VIM - VIRTUAL ID BASED M-WAY LOOKUP PROTOCOL FOR PEER - TO -PEER NETWORK

Abstract

Peer-to-peer systems and applications are distributed systems. P2P systems form the basis of several applications, such as file sharing systems and event notification services. Distributed Hash Table (DHT) based P2P systems such as CAN, Chord, Pastry and Tapestry, use uniform hash functions to ensure load balance in the participant nodes. But their evenly distributed behavior 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 dissertation, a virtual id based m-way search tree (VIM) P2P overlay infrastructure, called VIM is proposed .It is shown through simula...