Paper Info
Title
Stability Conditions of the MMAP[K]/G[K]/1/LCFS Preemptive Repeat Queue
Abstract
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.
Year
DOI
Venue
2003
10.1023/A:1024420505098
Queueing Syst.
Keywords
Field
DocType
matrix analytic methods,embedded markov chain,stability problem,accurate information,stability,linear programming.,new approach,lcfs preemptive repeat queue,stability conditions,queueing system,novel approach,lcfs preemptive repeat,markov process of matrix m/g/1 type with a tree structure,markov chain,system stability,stability condition,linear program,matrix analytic method,markov process,tree structure
M/D/1 queue,Mathematical optimization,G/G/1 queue,Continuous-time Markov chain,M/M/c queue,M/G/1 queue,M/G/k queue,Queueing theory,Matrix analytic method,Mathematics
Journal
Volume
Issue
ISSN
44
2
1572-9443
Citations 
PageRank 
References 
1
0.40
3
Authors
2
Name
Order
Citations
PageRank
Qi-Ming He123034.21
Hui Li2829.92