Tandem queues with subexponential service times and finite buffers

Authors:
Jung-Kyung Kim;Hayriye Ayhan
Affiliations:
H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA 30332-0205;H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA 30332-0205
Venue:
Queueing Systems: Theory and Applications
Year:
2010

Citing 13
Cited 0

Approximate analysis of open networks of queues with blocking: Tandem configurations

IEEE Transactions on Software Engineering
An approximation method for tandem queues with blocking

Operations Research
Asymptotic expansions for waiting time probabilities in an M/G/1 queue with long-tailed service time

Queueing Systems: Theory and Applications
Tail asymptotics for M/G/1 type queueing processes with subexponential increments

Queueing Systems: Theory and Applications
Asymptotics of stochastic networks with subexponential service times

Queueing Systems: Theory and Applications
Steady-state asymptotics for tandem, split-match and other feedforward queues with heavy tailed service

Queueing Systems: Theory and Applications
The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution

Queueing Systems: Theory and Applications
Large Tandem Queueing Networks with Blocking

Queueing Systems: Theory and Applications
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows

Queueing Systems: Theory and Applications
Asymptotics of Subexponential Max Plus Networks: the Stochastic Event Graph Case

Queueing Systems: Theory and Applications
LOWER BOUNDS FOR LRD/GI/1 QUEUES WITH SUBEXPONENTIAL SERVICE TIMES

Probability in the Engineering and Informational Sciences
Heavy Tails in Multi-Server Queue

Queueing Systems: Theory and Applications
Tails for (max, plus) recursions under subexponentiality

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room for finished customers after the last station but the size of the buffer between two consecutive stations is finite. Using (max, +) linear recursions, we investigate the tail asymptotics of transient response times and waiting times under both communication blocking and manufacturing blocking schemes. We also discuss under which conditions these results can be generalized to the tail asymptotics of stationary response times and waiting times.