{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T22:23:14Z","timestamp":1767046994612,"version":"3.40.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,2,3]],"date-time":"2012-02-03T00:00:00Z","timestamp":1328227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s12083-012-0124-z","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T18:29:46Z","timestamp":1328639386000},"page":"1-14","source":"Crossref","is-referenced-by-count":8,"title":["Stochastic analysis of a churn-tolerant structured peer-to-peer scheme"],"prefix":"10.1007","volume":"6","author":[{"given":"Tim","family":"Jacobs","sequence":"first","affiliation":[]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,3]]},"reference":[{"key":"124_CR1","unstructured":"Abraham I, Awerbuch B, Azar Y, Bartal Y, Malkhi D, Pavlov E (2003) A generic scheme for building overlay networks in adversarial scenarios. In: IPDPS"},{"key":"124_CR2","unstructured":"Alon N, Spencer J (1992) The probabilistic method. Wiley"},{"key":"124_CR3","doi-asserted-by":"crossref","unstructured":"Augustine J, Pandurangan G, Robinson P, Upfal E (2012) Towards robust and efficient computation in dynamic peer-to-peer networks. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)","DOI":"10.1137\/1.9781611973099.47"},{"key":"124_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch B, Scheideler C (2006) Towards a scalable and robust DHT. In: Proceedings of ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","DOI":"10.1145\/1148109.1148163"},{"issue":"2","key":"124_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/606272.606299","volume":"46","author":"H Balakrishnan","year":"2003","unstructured":"Balakrishnan H, Kaashoek F, Karger D, Morris R, Stoica, I (2003) Looking up data in P2P systems. Commun ACM 46(2):43\u201348","journal-title":"Commun ACM"},{"key":"124_CR6","doi-asserted-by":"crossref","unstructured":"Datar M (2002) Butterflies and p2p networks. In: Proceedings of the 10th European Symposium on Algorithms (ESA)","DOI":"10.1007\/3-540-45749-6_30"},{"key":"124_CR7","doi-asserted-by":"crossref","unstructured":"Elkin M (2007) A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners. In: 26th ACM Symp. on Principles of Distributed Computing (PODC), pp 195\u2013204","DOI":"10.1145\/1281100.1281128"},{"key":"124_CR8","doi-asserted-by":"crossref","unstructured":"Falkner J, Piatek M, John JP, Krishnamurthy A, Anderson T (2007) Profiling a million user DHT. In: Proceedings of the 7th ACM SIGCOMM conference on internet measurement","DOI":"10.1145\/1298306.1298325"},{"key":"124_CR9","doi-asserted-by":"crossref","unstructured":"Fiat A, Saia J (2007) Censorship Resistant Peer-to-Peer Content Addressable Networks. In: Proceedings of SODA, 2002. Journal version in Theory of Computing, vol 3, pp 1\u201323","DOI":"10.4086\/toc.2007.v003a001"},{"issue":"3","key":"124_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0020-0190(97)00013-6","volume":"61","author":"I Fris","year":"1997","unstructured":"Fris I, Havel I, Liebl P (1997) The diameter of the cube-connected cycles. Inf Process Lett 61(3):157\u2013160","journal-title":"Inf Process Lett"},{"issue":"2-3","key":"124_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","volume":"16","author":"C Gavoille","year":"2003","unstructured":"Gavoille C, Peleg D (2003) Compact and localized distributed data structures. Distrib Comput 16(2-3):111\u2013120","journal-title":"Distrib Comput"},{"key":"124_CR12","doi-asserted-by":"crossref","unstructured":"Hildrum K, Kubiatowicz J (2003) Asymptotically efficient approaches to fault-tolerance in p2p networks. In: 17th International Symposium on Distributed Computing (DISC)","DOI":"10.1007\/978-3-540-39989-6_23"},{"key":"124_CR13","unstructured":"Jagannathan S, Pandurangan G, Srinvasan S (2006) Query protocols for highly resilient peer-to-peer networks. In: 19th international conference on parallel and distributed computing systems"},{"issue":"4","key":"124_CR14","first-page":"68:1","volume":"6","author":"BM Kapron","year":"2010","unstructured":"Kapron, BM, Kempe D, King V, Saia J, Sanwalani V (2010) Fast asynchronous byzantine agreement and leader election with full information. ACM TALG 6(4):68:1\u201368:28","journal-title":"ACM TALG"},{"key":"124_CR15","doi-asserted-by":"crossref","unstructured":"Kashoek M, Karger D (2003) Koorde: a simple degree optimal distributed hash table. In: IPTPS","DOI":"10.1007\/978-3-540-45172-3_9"},{"key":"124_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00446-010-0099-z","volume":"22","author":"F Kuhn","year":"2005","unstructured":"Kuhn F, Schmid S, Wattenhofer R (2005) Towards worst-case churn resistant peer-to-peer systems. Distrib Comput 22:249\u2013267 (Conference version in IPTPS 2010)","journal-title":"Distrib Comput"},{"key":"124_CR17","unstructured":"Leighton F (1992) Introduction to parallel algorithms and architectures. Morgan Kaufmann"},{"key":"124_CR18","doi-asserted-by":"crossref","unstructured":"Liben-Nowell D, Balakrishnan H, Karger D (2002) Analysis of the evolution of peer-to-peer systems. In: Proceedings of ACM principles of distributed computing","DOI":"10.1145\/571825.571863"},{"key":"124_CR19","doi-asserted-by":"crossref","unstructured":"Malkhi D, Naor M, Ratajczak D (2002) Viceroy: a scalable and dynamic emulation of the butterfly. In: ACM principles of distributed computing","DOI":"10.1145\/571825.571857"},{"key":"124_CR20","doi-asserted-by":"crossref","unstructured":"Manku G (2003) Routing networks for distributed hash tables. In: Proceedings of the ACM principles of distributed computing","DOI":"10.1145\/872035.872054"},{"key":"124_CR21","doi-asserted-by":"crossref","unstructured":"Maymounkov P, Mazieres D (2002) Kademlia. A peer-to-peer information system based on the XOR metric. In: Proc. of IPTPS","DOI":"10.1007\/3-540-45748-8_5"},{"key":"124_CR22","doi-asserted-by":"crossref","unstructured":"Mitzenmacher M, Upfal E (2005) Probability and computing. Cambridge University Press","DOI":"10.1017\/CBO9780511813603"},{"key":"124_CR23","doi-asserted-by":"crossref","unstructured":"Naor M, Weider U (2003) A simple faul-tolerant distributed hash table. In: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS)","DOI":"10.1007\/978-3-540-45172-3_8"},{"key":"124_CR24","doi-asserted-by":"crossref","unstructured":"Naor M, Wieder U (2003) Novel architectures for p2p applications: the continuous-discrete approach. In: SPAA, pp 50\u201359","DOI":"10.1145\/777412.777421"},{"issue":"6","key":"124_CR25","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1109\/JSAC.2003.814666","volume":"21","author":"G Pandurangan","year":"2003","unstructured":"Pandurangan G, Raghavan P, Upfal E (2003) Building Low-Diameter P2P Networks. IEEE J Sel Areas Commun 21(6):995\u20131002 (Preliminary version in FOCS 2001)","journal-title":"IEEE J Sel Areas Commun"},{"key":"124_CR26","doi-asserted-by":"crossref","unstructured":"Peleg D (2000) Distributed computing: a locality-sensitive approach. SIAM","DOI":"10.1137\/1.9780898719772"},{"key":"124_CR27","doi-asserted-by":"crossref","unstructured":"Ratnasamy S, Francis P, Handley M, Karp R, Shenker S (2001) A scalable content addressable network. In: Proceedings of ACM SIGCOMM 2001","DOI":"10.1145\/383059.383072"},{"key":"124_CR28","unstructured":"Ross S (1970) Applied probability models with optimization applications. Dover Press"},{"key":"124_CR29","doi-asserted-by":"crossref","unstructured":"Rowstron A, Druschel P (2001) Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems . In: Proc. of the IFIP\/ACM intenrational conference on distributed systems platforms, pp 329\u2013350","DOI":"10.1007\/3-540-45518-3_18"},{"key":"124_CR30","doi-asserted-by":"crossref","unstructured":"Saia J, Fiat A, Gribble S, Karlin A, Saroiu S (2002) Dynamically fault-tolerant content addressable networks. In: Proceedings of the 1st international workshop on peer-to-peer systems","DOI":"10.1007\/3-540-45748-8_26"},{"key":"124_CR31","doi-asserted-by":"crossref","unstructured":"Saroiu S, Gummadi P, Gribble S (2002) A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking 2002 (MMCN\u201902). San Jose, CA, USA","DOI":"10.1117\/12.449977"},{"key":"124_CR32","doi-asserted-by":"crossref","unstructured":"Scheideler C, Schmid S (2009) A distributed and oblivious heap. In: Proceedings of ICALP, LNCS 5556, pp. 571\u2013582","DOI":"10.1007\/978-3-642-02930-1_47"},{"issue":"2","key":"124_CR33","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TNET.2004.826277","volume":"12","author":"S Sen","year":"2004","unstructured":"Sen S, Wang J (2004) Analyzing peer-to-peer traffic across large networks. IEEE\/ACM Trans Netw 12(2):219\u2013232","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"3","key":"124_CR34","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.peva.2005.01.004","volume":"63","author":"H Shen","year":"2006","unstructured":"Shen H, Xu C-Z, Chen G (2006) Cycloid: a constant-degree and lookup-efficient p2p overlay network. Perform Eval 63(3):195\u2013216","journal-title":"Perform Eval"},{"key":"124_CR35","doi-asserted-by":"crossref","unstructured":"Stoica I, Morris R, Karger D, Kaashoek F, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM conference, pp 149\u2013160","DOI":"10.1145\/383059.383071"},{"key":"124_CR36","doi-asserted-by":"crossref","unstructured":"Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM conference on internet measurement","DOI":"10.1145\/1177080.1177105"},{"key":"124_CR37","doi-asserted-by":"crossref","unstructured":"Stutzbach D, Rejaie R, Duffield N, Sen S, Willinger W (2006) On unbiased sampling for unstructured peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM conference on internet measurement","DOI":"10.1145\/1177080.1177084"},{"key":"124_CR38","unstructured":"Zhao B, Kubiatowicz J, Joseph A (2001) Tapestry: an infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB\/CSD-01-1141, UC Berkeley"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-012-0124-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12083-012-0124-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-012-0124-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T01:21:30Z","timestamp":1742433690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12083-012-0124-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,3]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s12083-012-0124-z","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2012,2,3]]}}}