[{"external_id":{"arxiv":["1909.04544"]},"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","abstract":[{"lang":"eng","text":"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"}],"file":[{"date_updated":"2019-09-11T11:20:16Z","creator":"mfeldma2","date_created":"2019-09-11T11:20:16Z","file_size":428908,"file_id":"13188","access_level":"closed","file_name":"main.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"publisher":"Springer, Cham","date_created":"2019-09-10T12:48:33Z","title":"A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory","year":"2019","_id":"13182","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"1","name":"SFB 901"}],"department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"23538","file_date_updated":"2019-09-11T11:20:16Z","type":"conference","status":"public","date_updated":"2022-01-06T06:51:30Z","author":[{"last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael","first_name":"Michael"},{"first_name":"Thorsten","full_name":"Götte, Thorsten","id":"34727","last_name":"Götte"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"doi":"https://doi.org/10.1007/978-3-030-34992-9_13","has_accepted_license":"1","page":"149-164","citation":{"apa":"Feldmann, M., Götte, T., &#38; Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 149–164). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>","mla":"Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Springer, Cham, 2019, pp. 149–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>.","bibtex":"@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>}, booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164}, collection={Lecture Notes in Computer Science} }","short":"M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–164.","ama":"Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In: <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Lecture Notes in Computer Science. Springer, Cham; 2019:149-164. doi:<a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>","ieee":"M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory,” in <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2019, pp. 149–164.","chicago":"Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” In <i>Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019. <a href=\"https://doi.org/10.1007/978-3-030-34992-9_13\">https://doi.org/10.1007/978-3-030-34992-9_13</a>."}}]