IEEE Transactions on Information Theory
SIAM Journal on Computing
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
A Bound on the Capacity of Backoff and Acknowledgement-based Protocols
A Bound on the Capacity of Backoff and Acknowledgement-based Protocols
Convex Optimization
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
Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
Network optimization and control
Foundations and Trends® in Networking
IEEE/ACM Transactions on Networking (TON)
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
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
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Foundations and Trends® in Networking
Randomized scheduling algorithms for high-aggregate bandwidth switches
IEEE Journal on Selected Areas in Communications
Hardness of Low Delay Network Scheduling
IEEE Transactions on Information Theory
Insensitivity and stability of random-access networks
Performance Evaluation
Equalizing throughputs in random-access networks
ACM SIGMETRICS Performance Evaluation Review
Enhance & explore: an adaptive algorithm to maximize the utility of wireless networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Delay performance of backlog based random access
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
Achieving target throughputs in random-access networks
Performance Evaluation
Approaching throughput-optimality in distributed CSMA scheduling algorithms with collisions
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
Spatial fairness in linear random-access networks
Performance Evaluation
Backoff mechanisms in narrow band and spread spectrum aloha networks
Proceedings of the first ACM MobiHoc workshop on Airborne Networks and Communications
Efficient rank aggregation using partial data
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Backpressure scheduling in IEEE 802.11 wireless mesh networks: Gap between theory and practice
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance of CSMA in multi-channel wireless networks
Queueing Systems: Theory and Applications
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
Queueing Systems: Theory and Applications
RateOptimal scheduling schemes for asynchronous InputQueued packet switches
ACM SIGMETRICS Performance Evaluation Review
Lingering issues in distributed scheduling
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Delays and mixing times in random-access networks
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
CSMA over time-varying channels: optimality, uniqueness and limited backoff rate
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Delay performance in random-access grid networks
Performance Evaluation
Random access in wireless networks: how much aggressiveness can cause instability?
ACM SIGMETRICS Performance Evaluation Review
Hi-index | 754.84 |
This paper provides proofs of the rate stability, Harris recurrence, and ε-optimality of carrier sense multiple access (CSMA) algorithms where the random access (or backoff) parameter of each node is adjusted dynamically. These algorithms require only local information and they are easy to implement. The setup is a network of wireless nodes with a fixed conflict graph that identifies pairs of nodes whose simultaneous transmissions conflict. The paper studies two algorithms. The first algorithm schedules transmissions to keep up with given arrival rates of packets. The second algorithm controls the arrivals in addition to the scheduling and attempts to maximize the sum of the utilities, in terms of the rates, of the packet flows at different nodes. For the first algorithm, the paper proves rate stability for strictly feasible arrival rates and also Harris recurrence of the queues. For the second algorithm, the paper proves the ε-optimality in terms of the utilities of the allocated rates. Both algorithms are iterative and we study two versions of each of them. In the first version, both operate with strictly local information but have relatively weaker performance guarantees; under the second version, both provide stronger performance guarantees by utilizing the additional information of the number of nodes in the network.