A performance analysis of binary exponential backoff algorithm in the random access packet networks

Authors:
Sun Hur;Jeong Kee Kim;Jae Ho Jeong;Heesang Lee
Affiliations:
Department of Industrial Engineering, Hanyang University, Ansan, Korea;Department of Industrial Engineering, Hanyang University, Ansan, Korea;Department of Industrial Engineering, Hanyang University, Ansan, Korea;School of Systems Management Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications
Year:
2004

Citing 3
Cited 0

Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Stability of binary exponential backoff

Journal of the ACM (JACM)
Ethernet: distributed packet switching for local computer networks

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the performance of binary exponential backoff (BEB) algorithm under the slotted ALOHA protocol. When a node's message which tries to reserve a channel is involved in a collision for the n th time, it chooses one of the next 2″ frames with equal probability and attempts the reservation again. We derive the expected access delay and throughput which is defined as the expected number of messages that reserve a channel in a frame. A simulation study shows that the system is stable if the number of request slots is more than 3 times of the arrival rate.