The impact of queue length information on buffer overflow in parallel queues
We consider a system consisting of N parallel queues, served by one server. Time is slotted, and the server serves one of the queues in each time slot, according to some scheduling policy. In the first part of the paper, we characterize the buffer overflow exponents and the likeliest overflow tr...
Main Authors: | Jagannathan, Krishna Prasanna, Modiano, Eytan H. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | en_US |
Published: |
International League Against Epilepsy
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/58748 https://orcid.org/0000-0001-8238-8130 |
Similar Items
-
An N Server Cutoff Priority Queue Where Customers Request a Random Number of Servers
by: Schaack, Christian, et al.
Published: (2004) -
Efficient Computation of Probabilities of Events Described by Order Statistics and Application to a Problem of Queues
by: Jones, Lee K., et al.
Published: (2004) -
On the Timing of the Peak Mean and Variance for the Number of Customers in an M(t)/M(t)/1 Queueing System
by: Malone, Kerry M., et al.
Published: (2004) -
Efficient ignorance : information heterogeneity in a queue
by: Hu, Ming, et al.
Published: (2020) -
The Impact of Queue Length Information on Buffer Overflow in Parallel Queues
by: Modiano, Eytan H, et al.
Published: (2018)