An Efficient Gossip Based Overlay Network For Peer-To-Peer Networks

Abstract

Overlay networks have emerged as a means to enhance end-to-end application performance and availability. Network topology plays an important role in utilizing resources in Peer-to-peer systems. Epidemic algorithms are potentially effective solutions for disseminating information in large scale and dynamic systems. P2P networks are popular for their dynamicity, but they are easy to deploy, robust and provide high resilience to failures. They proactively fight random process and network failures and do not need any reconfiguration when failures occur. This characteristic is particularly useful in P2P systems deployed on Internet or ad-hoc networks. In this paper we propose a new efficient gossip based algorithm for intelligent node selection (INS) and local view maintenance of a node. We also argue that the random node selection leads to data duplication which results in increasing bandwidth utilization. However, when selecting nodes on INS basis the bandwidth utilization has been reduced significantly. By using INS in application-level gossip multi-cast protocol the routing path will converge rapidly. For INS a distinctive overlay network which closely matches the Internet topology is constructed by combining different network topology-aware technique., The P2P system based on this structure is not only highly efficient for routing, but also keeps maintenance overhead very low even under highly dynamic environment, like ad-hoc networks.