By Topic

An efficient and secure peer-to-peer overlay network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Honghao Wang ; Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH ; Yingwu Zhu ; Yiming Hu

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

Published in:

Local Computer Networks, 2005. 30th Anniversary. The IEEE Conference on

Date of Conference:

17-17 Nov. 2005