Max-weight scheduling in networks with heavy-tailed traffic

We consider the problem of packet scheduling in a single-hop network with a mix of heavy-tailed and light-tailed traffic, and analyze the impact of heavy-tailed traffic on the performance of Max-Weight scheduling. As a performance metric we use the delay stability of traffic flows: a traffic flow is delay stable if its expected steady-state delay is finite, and delay unstable otherwise. First, we show that a heavy-tailed traffic flow is delay unstable under any scheduling policy. Then, we focus on the celebrated Max-Weight scheduling policy, and show that a light-tailed flow that conflicts with a heavy-tailed flow is also delay unstable. This is true irrespective of the rate or the tail distribution of the light-tailed flow, or other scheduling constraints in the network. Surprisingly, we show that a light-tailed flow can be delay unstable, even when it does not conflict with heavy-tailed traffic. Furthermore, delay stability in this case may depend on the rate of the light-tailed flow. Finally, we turn our attention to the class of Max-Weight-α scheduling policies; we show that if the α-parameters are chosen suitably, then the sum of the α-moments of the steady-state queue lengths is finite. We provide an explicit upper bound for the latter quantity, from which we derive results related to the delay stability of traffic flows, and the scaling of moments of steady-state queue lengths with traffic intensity.

[1]  Mihalis G. Markakis,et al.  Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic , 2011, IEEE/ACM Transactions on Networking.

[2]  Walter Willinger,et al.  Self‐Similar Network Traffic: An Overview , 2002 .

[3]  Alexander L. Stolyar,et al.  Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing , 2009, IEEE INFOCOM 2009.

[4]  Mihalis G. Markakis,et al.  Scheduling policies for single-hop networks with heavy-tailed traffic , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  P. R. Kumar,et al.  Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems , 1990 .

[6]  John N. Tsitsiklis,et al.  Optimal scaling of average queue sizes in an input-queued switch: an open problem , 2011, Queueing Syst. Theory Appl..

[7]  Walter Willinger,et al.  Self-Similar Network Traffic and Performance Evaluation , 2000 .

[8]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[9]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[10]  A. Stolyar MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[11]  Dharam J. Shah,et al.  Lower bound and optimality in switched networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[12]  Sem C. Borst,et al.  The impact of the service discipline on delay asymptotics , 2003, Perform. Evaluation.

[13]  Ronald W. Wolff,et al.  A Review of Regenerative Processes , 1993, SIAM Rev..

[14]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[15]  Bert Zwart,et al.  Tails in scheduling , 2007, PERV.

[16]  Eytan Modiano,et al.  Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity , 2007, IEEE Transactions on Information Theory.

[17]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[18]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[19]  Michael J. Neely,et al.  Order Optimal Delay for Opportunistic Scheduling in Multi-User Wireless Uplinks and Downlinks , 2008, IEEE/ACM Transactions on Networking.

[20]  Murad S. Taqqu,et al.  On the Self-Similar Nature of Ethernet Traffic , 1993, SIGCOMM.

[21]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[22]  Sem C. Borst,et al.  Generalized processor sharing with light-tailed and heavy-tailed input , 2003, TNET.