基于DHT发现端到端多条覆盖网路径的方法  

DHT-based method for discovering multiple end-to-end overlay network paths

作　　者：刘军[1] 张琳[1] 

机构地区：[1]河南财经学院计算中心,河南郑州450002

出　　处：《计算机工程与设计》2008年第16期4197-4199,共3页Computer Engineering and Design

基　　金：河南省教育厅技术研究基金项目(2007520001)

摘　　要：为进一步提高端到端数据传输的吞吐率,提出基于DHT发现多条覆盖网路径的方法。一条覆盖网路径由若干跳构成,而数据吞吐率依赖各跳传输性能的瓶颈。为消除瓶颈,根据数据到达结点的吞吐率选择往返延迟时间较小的若干下一跳结点,使得数据不会在该结点拥塞。结点DHT维护着到各下一跳结点的往返延迟时间,基于DHT可发现端-端多条覆盖路径,从而实现并行数据传输。实验结果表明,该方法可找到适合的多条端到端路径,并行传输可取得比单路径传输更大的吞吐率。To further improve throughput ofend-to-end data transfer, a method for discovering multiple overlay network paths is proposed based on DHT. An overlay network path comprises some hops, while the data throughput of the path depends upon the bottleneck of transfer performance ofall hops. To eliminate these bottlenecks, some next-hop nodes with lower round trip time are selected according to the throughput of data arriving at the node, thus no data congestion occurred at the node. The DHT on each node maintained the round trip time to each next-hop node, and the end-end multiple paths could be found based on DHT so that the parallel data transfer is implemented. Shown as experiment analyses, this method can find multiple appropriate end-to-end paths, and the parallel transfer can obtain higher throughput than single-path transfer.

关 键 词：P2P 分布式散列表 覆盖网 并行传输 吞吐率 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]