An efficient and secure peer-to-peer overlay network

Most of structured P2P overlays exploit distributed Hash table (DHT) to achieve an administration-free, fault tolerant overlay network and guarantee to deliver a message to the destination within O(log N) hops. While elegant from a theoretical perspective, those systems face difficulties under an open environment. Not only frequently joining and leaving of nodes generate enormous maintenance overhead, but also various behaviors and resources of peers compromise overlay performance and security. Instead of building P2P overlay from the theoretical view, this paper builds the overlay network from the perspective of the physical network. By combining different network topology-aware techniques, a distinctive overlay network that closely matches the Internet topology is constructed. The P2P system based on this structure is not only highly efficient for routing, but also keeps maintenance overhead very low even under highly dynamic environment. Moreover, the system provides a new aspect to solve many security issues

[1]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

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

[3]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[4]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

[5]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

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

[7]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[9]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

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

[11]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2002, IMW '02.

[12]  Mao Yang,et al.  An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System , 2005, IPTPS.

[13]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[14]  Yiming Hu,et al.  To unify structured and unstructured P2P systems , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[15]  David Meyer,et al.  Administratively Scoped IP Multicast , 1998, RFC.

[16]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[17]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..