TaChord:利用拓扑相关路由算法和超级节点的Chord系统

由于未考虑实际网络拓扑结构,当前结构化对等网络系统存在高延迟低效率的毛病. 本文提出一种与实际网络拓扑结构相关的路由方法,并开发出一种基于Chord的TaChord系统. 在仿真系统中, 用物理跳数、域间延迟和每个消息占用的带宽来衡量TaChord和其他系统的路由性能. 仿真结果表明,TaChord系统的路由性能有了极大的提高, 如平均物理跳数是Chord的一半,并且不同路由缓存管理策略对TaChord的路由性能能产生重要的影响.

TaChord:a Chord system using topology-aware routing and super peers

Due to minimum consideration of an actual network topology, the existing peer-to-peer (P2P) overlay networks, such as CAN, Chord, Pastry and Tapestry, will lead to high latency and low efficiency. In TaChord, a topology-aware routing approach in P2P overlays and an improved design in Chord are presented. TaChord and other algorithms are evaluated by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. Experimental results demonstrate that TaChord has the drastic improvement in routing performance where average physical hop is half that of chord, and the impact of cache management strategies in the TaChord overlay cannot be neglected.