Skip to main content
Log in

About the Sojourn Time Process in Multiphase Queueing Systems

  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • P. Billingsley, Convergence of probability measures, Wiley: New York, 1968.

    MATH  Google Scholar 

  • O. J. Boxma, “On a tandem queuing model with identical service times at both counters, I, II,” Advances in Applied Probability vol. 11 pp. 616–643, 644–659, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  • O. J. Boxma, and Q. Deng, “Asymptotic behaviour of the tandem queuing system with identical service times at both queues,” Mathematical Methods of Operation Research vol. 52 pp. 307–323, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  • E. G. Coffman Jr., and M. I. Reiman, “Diffusion approximation for computer/communication systems,” In Mathematical Computer Perfomance and Reliability, pp. 33–53, North-Holland: Amsterdam, 1984.

    Google Scholar 

  • J. Harrison and V. Nguyen, “Brownian models of multiclass queueing networks: current status and open problems,” Queueing Systems vol. 13 pp. 5–40, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  • C. Hong and S. Xinyang, “Strong approximations for multiclass feedforward queueing networks,” Annals of Applied Probability vol. 10 pp. 828–876, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  • F. I. Karpelevich and A. I. Kreinin, “Asymptotic analysis of switching systems for telegraph-type messages,” Problemy Peredachi Informatsii vol. 26 pp. 83–95, 1990 (In Russian).

    MATH  MathSciNet  Google Scholar 

  • F. I. Karpelevich and A. I. Kreinin, Heavy Traffic Limits for Multiphase Queues, American Mathematical Society: Providence, 1994.

    MATH  Google Scholar 

  • S. Minkevičius, “Weak convergence in multiphase queues,” Lietuvos Matematikos Rinkinys vol. 26 pp. 717–722, 1986.

    Google Scholar 

  • S. Minkevičius, “Transient phenomena in multiphase queueing systems,” Lietuvos Matematikos Rinkinys vol. 31 pp. 136–145, 1991.

    MATH  Google Scholar 

  • S. Minkevičius, “A laws of the iterated logarithm for the sojourn time process in multiphase queueing systems,” Lietuvos Matematikos Rinkinys, 2006 (in appear).

  • M. I. Reiman, “The heavy traffic diffusion approximation for sojourn times in Jackson networks,” In Applied Probability-computer Science: The Interface, vol. 2, pp. 409–421, Progr. Comput. Sci., 3, Birkhauser-Boston, MA, 1982.

  • M. I. Reiman and L. M. Wein, “Heavy traffic analysis of polling systems in tandem,” Operations Research vol. 47 pp. 524–534, 1999.

    MATH  MathSciNet  Google Scholar 

  • M. I. Reiman, B. Simon, and J. St. Willie, “Simterpolation: a simulation based interpolation approximation for queueing systems,” Operations Research vol. 40 706–723, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  • W. Szczotka, and F. P. Kelly, “Asymptotic stationarity of queues in series and the heavy traffic approximation,” Annals of Probability vol. 18 pp. 1232–1248, 1990.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Minkevičius.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Minkevičius, S., Steišūnas, S. About the Sojourn Time Process in Multiphase Queueing Systems. Methodol Comput Appl Probab 8, 293–302 (2006). https://doi.org/10.1007/s11009-006-8553-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11009-006-8553-x

Keywords

AMS 2000 Subject Classification

Navigation