Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime

Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime

0.00 Avg rating0 Votes
Article ID: iaor200954175
Country: United States
Volume: 33
Issue: 3
Start Page Number: 561
End Page Number: 586
Publication Date: Aug 2008
Journal: Mathematics of Operations Research
Authors: ,
Abstract:

We consider a first–come first–served multiserver queue in the Quality– and Efficiency–Driven (QED) regime. In this regime, which was first formalized by Halfin and Whitt, the number of servers N is not small, servers' utilization is 1–O(1/√N;) (Efficiency–Driven) while waiting time is O(1/√N;)(Quality–Driven). This is equivalent to having the number of servers N being approximately equal to R+β√R, where R is the offered load and β is a positive constant.

Reviews

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