Routing structure based on B+ tree in Distributed Hash Table
Yu Jian · Computer Engineering and Applications Journal · 2008
In the peer-to-peer network based on Distributed Hash Table(DHT),the structure of routing table impacts the efficiency of searching keywords .B+ tree is a tree-index structure convenient for search.Routing structure based on B+ tree is presented in order to manage the routing information easily.B+ tree enhances the search efficiency by building the indexes to the routing information between nodes,and it can control the lookup length in the height of B+ tree.B+ tree index structure also decreases storage cost through making the maintained information of the nodes little as soon as possible.