Dimensioning bandwidth for elastic traffic in high-speed data networks
IEEE/ACM Transactions on Networking (TON)
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Insensitive Traffic Models for Communication Networks
Discrete Event Dynamic Systems
Approaching throughput-optimality in a distributed CSMA algorithm: collisions and stability
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Resource allocation over network dynamics without timescale separation
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the stability of flow-aware CSMA
Performance Evaluation
Insensitivity and stability of random-access networks
Performance Evaluation
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
Backlog-based random access in wireless networks: fluid limits and delay issues
Proceedings of the 23rd International Teletraffic Congress
Modeling Internet backbone traffic at the flow level
IEEE Transactions on Signal Processing
| Hi-index | 0.00 |
We analyze the performance of CSMA in multi-channel wireless networks, accounting for the random nature of traffic. Specifically, we assess the ability of CSMA to fully utilize the radio resources and in turn to stabilize the network in a dynamic setting with flow arrivals and departures. We prove that CSMA is optimal in the ad-hoc mode, when each flow goes through a unique dedicated wireless link from a transmitter to a receiver. It is generally suboptimal in infrastructure mode, when all data flows originate from or are destined to the same set of access points, due to the inherent bias of CSMA against downlink traffic. We propose a slight modification of CSMA that we refer to as flow-aware CSMA, which corrects this bias and makes the algorithm optimal in all cases. The analysis is based on some time-scale separation assumption which is proved valid in the limit of large flow sizes.