A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory

We consider congestion control in peer-to-peer distributed systems. The problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called clients in this paper) that want to send messages to a fixed common peer (called server in this paper). We assume that each client $v \in V$ sends a message with probability $p(v) \in [0,1)$ and the server has a capacity of $\sigma \in \mathbb{N}$, i.e., it can recieve at most $\sigma$ messages per round and excess messages are dropped. The server can modify these probabilities when clients send messages. Ideally, we wish to converge to a state with $\sum p(v) = \sigma$ and $p(v) = p(w)$ for all $v,w \in V$. We propose a loosely self-stabilizing protocol with a slightly relaxed legimate state. Our protocol lets the system converge from any initial state to a state where $\sum p(v) \in \left[\sigma \pm \epsilon\right]$ and $|p(v)-p(w)| \in O(\frac{1}{n})$. This property is then maintained for $\Omega(n^{\mathfrak{c}})$ rounds in expectation. In particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values. Our protocol uses only $O(W + \log n)$ bits of memory where $W$ is length of node identifers, making it very lightweight. Finally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).

[1]  Rachid Guerraoui,et al.  Consensus in Asynchronous Distributed Systems: A Concise Guided Tour , 1999, Advances in Distributed Systems.

[2]  Christian Schindelhauer,et al.  Distributed random digraph transformations for peer-to-peer networks , 2006, SPAA '06.

[3]  Vassilis Tsaoussidis,et al.  Performance Evaluation of tau-AIMD over Wireless Asynchronous Networks , 2005, WWIC.

[4]  Christian Scheideler,et al.  Self-Stabilizing De Bruijn Networks , 2011, SSS.

[5]  Yukiko Yamauchi,et al.  Loosely-stabilizing leader election in a population protocol model , 2012, Theor. Comput. Sci..

[6]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[7]  Sébastien Tixeuil,et al.  Weak vs. Self vs. Probabilistic Stabilization , 2007, 2008 The 28th International Conference on Distributed Computing Systems.

[8]  Bin Tang,et al.  Benefit-Based Data Caching in Ad Hoc Networks , 2008, IEEE Trans. Mob. Comput..

[9]  Yishay Mansour,et al.  Adaptive AIMD Congestion Control , 2003, PODC '03.

[10]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[11]  Christian Scheideler,et al.  CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System , 2013, DISC.

[12]  Michael A. Bender,et al.  Scaling Exponential Backoff , 2018, J. ACM.

[13]  Michael A. Bender,et al.  Adversarial contention resolution for simple channels , 2005, SPAA '05.

[14]  C. Scheideler Probabilistic Methods for Coordination Problems , 2000 .

[15]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[16]  Kunal Talwar,et al.  Balanced Allocations: A Simple Proof for the Heavily Loaded Case , 2013, ICALP.

[17]  Seth Pettie,et al.  Simple Contention Resolution via Multiplicative Weight Updates , 2019, SOSA@SODA.

[18]  Christian Scheideler,et al.  Skueue: A Scalable and Sequentially Consistent Distributed Queue , 2018, 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[19]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[20]  Christian Scheideler,et al.  Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities , 2018, SPAA.

[21]  Robert Shorten,et al.  Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions , 2012, Autom..

[22]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[23]  Petra Berenbrink,et al.  Tight & Simple Load Balancing , 2019, 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS).