计算机应用 ›› 2010, Vol. 30 ›› Issue (10): 2645-2647.

• 网络与通信 • 上一篇    下一篇

基于Chord的P2P路由模型

赵静1,张振宇2   

  1. 1. 新疆大学信息科学与工程学院
    2. 新疆大学 信息科学与工程学院
  • 收稿日期:2010-04-12 修回日期:2010-06-04 发布日期:2010-09-21 出版日期:2010-10-01
  • 通讯作者: 赵静

Peer-to-Peer routing model based on Chord

  • Received:2010-04-12 Revised:2010-06-04 Online:2010-09-21 Published:2010-10-01

摘要: 针对现有P2P路由模型存在逻辑拓扑与物理拓扑失配和没有考虑节点异构性的不足,基于Chord提出了一种新的路由模型。该模型利用IPv6的地址聚类性,通过分段哈希节点IP,构建具有层次特性的节点标识符,实现逻辑拓扑与物理拓扑的有效结合;根据网络规模动态调整聚类级别,将节点映射到多层Chord环上,实现聚类内部自治;考虑节点的性能差异,让性能好的节点承担更多的路由任务。模拟实验表明,该模型能保持与Chord接近的平均跳数,但降低了存储开销和查询时延。

关键词: 对等网, 路由模型, 异构性, Chord, IPv6, 地址聚类性

Abstract: In view of the inconsistence between logical topology and physical topology, and neglect of the heterogeneity of nodes, a new Peer-to-Peer (P2P) routing model based on Chord was proposed. Using address aggregation of IPv6 and hashing node's IP partly, it got hierarchy node's identifier and achieved topological consistency. According to the size of the network, it mapped nodes to multi-layer Chord rings, so that nodes in the same aggregation could domain themselves. Considering the heterogeneity of nodes, well-behaved nodes were assigned more routing tasks. The simulation results show that the proposed model can keep an average routing hops length similar to Chord, but reduce storage cost and search delay.

Key words: Peer-to-Peer (P2P) network, routing model, heterogeneity, Chord, IPv6, address aggregation

中图分类号: