IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v8y2006i2d10.1007_s11009-006-8553-x.html
   My bibliography  Save this article

About the Sojourn Time Process in Multiphase Queueing Systems

Author

Listed:
  • S. Minkevičius

    (Institute of Mathematics and Informatics)

  • S. Steišūnas

    (Institute of Mathematics and Informatics)

Abstract

Multiphase queueing systems (MQS) (tandem queues, queues in series) are of special interest both in theory and in practical applications (packet switch structures, cellular mobile networks, message switching systems, retransmission of video images, asembly lines, etc.). In this paper, we deal with approximations of MQS and present a heavy traffic limit theorems for the sojourn time of a customer in MQS. Functional limit theorems are proved for the customer sojourn time – an important probability characteristic of the queueing system under conditions of heavy traffic.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:metcap:v:8:y:2006:i:2:d:10.1007_s11009-006-8553-x
    DOI: 10.1007/s11009-006-8553-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-006-8553-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-006-8553-x?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.

    References listed on IDEAS

    as
    1. Martin I. Reiman & Burton Simon & J. Stanford Willie, 1992. "Simterpolation: A Simulation based Interpolation Approximation for Queueing Systems," Operations Research, INFORMS, vol. 40(4), pages 706-723, August.
    2. Martin I. Reiman & Lawrence M. Wein, 1999. "Heavy Traffic Analysis of Polling Systems in Tandem," Operations Research, INFORMS, vol. 47(4), pages 524-534, August.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2001. "Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems," Management Science, INFORMS, vol. 47(10), pages 1421-1439, October.
    3. Otis B. Jennings, 2008. "Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 12-35, February.
    4. 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.
    5. Gromoll, H. Christian & Terwilliger, Bryce & Zwart, Bert, 2020. "Heavy traffic limit for the workload plateau process in a tandem queue with identical service times," Stochastic Processes and their Applications, Elsevier, vol. 130(3), pages 1435-1460.
    6. Russell C. H. Cheng & Jack P. C. Kleijnen, 1999. "Improved Design of Queueing Simulation Experiments with Highly Heteroscedastic Responses," Operations Research, INFORMS, vol. 47(5), pages 762-777, October.
    7. Cheng, R.C.H. & Kleijnen, J.P.C., 1995. "Optimal design of simulation experiments with nearly saturated queues," Discussion Paper 1995-67, Tilburg University, Center for Economic Research.
    8. Ravi Suman & Ananth Krishnamurthy, 2020. "Analysis of tandem polling queues with finite buffers," Annals of Operations Research, Springer, vol. 293(1), pages 343-369, October.
    9. Sem Borst & Onno Boxma, 2018. "Polling: past, present, and perspective," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 335-369, October.
    10. David M. Markowitz & Lawrence M. Wein, 2001. "Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem," Operations Research, INFORMS, vol. 49(2), pages 246-270, April.

    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:metcap:v:8:y:2006:i:2:d:10.1007_s11009-006-8553-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.