Loading

P2P Based Fast Replica Algorithm for Semantic Overlay Networks
Kirubakaran. S1, Arunkumar. M2, Prakash S.P3

1Kirubakaran. S, Assistant Professor, Department of ECE, Bannari Amman Institute of Technology, Sathy (Tamil Nadu), India.
2Arunkumar. M, Assistant Professor, Department of ECE, Bannari Amman Institute of Technology, Sathy (Tamil Nadu), India.
3Prakash S.P, Assistant Professor, Department of ECE, Bannari Amman Institute of Technology, Sathy (Tamil Nadu), India.
Manuscript received on 15 December 2018 | Revised Manuscript received on 27 December 2018 | Manuscript Published on 24 January 2019 | PP: 369-372 | Volume-7 Issue-4S2 December 2018 | Retrieval Number: ES2083017518/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Nowadays the Overlay networks are emerged as a prevailing and bendable technique. This paper aims to optimize the throughput parameter of overlay networks. A network based on similar content is created and called as Semantic overlay Network. To duplicate the contented within the semantic system, Fast Replica methods are used to condense the contented relocate time. This file are down loaded through various network in parallel manner. The vibrant main schemes are obtained to the main end users of the domain SON at the similar time, alluring dissimilar portion of that file from dissimilar nodes and saturated in local point. The loads are animatedly collective in the middle of all the peers. while considering a peer-to-peer (P2P) architecture queries are propagated to Overlay Broker (OB). The OB in turn returns the IP address of the semantic group requested by the node. Then the node queries the semantic members for the file. All the connections are maintained by nodes. For instance, “Jazz” archive of the main node will connect to additional similar nodes. All the nodes of Semantic Overlay Network (SON) are organized by themselves to the OB. The uncertainty are in retreat to the suitable SONs, which increasing the probability of matching files and dipping the look for the dissimilar nodes on the main content.
Keywords: Replica Algorithm, Overlay Networks, IP Address, P2P.
Scope of the Article: Algorithm Engineering