首页 | 本学科首页   官方微博 | 高级检索  
     

基于网络坐标的无结构P2P节点聚类算法
引用本文:周振朝,费耀平,李敏.基于网络坐标的无结构P2P节点聚类算法[J].计算机工程,2010,36(11):98-100.
作者姓名:周振朝  费耀平  李敏
作者单位:中南大学信息科学与工程学院,长沙,410075
摘    要:结合遗传聚类算法及K均值算法,提出一种混合的节点聚类算法,在无结构P2P网络中根据节点之间的距离进行聚类,可以优化其覆盖网络,提高系统的路由效率。实验结果表明,该算法具有良好的可靠性及可扩展性,能对节点进行有效聚类,且聚类后的节点平均延迟明显降低。

关 键 词:无结构P2P网络  网络坐标  聚类算法

Node Clustering Algorithm Based on Network Coordinate for Unstructured P2P
ZHOU Zhen-chao,FEI Yao-ping,LI Min.Node Clustering Algorithm Based on Network Coordinate for Unstructured P2P[J].Computer Engineering,2010,36(11):98-100.
Authors:ZHOU Zhen-chao  FEI Yao-ping  LI Min
Affiliation:(School of Information, Central University of Finance and Economics, Beijing 100081)
Abstract:A two-tier service placement strategy based on the P2P overlay network framework is proposed. The optimization model is built for intra-domain Service Placement Problem(SPP) and an efficient algorithm is designed to solve the problem. Several cost calculation methods are adopted to fit different structures of the composed service. Simulation result shows the intra-domain service placement strategy decreases the cost for intra-domain composed services, and the two-tier service placement strategy decreases the total cost of composed services.
Keywords:placement strategy  composed service  domain  overlay network  layered P2P network placement strategy  composed service  domain  overlay network  layered P2P network placement strategy  composed service  domain  overlay network  layered P2P network
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号