{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:26Z","timestamp":1759335566409,"version":"3.37.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030055288"},{"type":"electronic","value":"9783030055295"}],"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-05529-5_20","type":"book-chapter","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T21:54:08Z","timestamp":1546638848000},"page":"303-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Churn Possibilities and Impossibilities"],"prefix":"10.1007","author":[{"given":"Dianne","family":"Foreback","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,5]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: SOSP, pp. 131\u2013145. ACM, New York (2001)","DOI":"10.1145\/502034.502048"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Augustine, J., Molla, A.R., Morsy, E., Pandurangan, G., Robinson, P., Upfal, E.: Storage and search in dynamic peer-to-peer networks. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 53\u201362. ACM (2013)","DOI":"10.1145\/2486159.2486170"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P.: Fast byzantine agreement in dynamic networks. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, pp. 74\u201383. ACM (2013)","DOI":"10.1145\/2484239.2484275"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Augustine, J., Pandurangan, G., Robinson, P., Roche, S., Upfal, E.: Enabling robust and efficient distributed computation in dynamic peer-to-peer networks. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 350\u2013369. IEEE (2015)","DOI":"10.1109\/FOCS.2015.29"},{"key":"20_CR5","unstructured":"Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA, pp. 318\u2013327. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Scheideler, C.: Towards scalable and robust overlay networks. In: IPTPS (2007)","DOI":"10.1145\/1148109.1148163"},{"issue":"2","key":"20_CR7","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/s00224-008-9099-9","volume":"45","author":"B Awerbuch","year":"2009","unstructured":"Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. Theory Comput. Syst. 45(2), 234\u2013260 (2009)","journal-title":"Theory Comput. Syst."},{"key":"20_CR8","unstructured":"Baset, S.A., Schulzrinne, H.: An analysis of the skype peer-to-peer internet telephony protocol. arXiv preprint arxiv:cs\/0412017 (2004)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-24550-3_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Berns","year":"2011","unstructured":"Berns, A., Ghosh, S., Pemmaraju, S.V.: Building self-stabilizing overlay networks with the transitive closure framework. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 62\u201376. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_7"},{"issue":"1","key":"20_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1142\/S012962641000003X","volume":"20","author":"E Caron","year":"2010","unstructured":"Caron, E., Desprez, F., Petit, F., Tedeschi, C.: Snap-stabilizing prefix tree for peer-to-peer systems. Parallel Process. Lett. 20(1), 15\u201330 (2010)","journal-title":"Parallel Process. Lett."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S., Charron-Bost, B.: On the impossibility of group membership. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 322\u2013330. ACM (1996)","DOI":"10.1145\/248052.248120"},{"issue":"2","key":"20_CR12","doi-asserted-by":"crossref","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"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.tcs.2011.12.079","volume":"428","author":"T Clouser","year":"2012","unstructured":"Clouser, T., Nesterenko, M., Scheideler, C.: Tiara: a self-stabilizing deterministic skip list and skip graph. Theor. Comput. Sci. 428, 18\u201335 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Dolev, S., Kat, R.I.: Hypertree for self-stabilizing peer-to-peer systems. In: NCA, pp. 25\u201332 (2004)","DOI":"10.1109\/NCA.2004.1347757"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Drees, M., Gmyr, R., Scheideler, C.: Churn-and dos-resistant overlay networks based on network reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), California, USA, pp. 417\u2013427. ACM (2016)","DOI":"10.1145\/2935764.2935783"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-11764-5_4","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"D Foreback","year":"2014","unstructured":"Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., Strothmann, T.: On stabilizing departures in overlay networks. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 48\u201362. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11764-5_4"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-319-49259-9_12","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"D Foreback","year":"2016","unstructured":"Foreback, D., Nesterenko, M., Tixeuil, S.: Infinite unlimited churn (short paper). In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 148\u2013153. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_12"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Foreback, D., Nesterenko, M., Tixeuil, S.: Churn possibilities and impossibilities. Technical report hal-01753397, HAL (2018)","DOI":"10.1007\/978-3-030-05529-5_20"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-12200-2_27","volume-title":"LATIN 2010: Theoretical Informatics","author":"D Gall","year":"2010","unstructured":"Gall, D., Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4ubig, H.: Time complexity of distributed topological self-stabilization: the case of graph linearization. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 294\u2013305. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12200-2_27"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Gambs, S., Guerraoui, R., Harkous, H., Huc, F., Kermarrec, A.-M.: Scalable and secure polling in dynamic distributed networks. In: 31st Symposium on Reliable Distributed Systems (SRDS), pp. 181\u2013190. IEEE (2012)","DOI":"10.1109\/SRDS.2012.63"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Huc, F., Kermarrec, A.-M.: Highly dynamic distributed computing with byzantine failures. In: PODC, pp. 176\u2013183. ACM (2013)","DOI":"10.1145\/2484239.2484263"},{"issue":"4","key":"20_CR22","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00446-012-0160-1","volume":"25","author":"TP Hayes","year":"2012","unstructured":"Hayes, T.P., Saia, J., Trehan, A.: The forgiving graph: a distributed data structure for low stretch under adversarial attack. Distrib. Comput. 25(4), 261\u2013278 (2012)","journal-title":"Distrib. Comput."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4aubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: PODC, pp. 131\u2013140 (2009)","DOI":"10.1145\/1582716.1582741"},{"issue":"6","key":"20_CR24","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/2629695","volume":"61","author":"R Jacob","year":"2014","unstructured":"Jacob, R., Richa, A., Scheideler, C., Schmid, S., T\u00e4ubig, H.: Skip+: a self-stabilizing skip graph. J. ACM (JACM) 61(6), 36 (2014)","journal-title":"J. ACM (JACM)"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Ko, S.Y., Hoque, I., Gupta, I.: Using tractable and realistic churn models to analyze quiescence behavior of distributed protocols. In: SRDS, pp. 259\u2013268 (2008)","DOI":"10.1109\/SRDS.2008.19"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-21741-3_14","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Koutsopoulos","year":"2015","unstructured":"Koutsopoulos, A., Scheideler, C., Strothmann, T.: Towards a universal approach for the finite departure problem in overlay networks. In: Pelc, A., Schwarzmann, A.A. (eds.) SSS 2015. LNCS, vol. 9212, pp. 201\u2013216. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21741-3_14"},{"issue":"4","key":"20_CR27","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00446-010-0099-z","volume":"22","author":"F Kuhn","year":"2010","unstructured":"Kuhn, F., Schmid, S., Wattenhofer, R.: Towards worst-case churn resistant peer-to-peer systems. Distrib. Comput. 22(4), 249\u2013267 (2010)","journal-title":"Distrib. Comput."},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Mega, G., Montresor, A., Picco, G.P.: On churn and communication delays in social overlays. In: 2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P), pp. 214\u2013224. IEEE (2012)","DOI":"10.1109\/P2P.2012.6335802"},{"issue":"2012","key":"20_CR29","first-page":"28","volume":"1","author":"S Nakamoto","year":"2008","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Consulted 1(2012), 28 (2008)","journal-title":"Consulted"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Nor, R.M., Nesterenko, M., Scheideler, C.: Corona: a stabilizing deterministic message-passing skip list. In: 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Grenoble, France, pp. 356\u2013370, October 2011","DOI":"10.1007\/978-3-642-24550-3_27"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-319-03089-0_16","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"RM Nor","year":"2013","unstructured":"Nor, R.M., Nesterenko, M., Tixeuil, S.: Linearizing peer-to-peer systems with oracles. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 221\u2013236. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03089-0_16"},{"issue":"6","key":"20_CR32","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"20_CR33","unstructured":"Rickmann, C., Wagner, C., Nestmann, U., Schmid, S.: Topological self-stabilization with name-passing process calculi. In: Desharnaisand, J., Jagadeesan, R., (eds.), 27th International Conference on Concurrency Theory (CONCUR 2016), volume 59 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, pp. 19:1\u201319:15 (2016). SchlossDagstuhl\u2013Leibniz-Zentrum fuer Informatik"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A Rowstron","year":"2001","unstructured":"Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329\u2013350. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45518-3_18"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Saia, J., Trehan, A.: Picking up the pieces: self-healing in reconfigurable networks. In: 2008 IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1\u201312. IEEE (2008)","DOI":"10.1109\/IPDPS.2008.4536326"},{"key":"20_CR36","unstructured":"Shaker, A., Reeves, D.S.: Self-stabilizing structured ring topology P2P systems. In: Fifth International Conference on Peer-to-Peer Computing (P2P), pp. 39\u201346. IEEE (2005)"},{"issue":"1","key":"20_CR37","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I Stoica","year":"2003","unstructured":"Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE\/ACM Trans. Netw. 11(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: IMC, pp. 189\u2013202, October 2006","DOI":"10.1145\/1177080.1177105"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05529-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T11:42:37Z","timestamp":1573645357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05529-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030055288","9783030055295"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05529-5_20","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":"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":"Essaouira","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/history\/netys2018\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26% - 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"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}