Show simple item record

dc.contributor.authorModiano, Eytan H.
dc.contributor.authorMarkakis, Mihalis G.
dc.contributor.authorTsitsiklis, John N.
dc.date.accessioned2010-09-29T13:59:36Z
dc.date.available2010-09-29T13:59:36Z
dc.date.issued2010-01
dc.date.submitted2009-09
dc.identifier.isbn978-1-4244-5870-7
dc.identifier.otherINSPEC Accession Number: 11089589
dc.identifier.urihttp://hdl.handle.net/1721.1/58749
dc.description.abstractIn the first part of the paper, we study the impact of scheduling, in a setting of parallel queues with a mix of heavy-tailed and light-tailed traffic. We analyze queue-length unaware scheduling policies, such as round-robin, randomized, and priority, and characterize their performance. We prove the queue-length instability of Max-Weight scheduling, in the presence of heavy-tailed traffic. Motivated by this, we analyze the performance of Max-Weight- α scheduling, and establish conditions on the α-parameters, under which the system is queue-length stable. We also introduce the Max-Weight-log policy, which provides performance guarantees, without any knowledge of the arriving traffic. In the second part of the paper, we extend the results on Max-Weight and Max-Weight-α scheduling to a single-hop network, with arbitrary topology and scheduling constraints.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (grant CNS-0915988)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (grant CCF- 0728554)en_US
dc.description.sponsorshipUnited States. Army Research Office (Multidisciplinary University Research Initiative (MURI) grant W911NF-08-1-0238)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ALLERTON.2009.5394854en_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.titleScheduling policies for single-hop networks with heavy-tailed trafficen_US
dc.typeArticleen_US
dc.identifier.citationMarkakis, M.G.; Modiano, E.H.; Tsitsiklis, J.N.; , "Scheduling policies for single-hop networks with heavy-tailed traffic," Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on , vol., no., pp.112-120, Sept. 30 2009-Oct. 2 2009 doi: 10.1109/ALLERTON.2009.5394854en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverModiano, Eytan H.
dc.contributor.mitauthorModiano, Eytan H.
dc.contributor.mitauthorMarkakis, Mihalis G.
dc.contributor.mitauthorTsitsiklis, John N.
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.orderedauthorsMarkakis, Mihalis G.; Modiano, Eytan H.; Tsitsiklis, John N.en
dc.identifier.orcidhttps://orcid.org/0000-0003-1469-7729
dc.identifier.orcidhttps://orcid.org/0000-0001-8238-8130
dc.identifier.orcidhttps://orcid.org/0000-0003-2658-8239
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