Node clustering in the P2P environment

Authors:
Shui Chao;Li Hui;Liu Feng;Jia Yan
Affiliations:
National University of Defense Technology, 410073 Changsha, China;National University of Defense Technology, 410073 Changsha, China;National University of Defense Technology, 410073 Changsha, China;National University of Defense Technology, 410073 Changsha, China
Venue:
ICNICONSMCL '06 Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies
Year:
2006

Citing 0
Cited 1

HPM: A novel hierarchical Peer-to-Peer model for lookup acceleration with provision of physical proximity

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Node clustering is an efficient way to improve query hit radio and decreases network traffic cost in unstructured P2P topology. In this paper, we study the relationship between the similarity of peers properties and system clustering coefficient. It demonstrates that increase peers-similarity is an efficient way to increase system-clustering coefficient. By this theorem, we have proposed three algorithms base on unstructured P2P topology to improve the peers-similarity. The experiments show the algorithms will help P2P system reflect the small-world characteristics and reduce the average time complexity of per lookup request.