Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic

We study the problem of scheduling over time varying links in a network that serves both heavy-tailed and light tailed traffic. We consider a system consisting of two parallel queues, served by a single server. One of the queues receives heavy-tailed traffic (the heavy queue), and the other receives light-tailed traffic (the light queue). The queues are connected to the server through time-varying ON/OFF links, which model fading wireless channels. We first show that the policy that gives complete priority to the light-tailed traffic guarantees the best possible tail behavior of both queue backlog distributions, whenever the queues are stable. However, the priority policy is not throughput maximizing, and can cause undesirable instability effects in the heavy queue. Next, we study the class of throughput optimal max-weight-α scheduling policies. We discover a threshold phenomenon, and show that the steady state light queue backlog distribution is heavy-tailed for arrival rates above a threshold value, and light-tailed otherwise. We also obtain the exact tail coefficient of the light queue backlog distribution under max-weight-α scheduling. Finally, we study a log-max-weight scheduling policy, which is throughput optimal, and ensures that the light queue backlog distribution is light-tailed.

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

[2]  Eytan Modiano,et al.  Delay analysis of maximum weight scheduling in wireless Ad Hoc networks , 2009, 2009 43rd Annual Conference on Information Sciences and Systems.

[3]  Mihalis G. Markakis,et al.  Queue-Length Asymptotics for Generalized Max-Weight Scheduling in the Presence of Heavy-Tailed Traffic , 2010, IEEE/ACM Transactions on Networking.

[4]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[6]  Michael J. Neely,et al.  Delay Analysis for Max Weight Opportunistic Scheduling in Wireless Systems , 2008, IEEE Transactions on Automatic Control.

[7]  Eytan Modiano,et al.  Dynamic reconfiguration and routing algorithms for IP-over-WDM networks with stochastic traffic , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Adam Wierman,et al.  When Heavy-Tailed and Light-Tailed Flows Compete: The Response Time Tail Under Generalized Max-Weight Scheduling , 2016, IEEE/ACM Trans. Netw..

[9]  Vijay G. Subramanian,et al.  Large deviations of max-weight scheduling policies on convex rate regions , 2008, 2008 Information Theory and Applications Workshop.

[10]  A. Stolyar,et al.  LARGEST WEIGHTED DELAY FIRST SCHEDULING: LARGE DEVIATIONS AND OPTIMALITY , 2001 .

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

[12]  Mihalis G. Markakis,et al.  Throughput optimal scheduling in the presence of heavy-tailed traffic , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Adam Wierman,et al.  When Heavy-Tailed and Light-Tailed Flows Compete: The Response Time Tail Under Generalized Max-Weight Scheduling , 2013, IEEE/ACM Transactions on Networking.

[14]  Damon Wischik,et al.  Big queues , 2004, Lecture notes in mathematics.

[15]  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).

[16]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

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

[18]  J. Norris Appendix: probability and measure , 1997 .

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

[20]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[21]  Krishna P. Jagannathan Asymptotic performance of queue length based network control policies , 2010 .

[22]  Eytan Modiano,et al.  Power and server allocation in a multi-beam satellite with time varying channels , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.