Enhanced Document Search and Sharing Tool in Organized P2p Frameworks

Mohammad Aslamsultana, SSSN Usha Devi N


In internet p2p file sharing system generating more traffic. in this system file querying is important functionality which indicates the performance of p2p system .To improve file query performance cluster the common interested peers based on physical proximity .Existing methods are dedicated to only unstructured p2p systems and they don’t have strict policy for topology construction which decreases the file location efficiency. In this project proposing a proximity aware interest –clustered p2p file sharing system implemented in structured p2p file system. It forms a cluster based on node proximity as well as groups the nodes which having common interest into sub-cluster. A novel lookup function named as DHT and file replication algorithm which supports efficient file lookup and access. To reduce overhead and file searching delay the file querying may become inefficient due to the sub-interest supernode overload or failure. Thus, though the sub-interest based file querying improves querying efficiency, it is still not sufficiently scalable when there are a very large number of nodes in a sub-interest group. We then propose a distributed intra-sub-cluster file querying method in order to further improve the file querying efficiency.


BitTorrent. (2013) [Online]. Available: http://www.bittorrent. com/

Gnutella home page. (2003) [Online]. Available: http://www.


I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, “Freenet: A distributed anonymous information storage and retrieval system,” in Proc. Int. Workshop Des. Issues Anonymity Unobservability, 2001, pp. 46–66.

I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A scalable peer-topeerlookup protocol for internet applications,” IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 17–32, Feb. 2003.

A. Rowstron and P. Druschel, “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems,” in Proc. IFIP/ACM Int. Conf. Distrib. Syst. Platforms Heidelberg, 2001, pp. 329–350.

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. Kubiatowicz, “Tapestry: A resilient global-scale overlay for service deployment,” IEEE J. Sel. Areas Commun., vol. 22, no. 1, pp. 41–53, 2004.

H. Shen, C. Xu, and G. Chen, “Cycloid: A scalable constant-degree P2P overlay network,” Perform. Eval., vol. 63, pp. 195–216, 2006.

Z. Li, G. Xie, and Z. Li, “Efficient and scalable consistency maintenance for heterogeneous peer-to-peer systems,” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 12, pp. 1695–1708, Dec. 2008.

H. Shen and C.-Z. Xu, “Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks,” J. Parallel Distrib. Comput., vol. 68, pp. 686–702, 2008.

FastTrack. (2003) [Online]. Available: http://www.fasttrack.nu/ index_int.html

S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologically-aware overlay construction and server selection,” in Proc. IEEE INFOCOM, 2002, pp. 1190–1199.

M. Waldvogel and R. Rinaldi, “Efficient topology-aware overlay network,” in Proc. ACM Workshop Hot Topics Netw., 2002, pp. 101–106.

Y. Zhu and H. Shen, “An efficient and scalable framework for content- basedpublish/subscribe systems,” Peer-to-Per Netw. Appl., vol. 1, pp. 3–17, 2008.

C. Hang and K. C. Sia, “Peer clustering and firework query model,” in Proc. Int. World Wide Web Conf., 2002.

A. Crespo and H. Garcia-Molina, “Routing indices for peer-topeer systems,” in Proc. 22nd Int. Conf. Distrib. Comput. Syst., 2002, pp. 23–32.

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.