IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v141y2006i1p51-6610.1007-s10479-006-5293-9.html
   My bibliography  Save this article

Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: An algorithmic approach

Author

Listed:
  • Attahiru Alfa

Abstract

In this paper, we show that the discrete GI/G/1 system with Bernoulli retrials can be analyzed as a level-dependent QBD process with infinite blocks; these blocks are finite when both the inter-arrival and service times have finite supports. The resulting QBD has a special structure which makes it convenient to analyze by the Matrix-analytic method (MAM). By representing both the inter-arrival and service times using a Markov chain based approach we are able to use the tools for phase type distributions in our model. Secondly, the resulting phase type distributions have additional structures which we exploit in the development of the algorithmic approach. The final working model approximates the level-dependent Markov chain with a level independent Markov chain that has a large set of boundaries. This allows us to use the modified matrix-geometric method to analyze the problem. A key task is selecting the level at which this level independence should begin. A procedure for this selection process is presented and then the distribution of the number of jobs in the orbit is obtained. Numerical examples are presented to demonstrate how this method works. Copyright Springer Science + Business Media, Inc. 2006

Suggested Citation

  • Attahiru Alfa, 2006. "Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: An algorithmic approach," Annals of Operations Research, Springer, vol. 141(1), pages 51-66, January.
    • Handle: RePEc:spr:annopr:v:141:y:2006:i:1:p:51-66:10.1007/s10479-006-5293-9
    DOI: 10.1007/s10479-006-5293-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-5293-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-5293-9?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. Rein Nobel, 2016. "Retrial queueing models in discrete time: a short survey of some late arrival models," Annals of Operations Research, Springer, vol. 247(1), pages 37-63, 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:51-66:10.1007/s10479-006-5293-9. 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.