An Efficient Topology Search Mechanism for Unstructured Peer-To-Peer Networks

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 3

Abstract

 Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. Empirical measurement studies indicate that the peers in P2P networks have similar preferences, and have recently proposed unstructured P2P networks that organize participating peers by exploiting their similarity. The resultant networks may not perform searches efficiently and effectively because existing overlay topology construction algorithms often create unstructured P2P networks without performance guarantees.Thus, I propose a novel overlay formation algorithm for unstructured P2P networks. Based on the file sharing pattern exhibiting the power-law property, our proposal is unique in that it poses rigorous performance guarantees. Theoretical performance results conclude that in a constant probability, 1) searching an object in our proposed network efficiently takes N hops (where c is a small constant), and 2) the search progressively effectively exploits the similarity of peers. In addition, the success ratio of discovering an object approximates 100 percent. We validate our theoretical analysis and compare our proposal to competing algorithms in simulations. Based on the simulation results, my proposal clearly outperforms the competing algorithms in terms of 1) the hop count of routing a query message, 2) the successful ratio of resolving a query, 3) the number of messages required for resolving a query, and 4) the message overhead for maintaining and formatting the overlay.5.) Resultant set of finite N hops for data sharing in unstructured peer-to-peer (P2P) networks.

Authors and Affiliations

B. Vijayanandh , P. K. Yogeshwaran , R. Sivanesan , M. New Begin

Keywords

Related Articles

ICHALEC Improved Cluster Head And Low Energy Consumption Protocol In Wireless Sensor Network

Wireless Sensor Network is an emerging field for research in most of the aspects of mankind. It is a network composed of nodes without any central controller. Sensor network protocols have high ability to be used in each...

 Implementation of Hybrid Wavelet Transform for Adaptive Lossless Image Compression

Abstract: In digital image processing, Image compression is a type of data compression causing reduction in image size but maintain the image quality. It reduce cost and time in image storage and transmission and thuscan...

Big Data Analysis on Heterogeneous Distributed Systems using Remote Method Invocation

Big Data Analysis has become very essential for organizations to arrive at timely decisions, for progressive growth and keeping with the competition. To analyse huge amount of data generated through various business proc...

 Routing Framework for Delay Tolerant Networks using BayesiaLab

 Routing in delay tolerant networks (DTN) can benefit from the fact that most real life DTN, especially in the context of people-centric networks (e.g. Pocket Switching Networks (PSN)), exhibit som...

Filter Based addressing protocol for effective Node Auto configuration in Ad hoc Network

MANET is used for many distributed network, the lack of a centralized administration makes these networks attractive for several distributed applications, such as sensing, Internet access to deprived communities, and dis...

Download PDF file
  • EP ID EP105159
  • DOI 10.9790/0661-16358386
  • Views 130
  • Downloads 0

How To Cite

B. Vijayanandh, P. K. Yogeshwaran, R. Sivanesan, M. New Begin (2014). An Efficient Topology Search Mechanism for Unstructured Peer-To-Peer Networks. IOSR Journals (IOSR Journal of Computer Engineering), 16(3), 83-86. https://www.europub.co.uk/articles/-A-105159