Analysis of backoff protocols for multiple access channels

Authors:
J. Hastad;T. Leighton;B. Rogoff
Affiliations:
Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 8
Cited 15

On the stability of the Ethernet

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Network control by bayesian broadcast

IEEE Transactions on Information Theory
Stability conditions for multidimensional queueing systems with computer applications

Operations Research
Network Protocols

ACM Computing Surveys (CSUR)
Measured performance of an Ethernet local network

Communications of the ACM
Ethernet: distributed packet switching for local computer networks

Communications of the ACM
Some Theorems on the Instability of the Exponential Back-Off Protocol

Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation

Stability of binary exponential backoff

Journal of the ACM (JACM)
On the complexity of radio communication

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Run-away dynamics of CDMA channels in an adaptive packet radio network

Wireless Networks
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
Analysis of practical backoff protocols for contention resolution with multiple servers

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The wakeup problem in synchronous broadcast systems (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
A capacity analysis for the IEEE 802.11 MAC protocol

Wireless Networks
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Design and Analysis of Dynamic Processes: A Stocastic Approach

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Adversarial contention resolution for simple channels

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Faster deterministic wakeup in multiple access channels

Discrete Applied Mathematics
A carrier sense multiple access protocol with power backoff (CSMA/PB)

Ad Hoc Networks
An efficient bandwidth guaranteed routing for ad hoc networks using ieee 802.11 with interference consideration

Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Faster deterministic wakeup in multiple access channels

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, we analyze the stochastic behavior of backoff protocols for multiple access channels such as the Ethernet. In particular, we prove that binary exponential backoff is unstable if the arrival rate of new messages at each station is &lgr;/N for any number of stations N exceeding 1 and any overall arrival rate &lgr; exceeding .567 + 1/4N - 2. More importantly, we also prove that any superlinear polynomial backoff protocol (e.g., quadratic backoff) is stable for any set of arrival rates that sum to less than one, and any number of stations. The results significantly extend the previous work in the area, and provide the first examples of acknowledgement based protocols known to be stable for a nonnegligible overall arrival rate distributed over an arbitrarily large number of stations. The results also disprove a popular assumption that exponential backoff is the best choice among acknowledgement based protocols for systems with large overall arrival rates. Finally, we prove that any linear or sublinear backoff protocol is unstable if the arrival rate at each station is &lgr;/N for any fixed &lgr; and sufficiently large N.