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. We first characterize the exponent of the buffer overflow probability and the most likely overflow trajectories...
Main Authors: | Modiano, Eytan H, Jagannathan, Krishna Prasanna |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2018
|
Online Access: | http://hdl.handle.net/1721.1/115238 https://orcid.org/0000-0001-8238-8130 |
Similar Items
-
The impact of queue length information on buffer overflow in parallel queues
by: Jagannathan, Krishna Prasanna, et al.
Published: (2010) -
On the Role of Queue Length Information in Network Control
by: Jagannathan, Krishna Prasanna, et al.
Published: (2012) -
Asymptotic performance of queue length based network control policies
by: Jagannathan, Krishna Prasanna
Published: (2011) -
Queue length asymptotics for generalized max-weight scheduling in the presence of heavy-tailed traffic
by: Jagannathan, Krishna Prasanna, et al.
Published: (2011) -
Learning Algorithms for Minimizing Queue Length Regret
by: Stahlbuhk, Thomas, et al.
Published: (2021)