Scheduling policies for single-hop networks with heavy-tailed traffic
Name
Tsitsiklis_Scheduling policies.pdf
Size
174.74 KB
Format
Adobe PDF
Checksum (MD5)
3ce33680f60d639721bbe4d44e3680d5
Author(s)
Modiano, Eytan H.
Markakis, Mihalis G.
Tsitsiklis, John N.
Date Issued
January 2010
Journal
Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Publisher
Institute of Electrical and Electronics Engineers
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
Version
Original manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ALLERTON.2009.5394854
