Stability and delay of distributed scheduling algorithms for networks of conflicting queues

This paper explains recent results on distributed algorithms for networks of conflicting queues. At any given time, only specific subsets of queues can be served simultaneously. The challenge is to select the subsets in a distributed way to stabilize the queues whenever the arrival rates are feasible.One key idea is to formulate the subset selection as an optimization problem where the objective function includes the entropy of the distribution of the selected subsets. The dual algorithm for solving this optimization problem provides a distributed scheduling algorithm that requires only local queue-length information. The algorithm is based on the CSMA (Carrier Sense Multiple Access) protocol in wireless networks.We also explain recent results, some of them unpublished so far, on the delay properties of these algorithms. In particular, we present a framework for queuing stability under bounded CSMA parameters, and show how the expected queue lengths depend on the throughput region to be supported. When the arrival rates are within a fraction of the capacity region, queue lengths that are polynomial (or even logarithmic) in the number of queues can be achieved.

[1]  Jean C. Walrand,et al.  Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling , 2010, IEEE Transactions on Information Theory.

[2]  J. Walrand,et al.  Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits , 2006, Advances in Applied Probability.

[3]  Jean C. Walrand,et al.  Distributed Random Access Algorithm: Scheduling and Congestion Control , 2009, IEEE Transactions on Information Theory.

[4]  Soung Chang Liew,et al.  Markov Approximation for Combinatorial Network Optimization , 2013, IEEE Trans. Inf. Theory.

[5]  Devavrat Shah,et al.  Delay optimal queue-based CSMA , 2010, SIGMETRICS '10.

[6]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

[7]  Eytan Modiano,et al.  Multihop Local Pooling for Distributed Throughput Maximization in Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[8]  Jean Walrand,et al.  Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability , 2009, MobiHoc S3 '09.

[9]  Koushik Kar,et al.  Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  Jean C. Walrand,et al.  Performance bounds of distributed CSMA scheduling , 2010, 2010 Information Theory and Applications Workshop (ITA).

[11]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

[12]  Asuman E. Ozdaglar,et al.  Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints , 2011, IEEE Transactions on Information Theory.

[13]  V. Borkar.  Stochastic Approximation: A Dynamical Systems Viewpoint , 2008 .

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

[15]  Patrick Thiran,et al.  On the fairness of large CSMA networks , 2009, IEEE Journal on Selected Areas in Communications.

[16]  Jiaping Liu,et al.  Towards utility-optimal random access without message passing , 2010, CMC 2010.

[17]  Alexandre Proutière,et al.  Resource Allocation over Network Dynamics without Timescale Separation , 2010, 2010 Proceedings IEEE INFOCOM.

[18]  Jean C. Walrand,et al.  Convergence and stability of a distributed CSMA algorithm for maximal network throughput , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[19]  Soung Chang Liew,et al.  Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks , 2007, 2009 IEEE International Conference on Communications.

[20]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[21]  John N. Tsitsiklis,et al.  Hardness of Low Delay Network Scheduling , 2011, IEEE Transactions on Information Theory.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Jiang Libin,et al.  Scheduling and Congestion Control for Wireless and Processing Networks , 2010 .

[24]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[25]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[26]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[27]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[28]  Peter Marbach,et al.  Throughput-optimal random access with order-optimal delay , 2010, 2011 Proceedings IEEE INFOCOM.

[29]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[30]  H. Kushner,et al.  Stochastic Approximation and Recursive Algorithms and Applications , 2003 .