IDEAS home Printed from
   My bibliography  Save this article

A special discrete cyclic-waiting queuing system


  • Péter Kárász



Within the light of technological applications those type of queuing systems play a significant role, where the service time of entering entities cannot take up any value, it can only be multiples of a certain cycle-time. As an example to this mechanism landing of aeroplanes and optical buffers of internet networks can be mentioned. In this case the service of an entering customer can be started immediately, or in case of a busy server or waiting customers it joins a queue, so that it keeps moving along a closed path which can be completed within T units of time. Applications in digital technology induce the investigation of discrete systems. We give the mathematical description of systems serving two types of customers, where inter-arrival and service times are geometrically distributed. A Markov-chain is defined, generating functions of transition probabilites are calculated, as well as condition of ergodicity is established and equilibrium distribution is given. At last, the mean value of queue-length is given as a function of the input parameters. Copyright Springer-Verlag 2008

Suggested Citation

  • Péter Kárász, 2008. "A special discrete cyclic-waiting queuing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(4), pages 391-406, December.
  • Handle: RePEc:spr:cejnor:v:16:y:2008:i:4:p:391-406 DOI: 10.1007/s10100-008-0065-z

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

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

    References listed on IDEAS

    1. Scaparra, Maria P. & Church, Richard L., 2008. "An exact solution approach for the interdiction median problem with fortification," European Journal of Operational Research, Elsevier, vol. 189(1), pages 76-92, August.
    2. Aras, Necati & Aksen, Deniz, 2008. "Locating collection centers for distance- and incentive-dependent returns," International Journal of Production Economics, Elsevier, vol. 111(2), pages 316-333, February.
    3. Wen, U. P. & Huang, A. D., 1996. "A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 563-571, February.
    4. Teixeira, Joao C. & Antunes, Antonio P., 2008. "A hierarchical location model for public facility planning," European Journal of Operational Research, Elsevier, vol. 185(1), pages 92-104, February.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Cyclic-waiting queuing system; Discrete retrial system; 60K25; 90B22;

    JEL classification:


    Access and download statistics


    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:cejnor:v:16:y:2008:i:4:p:391-406. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.