{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:39:50Z","timestamp":1725997190195},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030032319"},{"type":"electronic","value":"9783030032326"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_4","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"50-64","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Underlay-Aware Self-Stabilizing Overlay Networks"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"G\u00f6tte","sequence":"first","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Setzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"4_CR1","unstructured":"Abraham, I., Malkhi, D., Dobzinski, O.: LAND: stretch (1 + epsilon) locality-aware networks for DHTs. In: $$15^{th}$$ Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 550\u2013559 (2004)"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1002\/net.21631","volume":"67","author":"M Abu-Ata","year":"2016","unstructured":"Abu-Ata, M., Dragan, F.F.: Metric tree-like structures in real-world networks: an empirical study. Networks 67(1), 49\u201368 (2016)","journal-title":"Networks"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Adcock, A.B., Sullivan, B.D., Mahoney, M.W.: Tree-like structure in large social and information networks. In: $$13^{th}$$ International Conference on Data Mining, pp. 1\u201310 (2013)","DOI":"10.1109\/ICDM.2013.77"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Al-Fares, M., Loukissas, A., Vahdat, A.: A scalable, commodity data center network architecture. In: ACM 2008 Conference on Data Communication, pp. 63\u201374 (2008)","DOI":"10.1145\/1402958.1402967"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/BFb0002773","volume-title":"Euro-Par\u201997 Parallel Processing","author":"G Antonoiul","year":"1997","unstructured":"Antonoiul, G., Srimani, P.K.: Distributed self-stabilizing algorithm for minimum spanning tree construction. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds.) Euro-Par 1997. LNCS, vol. 1300, pp. 480\u2013487. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0002773"},{"key":"4_CR6","volume-title":"Data Center Fundamentals","author":"M Arregoces","year":"2003","unstructured":"Arregoces, M., Portolani, M.: Data Center Fundamentals. Cisco Press, Indianapolis (2003)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-642-15763-9_46","volume-title":"Distributed Computing","author":"L Blin","year":"2010","unstructured":"Blin, L., Dolev, S., Potop-Butucaru, M.G., Rovedakis, S.: Fast self-stabilizing minimum spanning tree construction. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 480\u2013494. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15763-9_46"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-04355-0_43","volume-title":"Distributed Computing","author":"L Blin","year":"2009","unstructured":"Blin, L., Potop-Butucaru, M., Rovedakis, S., Tixeuil, S.: A new self-stabilizing minimum spanning tree construction with loop-free property. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 407\u2013422. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04355-0_43"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-16023-3_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Blin","year":"2010","unstructured":"Blin, L., Potop-Butucaru, M.G., Rovedakis, S., Tixeuil, S.: Loop-free super-stabilizing spanning tree construction. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 50\u201364. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16023-3_7"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"de Montgolfier, F., Soto, M., Viennot, L.: Treewidth and hyperbolicity of the internet. In: 10th IEEE International Symposium on Networking Computing and Applications, pp. 25\u201332 (2011)","DOI":"10.1109\/NCA.2011.11"},{"key":"4_CR11","doi-asserted-by":"crossref","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)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-69084-1_17","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Feldmann","year":"2017","unstructured":"Feldmann, M., Scheideler, C.: A self-stabilizing general De Bruijn graph. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 250\u2013264. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_17"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-49259-9_20","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"R Gmyr","year":"2016","unstructured":"Gmyr, R., Lef\u00e8vre, J., Scheideler, C.: Self-stabilizing metric graphs. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 248\u2013262. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_20"},{"key":"4_CR14","unstructured":"G\u00f6tte, T., Scheideler, C., Setzer, A.: On underlay-aware self-stabilizing overlay networks. ArXiv e-prints (2018). http:\/\/arxiv.org\/abs\/1809.02436"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Gross, C., Stingl, D., Richerzhagen, B., Hemel, A., Steinmetz, R., Hausheer, D.: Geodemlia: a robust peer-to-peer overlay supporting location-based search. In: 12th IEEE International Conference on Peer-to-Peer Computing, Tarragona, Spain, pp. 25\u201336 (2012)","DOI":"10.1109\/P2P.2012.6335806"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-45414-4_14","volume-title":"Distributed Computing","author":"L Higham","year":"2001","unstructured":"Higham, L., Liang, Z.: Self-stabilizing minimum spanning tree construction on message-passing networks. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 194\u2013208. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45414-4_14"},{"key":"4_CR17","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: 28th Annual ACM Symposium on Principles of Distributed Computing, pp. 131\u2013140 (2009)","DOI":"10.1145\/1582716.1582741"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-642-10631-6_78","volume-title":"Algorithms and Computation","author":"R Jacob","year":"2009","unstructured":"Jacob, R., Ritscher, S., Scheideler, C., Schmid, S.: A self-stabilizing and local delaunay graph construction. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 771\u2013780. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_78"},{"issue":"9","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"JW Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE 80(9), 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Korman, A., Kutten, S., Masuzawa, T.: Fast and compact self stabilizing verification, computation, and fault detection of an MST. In: 30th Annual ACM Symposium on Principles of Distributed Computing, pp. 311\u2013320 (2011)","DOI":"10.1145\/1993806.1993866"},{"issue":"10","key":"4_CR21","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"C\u201334","author":"CE Leiserson","year":"1985","unstructured":"Leiserson, C.E.: Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans. Comput. C\u201334(10), 892\u2013901 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR22","first-page":"356","volume-title":"Lecture Notes in Computer Science","author":"Rizal Mohd Nor","year":"2011","unstructured":"Nor, R.M., Nesterenko, M., Scheideler, C.: Corona: a stabilizing deterministic message-passing skip list. In: 13th International Symposium Stabilization, Safety, and Security of Distributed Systems, pp. 356\u2013370 (2011)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/1.9781611972870.10","volume-title":"2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Melih Onus","year":"2007","unstructured":"Onus, M., Richa, A.W., Scheideler, C.: Linearization: locally self-stabilizing sorting in graphs. In: 9th Workshop on Algorithm Engineering and Experiments, pp. 99\u2013108 (2007)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Perlman, R.J.: An algorithm for distributed computation of a spanningtree in an extended LAN. In: 9th Symposium on Data Communications, pp. 44\u201353 (1985)","DOI":"10.1145\/319056.319004"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"4_CR26","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). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_31"},{"key":"4_CR27","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"},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TNET.2007.899021","volume":"16","author":"Y Shavitt","year":"2008","unstructured":"Shavitt, Y., Tankel, T.: Hyperbolic embedding of internet graph for distance estimation and overlay construction. IEEE\/ACM Trans. Netw. 16(1), 25\u201336 (2008)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"4_CR29","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1145\/2402.322386","volume":"30","author":"KJ Supowit","year":"1983","unstructured":"Supowit, K.J.: The relative neighborhood graph, with an application to minimum spanning trees. J. ACM 30(3), 428\u2013448 (1983)","journal-title":"J. ACM"},{"issue":"4","key":"4_CR30","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognit. 12(4), 261\u2013268 (1980)","journal-title":"Pattern Recognit."}],"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-030-03232-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,27]],"date-time":"2019-10-27T03:41:36Z","timestamp":1572147696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}