Skip to main content
SpringerLink
Log in

Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH-distributions. A GI /M/1 type Markov process for a generalized age process of batches of customers is constructed. The stationary distribution of the GI /M/1 type Markov process is found explicitly and, consequently, the distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. The paper gives the matrix representations of the PH-distributions of waiting times and sojourn times. Some results are obtained for the distributions of queue lengths at departure epochs and at an arbitrary time. These results can be used to analyze not only the queue length, but also the composition of the queue. Computational methods are developed for calculating steady state distributions related to the queue lengths, sojourn times, and waiting times.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Cinlar, Queues with semi-Markov arrivals, J. Appl. Prob., 1967, 4: 365–379.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. W. Cohen, The Single Server Queue, North-Holland, Amsterdam, 1982.

    MATH  Google Scholar 

  3. Q. M. He, Queues with marked customers, Adv. Appl. Prob., 1996, 28: 567–587.

    Article  MATH  Google Scholar 

  4. Q. M. He, The versatility of MMAP[K]_and the MMAP[K]/G[K]/1 queue, Queueing Systems, 2001, 38(4): 397–418.

    Article  MathSciNet  MATH  Google Scholar 

  5. G. Latouche and V. Ramaswami, Introduction to Matrix Analytic Methods in Stochastic Modelling, ASA & SIAM, Philadelphia, 1999.

    Book  Google Scholar 

  6. D. M. Lucantoni, K. S. Meier-Hellstern, and M. F. Neuts, A single server queue with server vacations and a class of non-renewal arrival processes, Adv. Appl. Prob., 1990, 22: 676–705.

    Article  MathSciNet  MATH  Google Scholar 

  7. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An algorithmic Approach, The Johns Hopkins University Press, Baltimore, 1981.

    MATH  Google Scholar 

  8. M. F. Neuts, Generalizations of the Pollaczek-Khinchin integral method in the theory of queues, Adv. Appl. Prob., 1986, 18: 952–990.

    Article  MathSciNet  MATH  Google Scholar 

  9. M. F. Neuts, Structured Stochastic Matrices of M/G/ 1 type and Their Applications, MarcelDekker, New York, 1989.

    MATH  Google Scholar 

  10. V. Ramaswami, The N/G/1 queue and its detailed analysis, Adv. Appl. Prob., 1980, 12: 222–261.

    Article  MathSciNet  MATH  Google Scholar 

  11. T. Takine, Queue length distribution in an FIFO single-server queue with multiple arrival streams having different service time distributions, Queueing System, 2001a, 39: 349–375.

    Article  MathSciNet  MATH  Google Scholar 

  12. T. Takine, A recent progress in algorithmic analysis of FIFO queues with Markovian arrival streams, J. Korean Math. Soc., 2001b, 38(4): 807–842.

    MathSciNet  MATH  Google Scholar 

  13. T. Takine and T. Hasegawa, The workload in an MAP/G/1 queue with state-dependent services: Its applications to a queue with preemptive resume priority, Stochastic Models, 1994, 10(1): 183–204.

    Article  MathSciNet  MATH  Google Scholar 

  14. S. Asmussen, Phase-type representation in random walk and queueing problems, Annals of Probability, 1992, 20(2): 772–789.

    Article  MathSciNet  MATH  Google Scholar 

  15. S. Asmussen and C. O’Cinneide, Representation for matrix-geometric and matrix-exponential steady-state distributions with applications to many-server queues, Stochastic Models, 1998, 14: 369–387.

    Article  MathSciNet  MATH  Google Scholar 

  16. B. Sengupta, Markov processes whose steady state distribution is matrix-exponential with an application to the GI /PH/1 queue, Adv. Appl. Prob., 1989, 21: 159–180.

    Article  MATH  Google Scholar 

  17. B. Sengupta, Phase-type representations for matrix-geometric solutions, Stochastic Models, 1990a, 6: 163–167.

    Article  MATH  Google Scholar 

  18. B. Sengupta, The semi-Markovian queue: Theory and applications, Stochastic Models, 1990b, 6: 383–413.

    Article  MATH  Google Scholar 

  19. Q. M. He,Workload process, waiting times, and sojourn times in a discrete time MMAP[K]/SM[K]/1/FCFS queue, Stochastic Models, 2004, 20(4): 415–437.

    Article  MathSciNet  MATH  Google Scholar 

  20. Q. M. He, Age process, total workload, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue, Queueing Systems, 2005, 49: 363–403.

    Article  MathSciNet  MATH  Google Scholar 

  21. B. Van Houdt and C. Blondia, The delay distribution of a type k customer in an FCFS MMAP[K]/PH[K]/1 queue, Journal of Applied Probability, 2002a, 39(1): 213–222.

    Article  MathSciNet  MATH  Google Scholar 

  22. B. Van Houdt and C. Blondia, The waiting time distribution of a type k customer in a discrete-time FCFS MMAP[K]/PH[K]/c (c=1,2) queue using QBDs, Stochastic Models, 2002b, 20(1): 55–69.

    Google Scholar 

  23. J. Lambert, B. Van Houdt, and C. Blondia, Queues in DOCSIS cable modem networks, Computer and Operations Research, 2008, 35(8): 2482–2496.

    Article  MATH  Google Scholar 

  24. S. Asmussen and G. Koole, Marked point processes as limits of Markovian arrival streams, J. Appl. Probab., 1993, 30: 365-372.

    Google Scholar 

  25. E. Cinlar, Markov renewal theory, Adv. Appl. Prob., 1969, 1: 123–187.

    Article  MathSciNet  MATH  Google Scholar 

  26. Q. M. He and M. F. Neuts, Markov chains with marked transitions, Stochastic Processes and Their Applications, 1998, 74(1): 37–52.

    Article  MathSciNet  MATH  Google Scholar 

  27. R. M. Loynes, The stability of a queue with non-independent interarrival and service times, Proc. Cambridge Philos. Soc., 1962, 58: 497–520.

    Article  MathSciNet  MATH  Google Scholar 

  28. F. R. Gantmacher, The Theory of Matrices, Chelsea, New York, 1959.

    MATH  Google Scholar 

  29. H. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Inc., Boston, 1964.

    MATH  Google Scholar 

  30. J. F. Perez, J. Van Velthoven, and B. Van Houdt, Q-MAM: A tool for solving infinite queues using matrix-analytic methods, Proceedings of SMCtools’08, ACM Press, Athens (Greece), 2008.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    Qiming He

Authors
  1. Qiming He
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qiming He.

Additional information

This research is supported by NSERC.

This paper was recommended for publication by Editor Shouyang WANG.

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, Q. Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths. J Syst Sci Complex 25, 133–155 (2012). https://doi.org/10.1007/s11424-012-9138-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-012-9138-0

Key words

Search

Navigation