Translator Disclaimer
10 September 2007 A tree-index routing structure in a peer-to-peer system
Author Affiliations +
Abstract
DHT (Distributed Hash Table) is the key technology in structured P2P. DHT sets up logic topology with certain structure among the nodes and builds relations between nodes and data resources according to some rules. Routing table structure based on B+ tree for DHT is presented which builds up the balanced multilevel ordered tree-indexes to the routing tables so as to form levels indexes and ordered link between nodes. In term of this method, key search performs along the ordered indexes in B+ tree and the problem of resources location which is the core problem in DHT network is resolved efficiently. This Routing table structure is of advantaged to manage numerous routing information in network and makes the ruleless information well-regulated. It not only enhances the lookup efficiency and achieves the range search but also can control the lookup length in the height of B+ tree. When nodes join and depart, index structure can make the maintained routing information few in each node by updating linked message only. At the same time, for linked information of successor node being mainly stored in every node, the storage cost is decreased. It is effective and scalable routing table structure.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mei Yu, Zheng Zhao, Jian Yu, Zhichao Zhao, and Qingwei Shi "A tree-index routing structure in a peer-to-peer system", Proc. SPIE 6773, Next-Generation Communication and Sensor Networks 2007, 67730G (10 September 2007); https://doi.org/10.1117/12.732834
PROCEEDINGS
8 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top