Paper Info
Title
Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times
Abstract
We analyze the intermediate buffer requirements in a tandem queue where service times of each customer are deterministically correlated between the servers and arbitrarily distributed between customers. The major issue at hand is the determination of intermediate buffer sizes assuring no blocking when the arrivals pattern is arbitrary and unpredictable. The analysis shows that the worst arrival process is the Just-in-Time (JIT) process. Further, it shows that ordering of the servers with respect to service rates may be detrimental, and that the most vulnerable architectural design is that in which the servers have almost the same service rates. It is shown that the total buffer requirement in the system may be quite sensitive to the server ordering: A proper ordering requires justO( M) (whereM is the number of queues) buffer size, while an improper ordering may requireO( M2).
Year
DOI
Venue
2001
10.1287/moor.26.2.358.10556
Math. Oper. Res.
Keywords
DocType
Volume
Buffer Requirements,buffer. 358,intermediate buffer size,major issue,tandem queues,service time,worst arrival process,queuing,Server Ordering,Tandem Queue,Correlated Service Times,tandem queue,total buffer requirement,service rate,buffer size,intermediate buffer requirement,arrivals pattern
Journal
26
Issue
ISSN
Citations 
2
0364-765X
4
PageRank 
References 
Authors
0.67
2
2
Name
Order
Citations
PageRank
Benjamin Avi-Itzhak1569.41
Hanoch Levy255969.67