Simple contention resolution via multiplicative weight updates

DOI10.4230/OASICS.SOSA.2019.16MaRDI QIDQ6593572zbMATH OpenFDO

Authors Yi-Jun Chang, Wenyu Jin, Seth Pettie

Publication date 26 August 2024

Full work available at URL https://doi.org/10.4230/OASICS.SOSA.2019.16

zbMATH Keywords

contention resolutionmultiplicative weight update method

Mathematics Subject Classification ID

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

Recommendations

• Optimal Protocols for 2-Party Contention Resolution
• Contention resolution without collision detection
• Contention resolution with constant expected delay
• Deterministic non-adaptive contention resolution on a shared channel
• Contention resolution with log-logstar channel accesses

Cited in

(6)

• Tight Trade-off in Contention Resolution without Collision Detection
• A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory
• 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
• Softening the impact of collisions in contention resolution

This page was built for publication: Simple contention resolution via multiplicative weight updates

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