Tandem queues with subexponential service times and finite buffers

Tandem queues with subexponential service times and finite buffers

0.00 Avg rating0 Votes
Article ID: iaor20106833
Volume: 66
Issue: 2
Start Page Number: 195
End Page Number: 209
Publication Date: Oct 2010
Journal: Queueing Systems
Authors: ,
Keywords: buffer allocation, tandem queues
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.

Reviews

Required fields are marked *. Your email address will not be published.