The Community for Technology Leaders
RSS Icon
Issue No.03 - May/June (2011 vol.8)
pp: 419-433
Cyrus Harvesf , Georgia Institute of Technology, Atlanta
Douglas M. Blough , Georgia Institute of Technology, Atlanta
Distributed hash tables (DHTs) share storage and routing responsibility among all nodes in a peer-to-peer network. These networks have bounded path length unlike unstructured networks. Unfortunately, nodes can deny access to keys or misroute lookups. We address both of these problems through replica placement. We characterize tree-based routing DHTs and define MaxDisjoint, a replica placement that creates route diversity for these DHTs. We prove that this placement creates disjoint routes and find the replication degree necessary to produce a desired number of disjoint routes. Using simulations of Pastry (a tree-based routing DHT), we evaluate the impact of MaxDisjoint on routing robustness compared to other placements when nodes are compromised at random or in a contiguous run. Furthermore, we consider another route diversity mechanism that we call neighbor set routing and show that, when used with our replica placement, it can successfully route messages to a correct replica even with a quarter of the nodes in the system compromised at random. Finally, we demonstrate a family of replica query strategies that can trade off response time and system load. We present a hybrid query strategy that keeps response time low without producing too high a load.
Distributed systems, peer-to-peer networks, distributed hash tables, routing, replica placement, robustness.
Cyrus Harvesf, Douglas M. Blough, "Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables", IEEE Transactions on Dependable and Secure Computing, vol.8, no. 3, pp. 419-433, May/June 2011, doi:10.1109/TDSC.2009.49
[1] J. Aikat, J. Kaur, F.D. Smith, and K. Jeffay, "Variability in TCP Round-Trip Times," Proc. ACM SIGCOMM Internet Measurement Conf. (IMC '03), pp. 279-284, 2003.
[2] M.S. Artigas, P.G. Lopez, and A.F.G. Skarmeta, "A Novel Methodology for Constructing Secure Multipath Overlays," IEEE Internet Computing, vol. 9, no. 6, pp. 50-57, Nov./Dec. 2005.
[3] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach, "Secure Routing for Structured Peer-to-Peer Overlay Networks," Proc. Symp. Operating Systems Design and Implementation (OSDI '02), pp. 299-314, 2002.
[4] M. Castro and B. Liskov, "Practical Byzantine Fault Tolerance," Proc. Symp. Operating Systems Design and Implementation (OSDI '99), pp. 173-186, 1999.
[5] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-Bandwidth Multicast in Cooperative Environments," Proc. ACM Symp. Operating Systems Principles (SOSP '03), pp. 298-313, 2003.
[6] Y. Chen, R.H. Katz, and J. Kubiatowicz, "Dynamic Replica Placement for Scalable Content Delivery," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS '02), pp. 306-318, 2002.
[7] F. Dabek, M. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide Area Cooperative Storage with CFS," Proc. ACM Symp. Operating Systems Principles (SOSP '01), pp. 202-215, 2001.
[8] J.R. Douceur, "The Sybil Attack," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS '02), pp. 251-260, 2002.
[9] J.R. Douceur and R.P. Wattenhofer, "Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System," Proc. Int'l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems (MASCOTS '01), pp. 311-319, 2001.
[10] M.J. Freedman, E. Sit, J. Cates, and R. Morris, "Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer," Proc. Revised Papers from the First Int'l Workshop Peer-to-Peer Systems (IPTPS '01), pp. 121-129, 2002.
[11] "FreePastry," http:/,, May 2009.
[12] A. Ghodsi, L.O. Alima, and S. Haridi, "Symmetric Replication for Structured Peer-to-Peer Systems," Proc. Int'l Workshops Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P '05), pp. 74-85, 2005.
[13] K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, "The Impact of DHT Routing Geometry on Resilience and Proximity," Proc. ACM SIGCOMM '03, pp. 381-394, 2003.
[14] A. Gupta, B. Liskov, and R. Rodrigues, "Efficient Routing for Peer-to-Peer Overlays," Proc. Conf. Symp. Networked Systems Design and Implementation (NSDI '04), 2004.
[15] I. Gupta, K. Birman, P. Linga, A. Demers, and R.V. Renesse, "Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS '03), pp. 160-169, 2003.
[16] C. Harvesf and D.M. Blough, "The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables," Proc. IEEE Int'l Conf. Peer-to-Peer Computing (P2P '06), pp. 57-66, 2006.
[17] C. Harvesf and D.M. Blough, "The Design and Evaluation of Techniques for Route Diversity in Distributed Hash Tables," Proc. IEEE Int'l Conf. Peer-to-Peer Computing (P2P '07), pp. 237-238, 2007.
[18] "DNS Security Extensions," IETF, http:/, 2009.
[19] Q. Lian, W. Chen, and Z. Zhang, "On the Impact of Replica Placement to the Reliability of Distributed Block Storage Systems," Proc. Int'l Conf. Distributed Computing Systems (ICDCS '05), pp. 187-196, 2005.
[20] P. Maymounkov and D. Mazières, "Kademlia: A Peer-to-Peer Information System Based on the XOR Metric," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS '02), pp. 53-65, 2002.
[21] J.W. Mickens and B.D. Noble, "Concilium: Collaborative Diagnosis of Broken Overlay Routes," Proc. Int'l Conf. Dependable Systems and Networks (DSN '07), pp. 225-234, 2007.
[22] G. On, J. Schmitt, and R. Steinmetz, "The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems," Proc. IEEE Int'l Conf. Peer-to-Peer Computing (P2P '03), pp. 57-64, 2003.
[23] C.G. Plaxton, R. Rajaraman, and A. Richa, "Accessing Nearby Copies of Replicated Objects in a Distributed Environment," Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA '97), pp. 311-320, 1997.
[24] M. Portmann, S. Ardon, and A. Seneviratne, "Mitigating Routing Misbehaviour of Rational Nodes in Chord," Proc. Symp. Applications and the Internet (SAINT '04), pp. 541-545, 2004.
[25] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, "A Scalable Content-Addressable Network," Proc. ACM SIGCOMM '01, pp. 161-172, 2001.
[26] A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. ACM Middleware '01, pp. 329-350, 2001.
[27] A. Rowstron and P. Druschel, "Storage Management and Caching in PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility," Proc. ACM Symp. Operating Systems Principles (SOSP '01), 2001.
[28] N. Saxena, G. Tsudik, and J.H. Yi, "Admission Control in Peer-to-Peer: Design and Performance Evaluation," Proc. ACM Workshop Security of Ad Hoc and Sensor Networks (SASN '03), pp. 104-113, 2003.
[29] A. Serjantov, "Anonymizing Censorship Resistant Systems," Proc. Revised Papers from the First Int'l Workshop Peer-to-Peer Systems (IPTPS '01), pp. 111-120, 2002.
[30] A. Singh, M. Castro, P. Druschel, and A. Rowstron, "Defending against Eclipse Attacks on Overlay Networks," Proc. ACM SIGOPS '04, pp. 115-120, 2004.
[31] E. Sit and R. Morris, "Security Considerations for Peer-to-Peer Distributed Hash Tables," Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS '02), pp. 261-269, 2002.
[32] M. Srivatsa and L. Liu, "Vulnerabilities and Security Threats in Structured Peer-to-Peer Systems: A Quantitative Analysis," Proc. IEEE Ann. Computer Security Applications Conf. (ACSAC '04), pp. 252-261, 2004.
[33] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM '01, pp. 149-160, 2001.
[34] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, "Tapestry: A Resilient Global-Scale Overlay for Service Deployment," IEEE J. on Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, Jan. 2004.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool