Instability of backoff protocols with arbitrary arrival rates

DOI10.1016/J.JCSS.2025.103638MaRDI QIDQ6987102zbMATH OpenFDO

Authors Leslie Ann Goldberg, John Lapinskas

Publication date 7 May 2025

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2025.103638

zbMATH Keywords

backoff protocolscontention resolutionMarkov chainsnetworksrandom processesstability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites work

• A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
• An improved stability bound for binary exponential backoff
• Analysis of Backoff Protocols for Multiple Access Channels
• Contention resolution with constant expected delay
• Contention resolution without collision detection
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
• Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution
• Information theory and communication networks: an unconsummated union
• Medium Access Using Queues
• Probability and Computing
• Randomized scheduling algorithm for queueing networks
• Stochastic Contention Resolution With Short Delays
• The number of packets transmitted by collision detect random access schemes
• Tight Trade-off in Contention Resolution without Collision Detection
• Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

This page was built for publication: Instability of backoff protocols with arbitrary arrival rates

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