论文信息 - The Exclusion of Malicious Routing Peers in Structured P2P Systems

The Exclusion of Malicious Routing Peers in Structured P2P Systems

We propose a scheme which excludes malicious routing peers from the normal routing process of structured P2P systems such as Chord. This scheme prevents continuous routing overheads from malicious peers. Simulation results show that the proposed scheme reduces the average routing length compared with the routing algorithm only using the alternate lookup path.

Jong Kim | Sung Je Hong | O-Hoon Kwon | Bong-Soo Roh

[1] Mudhakar Srivatsa,et al. Vulnerabilities and security threats in structured overlay networks: a quantitative analysis , 2004, 20th Annual Computer Security Applications Conference.

[2] David Mazières,et al. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[3] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[4] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.

[5] Robert Tappan Morris,et al. Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.

[6] Miguel Castro,et al. Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[7] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[8] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.