Chord Algorithm Based on Two-way Routing Table
Chord algorithm is a typical and relatively successful routing algorithm in the structured P2P network, but it needs to be improved in searching efficiency. By the method adding a reverse routing table for each node, the finding each hop is as close as possible the target node to reduce search times in the search process, that is, to improve the search efficiency. The analysis of examples proves that routing hop times have a certain decrease in the search process, and the search efficiency is improved.
P2P chord routing table: two way routing table
Wang Ziyang Yyin Siqing
North University of China School of Electronics and Computer Science and Technology Taiyuan city, Shanxi province China
国际会议
太原
英文
168-171
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）