Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-26T21:20:38.411Z Has data issue: false hasContentIssue false
  • English
  • Français

Simpler proofs of some properties of the fundamental period of the MAP/G/1 queue

Part of: Special processes

Published online by Cambridge University Press:  14 July 2016

David M. Lucantoni  and
Marcel F. Neuts
David M. Lucantoni*
Affiliation:
AT&T Bell Laboratories
Marcel F. Neuts*
Affiliation:
University of Arizona
*
∗ Postal address: Room 1L-224, AT&T Bell Laboratories, Holmdel, NJ 07733, USA.
∗∗ Postal address: Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ 85721.
Get access Rights & Permissions [Opens in a new window]

Abstract

By an argument which involves matching sample paths, some useful equations for the probability distribution of the fundamental period in the MAP/G/1 queue are derived with less calculational effort than in earlier proofs. It is further shown that analogous equations hold for the MAP/SM/1 queueing model. These results are then used to derive explicit formulas for the mean vectors of the number served during and the duration of the fundamental period.

Keywords

BUSY PERIODSAMPLE PATHS

MSC classification

Primary: 60K25: Queueing theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 31 , Issue 1 , March 1994 , pp. 235 - 243
Copyright
Copyright © Applied Probability Trust 1994 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Research supported in part by Grant Nr. DDM-8915235 from the National Science Foundation.

References

[1] Lucantoni, D. M. (1991) New results on the single server queue with a batch Markovian arrival process. Stoch. Models 7, 1–46.Google Scholar
[2] Lucantoni, D. M. (1993) The BMAP/G/1 queue: a tutorial. In Models and Techniques for Performance Evaluation of Computer and Communications Systems, ed. Donatiello, L. and Nelson, R. Springer-Verlag, Berlin.Google Scholar
[3] Lucantoni, D. M., Meier-Hellstern, K. S. and Neuts, M. F. (1990) A single server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Prob. 22, 676–705.CrossRefGoogle Scholar
[4] Neuts, M. F. (1989) Structured Stochastic Matrices of M/G/1 Type and their Applications. Marcel Dekker, New York.Google Scholar
[5] Neuts, M. F. (1989) The fundamental period of the queue with Markov-modulated arrivals. Probability, Statistics and Mathematics: Papers in Honor of Samuel Karlin, pp. 187–200, Academic Press, New York.Google Scholar
[6] Ramaswami, V. (1990) From the matrix-geometric to the matrix-exponential. Queueing Systems 6, 229–260.CrossRefGoogle Scholar
[7] Runnenburg, J. Th. (1965) On the use of the method of collective marks in queueing theory. Proc. Symp. on Congestion Theory, ed. Smith, W. L. and Wilkinson, W. E., pp. 399–438, University of N. Carolina Monographs, Chapel Hill.Google Scholar
[8] Takács, L. (1961) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar