Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (1): 135-137.

• 网络、通信与安全 • Previous Articles     Next Articles

Routing structure based on B+ tree in Distributed Hash Table

YU Mei1,WU Pu-qing2,ZHAO Zheng1,YU Jian1   

  1. 1.School of Computer Science and Technology,Tianjin University,Tianjin 300072,China
    2.School of Electronic Engineering and Automation,Tianjin University,Tianjin 300072,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-01 Published:2008-01-01
  • Contact: YU Mei

基于B+树的分布式哈希表路由结构

喻 梅1,吴普青2,赵 政1,于 健1   

  1. 1.天津大学 计算机科学与技术学院,天津 300072
    2.天津大学 电气与自动化学院,天津 300072
  • 通讯作者: 喻 梅

Abstract: 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.

Key words: P2P, DHT(Distributed Hash Table), B+ tree, index

摘要: 在基于分布式哈希表构造的对等网络中,路由表的结构影响关键字的查询效率。B+树是一种有效查找的树型索引结构。考虑便于管理网络中众多的节点路由信息,提出一种基于B+树的路由结构,它通过为节点的路由信息建立索引,不仅提高了查询效率,将查找长度控制在树的高度内,而且使每个节点维护的路由信息尽可能少,减少了存储开销。

关键词: 对等网络, 分布式哈希表, B+树, 索引