Delays and mixing times in random-access networks

We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed backlog-based random-access schemes provide the striking capability to match the optimal throughput performance of centralized scheduling mechanisms. The specific type of activation rules for which throughput optimality has been established, may however yield excessive backlogs and delays. Motivated by that issue, we examine whether the poor delay performance is inherent to the basic operation of these schemes, or caused by the specific kind of activation rules. We derive delay lower bounds for backlog-based activation rules, which offer fundamental insight in the cause of the excessive delays. For fixed activation rates we obtain lower bounds indicating that delays and mixing times can grow dramatically with the load in certain topologies as well.

[1]  Jean C. Walrand,et al.  Stability and delay of distributed scheduling algorithms for networks of conflicting queues , 2012, Queueing Syst. Theory Appl..

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

[3]  Patrick Thiran,et al.  A Packing Approach to Compare Slotted and Non-Slotted Medium Access Control , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

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

[6]  Sem C. Borst,et al.  Backlog-based random access in wireless networks: Fluid limits and instability issues , 2012, 2012 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt).

[7]  H. Vincent Poor,et al.  Towards utility-optimal random access without message passing , 2010, Wirel. Commun. Mob. Comput..

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

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

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

[11]  Devavrat Shah,et al.  Hardness of low delay network scheduling , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[12]  Sem C. Borst,et al.  Backlog-based random access in wireless networks: Fluid limits and delay issues , 2011, 2011 23rd International Teletraffic Congress (ITC).

[13]  Sem C. Borst,et al.  Achievable delay performance in CSMA networks , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Devavrat Shah,et al.  Medium Access Using Queues , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[15]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[16]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[17]  Sem C. Borst,et al.  Achieving target throughputs in random-access networks , 2011, Perform. Evaluation.

[18]  A. Eryilmaz,et al.  A backlog-based CSMA mechanism to achieve fairness and throughput-optimality in multihop wireless networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[19]  Murat Alanyali,et al.  Delay performance of CSMA in networks with bounded degree conflict graphs , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

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

[22]  Michele Garetto,et al.  Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks , 2008, TNET.

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

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

[25]  Sem C. Borst,et al.  Mixing properties of CSMA networks on partite graphs , 2012, 6th International ICST Conference on Performance Evaluation Methodologies and Tools.

[26]  Devavrat Shah,et al.  Randomized Scheduling Algorithm for Queueing Networks , 2009, ArXiv.

[27]  Patrick Thiran,et al.  Modeling the 802.11 Protocol Under Different Capture and Sensing Capabilities , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[28]  R. Srikant,et al.  On the design of efficient CSMA algorithms for wireless networks , 2010, 49th IEEE Conference on Decision and Control (CDC).