Network Adiabatic Theorem: An Efficient Randomized Protocol for Contention Resolution
The popularity of Aloha(-like) algorithms for resolution of contention between multiple entities accessing common re- sources is due to their extreme simplicity and distributed nature. Example applications of such algorithms include Ethernet and recently emerging wireless multi-access net- work...
Main Authors: | Rajagopalan, Shreevatsa, Shah, Devavrat, Shin, Jinwoo |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery
2011
|
Online Access: | http://hdl.handle.net/1721.1/61980 https://orcid.org/0000-0003-0737-3259 |
Similar Items
-
Randomized Scheduling Algorithm for Queueing Networks
by: Shah, Devavrat, et al.
Published: (2012) -
Distributed averaging in dynamic networks
by: Rajagopalan, Shreevatsa
Published: (2011) -
Inertial Theorem: Overcoming the quantum adiabatic limit
by: Roie Dann, et al.
Published: (2021-01-01) -
Distributed Random Access Algorithm: Scheduling and Congesion Control
by: Jiang, Libin, et al.
Published: (2011) -
Dynamics in congestion games
by: Shah, Devavrat, et al.
Published: (2011)