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
- EP ID EP105159
- DOI 10.9790/0661-16358386
- Views 121
- Downloads 0
An Intermediate Service Composer Architecture for Dynamic Discovery and Invocation of Web Services from Mobile Devices
Web services describe a standardized way of integrating Web-based applications over an Internet protocol backbone. Mobile devices are getting more pervasive and it is becoming increasingly necessary to inte...
A Parallel Algorithm for Factorization of Big Odd Numbers
The article puts forward an algorithm to factorize a big odd number by means of subdividing the searching interval into finite independent subintervals. A divisor of a big odd number can be found in one of the subinterva...
Motion-Based Foreground Image Segmentation
Abstract: A variety of useful applications demonstrate the need for precise motion-based segmentation ofimage data. Video compression techniques rely heavily on accurate and efficient representation of spatiotempor...
Internet-Based Geographical Information Systems for the RealEstate Marketing
Abstract : In this paper , a user-friendly Geographic Information Systems (GIS) program was developed tomanipulate the property listing for sale geographically, to display the property listing in relation to other social...
Appraisal on Applications of Nanorobots
Abstract: Nanotech is the manipulation of the matter on atomic and molecular scale. Nanorobots being an emerging technology used precisely in machines or robots to perform controlled manipulation of objects with na...