Improving Query Search Performance in Unstructured P2P Network Using Proclamation Based Search (PS) Algorithm
Full Text(PDF, ) PP.204-208
| Author(s) |
| KEYWORDS |
Peer-to-peer, proclamation, PS, search, synopsis, Un-structured P2P
The challenge in unstructured p2p networks is designing an efficient Search Algorithm. Some typical search algorithms are random walk and flooding. Flooding in general covers many nodes but the drawback is it generates huge amount of query messages. Random walk generates only fewer amounts of query messages but takes long time to search. In this paper we propose a Proclamation Search (PS) algorithm for avoiding multiple hops in forwarding the query in unstructured Peer to peer network. Proclamation is publishing the synopsis of the contents a peer tends to share and properly distributed and cached by other peers. In this system, the nodes anticipatorily publish their contents, and selectively store interesting contents received from other peers. When there is a search request, a node can find the destination nodes by looking up its local publishing repository, and thus obtain one-hop search with moderate search cost. We analyze the performance of PS algorithm compared to other search algorithms based on search efficiency.
 R. Bolla, R. Gaeta, A. Magnetto, M. Sciuto, and M. Sereno, “A
Measurement Study Supporting P2P File-Sharing Community
Models,” Computer Networks, vol. 53, no. 4, pp. 485 – 500, 2009.
 D. Stutzbach, R. Rejaie, and S. Sen, “Characterizing Unstructured
Overlay Topologies in Modern P2P File-Sharing Systems,” in
Proc. of the ACM Sigcomm Internet Measurement Conference,
 S. Iyer, P. Rowstron, and P. Druschel, “Squirrel: a Decentralized
Peer-to-Peer Web Cache,” in Proc. of the ACM Symposium on
Principles of Distributed Computing (PODC), 2002.
 Hailong Cai and Jun Wang. Foreseer: A novel, locality-aware
peer-to-peer system architecture for keyword searches. In
Proceedings of International Middleware Conference
(Middleware 2004), pages 38–58, Toronto, Ontario, Canada, Oct.
 C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to
peer networks. In Proceedings of the 23rd Annual Joint
Conference of the IEEE Computer and communications Societies
(INFOCOM „04), volume 1, pages 120–130, 2004.
 D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B.
Richard, S. Rollins, and Z. Xu, Peer-to-Peer Computing Technical
Report HPL-2002-57, HP, 2002.
 L.A. Adamic, R.M. Lukose, and B.A. Huberman, “Local Search in
Unstructured Networks,” Handbook of Graphs and Networks
pp. 295-317, Wiley-VCH, 2003.
 V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, “A Local
Search Mechanism for Peer-to-Peer networks Proc.ACM CIKM
Int‟l Conf. Information and Knowledge Management(CIKM ‟02),
pp. 300- 307, Nov. 2002.
 A. Crespo and H. Garcia-Molina, “Routing Indices for Peer-toPeer Systems,” Proc. 22nd Int‟l Conf. Distributed Computing
Systems(ICDCS ‟02), pp. 23-32, July 2002.
 Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble. A
measurement study of peer-to-peer file sharing systems. In
Proceedings of Multimedia Computing and Networking
(MMCN), San Jones, CA, Jan.2002
 Kazaa website http://kazaa.com
 Christos Gkantsidis, Milena Mihail, and Amin Saberi.
Hybrid searchschemes for unstructuredpeer-to-peer networks.
In Proceedings ofIEEE INFOCOM‟05, Miami, FL, March 2005.
 Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search
and replication in unstructured peer-to-peer networks.
In Proc. Of ICS, 2002.
 Anjali Gupta, Barbara Liskov, and RodrigoRodrigues. One hop
lookups for peer-to-peer overlays. In Proceedings of the 9th
IEEE Workshop on Hot Topics in Operating Systems (HotOSIX), pages 7–12,Lihue, Hawaii, USA, May 2003.
 V. Cholvi, P. A. Felber, and E. W. Biersack. Ef_cient search in
unstructured peer-to-peer networks. Technical Report RR- 03-090,
Institute Eur_ecom, 2003.
. Network Simulator 2 http://www.isi.edu/nsnam/ns/