Grapes: Topology-Based Hierarchical Virtual Network for Peer-to-Peer Lookup Services

نویسندگان

  • Kwangwook Shin
  • Seunghak Lee
  • Geunhwi Lim
  • Hyunsoo Yoon
  • Joong Soo Ma
چکیده

Peer-to-peer systems and applications are distributed systems without any centralized control. The core operation in most peer-to-peer systems is efficient location of data items. The current well-known peer-topeer systems like Napster and Gnutella have scalability problem in location of data items. To solve the scalability problem, some scalable peer-to-peer lookup services show up, such as CAN, Chord, Pastry, and Tapestry. In this paper, we propose a self organizing hierarchical virtual network infrastructure, called Grapes, for peer-to-peer lookup services. Hierarchical approach of Grapes brings two benefits. First, a node can find data in its sub-network with the high probability due to the data replication in its sub-network. Second, the hierarchical structure makes lookup hops shorter than those of the flat one.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

Oasis: A Hierarchical EMST Based P2P Network

Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and event notification services. P2P systems based on Distributed Hash Table (DHT) such as CAN, Chord, Pastry and Tapestry, use uniform hash functions to ensure load balance in the participant nodes. But their evenly dist...

متن کامل

An EMST Based Look-up Protocol for Peer to Peer Networks

Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and event notification services. P2P systems based on Distributed Hash Table (DHT) such as CAN, Chord, Pastry and Tapestry, use uniform hash functions to ensure load balance in the participant nodes. But their evenly dist...

متن کامل

A Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables

Several structured peer-to-peer networks have been created to solve the scalability problem of previous peer-to-peer systems such as Gnutella and Napster. These peer-to-peer networks which support distributed hash table functionality construct a sort of structured overlay network, which can cause a topology mismatch between the overlay and the underlying physical network. To solve this mismatch...

متن کامل

P3ON: Proximity-based Peer-to-Peer Overlay Networks

Peer-to-peer(P2P) overlay networks provide robust, scalable file sharing services. The hop distance between two virtual nodes in P2P overlay networks is irrelevant to the real distance between two nodes. Therefore, many lookup operations may be executed, without considering the real distance, even though a node wants to find a file object located in another node within the same subnet. To overc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002