节点文献
一种基于K-means聚类分组的P2P超结点模型
A SUPER-PEER P2P MODEL BASED ON K-MEANS CLUSTERING
【Author】 Jiang Hua Wang Hanhu Chen Mei College of Computer Science and Engineering, Guizhou University, Guiyang Guizhou 550025, China
【机构】 贵州大学计算机科学与工程学院;
【摘要】 本文面向网格计算、协同工作等特定P2P应用,提出了一种基于超节点的P2P混合网络模型。该模型的主要特点是采用K-means聚类算法对网络中的节点进行聚类,从而得到分组虚拟子网,由各子网内的超节点负责临近节点的加入与注销。该模型既克服P2P集中模型伸缩性不强,分散性P2P模型发送消息量大等缺点,又可以灵活地组织对等节点进行网格计算或组内协同工作等分布式应用。文章最后使用仿真实验表明K-means算法在网络节点聚类中的有效性。
【Abstract】 The paper described a hybrid P2P model with super-peer that is oriented on the special P2P applications, such as grid computing and cooperation work. The K-means algorism is utilized to cluster the nodes in the network in this model, and every cluster is a virtual sub network. The main function of super-peers is responsible for the registration, logout of the new peers, maintaining the index and network distance map. The model does not only improve the flexibility of the distributed computing platform, but also reduces the request messages. The model is conducive to distributed applications. The result of simulated test is described in the end of the paper that showed the efficiency of using K-means algorism to clustering network hosts.
【Key words】 Hybrid P2P Super-peer K-means clustering Distributed application;
- 【会议录名称】 2005年全国开放式分布与并行计算学术会议论文集
- 【会议名称】2005年全国开放式分布与并行计算学术会议
- 【会议时间】2005
- 【会议地点】中国上海
- 【分类号】TP393.02
- 【主办单位】中国计算机学会开放系统专业委员会