A Bound on the Capacity of Backoff and Acknowledgement-based Protocols

Authors:
L. A. Goldberg;M. Jerrum;S. Kannan;M. S. Paterson
Affiliations:
-;-;-;-
Venue:
A Bound on the Capacity of Backoff and Acknowledgement-based Protocols
Year:
2000

Citing 0
Cited 3

Removing exponential backoff from TCP

ACM SIGCOMM Computer Communication Review
Network adiabatic theorem: an efficient randomized protocol for contention resolution

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Distributed random access algorithm: scheduling and congestion control

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, lambda, is at least 0.42 and that the capacity of every backoff protocol is at most 0.42. Thus, we show that backoff protocols have (provably) smaller capacity than full-sensing protocols. Finally, we show that the corresponding results, with the larger arrival bound of 0.531, also hold for every acknowledgement-based protocol.