The MMAP[K]/PH[K]/1 queues with a last-come-first-served preemptive service discipline

Queueing Systems

Volumn 29, Issue 2-4, 1998, Pages 269-291

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

^a DALHOUSIE UNIVERSITY   (Canada)

^b NONE

Author keywords

LCFS; Matrix analytic methods; Quasi birth and death Markov process; Queueing theory; Tree structure

Indexed keywords

COMPUTATION THEORY; MARKOV PROCESSES; QUEUEING NETWORKS; SALES; TREES (MATHEMATICS);

LAST-COME FIRST-SERVED; LCFS; MARKOV ARRIVAL PROCESS; MATRIX ANALYTIC METHODS; PERFORMANCE MEASURE; SERVICE DISCIPLINES; STATIONARY DISTRIBUTION; TREE STRUCTURES;

QUEUEING THEORY;

EID: 0032343310     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019140332008     Document Type: Article

References (20)

1. S. Asmussen and G. Koole, Marked point processes as limits of Markovian arrival streams, J. Appl. Probab. 30 (1993) 365-372.
2. F.R. Gantmacher, The Theory of Matrices (Chelsea, New York, 1959).
3. Q.-M. HE, Queues with marked customers, Adv. in Appl. Probab. 28 (1996) 567-587.
4. Q.-M. HE, Quasi-birth-and-death processes with a tree structure and a detailed analysis of the MMAP[K]/PH[K]/1 queue (1997) submitted for publication.
5. Q.-M. HE and M.F. Neuts, Markov arrival processes with marked transitions, Stochastic Process. Appl. 74(1) (1998) 37-52.
6. F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
7. G. Latouche and V. Ramaswami, A logarithmic reduction algorithm for quasi birth and death processes, J. Appl. Probab. 30 (1993) 650-674.
8. R. Lyons, Random walks and percolation on trees, Ann. Probab. 18 (1990) 931-958.
9. R. Lyons, Random walks, capacity and percolation on trees, Ann. Probab. 20 (1992) 2043-2088.
10. D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7 (1991) 1-46.
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 (Johns Hopkins Univ. Press, Baltimore, MD, 1981).
13. M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).
14. M.F. Neuts, The joint distribution of arrivals and departures in quasi-birth-and-death processes, in: Numerical Solutions of Markov Chains, ed. W.J. Stewart (Marcel Decker, New York, 1991) pp. 147-159.
15. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, Part 1 (Elsevier, Amsterdam, 1990).
16. H. Takagi, Queueing analysis of polling models: progress in 1990-1994, in: Frontiers in Queueing, ed. J.H. Dshalalow (1996) pp. 119-146.
17. T. Takine and T. Hasegawa, The workload in the MAP/G/1 queue with state-dependent services its application to a queue with preemptive resume priority, Stochastic Models 10 (1994) 183-204.
18. 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.
19. R.W. Yeung and B. Sengupta, Matrix product-form solutions for Markov chains with a tree structure, Adv. in Appl. Probab. 26(4) (1994) 965-987.
20. R.W. Yeung and A.S. Alfa, The quasi-birth-and-death type Markov chain with a tree structure, submitted for publication.