The impact of queue length information on buffer overflow in parallel queues
Name
Modiano_The impact.pdf
Size
354.65 KB
Format
Adobe PDF
Checksum (MD5)
5219690dc37bb165988fa0d4d047c9d9
Author(s)
Jagannathan, Krishna Prasanna
Modiano, Eytan H.
Date Issued
October 2009
Journal
Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Publisher
International League Against Epilepsy
Citation
Jagannathan, K.; Modiano, E.; , "The impact of queue length information on buffer overflow in parallel queues," Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on , vol., no., pp.1103-1110, Sept. 30 2009-Oct. 2 2009
doi: 10.1109/ALLERTON.2009.5394869
Version
Original manuscript
Abstract
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 trajectories
under the Longest Queue First (LQF) scheduling policy.
Under statistically identical arrivals to each queue, we show
that the buffer overflow exponent can be simply expressed in
terms of the total system occupancy exponent of m parallel
queues, for some m ≤ N. We next turn our attention to the
rate of queue length information needed to operate a scheduling
policy, and its relationship to the buffer overflow exponents. It
is known that LQF scheduling has superior overflow exponents
compared to queue blind policies such as processor sharing (PS)
and random scheduling. However, we show that the overflow
exponent of the LQF policy can be preserved under arbitrarily
infrequent queue length information.
Subjects
time slot
parallel queues
longest queue first scheduling
buffer overflow exponents
queue length information
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ALLERTON.2009.5394869
