IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v52y2000i2p307-323.html
   My bibliography  Save this article

Asymptotic behaviour of the tandem queueing system with identical service times at both queues

Author

Listed:
  • O. J. Boxma
  • Q. Deng

Abstract

Consider a tandem queue consisting of two single-server queues in series, with a Poisson arrival process at the first queue and arbitrarily distributed service times, which for any customer are identical in both queues. For this tandem queue, we relate the tail behaviour of the sojourn time distribution and the workload distribution at the second queue to that of the (residual) service time distribution. As a by-result, we prove that both the sojourn time distribution and the workload distribution at the second queue are regularly varying at infinity of index 1−ν, if the service time distribution is regularly varying at infinity of index −ν (ν>1). Furthermore, in the latter case we derive a heavy-traffic limit theorem for the sojourn time S (2) at the second queue when the traffic load ρ↑ 1. It states that, for a particular contraction factor Δ (ρ), the contracted sojourn time Δ (ρ) S (2) converges in distribution to the limit distribution H(·) as ρ↑ 1 where . Copyright Springer-Verlag Berlin Heidelberg 2000

Suggested Citation

  • O. J. Boxma & Q. Deng, 2000. "Asymptotic behaviour of the tandem queueing system with identical service times at both queues," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(2), pages 307-323, November.
    • Handle: RePEc:spr:mathme:v:52:y:2000:i:2:p:307-323
    DOI: 10.1007/s186-000-8317-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s186-000-8317-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s186-000-8317-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. H. Christian Gromoll & Bryce Terwilliger & Bert Zwart, 2018. "Heavy traffic limit for a tandem queue with identical service times," Queueing Systems: Theory and Applications, Springer, vol. 89(3), pages 213-241, August.
    2. Saulius Minkevičius & Vladimiras Dolgopolovas & Leonidas L. Sakalauskas, 2016. "A Law of the Iterated Logarithm for the Sojourn Time Process in Queues in Series," Methodology and Computing in Applied Probability, Springer, vol. 18(1), pages 37-57, March.
    3. S. Minkevičius & S. Steišūnas, 2006. "About the Sojourn Time Process in Multiphase Queueing Systems," Methodology and Computing in Applied Probability, Springer, vol. 8(2), pages 293-302, June.

    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:mathme:v:52:y:2000:i:2:p:307-323. 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.