Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
IEEE Transactions on Information Theory
Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
A Bound on the Capacity of Backoff and Acknowledgement-based Protocols
A Bound on the Capacity of Backoff and Acknowledgement-based Protocols
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
Network optimization and control
Foundations and Trends® in Networking
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
Markov Chains and Stochastic Stability
Markov Chains and Stochastic Stability
Information theory and communication networks: an unconsummated union
IEEE Transactions on Information Theory
Towards optimal MAC without message passing in wireless networks
CFI '09 Proceedings of the 4th International Conference on Future Internet Technologies
Foundations and Trends® in Networking
EZ-Flow: removing turbulence in IEEE 802.11 wireless mesh networks without message passing
Proceedings of the 5th international conference on Emerging networking experiments and technologies
On channel access delay of CSMA policies in wireless networks with primary interference constraints
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal tradeoff between exposed and hidden nodes in large wireless networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Qualitative properties of α-weighted scheduling policies
Proceedings of the ACM SIGMETRICS international 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
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
Equalizing throughputs in random-access networks
ACM SIGMETRICS Performance Evaluation Review
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
Cell association and interference coordination in heterogeneous LTE-A cellular networks
IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
Cross-layer design in multihop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Extra back-off flow control in multi-hop wireless networks
Performance Evaluation
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
Tandem queueing networks with neighbor blocking and back-offs
Queueing Systems: Theory and Applications
Achieving target throughputs in random-access networks
Performance Evaluation
Understanding and tackling the root causes of instability in wireless mesh 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
Spatial fairness in linear random-access networks
Performance Evaluation
Congestion control meets medium access: throughput, delay, and complexity
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
IEEE/ACM Transactions on Networking (TON)
Exploring the throughput boundaries of randomized schedulers in wireless networks
IEEE/ACM Transactions on Networking (TON)
Timescale decoupled routing and rate control in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
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
On distributed scheduling with heterogeneously delayed network-state information
Queueing Systems: Theory and Applications
Embedding of virtual network requests over static wireless multihop networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exploiting the past to reduce delay in CSMA scheduling: a high-order markov chain approach
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
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
Balancing lifetime and classification accuracy of wireless sensor networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
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
Throughput-optimal scheduling in multihop wireless networks without per-flow information
IEEE/ACM Transactions on Networking (TON)
Distributed CSMA algorithms for link scheduling in multihop MIMO networks under SINR model
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
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
On the efficiency of CSMA-CA scheduling in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
Throughput-optimal CSMA with imperfect carrier sensing
IEEE/ACM Transactions on Networking (TON)
Delay-guaranteed cross-layer scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.06 |
The popularity of Aloha-like algorithms for resolution of contention between multiple entities accessing common resources is due to their extreme simplicity and distributed nature. Example applications of such algorithms include Ethernet and recently emerging wireless multi-access networks. Despite a long and exciting history of more than four decades, the question of designing an algorithm that is essentially as simple and distributed as Aloha while being efficient has remained unresolved. In this paper, we resolve this question successfully for a network of queues where contention is modeled through independent-set constraints over the network graph. The work by Tassiulas and Ephremides (1992) suggests that an algorithm that schedules queues so that the summation of `weight' of scheduled queues is maximized, subject to constraints, is efficient. However, implementing such an algorithm using Aloha-like mechanism has remained a mystery. We design such an algorithm building upon a Metropolis-Hastings sampling mechanism along with selection of `weight' as an appropriate function of the queue-size. The key ingredient in establishing the efficiency of the algorithm is a novel adiabatic-like theorem for the underlying queueing network, which may be of general interest in the context of dynamical systems.