Contention resolution with constant expected delay
From MaRDI portal
(Redirected from Publication:5487882)
Recommendations
Cited in
(35)- A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
- Packet latency of deterministic broadcasting in adversarial multiple access channels
- Sade: competitive MAC under adversarial SINR
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Windowed backoff algorithms for WiFi: theory and performance under batched arrivals
- Broadcasting in ad hoc multiple access channels
- Performing work in broadcast networks
- Maximum throughput of multiple access channels in adversarial environments
- Consensus and collision detectors in radio networks
- Adversarial multiple access channels with individual injection rates
- Analysis of randomized protocols for conflict-free distributed access
- Deterministic non-adaptive contention resolution on a shared channel
- The cost of synchronizing multiple-access channels
- Broadcasting in ad hoc multiple access channels
- scientific article; zbMATH DE number 2088525 (Why is no real title available?)
- Competitive throughput in multi-hop wireless networks despite adaptive jamming
- Output Processes in Contention Packet Broadcasting Systems
- Delay Analysis of 0.487 Contention Resolution Algorithms
- Stochastic Contention Resolution With Short Delays
- scientific article; zbMATH DE number 1263198 (Why is no real title available?)
- Limiting distribution of the collision resolution interval
- Contention resolution with constant throughput and log-logstar channel accesses
- Contention resolution under selfishness
- Local queuing under contention
- Contention resolution with log-logstar channel accesses
- Asynchronous shared channel
- Contention Resolution with Heterogeneous Job Sizes
- Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Optimal Protocols for 2-Party Contention Resolution
- Simple contention resolution via multiplicative weight updates
- Contention resolution with message deadlines
- 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: Contention resolution with constant expected delay
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487882)
