JOURNAL OF NETWORKS (JNW)
ISSN : 1796-2056
Volume : 1    Issue : 3    Date : July 2006

An EMST Based Look-up Protocol for Peer to Peer Networks
Tarun Bansal and Pankaj Ghanshani
Page(s): 9-17
Full Text:
PDF (615 KB)


Abstract
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 distributed behaviour in the virtual space destroys the locality between participant nodes. The
topology-based hierarchical overlay networks like Grapes and Jelly, exploit the physical distance
information among the nodes to construct a two-layered hierarchy. This highly improves the locality
property, but disturbs the concept of decentralization as the leaders in the top layer get accessed
very frequently, becoming a performance bottleneck and resulting in a single point of failure. In this
paper, we propose an enhanced m-way search tree (EMST) based P2P overlay infrastructure, called
Oasis. It is shown through simulation that Oasis can achieve both the decentralization and locality
properties along with high fault tolerance and a logarithmic data lookup time.

Index Terms
peer to peer networks, routing, decentralisation, load balancing