Improvement of Chord Routing Algorithm

摘要：

The key in P2P network is to locate resources effectively.Chord is a kind of structured P2P network, but the routing table in Chord suffers serious information redundancy and it is not very efficient Therefore, an improved Chord routing algorithm is proposed.On the premise of not increasing the length of routing table, repetitious entries are deleted and anticlockwise routing in the same amount are added.Simulation experiments show that the algorithm eliminates information redundancy, reduces the average lookup path length and gets higher efficiency so as to coordinates lookup efficiency and routing table length well.

关键词： P2P Chord routing algorithm

作者: Wang Biqing

作者单位: Dept.of Mathematics and Computer Science Tongling University Tongling, China

会议类型: 国际会议

会议名称: Second International Symposium on Electronic Commerce and Security(第二届电子商务与安全国际研究大会)(ISECS 2009)

会议地点: 南昌

会议语种:英文

页码: 523-525

在线出版日期: 2009-05-22（万方平台首次上网日期，不代表论文的发表时间）