The effect of replica placement on routing robustness in distributed hash tables

Proceedings - 6th IEEE International Conference on Peer-to-Peer Computing, P2P 2006

Volumn , Issue , 2006, Pages 57-64

  Harvesf, Cyrus ^a   Blough, Douglas M ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

CHORD RING; COMPROMISED NODES; DISTRIBUTED HASH TABLE; HIGHER EFFICIENCY; MALICIOUS PARTICIPANT; REPLICA PLACEMENT; ROUTING LOOKUP; STRUCTURED PEER-TO-PEER SYSTEM;

PEER TO PEER NETWORKS;

EID: 67549104856     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/P2P.2006.44     Document Type: Conference Paper

References (18)

1. M.S. Artigas, P.G. Lopez, A.F. Gomez Skarmeta, “A Novel Methodology for Constructing Secure Multipath Overlays,” IEEE Internet Computing, vol. 9, no. 6, pp. 50-7, Nov. 2005.
2. M. Castro, P. Druschel, A. Ganesh, A. Rowston, D. Wallach, “Secure Routing for Structured Peer-to-Peer Overlay Networks,” In Proc. OSDI 02, Boston, Massachusetts, pp. 299-314, Dec. 2002.
3. Y. Chen, R. Katz, J. Kubiatowicz, “Dynamic Replica Placement for Scalable Content Delivery,” In Proc. IPTPS 02, Cambridge, Massachusetts, pp. 306-318, Mar. 2002.
4. F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, I. Stoica, “Wide-area cooperative storage with CFS,” In Proc. ACM SOSP 01, Banff, Canada, pp. 202-215, Oct. 2001.
5. J. Douceur, “The Sybil Attack,” In Proc. IPTPS 02, Cambridge, Massachusetts, pp. 251-260, Mar. 2002.
6. J. Douceur, R. Wattenhofer, “Large-scale Simualtion of Replica Placement Algorithms for a Serverless Distributed File System,” In Proc. MASCOTS 01, Cincinnati, Ohio, pp. 311-319, Aug. 2001.
7. D. Dumitriu, E. Knightly, A. Kuzmanovic, I. Stoica, E. Zwaenepoel, “Denial-of-Service Resilience in Peer-to-Peer File Sharing Systems,” In Proc. ACM SIGMETRICS 05, Banff, Canada, pp. 38-49, June 2005.
8. Q. Lian, W. Chen, Z. Zhang, “On the Impact of Replica Placement to the Reliability of Distributed Block Storage Systems,” In Proc. IEEE ICDCS 05, Columbus, Ohio, pp. 187-196, June 2005.
9. G. On, J. Schmitt, R. Steinmetz, “The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems,” In Proc. IEEE P2P 03, Linkoping, Sweden, pp. 57-64, Sep. 2003.
10. C.G. Plaxton, R. Rajaraman, A. Richa, “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,” In Proc. ACM SPAA, Newport, Rhode Island, pp. 311-320, June 1997.
11. M. Portmann, S. Ardon, A. Seneviratne, “Mitigating Routing Misbehaviour of Rational Nodes in CHORD,” Symposium on Applications and the Internet 04, Tokyo, Japan, pp. 541-545, Jan. 2004.
12. A. Singh, M. Castro, P. Druschel, A. Rowstron, “Defending Against Eclipse Attacks on Overlay Networks,” In Proc. ACM SIGOPS 04, Leuven, Belgium, pp. 115-120, Sep. 2004.
13. E. Sit, R. Morris, “Security Considerations for Peer-to-Peer Distributed Hash Tables,” In Proc. IPTPS 02, Cambridge, Massachusetts, pp. 261-9, Mar. 2002.
14. M. Srivatsa, L. Liu, “Vulnerabilities and Security Threats in Structured Peer-to-Peer Systems: A Quantitative Analysis,” In Proc. IEEE ACSAC 04, Tuscon, Arizona, pp.252-261, Dec. 2004.
15. A. Stavrou, A. Keromytis, D. Rubenstein, “Exploting Structure in DHT Overlays for DoS Protection,” Columbia University Computer Science Tech. Rep. CUCS-019-04, May 2004.
16. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” In Proc. ACM SIGCOMM 01, San Diego, California, pp. 149-160, Aug. 2001.
17. D. Wallach, “A Survey of Peer-to-Peer Security Issues,” International Symposium on Software Security 02, Tokyo, Japan, pp. 42-57, Nov. 2002.
18. M. Waldvogel, P. Hurley, D. Bauer, “Dynamic Replica Management in Distributed Hash Tables,” IBM Tech. Rep. RZ-3502, July 2003.