AN EFFICIENT APPROACH OF AMORPHOUS PEER-TO-PEER SYSTEMS
R. V. V. S. V. Prasad, B.S.N. Murty · IJCER · 2013
Peer to peer (P2P) networks have been extensively organized in the Internet, and they offer a variety of services such as file distribution, information recovery, media streaming, and telephony. P2P applications are well-liked because they mainly offer low entry difficulties and self-scaling. Unstructured peer-to-peer (P2P) file distribution networks are accepted in the mass market. As the peers contributing in unstructured networks interrelate randomly, they depend on flooding query messages to determine objects of attention and thus establish extra ordinary network traffic. The peers in P2P networks have comparable preferences and have recently proposed unstructured P2P networks that manage participating peers by exploiting their similarities which are indicated by Empirical measurement studies. The existing overlay topology construction algorithms often create unstructured P2P networks without performance guarantees as the resulting networks may not perform searches proficiently and successfully. A novel overlay formation algorithm for unstructured P2P networks is proposed here. Our proposal is unique based on the file distribution pattern demonstrating the power-law property in that it poses exact performance guarantees. Imaginary performance results conclude that in a stable possibility, searching an object in our proposed network proficiently takes O (ln c N) hops and the search increasingly and efficiently develops the resemblance of peers. Based on the imitation results, our proposal clearly outperforms the competing algorithms.