A Square Root Topologys To Find Unstructured Peer-To ... - ijcsmr

International Journal of Computer Science and Management Research Vol 2 Issue 3 March 2013ISSN 2278-733XWe have presented the square-root topology, andshown that implementing a protocol that causes thenetwork to converge to the square root topology,rather than a power-law topology, can providesignificant performance improvements for peer-topeersearches. In the square-root topology, thedegree of each peer is proportional to the squareroot of the popularity of the content at the peer. Ouranalysis shows that the square-root topology isoptimal in the number of hops required for simplerandom walk searches. We also present simulationresults which demonstrate that the square-roottopology is better than power-law topologies forother peer-to-peer search techniques. we presentedan algorithm for constructing the square-roottopology using purely local information. Each peerestimates its ideal degree by tracking how manyqueries match its content, and then adds or dropsconnections to achieve its estimated ideal degree.Results from simulations and our prototype showthat this locally adaptive algorithm quicklyconverges to a globally efficient square-roottopology. Our results show that the combination ofan optimized topology and efficient searchmechanisms provides high performance inunstructured peer-to-peer networks.D Raman,Associate Professor InVardhaman College Of Engineering(Autonomous)Aflicated To AICTE, Jwaharlal TechnologicalUniversity,Hyderabad.Yadma Srinivas Reddy PersuingMasters Degree In Vardhaman College OfEngineering, Aflicated To Aicte.Jawaharlal NehruTechnological University,Hyderabad.5 References1. Stoica, I, Morris, R, Karger, D. Kaashoek, M.F.Balakrishnan, H: Chord: A scalable peer-to-peerlookup service for internet applications.2. Ratna samy S., Francis, P , Handley, M , Karp, R,Shenker, S: A scalable content addressable network.3. Rowstron, A Druschel, P: Pastry: Scalable,decentralized object location and routing for largescalepeer-to-peer systems.4. Chawathe, Y., Ratnasamy, S, Breslau, L,Lanham, N, Shenker, S: Making Gnutella-like P2Psystems scalable.5. Loo, B, Hellerstein, J, Huebsch, R, Shenker, S,Stoica, I: Enhancing P2P file-sharing with anInternet-scale query processor.6. Loo, B, Huebsch, R, Stoica, I, Hellerstein, J:Enhancing P2P file-sharing with an Internet scalequery processor.7. Yang, B., Garcia-Molina, H.: Designing a superpeernetwork.8. Kalnis, P, Ng, W, Ooi, B, Papadias, D, Tan, K:An adaptive peer-to-peer network for distributedcaching of OLAP results.D. Raman et.al. 1736www.ijcsmr.org