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 123
- Downloads 0
An Overview of Localization for Wireless Sensor Networks
Abstract: Localization is an important issue for location-dependent applications of wireless sensor networks. In Sensor networks, data collected by sensor nodes need to be tagged with time and location information. Local...
Non-Intrusive Speech Quality with Different Time Scale
Speech quality evaluation is an extremely important problem in modern communication networks. Service providers always strive to achieve a certain Quality of Service (QoS) in order to ensure customer satisfaction...
I-ViDE: An Improved Vision-Based Approach for Deep Web Data Extraction
Abstract: Deep Web contents are accessed by queries submitted to Web databases and the returned data records are enwrapped in dynamically generated Web pages (they will be called deep Web pages in this paper). Extr...
Video Surveillance for Effective Object Detection with Alarm Triggering
Abstract: This paper presents a novel algorithm for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and under- goes both gradual and sudden...
Recapitulating the development initiatives of a robust information security safeguard: RITSB-the proposed solution
Most current information security systems performance vary with the nature of the filed its being operating. With an increased emphasizes on the adoption of security tools and technologies, the anomalies and &nb...