An Arrival Time Approach to M/G/1-type Queues with Generalized Vacations

Authors:
K. C. Chae;H. W. Lee;C. W. Ahn
Affiliations:
KAIST, Taejon, Korea kcchae@kaist.ac.kr;Sung Kyun Kwan University, Su Won, Korea hwlee@yurim.skku.ac.kr;ETRI, Taejon, Korea ahn@etri.re.kr
Venue:
Queueing Systems: Theory and Applications
Year:
2001

Citing 1
Cited 2

On stochastic decomposition in M/G/1 type queues with generalized server vacations

Operations Research

Analysis of a nonpreemptive priority queue with exponential timer and server vacations

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a simple way, called the arrival time approach, of finding the queue length distributions for M/G/1-type queues with generalized server vacations. The proposed approach serves as a useful alternative to understanding complicated queueing processes such as priority queues with server vacations and MAP/G/1 queues with server vacations.