On the stability of flow-aware CSMA

We consider a wireless network where each flow (instead of each link) runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each flow attempts to access the radio channel after some random time and transmits a packet if the channel is sensed idle. We prove that, unlike the standard CSMA algorithm, this simple distributed access scheme is optimal in the sense that the network is stable for all traffic intensities in the capacity region of the network.

[1]  Sean P. Meyn.  Transience of Multiclass Queueing Networks Via Fluid Limit Models , 1995 .

[2]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[3]  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.

[4]  Alexandre Proutière,et al.  Throughput of random access without message passing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[5]  Devavrat Shah,et al.  Distributed algorithm and reversible network , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[6]  Jian Ni,et al.  Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks , 2011, TNET.

[7]  Sem C. Borst,et al.  Instability of MaxWeight Scheduling Algorithms , 2009, IEEE INFOCOM 2009.

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

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

[10]  Philippe Robert.  Stochastic Networks and Queues , 2003 .

[11]  Thomas Bonald,et al.  Insensitive Traffic Models for Communication Networks , 2007, Discret. Event Dyn. Syst..

[12]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[13]  Alexandre Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[14]  G. Fayolle,et al.  Two coupled processors: The reduction to a Riemann-Hilbert problem , 1979 .

[15]  R. Srikant,et al.  Low-Complexity Distributed Scheduling Algorithms for Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[16]  Jian Ni,et al.  Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[17]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[18]  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.

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

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

[21]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

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