{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T20:10:06Z","timestamp":1746389406751,"version":"3.40.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319117638"},{"type":"electronic","value":"9783319117645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11764-5_4","type":"book-chapter","created":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T22:53:32Z","timestamp":1411512812000},"page":"48-62","source":"Crossref","is-referenced-by-count":8,"title":["On Stabilizing Departures in Overlay Networks"],"prefix":"10.1007","author":[{"given":"Dianne","family":"Foreback","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Koutsopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","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","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/11808107_13","volume-title":"Dependable Systems: Software, Computing, Networks","author":"K. Albrecht","year":"2006","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.\u00a04028, pp. 275\u2013294. Springer, Heidelberg (2006)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/502034.502048","volume-title":"SOSP","author":"D. Andersen","year":"2001","unstructured":"Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: SOSP, pp. 131\u2013145. ACM, New York (2001)"},{"issue":"4","key":"4_CR3","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\u00a03(4), 37 (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"4_CR4","first-page":"318","volume-title":"SODA","author":"B. Awerbuch","year":"2004","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":"4_CR5","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":"4_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.\u00a045(2), 234\u2013260 (2009)","journal-title":"Theory Comput. Syst."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Benter, M., Divband, M., Kniesburges, S., Koutsopoulos, A., Graffi, K.: Ca-re-chord: A churn resistant self-stabilizing chord overlay network. In: NetSys, pp. 27\u201334 (2013)","DOI":"10.1109\/NetSys.2013.11"},{"key":"4_CR8","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.\u00a06976, pp. 62\u201376. Springer, Heidelberg (2011)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/1007912.1007938","volume-title":"SPAA","author":"A. Bhargava","year":"2004","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. ACM, New York (2004)"},{"key":"4_CR10","first-page":"27","volume-title":"ICDCS","author":"S. Bianchi","year":"2007","unstructured":"Bianchi, S., Datta, A., Felber, P., Gradinariu, M.: Stabilizing peer-to-peer spatial filters. In: ICDCS, p. 27. IEEE Computer Society, Washington, DC (2007)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","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 Processing Letters\u00a020(1), 15\u201330 (2010)","journal-title":"Parallel Processing Letters"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"4_CR13","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.\u00a0428, 18\u201335 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR14","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.\u00a04878, pp. 343\u2013357. Springer, Heidelberg (2007)"},{"key":"4_CR15","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\/DEXA.2004.1333553"},{"issue":"5","key":"4_CR16","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.\u00a078(5), 544\u2013555 (2013)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a06034, pp. 294\u2013305. Springer, Heidelberg (2010)"},{"key":"4_CR19","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":"4_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00446-012-0160-1","volume":"25","author":"T.P. 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\u00a025(4), 261\u2013278 (2012)","journal-title":"Distributed Computing"},{"key":"4_CR21","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.\u00a04280, pp. 574\u2013575. Springer, Heidelberg (2006)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Jacob, R., Richa, A., 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":"4_CR23","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.\u00a0457, 137\u2013148 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR24","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":"4_CR25","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\u00a022(4), 249\u2013267 (2010)","journal-title":"Distributed Computing"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/571825.571857","volume-title":"PODC","author":"D. Malkhi","year":"2002","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: PODC, pp. 183\u2013192. ACM, New York (2002)"},{"key":"4_CR27","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":"R.M. 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.\u00a06976, pp. 356\u2013370. Springer, Heidelberg (2011)"},{"key":"4_CR28","unstructured":"Nor, R.M., Nesterenko, M., Tixeuil, S.: Linearizing peer-to-peer systems with oracles. Technical Report TR-KSU-CS-2012-02, Dept. of Computer Science, Kent State University (July 2012)"},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/383059.383072","volume-title":"SIGCOMM","author":"S. Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: SIGCOMM, pp. 161\u2013172. ACM, New York (2001)"},{"key":"4_CR30","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.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"4_CR31","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":"4_CR32","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":"4_CR33","doi-asserted-by":"crossref","unstructured":"Shaker, A., Reeves, D.S.: Self-stabilizing structured ring topology P2P systems. In: Peer-to-Peer Computing, pp. 39\u201346 (2005)","DOI":"10.1109\/P2P.2005.34"},{"issue":"1","key":"4_CR34","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TNET.2002.808407","volume":"11","author":"I. Stoica","year":"2003","unstructured":"Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE\/ACM Trans. Netw.\u00a011(1), 17\u201332 (2003)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11764-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T19:42:01Z","timestamp":1746387721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11764-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319117638","9783319117645"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11764-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}