{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:17Z","timestamp":1759638017488,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349912"},{"type":"electronic","value":"9783030349929"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34992-9_13","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T13:02:48Z","timestamp":1573736568000},"page":"149-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory"],"prefix":"10.1007","author":[{"given":"Michael","family":"Feldmann","sequence":"first","affiliation":[]},{"given":"Thorsten","family":"G\u00f6tte","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: SPAA, pp. 325\u2013332. ACM (2005). \nhttps:\/\/doi.org\/10.1145\/1073970.1074023","key":"13_CR1","DOI":"10.1145\/1073970.1074023"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/3276769","volume":"66","author":"MA Bender","year":"2019","unstructured":"Bender, M.A., Fineman, J.T., Gilbert, S., Young, M.: Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness. J. ACM 66(1), 6:1\u20136:33 (2019). \nhttps:\/\/doi.org\/10.1145\/3276769","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Berenbrink, P., Friedetzky, T., Kaaser, D., Kling, P.: Tight & simple load balancing. In: IPDPS, pp. 718\u2013726. IEEE (2019). \nhttps:\/\/doi.org\/10.1109\/IPDPS.2019.00080","key":"13_CR3","DOI":"10.1109\/IPDPS.2019.00080"},{"doi-asserted-by":"publisher","unstructured":"Chang, Y., Jin, W., Pettie, S.: Simple contention resolution via multiplicative weight updates. In: SOSA@SODA, OASICS, vol. 69, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2019). \nhttps:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.16","key":"13_CR4","DOI":"10.4230\/OASIcs.SOSA.2019.16"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0169-7552(89)90019-6","volume":"17","author":"D Chiu","year":"1989","unstructured":"Chiu, D., Jain, R.: Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Comput. Netw. 17, 1\u201314 (1989). \nhttps:\/\/doi.org\/10.1016\/0169-7552(89)90019-6","journal-title":"Comput. Netw."},{"issue":"7","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1016\/j.automatica.2012.03.014","volume":"48","author":"MJ Corless","year":"2012","unstructured":"Corless, M.J., Shorten, R.: Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions. Automatica 48(7), 1291\u20131299 (2012). \nhttps:\/\/doi.org\/10.1016\/j.automatica.2012.03.014","journal-title":"Automatica"},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/S0129054115500173","volume":"26","author":"S Devismes","year":"2015","unstructured":"Devismes, S., Tixeuil, S., Yamashita, M.: Weak vs. self vs. probabilistic stabilization. Int. J. Found. Comput. Sci. 26(3), 293\u2013320 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"11","key":"13_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974). \nhttps:\/\/doi.org\/10.1145\/361179.361202","journal-title":"Commun. ACM"},{"unstructured":"Feldmann, M., G\u00f6tte, T., Scheideler, C.: A loosely self-stabilizing protocol for randomized congestion control with logarithmic memory. CoRR abs\/1909.04544 (2019). \nhttps:\/\/arxiv.org\/abs\/1909.04544","key":"13_CR9"},{"doi-asserted-by":"publisher","unstructured":"Feldmann, M., Scheideler, C.: Skeap & seap: scalable distributed priority queues for constant and arbitrary priorities. In: SPAA, pp. 287\u2013296. ACM (2019). \nhttps:\/\/doi.org\/10.1145\/3323165.3323193","key":"13_CR10","DOI":"10.1145\/3323165.3323193"},{"doi-asserted-by":"publisher","unstructured":"Feldmann, M., Scheideler, C., Setzer, A.: Skueue: a scalable and sequentially consistent distributed queue. In: IPDPS, pp. 1040\u20131049. IEEE Computer Society (2018). \nhttps:\/\/doi.org\/10.1109\/IPDPS.2018.00113","key":"13_CR11","DOI":"10.1109\/IPDPS.2018.00113"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/TCOM.1980.1094691","volume":"28","author":"M Gerla","year":"1980","unstructured":"Gerla, M., Kleinrock, L.: Flow control: a comparative survey. IEEE Trans. Commun. 28(4), 553\u2013574 (1980). \nhttps:\/\/doi.org\/10.1109\/TCOM.1980.1094691","journal-title":"IEEE Trans. Commun."},{"unstructured":"Goldberg, L.A.: Notes on contention resolution (2002). \nhttps:\/\/www.cs.ox.ac.uk\/people\/leslieann.goldberg\/contention.html","key":"13_CR13"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-46475-1_2","volume-title":"Advances in Distributed Systems","author":"R Guerraoui","year":"2000","unstructured":"Guerraoui, R., Hurfinn, M., Mostefaoui, A., Oliveira, R., Raynal, M., Schiper, A.: Consensus in asynchronous distributed systems: a concise guided tour. In: Krakowiak, S., Shrivastava, S. (eds.) Advances in Distributed Systems. LNCS, vol. 1752, pp. 33\u201347. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-46475-1_2"},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/956981.956989","volume":"33","author":"T Kelly","year":"2003","unstructured":"Kelly, T.: Scalable TCP: improving performance in highspeed wide area networks. Comput. Commun. Rev. 33(2), 83\u201391 (2003). \nhttps:\/\/doi.org\/10.1145\/956981.956989","journal-title":"Comput. Commun. Rev."},{"issue":"1\u20132","key":"13_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00453-005-1160-3","volume":"43","author":"A Kesselman","year":"2005","unstructured":"Kesselman, A., Mansour, Y.: Adaptive AIMD congestion control. Algorithmica 43(1\u20132), 97\u2013111 (2005). \nhttps:\/\/doi.org\/10.1007\/s00453-005-1160-3","journal-title":"Algorithmica"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-642-41527-2_37","volume-title":"Distributed Computing","author":"S Kniesburges","year":"2013","unstructured":"Kniesburges, S., Koutsopoulos, A., Scheideler, C.: CONE-DHT: a distributed self-stabilizing algorithm for a heterogeneous storage system. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 537\u2013549. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-41527-2_37"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/11424505_9","volume-title":"Wired\/Wireless Internet Communications","author":"A Lahanas","year":"2005","unstructured":"Lahanas, A., Tsaoussidis, V.: Performance evaluation of $$\\tau $$-AIMD over wireless asynchronous networks. In: Braun, T., Carle, G., Koucheryavy, Y., Tsaoussidis, V. (eds.) WWIC 2005. LNCS, vol. 3510, pp. 86\u201396. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11424505_9"},{"doi-asserted-by":"publisher","unstructured":"Mahlmann, P., Schindelhauer, C.: Distributed random digraph transformations for peer-to-peer networks. In: SPAA, pp. 308\u2013317. ACM (2006). \nhttps:\/\/doi.org\/10.1145\/1148109.1148162","key":"13_CR19","DOI":"10.1145\/1148109.1148162"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-24550-3_31","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Richa","year":"2011","unstructured":"Richa, A., Scheideler, C., Stevens, P.: Self-stabilizing De Bruijn networks. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 416\u2013430. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24550-3_31"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2012.01.007","volume":"444","author":"Y Sudo","year":"2012","unstructured":"Sudo, Y., Nakamura, J., Yamauchi, Y., Ooshita, F., Kakugawa, H., Masuzawa, T.: Loosely-stabilizing leader election in a population protocol model. Theor. Comput. Sci. 444, 100\u2013112 (2012). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2012.01.007","journal-title":"Theor. Comput. Sci."},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1007\/978-3-662-43948-7_81","volume-title":"Automata, Languages, and Programming","author":"K Talwar","year":"2014","unstructured":"Talwar, K., Wieder, U.: Balanced allocations: a simple proof for the heavily loaded case. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 979\u2013990. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-43948-7_81"},{"issue":"3","key":"13_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TMC.2007.70770","volume":"7","author":"B Tang","year":"2008","unstructured":"Tang, B., Gupta, H., Das, S.R.: Benefit-based data caching in ad hoc networks. IEEE Trans. Mob. Comput. 7(3), 289\u2013304 (2008). \nhttps:\/\/doi.org\/10.1109\/TMC.2007.70770","journal-title":"IEEE Trans. Mob. Comput."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34992-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T19:46:41Z","timestamp":1573760801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34992-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349912","9783030349929"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34992-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2019.lip6.fr\/symp\/sss2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}