C-Chord:一种改进的Chord路由算法  

C- Chord: An Improved Chord Routing Algorithm

作　　者：祝华平[1] 李蜀瑜[1] 

机构地区：[1]陕西师范大学计算机科学学院,陕西西安710062

出　　处：《计算机技术与发展》2013年第12期47-50,共4页Computer Technology and Development

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

摘　　要：Chord是一种典型的资源查找路由协议,具有负载均衡、可扩展性和灵活性等特点,广泛应用于P2P系统,但查找效率并不高。为了提高查找效率,提出了一种改进的多层次C-Chord路由算法,通过多层的集群结构组织,先优化路由表,然后改进资源查询过程,最后结合有效的维护机制,使查询效率得以提高。仿真实验表明,这种改进的Chord路由算法查询效率明显高于传统的Chord算法。而且C-Chord路由算法可以把传统的P2P系统扩展成适应大规模的分布式系统,网络的稳定性和健壮性更好。Chord is a typical resource lookup routing protocol with load balancing, scalability and flexibility, widely used in P2P systems, but search efficiency is not good. To improve search efficiency, an improved multi-level C-Chord routing algorithm is proposed, through the multilayer cluster structure organization, optimize the routing table, and then improve resource query process, finally combined with an effective safeguard mechanism, the query efficiency can be improved. Simulation results show that this improved Chord routing algorithm is significantly more efficient than traditional Chord algorithm. And C-Chord routing algorithm can be extended to the traditional P2P systems to adapt to the large-scale distributed systems,with better stability and robustness of the network.

关 键 词：CHORD C—Chord 路由表 

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