Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

Naval Research Logistics

Volumn 47, Issue 5, 2000, Pages 399-421

  He, Qi Ming ^a   Alfa, Attahiru Sule ^b  

^a DALHOUSIE UNIVERSITY   (Canada)

^b UNIVERSITY OF WINDSOR   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; MATRIX ALGEBRA; QUEUEING THEORY; TREES (MATHEMATICS);

WAITING TIMES;

INDUSTRIAL ENGINEERING;

EID: 0034250540     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/1520-6750(200008)47:5<399::AID-NAV3>3.0.CO;2-9     Document Type: Article

References (18)

1. A.S. Alfa and G.J. Fitzpatrick, Waiting time distribution of a FIFO/LIFO Geo/D/1 queue, INFOR, 39(1) (1999), 149-159.
2. S. Asmussen and G. Koole, Marked point processes as limits of Markovian arrival streams, J Appl Probab 30 (1993), 365-372.
3. B.T. Doshi, An M/G/1 queue with a hybrid discipline, AT&T Tech J 62(5) (1983), 1251-1271.
4. L.J. Forys, Performance analysis of a new overload strategy, ITC-10, 1982.
5. F.R. Gantmacher, The theory of matrices, Chelsca, New York, 1959.
6. Q.-M. HE, Queues with marked customers, Adv Appl Probab 28 (1996), 567-587.
7. Q.-M. HE, Quasi-birth-and-death processes with a tree structure and a detailed analysis of the M M AP[K]/PH[K]/1 queue, Eur J Oper Res 120(3) (2000), 641-656.
8. Q.-M. HE and A.S. Alfa. The M M AP[K]/PH[K]/1 queue with a last-come-first-served preemptive service discipline, Queueing Syst 28 (1998), 269-291.
9. Q.-M. HE and M.F. Neuts, Markov arrival processes with marked transitions, Stochastic Process Appl 74 (1998), 37-52.
10. G. Latouche and V. Ramaswami, A logarithmic reduction algorithm for quasi birth and death processes, J Appl Probab 30 (1993), 650-674.
11. M.F. Neuts, A versatile Markovian point process, J Appl Probab 16 (1979), 764-779.
12. M.F. Neuts, Matrix-geometric solutions in stochastic models: An algorithmic approach, The Johns Hopkins University Press, Baltimore, 1981.
13. M.F. Neuts, Structured stochastic matrices of M/G/1 type and their applications, Marcel Dekker, New York, 1989.
14. F. Schreiber, Eine Familie von warteprozeduren zweichen FIFO und LIFO, Arch Elektron Uebertragungstech 30(12) (1976), 497-501.
15. H. Takagi, Queueing analysis: A foundation of performance evaluation, Volume 1: Vacation and priority systems, Part I, Elsevier, Amsterdam, 1990.
16. T. Takine, B. Sengupta, and R.W. Yeung, A generalization of the matrix M/G/1 paradigm for Markov chains with a tree structure, Stochastic Models 11 (1995), 411-421.
17. R.W. Yeung and B. Sengupta, Matrix product-form solutions for Markov chains with a tree structure, Adv Appl Probab 26(4) (1994), 965-987.
18. R.W. Yeung and A.S. Alfa, The quasi-birth-death type Markov chain with a tree structure, Stochastic Models, 15(4) (1999), 639-659.