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

基于小世界的JXTA发现机制的改进
引用本文:张智,符海东,黄革新,杨湘.基于小世界的JXTA发现机制的改进[J].武汉科技大学学报(自然科学版),2007,30(4):405-407.
作者姓名:张智  符海东  黄革新  杨湘
作者单位:武汉科技大学计算机科学与技术学院,湖北,武汉,430081
基金项目:武汉科技大学校科研和教改项目
摘    要:针对JXTA对等网络RPV发现机制存在效率低下的问题,提出了一种基于小世界的改进方案。该方案利用Kleinberg的小世界理论,将RPV表分解为本地短链RPV(S)表和长链RPV(L)表,本地短链RPV(S)表可以保证搜索的获得性和可靠性,长链RPV(L)表可以实现快速搜索,同时采用概率置换长链策略构造长链RPV(L)表。研究表明,该方案可以保证JXTA对等网络的平均跳数为0(log^2N)。

关 键 词:对等网络  小世界  RPV表
文章编号:1672-3090(2007)04-0405-03
修稿时间:2007-01-09

The small world-based improvement of JXTA discovery mechanism
Zhang Zhi,Fu Haidong,Huang Gexin,Yang Xiang.The small world-based improvement of JXTA discovery mechanism[J].Journal of Wuhan University of Science and Technology(Natural Science Edition),2007,30(4):405-407.
Authors:Zhang Zhi  Fu Haidong  Huang Gexin  Yang Xiang
Institution:College of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan 430081, China
Abstract:In light of the inefficiency of JXTA peer-to-peer network's discovery mechanism,a small world-based improvement method is presented.Making use of the Kleinberg's small world theory,the method breaks the RPV table into two tables: the local short chain RPV(S) and the long chain RPV(L).The RPV(S) guarantees the acquirability and reliability of discovery and the RPV(L) which is constructed by probability replacement of long chain strategy can speed up search.The study shows that the method can ensure the JXTA peer-to-peer network with average latency of 0(log2N) hops.
Keywords:JXTA
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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