IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v141y2006i1p271-28110.1007-s10479-006-5302-z.html
   My bibliography  Save this article

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

Author

Listed:
  • M. Lopez-Herrero

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

Suggested Citation

  • M. Lopez-Herrero, 2006. "A maximum entropy approach for the busy period of the M/G /1 retrial queue," Annals of Operations Research, Springer, vol. 141(1), pages 271-281, January.
    • Handle: RePEc:spr:annopr:v:141:y:2006:i:1:p:271-281:10.1007/s10479-006-5302-z
    DOI: 10.1007/s10479-006-5302-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-5302-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-5302-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lyes Ikhlef & Ouiza Lekadir & Djamil Aïssani, 2016. "MRSPN analysis of Semi-Markovian finite source retrial queues," Annals of Operations Research, Springer, vol. 247(1), pages 141-167, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:141:y:2006:i:1:p:271-281:10.1007/s10479-006-5302-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.