An Improvement to the Chord-based P2P Routing Algorithm
Chord has been widely used as a routing protocol in structured peer-to-peer overlay networks. A fundamental problem of peer-to-peer applications is to efficiently locate the node that stores a particular data item. In fact, performance of structured peer-to-peer overlay networks depends on the routing protocols. The original Chord routing protocol based on DHT uses Finger Table to route. However, in the original model, there is redundancy information in the Finger Table. This paper analyzes the routing algorithm of Chord protocol and presents an improvement strategy of original Chord routing algorithm. Results from theoretical analysis and experiments show that the routing performance of structured Chord-based overlay networks is improved.
Dong Chen Zhenhua Tan Guiran Chang Xingwei Wang
School of Information Science and Engineering, Northeastern University Shenyang, Liaoning Province, China
国际会议
Fifth International Conference on Semantics,Knowledge and Grid(第五届语义、知识与网格国际会议 SKG 2009)
珠海
英文
266-269
2009-10-12(万方平台首次上网日期,不代表论文的发表时间)