Delay performance of backlog based random access

Authors:
N. Bouman;S. C. Borst;J. S.H. van Leeuwaarden
Affiliations:
Eindhoven University of Technology, EURANDOM;Eindhoven University of Technology, AlcatelLucent, Bell Labs;Eindhoven University of Technology, EURANDOM
Venue:
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Year:
2011

Citing 6
Cited 0

Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Delay optimal queue-based CSMA

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed random access algorithm: scheduling and congestion control

IEEE Transactions on Information Theory
A distributed CSMA algorithm for throughput and utility maximization in wireless networks

IEEE/ACM Transactions on Networking (TON)
Backlog-based random access in wireless networks: fluid limits and delay issues

Proceedings of the 23rd International Teletraffic Congress

Quantified Score

Hi-index	0.00

Visualization

Abstract

Backlog-based CSMA strategies provide a popular mechanism for distributed medium access control in wireless networks. When suitably designed, such strategies offer the striking capability to match the optimal throughput performance of centralized scheduling algorithms in a wide range of scenarios. Unfortunately, however, the activation rules used in these schemes tend to yield excessive backlogs and delays. More aggressive activation rates can potentially improve the delay performance, but may not allow provable maximum-stability guarantees. In order to gain a fundamental understanding how the shape of the activation function affects the queueing behavior, we focus on a single- node scenario, thus separating the impact of the network topology. We demonstrate that three qualitatively different regimes can arise, depending on how rapidly the activation function increases with the backlog. Simulation experiments are conducted to validate the analytical findings.