Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
On the fairness of large CSMA networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Towards utility-optimal random access without message passing
Wireless Communications & Mobile Computing - Recent Advances in Wireless Communications and Networks
Delay optimal queue-based CSMA
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Back-of-the-envelope computation of throughput distributions in CSMA wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
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
Markov approximation for combinatorial network optimization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Scheduling and Congestion Control for Wireless and Processing Networks
Scheduling and Congestion Control for Wireless and Processing Networks
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
Stochastic Network Optimization with Application to Communication and Queueing Systems
Stochastic Network Optimization with Application to Communication and Queueing Systems
Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints
IEEE Transactions on Information Theory
Hardness of Low Delay Network Scheduling
IEEE Transactions on Information Theory
Delays and mixing times in random-access networks
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Hi-index | 0.00 |
This paper explains recent results on distributed algorithms for networks of conflicting queues. At any given time, only specific subsets of queues can be served simultaneously. The challenge is to select the subsets in a distributed way to stabilize the queues whenever the arrival rates are feasible.One key idea is to formulate the subset selection as an optimization problem where the objective function includes the entropy of the distribution of the selected subsets. The dual algorithm for solving this optimization problem provides a distributed scheduling algorithm that requires only local queue-length information. The algorithm is based on the CSMA (Carrier Sense Multiple Access) protocol in wireless networks.We also explain recent results, some of them unpublished so far, on the delay properties of these algorithms. In particular, we present a framework for queuing stability under bounded CSMA parameters, and show how the expected queue lengths depend on the throughput region to be supported. When the arrival rates are within a fraction of the capacity region, queue lengths that are polynomial (or even logarithmic) in the number of queues can be achieved.