Symmetrical bidirectional Base-k Chord and Its Interesting Character
The Chord is a famous peer-to-peer application. There are many variants which change the structure and the routing algorithm of the Chord, and all these variants achieve the higher routing efficiency than those of the original ones. To improve the routing efficiency of Base-k Chord, this paper proposes a new finger table for Base-k Chord by using symmetrical bidirectional structure, which just like the 2-Chords, the difference between them is the hop sequences base from 2 to k. Concretely, keeping the odd items in the finger table unchanged, while re-directing the odd items to back direction, does not change the size of the finger table. A new routing algorithm is developed, which always chooses the nearest finger to the destination node. Interesting experimental results show that 1) symmetrical bidirectional Base-k Chord has better routing efficiency than its counterparts when the k is even; 2)and the routing efficiency of symmetrical bidirectional Base-k Chord is equal(worse more often) to its counterparts almost when the k is odd. We analyze the causation between the structure of symmetrical bidirectional Base-k Chord and the routing efficiency.
Huayun Yan Jihong Guan Yunliang Jiang
College of Electronics & Information Engineering, Tongji University 201804 Shanghai,China School of Information & Engineering, Huzhou Teachers College 313000 Huzhou,China
国际会议
Fifth International Conference on Semantics,Knowledge and Grid(第五届语义、知识与网格国际会议 SKG 2009)
珠海
英文
371-375
2009-10-12（万方平台首次上网日期，不代表论文的发表时间）