RelaxDHT: A churn-resilient replication strategy for peer-to-peer distributed hash-tables

ACM Transactions on Autonomous and Adaptive Systems

Volumn 7, Issue 2, 2012, Pages

  Legtchenko, Sergey ^a   Monnet, Sébastien ^a   Sens, Pierre ^a   Muller, Gilles ^a  

^a CNRS   (France)

Author keywords

Churn; Distributed hash tables (DHT); Fault tolerance; Peer to peer (P2P); Replication

Indexed keywords

CHURN; DATA BLOCKS; DISTRIBUTED HASH TABLES; FAULT-TOLERANT; P2P SYSTEM; PEER TO PEER; REPLICATION; REPLICATION STRATEGIES;

DISCRETE EVENT SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE;

PEER TO PEER NETWORKS;

EID: 84864833819     PISSN: 15564665     EISSN: 15564703     Source Type: Journal    
DOI: 10.1145/2240166.2240178     Document Type: Article

References (33)

1. Adya, A., Bolosky, W., Castro, M., Chaiken, R., Cermak, G., Douceur, J., Howell, J., Lorch, J., Theimer, M., and Wattenhofer, R. 2002. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI'02).
2. Broder, A., Mitzenmacher, M., and Mitzenmacher, A. B. I. M. 2002. Network applications of bloom filters: A survey. In Internet Mathematics. 636-646.
3. Busca, J.-M., Picconi, F., and Sens, P. 2005. Pastis: A highly-scalable multi-user peer-to-peer file system. In Proceedings of European Conference on Parallel Computing (Euro-Par '05). 1173-1182. (Pubitemid 41490921)
4. Castro, M., Costa, M., and Rowstron, A. 2004. Performance and dependability of structured peer-to-peer overlays. In (DSN '04) Proceedings of the International Conference on Dependable Systems and Network. IEEE Computer Society, Washington, DC, 9.
5. Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S., and Hellerstein, J. M. 2005. A case study in building layered dht applications. In Proceedings of the SIGCOMM Conference, R. Guerin, R. Govindan, and G. Minshall, Eds. ACM, 97-108. (Pubitemid 46323497)
6. Dabek, F., Kaashoek, F. M., Karger, D., Morris, R., and Stoica, I. 2001. Wide-area cooperative storage with CFS. In Proceedings of the 8th ACM Symposium on Operating Systems Principles (SOSP '01). Vol. 35. ACM Press, New York, 202-215. (Pubitemid 33612615)
7. Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, F. F., and Morris, R. 2004. Designing a DHT for low latency and high throughput. In Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI '04).
8. Ghemawat, S., Gobioff, H., and Leung, S.-T. 2003. The google file system. In (SOSP '03) Proceedings of the 9th ACM Symposium on Operating Systems Principles. ACM Press, New York, 29-43. (Pubitemid 40929686)
9. Ghodsi, A., Alima, L. O., and Haridi, S. 2005. Symmetric replication for structured peer-to-peer systems. In Proceedings of the 3rd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DB1SP2P '05), 12.
10. Gupta, A., Agrawal, D., and Abbadi, A. E. 2003. Approximate range selection queries in peer-to-peer systems. In Proceedings of the C1DR Conference on Innovative Data Systems Research.
11. Jelasity, M., Montresor, A., Jesi, G. P., and Voulgaris, S. 2008. The Peersim simulator, http://peersim.sf.net.
12. Jernberg, J., Vlassov, V., Ghodsi, A., and Haridi, S. 2006. Doh: A content delivery peer-to-peer network. In Proceedings of European Conference on Parallel Computing (Euro-Par '06) 13.
13. Kim, K. and Park, D. 2006. Reducing data replication overhead in DHT based peer-to-peer system. In Proceedings of the 2nd International Conference on High Performance Computing and Communications (HPCC '06). 915-924. (Pubitemid 44617680)
14. Ktari, S., Zoubert, M., Hecker, A., and Labiod, H. 2007. Performance evaluation of replication strategies in DHTs under churn. In Proceedings of the 6th International Conference on Mobile and Ubiquitous Multimedia (MUM '07). ACM Press, New York, 90-97.
15. Landers, M., Zhang, H., and Tan, K.-L. 2004. Peerstore: Better performance by relaxing in peer-to-peer backup. In Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P '04). IEEE Computer Society, Washington, DC, 72-79. (Pubitemid 40184538)
16. Legtchenko, S., Monnet, S., Sens, P., and Muller, G. 2009. Churn-Resilient replication strategy for peer-to-peer distributed hash-tables. In Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'09). Lecture Notes in Computer Science, vol. 5873. Springer 485-499.
17. Lian, Q., Chen, W., and Zhang, Z. 2005. On the impact of replica placement to the reliability of distributed brick storage systems. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (1CDCS '05). IEEE Computer Society, Washington, DC, 187-196. (Pubitemid 41675598)
18. Madhyastha, H. V., Anderson, T. E., Krishnamurthy, A., Spring, N., and Venkataramani, A. 2006. A structural approach to latency prediction. In Internet Measurement Conference, J. M. Almeida, V. A. F. Almeida, and P. Barford, Eds. ACM, 99-104. (Pubitemid 47165592)
19. Maymounkov, P and Mazieres, D. 2002. Kademlia: A peer-to-peer information system based on the xor metric. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (1PTPS '02). 53-65.
20. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Schenker, S. 2001. A scalable content-addressable network. In Proceedings of the SigCoMM Conference. Vol. 31. ACM Press, 161-172. (Pubitemid 32981962)
21. Rhea, S., Geels, D., Roscoe, T., and Kubiatowicz, J. 2004. Handling churn in a DHT. In Proceedings of the USENIX Technical Conference.
22. Rodrigues, R. and Blake, C. 2004. When multi-hop peer-to-peer lookup matters. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (1PTPS '04). 112-122. (Pubitemid 41190543)
23. Rowstron, A. and Druschel, P. 2001a. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Lecture Notes in Computer Science, vol. 2218. Springer, 329-350. (Pubitemid 33362020)
24. Rowstron, A. I. T. and Druschel, P. 2001b. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 8th ACM Symposium on Operating Systems Principles (SOSP '01). 188-201. (Pubitemid 33612614)
25. Schmidt, C. and Parashar, M. 2004. Enabling flexible queries with guarantees in p2p systems. IEEE 1nternet Comput. 8, 3, 19-26.
26. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, F. F., Dabek, F., and Balakrishnan, H. 2003. Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11, 1, 17-32.
27. van Renesse, R. 2004. Efficient reliable internet storage. In Proceedings of the 2nd Workshop on Dependable Distributed Data Management (WDDDM '04).
28. Varvello, M., Diout, C., and Biersack, E. W. 2009. P2p second life: Experimental validation using kad. In Proceedings of the 1NFOCOM Conference. IEEE, 1161-1169.
29. Zahn, T. and Schiller, J. H. 2006. Dht-based unicast for mobile ad hoc networks. In Proceedings of the PerCom Workshops. IEEE Computer Society, 179-183. (Pubitemid 44612572)
30. Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., and Kubiatowicz, J. D. 2003. Tapestry: A global-scale overlay for rapid service deployment. IEEE J. Select. Areas Comm. 22, 41-53.
31. Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., and Kubiatowicz, J. D. 2004. Tapestry: A resilient global-scale overlay for service deployment. IEEE J. Select. Areas Comm. 22, 41-53.
32. Ziv, J. and Lempel, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Info. Theory 23, 337-343.
33. ZZZ-gzip. 2012. Gzip. http://www.gzip.org/.