Binary exponential backoff is stable for high arrival rates

DOI10.1007/3-540-46541-3_14MaRDI QIDQ4501533zbMATH OpenFDO

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

Publication date 13 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://wrap.warwick.ac.uk/61086/7/WRAP_cs-rr-359.pdf

zbMATH Keywords

binary exponential backoff protocolmaximum arrival rate

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• An improved stability bound for binary exponential backoff
• 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

(6)

• Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
• Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels
• How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
• An improved stability bound for binary exponential backoff
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution

This page was built for publication: Binary exponential backoff is stable for high arrival rates

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