首页 | 本学科首页   官方微博 | 高级检索  
     

基于DHT发现端到端多条覆盖网路径的方法
引用本文:刘军,张琳.基于DHT发现端到端多条覆盖网路径的方法[J].计算机工程与设计,2008,29(16).
作者姓名:刘军  张琳
作者单位:河南财经学院,计算中心,河南,郑州,450002
基金项目:河南省教育厅技术研究基金
摘    要:为进一步提高端到端数据传输的吞吐率,提出基于DHT发现多条覆盖网路径的方法.一条覆盖网路径由若干跳构成,而数据吞吐率依赖各跳传输性能的瓶颈.为消除瓶颈,根据数据到达结点的吞吐率选择往返延迟时间较小的若干下一跳结点,使得数据不会在该结点拥塞.结点DHT维护着到各下一跳结点的往返延迟时间,基于DHT可发现端-端多条覆盖路径,从而实现并行数据传输.实验结果表明,该方法可找到适合的多条端到端路径,并行传输可取得比单路径传榆更大的吞吐率.

关 键 词:分布式散列表  覆盖网  并行传榆  吞吐率

DHT-based method for discovering multiple end-to-end overlay network paths
LIU Jun,ZHANG Lin.DHT-based method for discovering multiple end-to-end overlay network paths[J].Computer Engineering and Design,2008,29(16).
Authors:LIU Jun  ZHANG Lin
Affiliation:LIU Jun,ZHANG Lin(Computer Center,Henan University of Finance , Economics,Zhengzhou 450002,China)
Abstract:To further improve throughput of end-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 of all 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 th...
Keywords:P2P
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号