A Self-Organizing Overlay Network to Exploit the Locality of Interests for Effective Resource Discovery in P2P Systems

2005 ◽  
Author(s):  
H. Kobayashi ◽  
H. Takizawa ◽  
T. Inaba ◽  
Y. Takizawa
Keyword(s):  
Overlay Network ◽  
Resource Discovery ◽  
P2p Systems ◽  
Self Organizing

Construction of Overlay Network in P2P-based Resource Discovery Model in Grid Environment

2005 ◽  
Author(s):  
Xiaoshe Dong ◽  
Xiuqiang He ◽  
Hua Guo ◽  
Wancheng Li ◽  
Xingjun Zhang
Keyword(s):  
Overlay Network ◽  
Resource Discovery ◽  
Grid Environment

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.

Peer-to-Peer Search Techniques for Service-Oriented Computing

2010 ◽  
pp. 44-63
Author(s):  
Lu Liu ◽  
Duncan Russell ◽  
Jie Xu
Keyword(s):  
Service Discovery ◽  
Large Scale ◽  
Resource Discovery ◽  
Peer To Peer ◽  
Great Success ◽  
P2p Networks ◽  
Search Techniques ◽  
P2p Systems ◽  
Service Oriented ◽  
And Performance

Peer-to-peer (P2P) networks attract attentions worldwide with their great success in file sharing networks (e.g., Napster, Gnutella, BitTorrent, and Kazaa). In the last decade, numerous studies have been devoted to the problem of resource discovery in P2P networks. Recent research on structured and unstructured P2P systems provides a series of useful solutions to improve the scalability and performance of service discovery in large-scale service-based systems. In this chapter, the authors systematically review recent research studies on P2P search techniques and explore the potential roles and influence of P2P networking in dependable service-based military systems.

Sign in / Sign up

Export Citation Format

Share Document