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

Authors:
Geunhwi Lim
Affiliations:
-
Venue:
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Year:
2002

Citing 0
Cited 6

Jelly: A Dynamic Hierarchical P2P Overlay Network with Load Balance and Locality

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Oasis: a hierarchical EMST based P2P network

IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Uinta: a P2P routing algorithm based on the user’s interest and the network topology

IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Tide: An effective and practical design for hierarchical-structured P2P model

Computer Communications
HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity

Journal of Network and Computer Applications
Analyzing locality over a P2P computing architecture

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

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-to-peer 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.