On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals

Operations Research Letters

Volumn 30, Issue 1, 2002, Pages 25-32

  Kim, Nam K ^a   Chang, Seok H ^a   Chae, Kyung C ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Discrete time queues; Markovian arrival process; Queue length

Indexed keywords

DIGITAL COMMUNICATION SYSTEMS; DIGITAL SIGNAL PROCESSING; DISCRETE TIME CONTROL SYSTEMS; MARKOV PROCESSES; MATRIX ALGEBRA;

QUEUE LENGTHS;

QUEUEING THEORY;

EID: 0036477923     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00110-9     Document Type: Article

References (14)

1. A discrete time batch Markovian arrival process as B-ISDN traffic model
2. Statistical multiplexing of VBR sources: A matrix-analytic approach
3. Waiting times in discrete-time cyclic-service systems
4. An arrival time approach to the M/G/1-type queues with generalized vacations
5. The complete analysis of the discrete time finite DBMAP/G/1/N queue
6. The BMAP/G/1 queue: A tutorial
7. On the relationship between queue lengths at a random instant and at a departure in the stationary queue with BMAP arrivals