An EMST Based Look-up Protocol for Peer to Peer Networks
|
| Title | An EMST Based Look-up Protocol for Peer to Peer Networks |
| Authors | |
| 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. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2006-07-01 |
| Source | Journal of Networks Vol 1, No 3 (2006) |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |