An efficient and secure peer-to-peer overlay network

Honghao Wang, Yingwu Zhu, Yiming Hu
2005 The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l  
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 ¡ £ ¥ § © 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
more » ... rmance 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. is the number of peers in the system. While elegant from a theoretical perspective, DHT-based systems face difficulties in an open Internet deployment. Due to various behaviors and resources of peers in the real world, the basic operation, the key lookup, of current P2P overlay is far from efficient and hard to be improved. Although DHT designs guarantee to solve a query within ¡ £ ¥ § ©
doi:10.1109/lcn.2005.27 dblp:conf/lcn/WangZH05 fatcat:25qpr4z7jfd6netdunaafjn2v4