Constructing the Robust and Efficient Small World Overlay Network for P2P Systems

2005 ◽  
pp. 966-971
Author(s):  
Guofu Feng ◽  
Ying-chi Mao ◽  
Dao-xu Chen
Keyword(s):  
Small World ◽  
Overlay Network ◽  
P2p Systems

CHC: A Robust P2P Overlay Network with Simple Routing and Small-World Features

2011 ◽  
Vol 6 (8) ◽  
Author(s):  
Wenjun Xiao ◽  
Qin Zhang ◽  
Yanxia Liu ◽  
Lan Li ◽  
Weidong Chen
Keyword(s):  
Small World ◽  
Overlay Network ◽  
P2p Overlay

HIERARCHICAL PEER-TO-PEER SYSTEMS

2003 ◽  
Vol 13 (04) ◽  
pp. 643-657 ◽  
Author(s):  
L. GARCÉS-ERICE ◽  
E. W. BIERSACK ◽  
K. W. ROSS ◽  
P. A. FELBER ◽  
G. URVOY-KELLER
Keyword(s):  
Hash Table ◽  
Overlay Network ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Hierarchical Design ◽  
P2p Systems ◽  
Lookup Services ◽  
Peer To Peer Systems ◽  
Responsible Group ◽  
Overlay Management

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

scholarly journals A Measurement Study of the Structured Overlay Network in P2P File-Sharing Systems

2007 ◽  
Vol 2007 ◽  
pp. 1-9 ◽  
Author(s):  
Mo Zhou ◽  
Yafei Dai ◽  
Xiaoming Li
Keyword(s):  
Large Scale ◽  
Single Point ◽  
Overlay Network ◽  
File Sharing ◽  
Measurement Study ◽  
P2p Systems ◽  
Ddos Attack ◽  
P2p File Sharing ◽  
Structured Overlay ◽  
Single User

The architecture of P2P file-sharing applications has been developing to meet the needs of large scale demands. The structured overlay network, also known as DHT, has been used in these applications to improve the scalability, and robustness of the system, and to make it free from single-point failure. We believe that the measurement study of the overlay network used in the real file-sharing P2P systems can provide guidance for the designing of such systems, and improve the performance of the system. In this paper, we perform the measurement in two different aspects. First, a modified client is designed to provide view to the overlay network from a single-user vision. Second, the instances of crawler programs deployed in many nodes managed to crawl the user information of the overlay network as much as possible. We also find a vulnerability in the overlay network, combined with the character of the DNS service, a more serious DDoS attack can be launched.

Sign in / Sign up

Export Citation Format

Share Document