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

自组织聚类的P2P语义路由算法
引用本文:向永生,张颖,陈曦.自组织聚类的P2P语义路由算法[J].计算机工程,2010,36(9):123-125.
作者姓名:向永生  张颖  陈曦
作者单位:1. 长沙理工大学城南学院,长沙,410076
2. 长沙理工大学计算机与通信工程学院,长沙,410076
基金项目:湖南省科技计划基金资助项目(2009GK3160);;湖南省教育厅基金资助项目(06C122);;湖南省自然科学基金资助项目(07JJ3120)
摘    要:为解决结构化P2P语义路由过程效率低的问题,通过分析哈希函数,归纳出目的节点、传统语义路由中继节点序列、聚类邻居节点集三者之间的逻辑关联特性,提出一种自组织聚类的P2P语义路由算法,在提高路由效率的同时,保证P2P网络的对等性、自组织性及规模可缩放性。

关 键 词:结构化P2P  自组织聚类  哈希函数  语义路由
修稿时间: 

Self-organizing Clustering P2P Semantic Routing Algorithm
XIANG Yong-sheng,ZHANG Ying,CHEN Xi.Self-organizing Clustering P2P Semantic Routing Algorithm[J].Computer Engineering,2010,36(9):123-125.
Authors:XIANG Yong-sheng  ZHANG Ying  CHEN Xi
Affiliation:(1. College of Chengnan, Changsha University of Science & Technology, Changsha 410076; 2. Institute of Computer and Communication Engineering, Changsha University of Science & Technology, Changsha 410076)
Abstract:In order to solve the problem of low efficiency of structured P2P semantic routing process, this paper analyzes the Hash function, concludes and applies the property that the logical relation among the destination node, the traditional semantic routing relay node sequence, and the clustering neighboring nodes. It proposes the self-organizing clustering P2P semantic routing algorithm to improve the efficiency of semantic routing, and guarantee the equivalence, self-organization and the possible of scaling scale of P2P network.
Keywords:structured P2P  self-organizing clustering  Hash function  semantic routing
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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