International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Self-organized file sharing by node feature in clustered P2P system

Author : Anju S Kumar ¹ Ratheesh S ²

Date of Publication :7th February 2016

Abstract: The overall performance of peer-to-peer (P2P) file sharing lies on the efficiency of file query. To enhance the efficiency of file query in a structured peer-to-peer system, clustering technique can be used. Clustering peers by their common interests and by their physical proximity can improve file query performance. In the clustering technique the physically-close nodes are formed into a cluster and further physically-close and common-interest nodes are grouped into a sub-cluster based on a hierarchical topology. In the search mechanism, the file query will move to the nearest proximity cluster and to the corresponding interest cluster within that proximity cluster. If all nodes within this cluster can respond to the query, there is a need for a method to choose appropriate node to share the file. In this paper, we propose a method, called the statistical feature matrix form (SMF), which improves the searching mechanism in the structured Peer–to-Peer system by selecting neighbors according to their capabilities. SMF measures the number of shared files, the content quality, the query service and the transmission distance between neighbor nodes. Based on these measurements, appropriate nodes can be selected by finding the rank of each nodes in the cluster, thereby reducing the traffic overhead significantly and enhance the file sharing efficiency in the structured P2P system.

Reference :

1. Haiying Shen, Senior Member, IEEE, Guoxin Liu, Student Member, IEEE and Lee Ward ”A ProximityAware Interest- Clustered P2P File Sharing System” IEEE transactions on parallel and distributed systems, vol. 26, no. 6, June 2015.
2. P. Garbacki, D. H. J. Epema, and M. V. Steen ”The design and evaluation of a self-organizing super-peer network” IEEE Trans. Comput., vol. 59, no. 3, pp. 317331, Mar. 2010.
3. P. Garbacki, D. H. J. Epema, and M. van Steen ”Optimizing peer relationships in a super-peer network” in Proc. Int. Conf. Distrib. Comput. Syst., 2007, p. 31.
4. Z. Li, G. Xie, and Z. Li ” Efficient and scalable consistency maintenance for heterogeneous peer-topeer systems” IEEE Trans. Parallel Distrib. Syst., vol. 19, no. 12, pp. 16951708, Dec. 2008.
5. 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. 686702, 2008.
6. C. Hang and K. C. Sia, ”Peer clustering and firework query mode” in Proc. Int. World Wide Web Conf., 2002.
7. G. Liu, H. Shen, and L. Ward, “An efficient and trustworthy P2P and social network integrated file sharing system,” Proc. P2P, 2012, pp. 203–213.
8. K. Elkhiyaoui, D. Kato, K. Kunieda, K. Yamada, and P. Michiardi,“A scalable interest-oriented peer-to-peer pub/sub network,” in Proc. 9th Int. Conf. Peer-to-Peer Comput., 2009, pp. 204–211.
9. M. Yang and Y. Yang, “An efficient hybrid peer-topeer system for distributed data sharing,” IEEE Trans. Comput., vol. 59, no. 9, pp. 1158–1171, Sep. 2010.
10. E. Adar and B. A. Huberman, ``Free riding on Gnutella,'' First Monday, vol. 5, nos. 10_12, pp. 1_22, Oct. 2000.
11. S. Bianchi, P. Felber, and M. G. Potop-Butucaru, ``Stabilizing distributed R-trees for peer-to-peer content routing,'' IEEE Trans. Parallel Distrib.Syst., vol. 21, no. 8, pp. 1175_1187, Aug. 2010.