RChord: An enhanced Chord system resilient to routing attacks

Proceedings - 2003 International Conference on Computer Networks and Mobile Computing, ICCNMC 2003

Volumn , Issue , 2003, Pages 253-260

  Xuan, Dong ^a   Chellappan, S ^a   Krishnamoorthy, M ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Algorithm design and analysis; Bidirectional control; Degradation; Electronic mail; Information science; Internet; Peer to peer computing; Performance analysis; Resilience; Routing

Indexed keywords

ALGORITHMS; DEGRADATION; ELECTRONIC MAIL; INFORMATION SCIENCE; INTERNET; MOBILE COMPUTING;

ALGORITHM DESIGN AND ANALYSIS; PEER-TO-PEER COMPUTING; PERFORMANCE ANALYSIS; RESILIENCE; ROUTING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79955852211     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCNMC.2003.1243053     Document Type: Conference Paper

References (19)

1. A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pages 329-350, November, 2001.
2. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content addressable network. In Proc. ACM SIGCOMM, 2001.
3. I. Stoica, R. Morris, D. Karger, M. F.Kaashoek, and H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM 2001, August 2001.
4. Y. Zhao, J. Kubiatowicz, and A. Joseph, Tapestry: An infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB/CSD-01-1141, University of California, Berkeley, 2000. 16.
5. C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of ACM SPAA. ACM, June 1997.
6. Sylvia Ratnasamy, Scott Shenker and Ion Stoica, Routing Algorithms for DHTs: Some Open Questions. In proc. of IPTPS, March,2002.
7. Andrew.S.Tenenbaum,Maarten Van Steen Distributed Systems: Principles and Paradigms, Prentice Hall, 1st Ed.
8. A. Ravindran, Don T. Phillips, James J. Solberg, Operations Research: Principles and Practice, 2nd Edition, John Wiley & Sons.
9. Randolph Nelson, Probability, Stochastic Processes, and Queueing Theory: the Mathematics of Computer Performance Modelling, Springer-Verlag.
10. Dong Xuan, Muralidhar Krishnamoorthy and Shengquan Wang, Enhanced Chord: Technical Report, Technical Report, Department of Computer and Information Science, The Ohio-State University,Columbus, http://www.cis.ohio-state.edu/xuan.
11. R. Motwani and P. Raghavan, Randomized Algorithms Cambridge University Press, Cambridge, 1995.
12. E. Sit and R.Morris Security Considerations for Peer-to-Peer Distributed Hash Tables In Proc. of IPTPS 2002.
13. B.Cooper,M.Bawa, N.Daswani,H.Garcia-Molina. Protecting the PIPE from malicious peers Technical Report, Stanford.2002.
14. V.Reich and D.Rosenthal Lockss(Lots of copies Keep stuff safe) Preservation 2000, Nov.2000.
15. Y.Chen et al. A prototype implementation of archival intermemory In Proc. of the ACM Conf. on Digital Libraries, 1999.
16. S.Payette and C.Lagoze. Policy-carrying,policy-enforcing digital objects In Proc. European Conf. on Digital Libraries (ECDL), 2000.
17. F.Dabek et al. Wide-area cooperative storage with CFS In Proc. of ACM Symposium on Operating Systems Principles. 2001
18. S.Hazel and B.Wiley. Achord: A variant of the Chord Lookup Service for Use in Censorship Resistant Peer-to-Peer Publishing Systems In Proc. of IPTPS 2002.
19. I.Clarke et al. Freenet: A Distributed Anonymous Information Storage and Retrieval System In Designing Privacy Enhancing Technologies:International workshop on Design Issues in Anonymity and Unobservability, 2001.