Implementing utility-optimal CSMA

Authors:
Jinsung Lee;Junhee Lee;Yung Yi;Song Chong;Alexandre Proutière;Mung Chiang
Affiliations:
Dept. of Electrical Engineering, KAIST, South Korea;Dept. of Electrical Engineering, KAIST, South Korea;Dept. of Electrical Engineering, KAIST, South Korea;Dept. of Electrical Engineering, KAIST, South Korea;Microsoft Research, Cambridge, UK;Dept. of Electrical Engineering, Princeton University
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 10
Cited 6

Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Distributed link scheduling with constant overhead

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Complexity in wireless scheduling: impact and tradeoffs

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Performance of random medium access control, an asymptotic approach

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Utility-optimal random access: reduced complexity, fast convergence, and robust performance

IEEE Transactions on Wireless Communications
Queue back-pressure random access in multihop wireless networks: optimality and stability

IEEE Transactions on Information Theory
Joint congestion control, routing, and MAC for stability and fairness in wireless networks

IEEE Journal on Selected Areas in Communications

Resource allocation over network dynamics without timescale separation

INFOCOM'10 Proceedings of the 29th conference on Information communications
Back-pressure routing and rate control for ICNs

Proceedings of the sixteenth annual international conference on Mobile computing and networking
On the performance of TCP over throughput-optimal CSMA

Proceedings of the Nineteenth International Workshop on Quality of Service
Research challenges towards the Future Internet

Computer Communications
Timescale decoupled routing and rate control in intermittently connected networks

IEEE/ACM Transactions on Networking (TON)
Throughput optimization in wireless local networks with inter-AP interference via a joint-association control, rate control, and contention resolution

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under a number of assumptions. This paper reports the results from the first deployment of such random access algorithms through an implementation over conventional 802.11 hardware, an on-going effort that started in summer 2009. It shows both a confirmation that Utility Optimal CSMA may work well in practice even with an implementation over legacy equipment, and a wide array of gaps between theory and practice in the field of wireless scheduling. This paper therefore also brainstorms the discovery of and bridging over these gaps, and the implementation-inspired questions on modeling and analysis of scheduling algorithms.