基于对等区域的改进的Chord资源路由算法  

Improved Chord Resource Routing Algorithm Based on Opposite Regions

作　　者：李焰峰[1] 李汉斌[1] 张学杰[1] 

机构地区：[1]云南大学信息学院,昆明650091

出　　处：《计算机工程》2009年第2期79-82,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(60573104)

摘　　要：给出一种基于对等区域的Chord网络资源路由算法。该算法在继承Chord算法简单、可靠、负载平衡等特点的基础上,在Chord环型结构中引入基于对等区域的搜索机制和区域管理机制,由超级节点统一转发区域成员节点状态信息,减少单个节点间由于路由信息失效而产生的无效转发,降低Chord网络的平均搜索长度,实现区域内超级节点选择的随机性,提高对等网络的资源搜索效率。This paper proposes an improved Chord resource routing algorithm based on opposite regions. Inheriting the simple, reliable and load balancing characteristics of Chord algorithm, the algorithm introduces routing mechanism between regions and region management mechanism which transmits the states of nodes in a region uniformly by region leader in Chord ring-like topology structure. Compared with the traditional Chord algorithm, the algorithm reduces the invalid transmitting between nodes owing to invalid routing information, decreases the average routing path, realizes selecting region leader in a region randomly and improves the efficiency of routing in opposite system.

关 键 词：P2P系统 CHORD网络 区域路由机制 区域管理机制 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]