{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T21:43:48Z","timestamp":1790891028597,"version":"4.1.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2012,7]]},"abstract":"<jats:p>DHT-based P2P systems provide a fault-tolerant and scalable means to store data blocks in a fully distributed way. Unfortunately, recent studies have shown that if connection\/disconnection frequency is too high, data blocks may be lost. This is true for most of the current DHT-based systems' implementations. To deal with this problem, it is necessary to build more efficient replication and maintenance mechanisms. In this article, we study the effect of churn on PAST, an existing DHT-based P2P system. We then propose solutions to enhance churn tolerance and evaluate them through discrete event simulation.<\/jats:p>","DOI":"10.1145\/2240166.2240178","type":"journal-article","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T14:41:09Z","timestamp":1343313669000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["RelaxDHT"],"prefix":"10.1145","volume":"7","author":[{"given":"Sergey","family":"Legtchenko","sequence":"first","affiliation":[{"name":"LIP6\/UPMC\/CNRS\/INRIA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Monnet","sequence":"additional","affiliation":[{"name":"LIP6\/UPMC\/CNRS\/INRIA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Sens","sequence":"additional","affiliation":[{"name":"LIP6\/UPMC\/CNRS\/INRIA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilles","family":"Muller","sequence":"additional","affiliation":[{"name":"LIP6\/UPMC\/CNRS\/INRIA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,7,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060291"},{"key":"e_1_2_1_2_1","unstructured":"Broder A. Mitzenmacher M. and Mitzenmacher A. B. I. M. 2002. Network applications of bloom filters: A survey. In Internet Mathematics. 636--646.  Broder A. Mitzenmacher M. and Mitzenmacher A. B. I. M. 2002. Network applications of bloom filters: A survey. In Internet Mathematics. 636--646."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11549468_128"},{"key":"e_1_2_1_4_1","volume-title":"(DSN '04) Proceedings of the International Conference on Dependable Systems and Network. IEEE Computer Society","author":"Castro M."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080104"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502054"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI '04)","author":"Dabek F."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 3rd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P '05)","author":"Ghodsi A."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the CIDR Conference on Innovative Data Systems Research.","author":"Gupta A."},{"key":"e_1_2_1_11_1","unstructured":"Jelasity M. Montresor A. Jesi G. P. and Voulgaris S. 2008. The Peersim simulator. http:\/\/peersim.sf.net.  Jelasity M. Montresor A. Jesi G. P. and Voulgaris S. 2008. The Peersim simulator. http:\/\/peersim.sf.net."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11823285_108"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11847366_94"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1329469.1329481"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018440.1021936"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05118-0_34"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.56"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177092"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02)","author":"Maymounkov P."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the USENIX Technical Conference.","author":"Rhea S."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30183-7_11"},{"key":"e_1_2_1_23_1","volume-title":"Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Lecture Notes in Computer Science","author":"Rowstron A.","year":"2001"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502053"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2004.1297269"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 2nd Workshop on Dependable Distributed Data Management (WDDDM '04)","author":"van Renesse R.","year":"2004"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the INFOCOM Conference. IEEE, 1161--1169","author":"Varvello M."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOMW.2006.42"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818784"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818784"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"e_1_2_1_33_1","unstructured":"ZZZ-gzip. 2012. Gzip. http:\/\/www.gzip.org\/.  ZZZ-gzip. 2012. Gzip. http:\/\/www.gzip.org\/."}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2240166.2240178","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2240166.2240178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:52Z","timestamp":1750238452000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2240166.2240178"}},"subtitle":["A churn-resilient replication strategy for peer-to-peer distributed hash-tables"],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["10.1145\/2240166.2240178"],"URL":"https:\/\/doi.org\/10.1145\/2240166.2240178","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"value":"1556-4665","type":"print"},{"value":"1556-4703","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]},"assertion":[{"value":"2010-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}