{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T20:50:22Z","timestamp":1791147022022,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343851","type":"print"},{"value":"9783540343868","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758549_58","type":"book-chapter","created":{"date-parts":[[2006,5,9]],"date-time":"2006-05-09T20:50:25Z","timestamp":1147207825000},"page":"404-411","source":"Crossref","is-referenced-by-count":10,"title":["Survive Under High Churn in Structured P2P Systems: Evaluation and Strategy"],"prefix":"10.1007","author":[{"given":"Zhiyu","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruifeng","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenhua","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongxing","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: ACM SIGCOMM (2001)","DOI":"10.1145\/383059.383071"},{"issue":"1","key":"58_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/510726.510755","volume":"32","author":"B.Y. Zhao","year":"2002","unstructured":"Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: a fault-tolerant wide-area application infrastructure. Computer Communication Review\u00a032(1), 81 (2002)","journal-title":"Computer Communication Review"},{"key":"58_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_15","volume-title":"Peer-to-Peer Systems II","author":"I. Gupta","year":"2003","unstructured":"Gupta, I., Birman, K.P., Linga, P., Demers, A.J., van Renesse, R.: Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"58_CR4","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., Mazieres, D.: Kademlia: A peerto -peer information system based on the xor metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 53. Springer, Heidelberg (2002)"},{"key":"58_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b11823","volume-title":"Peer-to-Peer Systems II","author":"M.F. Kaashoek","year":"2003","unstructured":"Kaashoek, M.F., Karger, R.: Koorde: A simple degreeoptpimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735. Springer, Heidelberg (2003)"},{"key":"58_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-540-30480-7_77","volume-title":"Web Information Systems \u2013 WISE 2004","author":"Z. Liu","year":"2004","unstructured":"Liu, Z., Chen, G., Yuan, C., Lu, S., Xu, C.: Fault Resilience of Structured P2P Systems. In: Zhou, X., Su, S., Papazoglou, M.P., Orlowska, M.E., Jeffery, K. (eds.) WISE 2004. LNCS, vol.\u00a03306, pp. 736\u2013741. Springer, Heidelberg (2004)"},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the Evolution of Peer-to-Peer Networks. In: ACM PODC (2002)","DOI":"10.1145\/571825.571863"},{"key":"58_CR8","unstructured":"Fiat, A., Saia, J.: Censorship Resistant Peer-to-Peer Content Addressable Networks. In: ACM\/SIAM Symposium on Discrete Algorithms (2002)"},{"key":"58_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-45748-8_26","volume-title":"Peer-to-Peer Systems","author":"J. Saia","year":"2002","unstructured":"Saia, J., Fiat, A., Gribble, S., Karlin, A.R., Saroiu, S.: Dynamically Fault-Tolerant Content Addressable Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol.\u00a02429, p. 270. Springer, Heidelberg (2002)"},{"key":"58_CR10","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Diamadi, Z., Shah, G.: Fault-Tolerant Routing in Peer-to-Peer Systems. In: ACM PODC (2002)","DOI":"10.1145\/571825.571862"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Gummadi, K.P., Gummadi, R., Gribble, S.D., Ratnasamy, S., Shenker, S., Stoica, I.: The Impact of DHT Routing Geometry on Resilience and Proximity. In: ACM SIGCOMM (2003)","DOI":"10.1145\/863955.863998"},{"key":"58_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-30183-7_9","volume-title":"Peer-to-Peer Systems III","author":"J. Li","year":"2005","unstructured":"Li, J., Stribling, J., Gil, T., Morris, R., Kaashoek, F.: Comparing the performance of distributed hash tables under churn. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol.\u00a03279, pp. 87\u201399. Springer, Heidelberg (2005)"},{"key":"58_CR13","doi-asserted-by":"crossref","unstructured":"Lam, S.S., Liu, H.: Failure Recovery for Structured P2P Networks: Protocol Design and Performance Evaluation. In: ACM SIGMETRICS\/Performance 2004 (2004)","DOI":"10.1145\/1005686.1005712"},{"key":"58_CR14","doi-asserted-by":"crossref","unstructured":"Loguinov, D., Kumar, A., Rai, V., Ganesh, S.: Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience. In: ACM SIGCOMM (2003)","DOI":"10.1145\/863997.863999"},{"key":"58_CR15","unstructured":"http:\/\/pdos.lcs.mit.edu\/p2psim\/howto.html"},{"issue":"1","key":"58_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TC.1982.1675885","volume":"31","author":"H. Garcia-Molina","year":"1982","unstructured":"Garcia-Molina, H.: Elections in a Distributed Computing System. IEEE Transactions on Computers\u00a0C-31(1), 48\u201359 (1982)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758549_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T15:07:16Z","timestamp":1555600036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758549_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343851","9783540343868"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11758549_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}