G-Chord：具有本地性和可靠性的改进型Chord模型  

G-CHORD:AN IMPROVED CHORD MODEL WITH BETTER LOCALITY AND RELIABILITY

作　　者：祝铭[1] 李佳[2] 陆际光[1] 

机构地区：[1]中南民族大学计算机学院,湖北武汉430074 [2]北京邮电大学计算机学院,北京100836

出　　处：《计算机应用与软件》2008年第5期203-204,共2页Computer Applications and Software

摘　　要：覆盖网络与物理网络不一致和覆盖网络节点易失效是目前众多基于DHT机制的P2P覆盖网络所面临的问题。在Chord基础上提出一种基于改进型模型G-Chord(Grouping-based Chord),它不仅具有Chord的优良特性,还具有更佳的本地性和可靠性。G-Chord通过使用物理节点IP地址前缀作为覆盖网络节点标识并为每一个覆盖网络节点分配多个物理节点来解决上述问题。The overlay network＇s incompatibility with the corresponding physical network and its nodes being prone to failure are two problems existing in many of its DHT-based P2P systems. By directly using the prefix of IP address as the overlay node ID and assigning several physical nodes to single overlay node ,the article proposes an improved G-Chord（ Grouping-based Chord） model which is based on Chord to solve the listed problems above. Theoretical analysis shows that apart from the good performance Chord with, G-Chord has better locality and reliability too.

关 键 词：分组Chord CHORD 分布式哈希算法 对等网络 

分 类 号：TP302.1[自动化与计算机技术—计算机系统结构] TB114.3[自动化与计算机技术—计算机科学与技术]