Analysis of backoff protocols for multiple access channels
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Stability of binary exponential backoff
Journal of the ACM (JACM)
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Traffic studies of unbuffered Delta networks
IBM Journal of Research and Development
Congestion avoidance and control
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Stochastic contention resolution with short delays
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Universal continuous routing strategies
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The n-ary stack algorithm for the wireless random access channel
Mobile Networks and Applications - Special issue on channel access in wireless networks
Contention resolution with constant expected delay
Journal of the ACM (JACM)
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Binary Exponential Backoff Is Stable for High Arrival Rates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Performance analysis of exponential backoff
IEEE/ACM Transactions on Networking (TON)
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fairness of medium access control protocols for multi-hop ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A TCP with guaranteed performance in networks with dynamic congestion and random wireless losses
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Contention-Based Polling Efficiency in Broadband Wireless Networks
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Removing exponential backoff from TCP
ACM SIGCOMM Computer Communication Review
On stability and maximum throughput of exponential backoff mechanisms with two users
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Impact of bandwidth request schemes for Best-Effort traffic in IEEE 802.16 networks
Computer Communications
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Overall Delay in IEEE 802.16 with Contention-Based Random Access
ASMTA '09 Proceedings of the 16th International Conference on Analytical and Stochastic Modeling Techniques and Applications
Fairness of medium access control protocols for multi-hop ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Capacity analysis of reservation-based random access for broadband wireless access networks
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Bounded-mean-delay throughput and nonstarvation conditions in Aloha network
IEEE/ACM Transactions on Networking (TON)
Achieving coordination in random access networks without explicit message passing
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Tuning SCTP failover for carrier grade telephony signaling
Computer Networks: The International Journal of Computer and Telecommunications Networking
On ergodic algorithms in random multiple access systems with "success-failure" feedback
Problems of Information Transmission
Upper bound on overall delay in wireless broadband networks with non real-time traffic
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
Interference cancellation tree algorithms with κ-signal memory locations
IEEE Transactions on Communications
A stability conjecture on bandwidth sharing networks
Queueing Systems: Theory and Applications
Dynamic internet congestion with bursts
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A performance analysis of binary exponential backoff algorithm in the random access packet networks
AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications
Near-optimal radio use for wireless network synchronization
Theoretical Computer Science
Randomized algorithms and probabilistic analysis in wireless networking
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
On the optimality and the stability of backoff protocols
NEW2AN'07 Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
| Hi-index | 754.90 |
When several users simultaneously transmit over a shared communication channel, the messages are lost and must be retransmitted later. Various protocols specifying when to retransmit have been proposed and studied in recent years. One protocol is "binary exponential back-off," used in the local area network Ethernet. A mathematical model with several idealizations (discrete time slots, infinite users, no deletions) is shown to be unstable in that the asymptotic rate of successful transmissions is zero, however small the arrival rate.