%0 Journal Article
%T Improvement of Chord routing algorithm<br>一种改进的Chord路由算法
%A JIANG Shou-xu
%A HAN Xi-xian
%A LI Jian-zhong
%A <br>姜守旭
%A 韩希先
%A 李建中
%J 计算机应用
%D 2006
%I 
%X Routing is essential in P2P applications, and it is very important to locate the nodes that contain given data items. Chord is a successful routing algorithm, but the routing table in Chord has a terrible problem of information redundancy. To address this problem, an improved Chord algorithm was proposed which inherited the advantages of Chord, such as simplicity, efficiency, reliability, load balance and low cost. The routing table was improved to gain more useful information and get higher efficiency.
%K Peer-to-Peer
%K Chord<br>分布哈希
%K 路由
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=FC2D1DF713164B44&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=E158A972A605785F&sid=C45B504FED793340&eid=9BA5B7BDD4CE0596&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=18