---
res:
bibo_abstract:
- "We consider congestion control in peer-to-peer distributed systems. \r\nThe problem
can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called
\\emph{clients} in this paper) that want to send messages to a fixed common peer
(called \\emph{server} in this paper).\r\nWe 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.\r\nThe server can modify these probabilities
when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum
p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a
\\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.
\ \r\nOur protocol lets the system converge from \\emph{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})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$
rounds in expectation.\r\nIn particular, the initial client probabilities and
server variables are not necessarily well-defined, i.e., they may have arbitrary
values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$
is length of node identifiers, making it very lightweight.\r\nFinally we state
a lower bound on the convergence time an see that our protocol performs asymptotically
optimal (up to some polylogarithmic factor).\r\n@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Michael
foaf_name: Feldmann, Michael
foaf_surname: Feldmann
foaf_workInfoHomepage: http://www.librecat.org/personId=23538
- foaf_Person:
foaf_givenName: Thorsten
foaf_name: Götte, Thorsten
foaf_surname: Götte
foaf_workInfoHomepage: http://www.librecat.org/personId=34727
- foaf_Person:
foaf_givenName: Christian
foaf_name: Scheideler, Christian
foaf_surname: Scheideler
foaf_workInfoHomepage: http://www.librecat.org/personId=20792
bibo_doi: https://doi.org/10.1007/978-3-030-34992-9_13
dct_date: 2019^xs_gYear
dct_language: eng
dct_publisher: Springer, Cham@
dct_title: A Loosely Self-stabilizing Protocol for Randomized Congestion Control
with Logarithmic Memory@
...