An improved stability bound for binary exponential backoff

DOI10.1007/S00224-001-0005-YMaRDI QIDQ5945723zbMATH OpenOpenAlexFDO

Authors H. Al-Ammal, Leslie Ann Goldberg, Philip MacKenzie

Publication date 11 September 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-001-0005-y

zbMATH Keywords

multiple-access channel

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 1500516
• Analysis of practical backoff protocols for contention resolution with multiple servers
• Analysis of Backoff Protocols for Multiple Access Channels
• Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels
• A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols

Cited in

(7)

• Packet latency of deterministic broadcasting in adversarial multiple access channels
• Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
• A stochastic game analysis of the binary exponential backoff algorithm with multi-power diversity and transmission cost
• scientific article; zbMATH DE number 1500516 (Why is no real title available?)
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution
• Instability of backoff protocols with arbitrary arrival rates

This page was built for publication: An improved stability bound for binary exponential backoff

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945723)