{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:20:17Z","timestamp":1743027617899,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319395760"},{"type":"electronic","value":"9783319395777"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39577-7_2","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T09:47:48Z","timestamp":1464083268000},"page":"16-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evaluating the Cost and Robustness of Self-organizing Distributed Hash Tables"],"prefix":"10.1007","author":[{"given":"Sveta","family":"Krasikova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raziel C.","family":"G\u00f3mez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heverson B.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Etienne","family":"Rivi\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerio","family":"Schiavoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: SplitStream: high-bandwidth multicast in cooperative environments. In: SOSP (2003)","DOI":"10.1145\/945445.945474"},{"key":"2_CR2","first-page":"100","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A.: Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE JSAC 20, 100\u2013110 (2002)","journal-title":"IEEE JSAC"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: SOSP (2001)","DOI":"10.1145\/502034.502054"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon\u2019s highly available key-value store. In: SOSP (2007)","DOI":"10.1145\/1294261.1294281"},{"key":"2_CR5","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)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Falkner, J., Piatek, M., John, J.P., Krishnamurthy, A., Anderson, T.: Profiling a million user dht. In: ACM IMC (2007)","DOI":"10.1145\/1298306.1298325"},{"issue":"1","key":"2_CR7","first-page":"74","volume":"5","author":"P Felber","year":"2012","unstructured":"Felber, P., Kermarrec, A.-M., Leonini, L., Rivi\u00e8re, E., Voulgaris, S.: Pulp: an adaptive gossip-based dissemination protocol for multi-source message streams. Springer PPNA 5(1), 74\u201391 (2012)","journal-title":"Springer PPNA"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gauron, P.: D2B: A De Bruijn based content-addressable network. Theorical Computer Science (2006)","DOI":"10.1016\/j.tcs.2005.12.006"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-30229-2_14","volume-title":"Middleware 2004","author":"A Gupta","year":"2004","unstructured":"Gupta, A., Sahin, O.D., Agrawal, D.P., El Abbadi, A.: Meghdoot: content-based publish\/subscribe over P2P networks. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, pp. 254\u2013273. Springer, Heidelberg (2004)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, I., Birman, K., Linga, P., Demers, A., Van Renesse, R.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: IEEE P2P (2003)","DOI":"10.1007\/978-3-540-45172-3_15"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: The bootstrapping service.In: ICDCSW 2006","DOI":"10.1109\/ICDCSW.2006.105"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: T-Man: Gossip-based fast overlay topology construction. Computer Networks (2009)","DOI":"10.1016\/j.comnet.2009.03.013"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M Jelasity","year":"2005","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM TOCS 23(3), 219\u2013252 (2005)","journal-title":"ACM TOCS"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1275517.1275520","volume":"25","author":"M Jelasity","year":"2007","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., Van Steen, M.: Gossip-based peer sampling. ACM TOCS 25, 8 (2007)","journal-title":"ACM TOCS"},{"issue":"10","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1016\/j.jss.2007.01.014","volume":"80","author":"D Kostoulas","year":"2007","unstructured":"Kostoulas, D., Psaltoulis, D., Gupta, I., Birman, K.P., Demers, A.J.: Active and passive techniques for group size estimation in large-scale and dynamic distributed systems. J. Syst. Softw. 80(10), 1639\u20131658 (2007)","journal-title":"J. Syst. Softw."},{"key":"2_CR16","unstructured":"Leonini, L., Rivi\u00e8re, E., Felber, P.: Distributed systems evaluation made simple (or how to turn ideas into live systems in a breeze). In: NSDI (2009)"},{"key":"2_CR17","unstructured":"Li, J., Stribling, J., Morris, R., Kaashoek, F., Gil, T.M.: A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In: INFOCOM (2005)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy : A scalable and dynamic emulation of the butterfly. In: ACM PODC (2002)","DOI":"10.1145\/571825.571857"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Matos, M., Schiavoni, V., Rivi\u00e8re, E., Felber, P., Oliveira, R.: LayStream: composing standard gossip protocols for live video streaming. In: IEEE P2P (2014)","DOI":"10.1109\/P2P.2014.6934297"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45748-8_5","volume-title":"Peer-to-Peer Systems","author":"P Maymounkov","year":"2002","unstructured":"Maymounkov, P., Mazi\u00e8res, D.: Kademlia: a peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Pouwelse, J.A., Garbacki, P., Wang, J., Bakker, A., Yang, J., Iosup, A., Epema, D.H., Reinders, M., Van Steen, M.R., Sips, H.J. et al.: Tribler: A social-based peer-to-peer system. Conc. and Comp.: Pract. and Exp. (2008)","DOI":"10.1002\/cpe.1189"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Rhea, S., Chun, B.-G., Kubiatowicz, J., Shenker, S.: Fixing the embarrassing slowness of OpenDHT on planetlab. In: WORLDS (2005)","DOI":"10.1145\/1080091.1080102"},{"key":"2_CR23","unstructured":"Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. In: USENIX ATC (2004)"},{"key":"2_CR24","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, p. 329. Springer, Heidelberg (2001)"},{"key":"2_CR25","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 ToN 11, 17\u201332 (2003)","journal-title":"IEEE\/ACM ToN"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-45065-5_2","volume-title":"Middleware 2013","author":"S Voulgaris","year":"2013","unstructured":"Voulgaris, S., van Steen, M.: VICINITY: a pinch of randomness brings out the structure. In: Eyers, D., Schwan, K. (eds.) Middleware 2013. LNCS, vol. 8275, pp. 21\u201340. Springer, Heidelberg (2013)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Wang, C.-C., Harfoush, K.: On the stability-scalability tradeoff of DHT deployment. In: IEEE INFOCOM (2007)","DOI":"10.1109\/INFCOM.2007.255"},{"key":"2_CR28","unstructured":"Wu, D., Tian, Y., Ng, K.-W.: Analytical study on improving DHT lookup performance under churn. In: IEEE P2P (2006)"},{"key":"2_CR29","first-page":"41","volume":"22","author":"BY Zhao","year":"2004","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE JSAC 22, 41\u201353 (2004)","journal-title":"IEEE JSAC"}],"container-title":["Lecture Notes in Computer Science","Distributed Applications and Interoperable Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39577-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T02:02:14Z","timestamp":1699840934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-39577-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319395760","9783319395777"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39577-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}