{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:20Z","timestamp":1759638980010,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030670863"},{"type":"electronic","value":"9783030670870"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67087-0_19","type":"book-chapter","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:17:39Z","timestamp":1610587059000},"page":"296-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Self-stabilizing Uniform Reliable Broadcast"],"prefix":"10.1007","author":[{"given":"Oskar","family":"Lundstr\u00f6m","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"M. Schiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,14]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/BFb0030680","volume-title":"Distributed Algorithms","author":"M Kawazoe Aguilera","year":"1997","unstructured":"Kawazoe Aguilera, M., Chen, W., Toueg, S.: Heartbeat: a timeout-free failure detector for quiescent reliable communication. In: Mavronicolas, M., Tsigas, P. (eds.) WDAG 1997. LNCS, vol. 1320, pp. 126\u2013140. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0030680"},{"issue":"6","key":"19_CR2","doi-asserted-by":"publisher","first-page":"2040","DOI":"10.1137\/S0097539798341296","volume":"29","author":"MK Aguilera","year":"2000","unstructured":"Aguilera, M.K., Chen, W., Toueg, S.: On quiescent reliable communication. SIAM J. Comput. 29(6), 2040\u20132073 (2000)","journal-title":"SIAM J. Comput."},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48169-9_2","volume-title":"Distributed Computing","author":"M Kawazoe Aguilera","year":"1999","unstructured":"Kawazoe Aguilera, M., Toueg, S., Deianov, B.: Revisiting the weakest failure detector for uniform reliable broadcast. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 19\u201334. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48169-9_2"},{"key":"19_CR4","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"publisher","DOI":"10.2200\/S00908ED1V01Y201903DCT015","volume-title":"Introduction to Distributed Self-Stabilizing Algorithms","author":"K Altisen","year":"2019","unstructured":"Altisen, K., Devismes, S., Dubois, S., Petit, F.: Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2019)"},{"unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Bounding the unbounded. In INFOCOM 1994, pp. 776\u2013783. IEEE Computer Society (1994)","key":"19_CR5"},{"issue":"9","key":"19_CR6","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1002\/(SICI)1097-024X(19990725)29:9<741::AID-SPE259>3.0.CO;2-I","volume":"29","author":"KP Birman","year":"1999","unstructured":"Birman, K.P.: A review of experiences with reliable multicast. Softw. Pract. Exper. 29(9), 741\u2013774 (1999)","journal-title":"Softw. Pract. Exper."},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-09581-3_8","volume-title":"Networked Systems","author":"P Blanchard","year":"2014","unstructured":"Blanchard, P., Dolev, S., Beauquier, J., Dela\u00ebt, S.: Practically self-stabilizing paxos replicated state-machine. In: Noubir, G., Raynal, M. (eds.) NETYS 2014. LNCS, vol. 8593, pp. 99\u2013121. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09581-3_8"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"TD Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"12","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1016\/j.jpdc.2010.04.002","volume":"70","author":"S Dela\u00ebt","year":"2010","unstructured":"Dela\u00ebt, S., Devismes, S., Nesterenko, M., Tixeuil, S.: Snap-stabilization in message-passing systems. J. Parallel Distrib. Comput. 70(12), 1220\u20131230 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"11","key":"19_CR10","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)","journal-title":"Commun. ACM"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"doi-asserted-by":"crossref","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Self-stabilizing reconfiguration. In: NETYS, pp. 51\u201368 (2017)","key":"19_CR12","DOI":"10.1007\/978-3-319-59647-1_5"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jcss.2018.04.003","volume":"96","author":"S Dolev","year":"2018","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Practically-self-stabilizing virtual synchrony. J. Comput. Syst. Sci. 96, 50\u201373 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-33536-5_14","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Dolev","year":"2012","unstructured":"Dolev, S., Hanemann, A., Schiller, E.M., Sharma, S.: Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-fifo) dynamic networks. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 133\u2013147. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33536-5_14"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-40148-0_4","volume-title":"Networked Systems","author":"S Dolev","year":"2013","unstructured":"Dolev, S., Liba, O., Schiller, E.M.: Self-stabilizing byzantine resilient topology discovery and message delivery. In: Gramoli, V., Guerraoui, R. (eds.) NETYS 2013. LNCS, vol. 7853, pp. 42\u201357. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40148-0_4"},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s002360050180","volume":"36","author":"S Dolev","year":"1999","unstructured":"Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Inf. 36(6), 447\u2013462 (1999)","journal-title":"Acta Inf."},{"unstructured":"Dolev, S., Petig, T., Schiller, E.M.: Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks. CoRR abs, 1806.03498, : http:\/\/arxiv.org\/abs\/1806.03498. An earlier version appeared as Robust and Private Distributed Shared Atomic Memory in Message Passing Networks in PODC 2015, 311\u2013313 (2018)","key":"19_CR17"},{"issue":"7","key":"19_CR18","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TPDS.2003.1214322","volume":"14","author":"S Dolev","year":"2003","unstructured":"Dolev, S., Schiller, E.: Communication adaptive self-stabilizing group membership service. IEEE Trans. Parallel Distrib. Syst. 14(7), 709\u2013720 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"9","key":"19_CR19","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s00236-004-0143-1","volume":"40","author":"S Dolev","year":"2004","unstructured":"Dolev, S., Schiller, E.: Self-stabilizing group communication in directed networks. Acta Inf. 40(9), 609\u2013636 (2004)","journal-title":"Acta Inf."},{"issue":"7","key":"19_CR20","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/TMC.2006.104","volume":"5","author":"S Dolev","year":"2006","unstructured":"Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput. 5(7), 893\u2013905 (2006)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-030-31277-0_8","volume-title":"Networked Systems","author":"C Georgiou","year":"2019","unstructured":"Georgiou, C., Lundstr\u00f6m, O., Schiller, E.M.: Self-stabilizing snapshot objects for asynchronous failure-prone networked systems. In: Atig, M.F., Schwarzmann, A.A. (eds.) NETYS 2019. LNCS, vol. 11704, pp. 113\u2013130. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31277-0_8"},{"unstructured":"Hadzilacos, V., Toueg, S.: A modular approach to fault-tolerant broadcasts and related problems. Cornell University, Ithaca, NY, USA, Technical report (1994)","key":"19_CR22"},{"doi-asserted-by":"crossref","unstructured":"Imbs, D., Most\u00e9faoui, A., Perrin, M., Raynal, M.: Set-constrained delivery broadcast: definition, abstraction power, and computability limits. In: 19th Distributed Computing and Networking, ICDCN, pp. 1\u201310. ACM (2018)","key":"19_CR23","DOI":"10.1145\/3154273.3154296"},{"key":"19_CR24","first-page":"95","volume":"2","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: The implementation of reliable distributed multiprocess systems. Comput. Netw. 2, 95\u2013114 (1978)","journal-title":"Comput. Netw."},{"doi-asserted-by":"crossref","unstructured":"Lundstr\u00f6m, O., Raynal, M., Schiller, E.M.: Self-stabilizing set-constraint delivery broadcast. In: 40th IEEE International Conference on Distributed Computing Systems, (ICDCS) (2020), to appear","key":"19_CR25","DOI":"10.1109\/ICDCS47774.2020.00080"},{"unstructured":"Lundstr\u00f6m, O., Raynal, M., Schiller, E.M.: Self-stabilizing uniform reliable broadcast. CoRR abs\/2001.03244 (2020). https:\/\/arxiv.org\/abs\/2001.03244","key":"19_CR26"},{"unstructured":"Raynal, M.: A case study of agreement problems in distributed systems: Non-blocking atomic commitment. In: 2nd High-Assurance Systems Engineering Workshop (HASE \u201997), pp. 209\u2013214. IEEE Computer Society (1997)","key":"19_CR27"},{"key":"19_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94141-7","volume-title":"Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach","author":"M Raynal","year":"2018","unstructured":"Raynal, M.: Fault-Tolerant Message-Passing Distributed Systems - An Algorithmic Approach. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94141-7"},{"doi-asserted-by":"crossref","unstructured":"Salem, I., Schiller, E.M.: Practically-self-stabilizing vector clocks in the absence of execution fairness. In: 6th Networked Systems, NETYS, pp. 318\u2013333 (2018)","key":"19_CR29","DOI":"10.1007\/978-3-030-05529-5_21"},{"issue":"4","key":"19_CR30","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67087-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T11:50:23Z","timestamp":1618833023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67087-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670863","9783030670870"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67087-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","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":"46","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":"18","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":"4","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":"39% - 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","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":"3.75","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)"}},{"value":"The conference was held virtually. Three invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}