Show simple item record

dc.contributor.authorJagannathan, Krishna Prasanna
dc.contributor.authorModiano, Eytan H.
dc.date.accessioned2010-09-29T13:43:32Z
dc.date.available2010-09-29T13:43:32Z
dc.date.issued2009-10
dc.date.submitted2009-09
dc.identifier.isbn978-1-4244-5870-7
dc.identifier.otherINSPEC Accession Number: 11135270
dc.identifier.urihttp://hdl.handle.net/1721.1/58748
dc.description.abstractWe 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.sponsorshipNational Science Foundation (U.S.) (grant CNS-0626781en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (grant CNS- 0915988)en_US
dc.description.sponsorshipUnited States. Army Research Office. Multidisciplinary University Research Initiative (MURI) (Multidisciplinary University Research Initiative (MURI) (grant W911NF-08-1-0238)en_US
dc.language.isoen_US
dc.publisherInternational League Against Epilepsyen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ALLERTON.2009.5394869en_US
dc.rightsAttribution-Noncommercial-Share Alike 3.0 Unporteden_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.subjecttime sloten_US
dc.subjectparallel queuesen_US
dc.subjectlongest queue first schedulingen_US
dc.subjectbuffer overflow exponentsen_US
dc.subjectqueue length informationen_US
dc.titleThe impact of queue length information on buffer overflow in parallel queuesen_US
dc.typeArticleen_US
dc.identifier.citationJagannathan, 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.5394869en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.contributor.approverModiano, Eytan H.
dc.contributor.mitauthorJagannathan, Krishna Prasanna
dc.contributor.mitauthorModiano, Eytan H.
dc.relation.journalProceedings of the 47th annual Allerton conference on Communication, control, and computingen_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsJagannathan, Krishna; Modiano, Eytanen
dc.identifier.orcidhttps://orcid.org/0000-0001-8238-8130
dspace.mitauthor.errortrue
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record