检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]诺基亚通信系统技术(北京)有限公司,浙江杭州310053 [2]杭州纵横通信股份有限公司,浙江杭州310012
出 处:《无线电通信技术》2014年第6期9-12,共4页Radio Communications Technology
摘 要:Chord是一种数值逐步逼近的P2P路由算法,它能够快速地定位资源。在Chord环上由于结点的随机性,资源定位时产生了逻辑路径和物理路径不一致及绕环问题,致使网络延迟增大。混合P2P具有很强的网络局部性,但查询效率低。提出了基于改进的混合P2P的Chord算法(Chord Algorithm Based on Enhanced Hybrid P2P,CBEH),该算法利用增强的混合P2P中超级结点的网络信息,在路由过程中优先选取物理距离近的结点。实验表明CBEH能够有效地减少路由查找时延,提高路由性能。Chord is a numerical gradual approximate routing algorithm of P2 P,and it can locate resources quickly.However,the random of node on Chord ring leads to inconsistence between the logic routing and the physical routing,and detour problems when node's routing,which makes a big network delay and will seriously affect the routing efficiency.Hybrid P2 P has a strong sense of locality,but its query is in low efficiency.Based on the analysis,the paper suggests a new algorithm Chord Algorithm Based on Enhanced Hybrid P2P(CBEH),which takes advantage of network information of super-node in Enhanced Hybrid P2 P,and firstly chooses a node nearby.The experimental results show that CBEH can effectively reduce the route lookup delay and improve the behavior of chord.
分 类 号:TP393.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.127