{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:04:46Z","timestamp":1743145486152,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319217406"},{"type":"electronic","value":"9783319217413"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21741-3_14","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T12:21:28Z","timestamp":1438604488000},"page":"201-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Towards a Universal Approach for the Finite Departure Problem in Overlay Networks"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Koutsopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thim","family":"Strothmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, K., Kuhn, F., Wattenhofer, R.: Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn. In: Kohlas, J., Meyer, B., Schiper, A. (eds.) Dependable Systems: Software, Computing, Networks. LNCS, vol. 4028, pp. 275\u2013294. Springer, Heidelberg (2006)","DOI":"10.1007\/11808107_13"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: SOSP, pp. 131\u2013145 (2001)","DOI":"10.1145\/502059.502048"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11776178_3","volume-title":"Distributed Computing in Sensor Systems","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing Consensus in Mobile Networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 37\u201350. Springer, Heidelberg (2006)"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1290672.1290674","volume":"3","author":"J Aspnes","year":"2007","unstructured":"Aspnes, J., Shah, G.: Skip graphs. ACM Transactions on Algorithms 3(4), 37 (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"14_CR5","unstructured":"Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: SODA, pp. 318\u2013327 (2004)"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","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":"14_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2013.02.021","volume":"512","author":"A Berns","year":"2013","unstructured":"Berns, A., Ghosh, S., Pemmaraju, S.V.: Building self-stabilizing overlay networks with the transitive closure framework. Theor. Comput. Sci. 512, 2\u201314 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., Thober, M.: Pagoda: a dynamic overlay network for routing, data management, and multicasting. In: SPAA, pp. 170\u2013179 (2004)","DOI":"10.1145\/1007912.1007938"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","DOI":"10.1145\/226643.226647"},{"key":"14_CR10","doi-asserted-by":"publisher","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":"14_CR11","doi-asserted-by":"crossref","unstructured":"Doerr, B., Goldberg, LA., Minder, L., Sauerwald, T., Scheideler, C.: Stabilizing consensus with the power of two choices. In: SPAA, pp. 149\u2013158 (2011)","DOI":"10.1145\/1989493.1989516"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-77096-1_25","volume-title":"Principles of Distributed Systems","author":"D Dolev","year":"2007","unstructured":"Dolev, D., Hoch, E.N., van Renesse, R.: Self-stabilizing and Byzantine-Tolerant Overlay Network. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 343\u2013357. Springer, Heidelberg (2007)"},{"issue":"5","key":"14_CR13","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.scico.2012.10.001","volume":"78","author":"S Dolev","year":"2013","unstructured":"Dolev, S., Tzachar, N.: Spanders: Distributed spanning expanders. Sci. Comput. Program. 78(5), 544\u2013555 (2013)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2014)"},{"key":"14_CR16","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)"},{"key":"14_CR17","unstructured":"Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: A scalable overlay network with practical locality properties. In: USENIX Symposium on Internet Technologies and Systems ((2003)"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","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. Distributed Computing 25(4), 261\u2013278 (2012)","journal-title":"Distributed Computing"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-540-49823-0_44","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T Herault","year":"2006","unstructured":"Herault, T., Lemarinier, P., Peres, O., Pilard, L., Beauquier, J.: Brief Announcement: Self-stabilizing Spanning Tree Algorithm for Large Scale Systems. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 574\u2013575. Springer, Heidelberg (2006)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A.W., Scheideler, C., Schmid, S., T\u00e4ubig, H.: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: PODC, pp. 131\u2013140 (2009)","DOI":"10.1145\/1582716.1582741"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2012.07.029","volume":"457","author":"R Jacob","year":"2012","unstructured":"Jacob, R., Ritscher, S., Scheideler, C., Schmid, S.: Towards higher-dimensional topological self-stabilization: A distributed algorithm for delaunay graphs. Theor. Comput. Sci. 457, 137\u2013148 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Kniesburges, S., Koutsopoulos, A., Scheideler, C.: Re-chord: a self-stabilizing chord overlay network. In: SPAA, pp. 235\u2013244 (2011)","DOI":"10.1145\/1989493.1989527"},{"issue":"4","key":"14_CR23","doi-asserted-by":"publisher","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. Distributed Computing 22(4), 249\u2013267 (2010)","journal-title":"Distributed Computing"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: PODC, pp. 183\u2013192 (2002)","DOI":"10.1145\/571825.571857"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-24550-3_27","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"RM Nor","year":"2011","unstructured":"Nor, R.M., Nesterenko, M., Scheideler, C.: Corona: A Stabilizing Deterministic Message-Passing Skip List. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 356\u2013370. Springer, Heidelberg (2011)"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Saia, J., Trehan, A.: Picking up the pieces: Self-healing in reconfigurable networks. In: IPDPS, pp. 1\u201312 (2008)","DOI":"10.1109\/IPDPS.2008.4536326"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Scheideler, C.: How to spread adversarial nodes?: rotate! In: STOC, pp. 704\u2013713 (2005)","DOI":"10.1145\/1060590.1060694"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Frans Kaashoek, M., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for Internet applications. IEEE\/ACM Trans. Netw. 11(1), 17\u201332 (2003)","DOI":"10.1109\/TNET.2002.808407"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21741-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:19:29Z","timestamp":1675138769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21741-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319217406","9783319217413"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21741-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}