A maximum entropy approach for the busy period of the M/G /1 retrial queue

M. Lopez-Herrero ()

Annals of Operations Research, 2006, vol. 141, issue 1, 281 pages

Abstract: This paper concerns the busy period of a single server queueing model with exponentially distributed repeated attempts. Several authors have analyzed the structure of the busy period in terms of the Laplace transform but, the information about the density function is limited to first and second order moments. We use the maximum entropy principle to find the least biased density function subject to several mean value constraints. We perform results for three different service time distributions: 3-stage Erlang, hyperexponential and exponential. Also a numerical comparative analysis between the exact Laplace transform and the corresponding maximum entropy density is presented. Copyright Springer Science + Business Media, Inc. 2006

Keywords: Retrial queue; Busy period; Laplace transforms; Maximum entropy principle; Lagrange multipliers (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-006-5302-z (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:141:y:2006:i:1:p:271-281:10.1007/s10479-006-5302-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-006-5302-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().