Scheduling policies for single-hop networks with heavy-tailed traffic

Authors:
Mihalis G. Markakis;Eytan H. Modiano;John N. Tsitsiklis
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 7
Cited 2

On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Self-Similar Network Traffic and Performance Evaluation

Self-Similar Network Traffic and Performance Evaluation
Scheduling strategies and long-range dependence

Queueing Systems: Theory and Applications
The impact of a heavy-tailed service-time distribution upon the M/GI/s waiting-time distribution

Queueing Systems: Theory and Applications
Generalized processor sharing with light-tailed and heavy-tailed input

IEEE/ACM Transactions on Networking (TON)
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Surprising results on task assignment in server farms with high-variability workloads

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems

Queue-length asymptotics for generalized max-weight scheduling in the presence of heavy-tailed traffic

IEEE/ACM Transactions on Networking (TON)
Inefficiency of MaxWeight scheduling in spatial wireless networks

Computer Communications

Quantified Score

Hi-index	0.06

Visualization

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.