dc.contributor.author | Modiano, Eytan H. | |
dc.contributor.author | Markakis, Mihalis G. | |
dc.contributor.author | Tsitsiklis, John N. | |
dc.date.accessioned | 2010-09-29T13:59:36Z | |
dc.date.available | 2010-09-29T13:59:36Z | |
dc.date.issued | 2010-01 | |
dc.date.submitted | 2009-09 | |
dc.identifier.isbn | 978-1-4244-5870-7 | |
dc.identifier.other | INSPEC Accession Number: 11089589 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/58749 | |
dc.description.abstract | In 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.sponsorship | National Science Foundation (U.S.) (grant CNS-0915988) | en_US |
dc.description.sponsorship | National Science Foundation (U.S.) (grant CCF- 0728554) | en_US |
dc.description.sponsorship | United States. Army Research Office (Multidisciplinary University Research Initiative (MURI) grant W911NF-08-1-0238) | en_US |
dc.language.iso | en_US | |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/ALLERTON.2009.5394854 | 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.title | Scheduling policies for single-hop networks with heavy-tailed traffic | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Markakis, 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.5394854 | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.approver | Modiano, Eytan H. | |
dc.contributor.mitauthor | Modiano, Eytan H. | |
dc.contributor.mitauthor | Markakis, Mihalis G. | |
dc.contributor.mitauthor | Tsitsiklis, John N. | |
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 | Markakis, Mihalis G.; Modiano, Eytan H.; Tsitsiklis, John N. | en |
dc.identifier.orcid | https://orcid.org/0000-0003-1469-7729 | |
dc.identifier.orcid | https://orcid.org/0000-0001-8238-8130 | |
dc.identifier.orcid | https://orcid.org/0000-0003-2658-8239 | |
dspace.mitauthor.error | true | |
mit.license | OPEN_ACCESS_POLICY | en_US |
mit.metadata.status | Complete | |