An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions

Authors:
Nam K. Kim;Kyung C. Chae;Mohan L. Chaudhry
Affiliations:
Chonnam National University, 300 Yongbong-dong, Buk-gu, Gwangju 500-757, Korea;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Daejon 305-701, Korea;Department of Mathematics and Computer Science, Royal Military College of Canada, P.O. Box 17000, STN Forces, Kingston, Ontario, Canada K7K 7B4
Venue:
Operations Research
Year:
2004

Citing 3
Cited 3

Statistical multiplexing of VBR sources: a matrix-analytic approach

Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals

Operations Research Letters
A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times

Operations Research Letters

Analysis of threshold-based batch-service queueing systems with batch arrivals and general service times

Performance Evaluation
A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times

Operations Research Letters
Analysis of a versatile batch-service queueing model with correlation in the arrival process

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a broad class of discrete- and continuous-time queueing systems, we show that the stationary number of customers in system (queue plus servers) is the sum of two independent random variables, one of which is the stationary number of customers in queue and the other is the number of customers that arrive during the time a customer spends in service. We call this relation an invariance relation in the sense that it does not change for a variety of single-sever queues (with batch arrivals and batch services) and some multiserver queues (with batch arrivals and deterministic service times) that satisfy a certain set of assumptions. Making use of this relation, we also present a simple method of deriving the probability generating functions (PGFs) of the stationary numbers in queue and in system, as well as some of their properties. This is illustrated by several examples, which show that new simple derivations of old results as well as new results can be obtained in a unified manner. Furthermore, we show that the invariance relation and the method we are presenting are easily generalized to analyze queues with batch Markovian arrival process (BMAP) arrivals. Most of the results are presented under the discrete-time setting. The corresponding continuous-time results, however, are covered as well because deriving the results for continuous-time queues runs exactly parallel to that for their discrete-time counterparts.