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

非结构化对等网信息缓存资源查找算法
引用本文:王艳丽,秦志光,周世杰,马新新,吴春江.非结构化对等网信息缓存资源查找算法[J].小型微型计算机系统,2008,29(9).
作者姓名:王艳丽  秦志光  周世杰  马新新  吴春江
作者单位:电子科技大学,计算机科学与工程学院,四川,成都,610054
摘    要:泛洪式路由(Flooding)是在非结构化对等网络中进行有效资源查找的主要方式,但其路由过程将产生大量冗余消息,因而严重制约了其可扩展性.随节点数增多,泛洪式路由的网络带宽消耗也变得异常严重.为此,本文提出了改善非结构化对等网络路由和查找效率的LHC (LookaHead with Catch) 算法,该算法利用缓存邻居节点的邻居列表和邻居节点的资源索引表,达到优化路由的目的.仿真实验表明,在保证维护和查询的带宽开销与现有算法基本一致的基础上,LHC算法不仅更有效的减少了查询过程中产生的冗余消息,而且在网络容量一定的情况下,资源命中率更高.

关 键 词:非结构化P2P  资源查询  路由算法  信息缓存

Information Catch Routing Algorithm in Unstructured Peer to Peer Network
WANG Yan-li,QIN Zhi-guang,ZHOU Shi-jie,MA Xin-xin,WU Chun-jiang.Information Catch Routing Algorithm in Unstructured Peer to Peer Network[J].Mini-micro Systems,2008,29(9).
Authors:WANG Yan-li  QIN Zhi-guang  ZHOU Shi-jie  MA Xin-xin  WU Chun-jiang
Affiliation:WANG Yan-li,QIN Zhi-guang,ZHOU Shi-jie,MA Xin-xin,WU Chun-jiang (School of Computer Science , Engineering,University of Electronic Science , Technology of China,Chengdu 610054,China)
Abstract:Flooding which is used in unstructured Peer to Peer Network for searching and locating information is a primary routing algorithm.But the routing produces a large number of redundant messages so that it restricts the P2P networks' expansibility.Moreover,with the increment of the number of nodes,the consumption of network bandwidth in unstructured P2P network has become a serious problem.This paper proposes the LHC(lookahead with catch) algorithm which optimizes the routing by catching neighbor's neighbor an...
Keywords:unstructured P2P systems  resource searching  routing algorithm  information catching  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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