A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory

DOI10.1007/978-3-030-34992-9_13MaRDI QIDQ6536332zbMATH OpenFDO

Authors Michael Feldmann, Thorsten Götte, Christian Scheideler

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-34992-9_13

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Stateless Near Optimal Flow Control with Poly-logarithmic Convergence
• Distributed Computing – IWDC 2005
• Self-stabilization: Randomness to reduce space
• scientific article; zbMATH DE number 1263198
• Stochastic Contention Resolution With Short Delays

Cites work

• Adaptive AIMD congestion control
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• Balanced allocations: a simple proof for the heavily loaded case
• Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions
• Loosely-stabilizing leader election in a population protocol model
• Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness
• Self-stabilizing systems in spite of distributed control
• Simple contention resolution via multiplicative weight updates
• Weak vs. self vs. probabilistic stabilization

This page was built for publication: A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory

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