Skip to main content Accessibility help

Queues with marked customers

  • Qi-Ming He (a1)


Queueing systems with distinguished arrivals are described on the basis of Markov arrival processes with marked transitions. Customers are distinguished by their types of arrival. Usually, the queues observed by customers of different types are different, especially for queueing systems with bursty arrival processes. We study queueing systems from the points of view of customers of different types. A detailed analysis of the fundamental period, queue lengths and waiting times at the epochs of arrivals is given. The results obtained are the generalizations of the results of the MAP/G/1 queue.


Corresponding author

Postal address: Department of Management Sciences, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada. Email:


Hide All

The research was supported by the K. C. Wang Education Foundation and the National Science Foundation through Grant Nr DDM-8915235.



Hide All
[1] Asmussen, S. and Ramaswami, V. (1990) Probabilistic interpretation of some duality results of the matrix paradigms in queueing theory. Stoch. Mod. 6, 715734.
[2] Chandramouli, Y., Neuts, M. F. and Ramaswami, V. (1989) A queueing model with service interruptions with applications to meteor burst packet communication systems. IEEE Trans. Commun. 37, 10241030.
[3] ÇInlar, E. (1969) Markov renewal theory. Adv. Appl. Prob. 1, 123187.
[4] Cohen, J. W. (1982) The Single Server Queue. North-Holland, Amsterdam.
[5] He, Qi-Ming and Neuts, M. F. (1995) Markov arrival processes with marked transitions. (Submitted for publication.)
[6] Lindley, D. V. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 227289.
[7] Lucantoni, D. M. (1991) New results on the single server queue with a batch Markovian arrival process. Stoch. Mod. 7, 146.
[8] 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, 676705.
[9] Neuts, M. F. (1979) A versatile Markovian point process. J. Appl. Prob. 16, 764–79.
[10] Neuts, M. F. (1981) Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore.
[11] Neuts, M. F. (1986) Generalizations of the Pollaczek-Khinchin integral equation in the theory of queues. Adv. Appl. Prob. 18, 952–90.
[12] Neuts, M. F. (1989) The fundamental period of the queue with Markov-modulated arrivals In: Probability, Statistics and Mathematics: Papers in Honor of Samuel Karlin. pp 187200. Academic Press, New York.
[13] Neuts, M. F. (1989) Structured Stochastic Matrices of M/G/1 type and their Applications. Marcel Dekker, New York.
[14] Ramaswami, V. (1980) The N/G/1 queue and its detailed analysis. Adv. Appl. Prob. 12, 222–61.
[15] Ramaswami, V. (1990) A duality theorem for the matrix paradigms in queueing theory. Stoch. Mod. 6, 151163.
[16] Ramaswami, V. (1990) From the matrix-geometric to the matrix-exponential. Queueing Systems. 6, 229260.
[17] Stanford, D. A. (1991) Interdeparture-time distributions in the non-preemptive priority SiMi/Gi/1 queue. Perf. Eval. 12, 4360.
[18] Stanford, D. A. and Fischer, W. (1989) The interdeparture time distribution for each class in the SiMi/Gi/1 queue. Queueing Systems 4, 179191.
[19] Stanford, D. A. and Fischer, W. (1991) Characterising interdeparture times for bursty input streams in the queue with pooled renewal arrivals. Stoch. Mod. 7, 311320.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Advances in Applied Probability
  • ISSN: 0001-8678
  • EISSN: 1475-6064
  • URL: /core/journals/advances-in-applied-probability
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


MSC classification


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed