Analysis of practical backoff protocols for contention resolution with multiple servers
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Modeling the backoff strategies of access to shared-memory multiprocessors
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Delay distribution and loss probability of bandwidth requests under truncated binary exponential backoff mechanism in IEEE 802.16e over Gilbert-Elliot error channel
- scientific article; zbMATH DE number 1670864 (Why is no real title available?)
- Stochastic Contention Resolution With Short Delays
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
- A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
- Contention resolution with constant throughput and log-logstar channel accesses
- Contention resolution under selfishness
- scientific article; zbMATH DE number 871955 (Why is no real title available?)
- Analysis of Backoff Protocols for Multiple Access Channels
- An Adaptive Backoff Protocol with Markovian Contention Window Control
- An improved stability bound for binary exponential backoff
- Instability of backoff protocols with arbitrary arrival rates
- Singletons for simpletons: revisiting windowed backoff with Chernoff bounds
- Thinning protocols for routing \(h\)-relations over shared media
- Contention resolution with message deadlines
- Jamming-resistant backoff with polylogarithmic sending and listening cost
This page was built for publication: Analysis of practical backoff protocols for contention resolution with multiple servers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1305940)
