dc.contributor.author | Jagannathan, Krishna Prasanna | |
dc.contributor.author | Modiano, Eytan H. | |
dc.date.accessioned | 2010-09-29T13:43:32Z | |
dc.date.available | 2010-09-29T13:43:32Z | |
dc.date.issued | 2009-10 | |
dc.date.submitted | 2009-09 | |
dc.identifier.isbn | 978-1-4244-5870-7 | |
dc.identifier.other | INSPEC Accession Number: 11135270 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/58748 | |
dc.description.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. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (grant CNS-0626781 | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (grant CNS- 0915988) | en_US |
dc.description.sponsorship | United States. Army Research Office. Multidisciplinary University Research Initiative (MURI) (Multidisciplinary University Research Initiative (MURI) (grant W911NF-08-1-0238) | en_US |
dc.language.iso | en_US | |
dc.publisher | International League Against Epilepsy | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/ALLERTON.2009.5394869 | en_US |
dc.rights | Attribution-Noncommercial-Share Alike 3.0 Unported | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.subject | time slot | en_US |
dc.subject | parallel queues | en_US |
dc.subject | longest queue first scheduling | en_US |
dc.subject | buffer overflow exponents | en_US |
dc.subject | queue length information | en_US |
dc.title | The impact of queue length information on buffer overflow in parallel queues | en_US |
dc.type | Article | en_US |
dc.identifier.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 | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics | en_US |
dc.contributor.approver | Modiano, Eytan H. | |
dc.contributor.mitauthor | Jagannathan, Krishna Prasanna | |
dc.contributor.mitauthor | Modiano, Eytan H. | |
dc.relation.journal | Proceedings of the 47th annual Allerton conference on Communication, control, and computing | en_US |
dc.eprint.version | Original manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
dspace.orderedauthors | Jagannathan, Krishna; Modiano, Eytan | en |
dc.identifier.orcid | https://orcid.org/0000-0001-8238-8130 | |
dspace.mitauthor.error | true | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |