MichaelAngelG. Salvo, RomeoMarkA. Mateo, Jae-Wan Lee, Journal of Internet Computing and Services, Vol. 10, No. 4, pp. 189-198, Aug. 2009
Full Text:  HTML
Keywords: hierarchical clustering, mobile agent, P2P system

Abstract

Unstructured peer-to-peer systems are most commonly used in today's internet. But file placement is random in these systems and no correlation exists between peers and their contents. There is no guarantee that flooding queries will find the desired data. In this paper, we propose to cluster nodes in unstructured P2P systems using the agglomerative hierarchical clustering algorithm to improve the search method. We compared the delay time of clustering the nodes between our proposed algorithm and the k-means clustering algorithm. We also simulated the delay time of locating data in a network topology and recorded the overhead of the system using our proposed algorithm, k-means clustering, and without clustering. Simulation results show that the delay time of our proposed algorithm is shorter compared to other methods and resource overhead is also reduced.

Statistics
Cite this article