期刊文献+

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

DHT-based method for discovering multiple end-to-end overlay network paths
下载PDF
导出
摘要 为进一步提高端到端数据传输的吞吐率,提出基于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.
作者 刘军 张琳
出处 《计算机工程与设计》 CSCD 北大核心 2008年第16期4197-4199,共3页 Computer Engineering and Design
基金 河南省教育厅技术研究基金项目(2007520001)
关键词 P2P 分布式散列表 覆盖网 并行传输 吞吐率 P2P distributed hash table overlay network parallel transfer throughput
  • 相关文献

参考文献8

  • 1Pradnya K,Mostafa A,Ellen Z.Optimizing end-to-end throughput for data transfers on an overlay-TCP path[C].RaoufB,Kevin A,Ramon P, et al.Networking 2005.Heidelberg: Springer,2005: 943-955.
  • 2Himabindu P, Charlie H Y. Overlay TCP: Ending end-to-end transport for higher throughput[C].Roch G,Ramesh G,Greg M. Proc SIGCOMM.New York:ACM Press,2005:119-120.
  • 3Han H,Shakkottai S,Hollot C V, et al.Multi-path TCP: A joint congestion control and routing scheme to emploit path diversity in the Internet [J]. IEEE/ACM Transactions on Networking, 2006,14(6): 1260-1271.
  • 4胡进锋,黎明,郑纬民,汪东升.带宽自适应的P2P网络路由协议[J].软件学报,2005,16(5):991-999. 被引量:14
  • 5冯国富,毛莺池,陆桑璐,陈道蓄.PeerRank:一种无结构P2P资源发现策略[J].软件学报,2006,17(5):1098-1106. 被引量:19
  • 6Qi H, Constantine D, Mostafa A.On the predictability of larger transfer TCP throughput [C]. Roch G, Ramesh G, Greg M. Proc SIGCOMM.New York:ACM Press,2005:145-156.
  • 7Antony R,Peter D.Pastry: Scalable,decentralized object location and routing for larger-scale peer-to-peer systems[C].Rachid G. Middleware 2001: IFIP/ACM International Conference on Distributed Systems Platforms.Heidelberg: Springer,2001:329-350.
  • 8Hari B,M Frans K,David K,et al.Looking up data in P2P systems [J].Communication of the ACM,2003,46(2):43-48.

二级参考文献18

  • 1Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Berkeley: Computer Science Division, 2001.
  • 2Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: Proc. of the Int'l Conf. on Distributed Systems Platforms 2001. http://research.microsoft.com/~antr/Pastry/
  • 3Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Proc. of the SIGCOMM 2001.2001. http://www.acm.org/sigs/sigcomm/sigcomm2001 /
  • 4Cox R, Muthitacharoen A, Morris R. Serving DNS using chord. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. 2002.http://www.cs.rice.edu/Conferences/IPTPS02/
  • 5Jain S, Mahajan R, Wetherall D. A study of the performance potential of DHT-based overlays. In: Proc. of the 4th USENIX Symp.on Internet Technologies and Systems. 2003. http://www.usenix.org/events/usits03/
  • 6Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to-peer overlays. In: Proc. of the 9th Workshop on Hot Topics in Operating Systems. 2003. http://www.usenix.org/events/hotos03/
  • 7Xu J. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proc .of the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies 2003. http://www.ieee-infocom.org/2003/
  • 8Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
  • 9Loguinov D, Kumar A, Rai V, Ganesh S. Graph-Theoretic analysis of structured peer-to-peer systems-routing distances and fault resilience. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
  • 10Gupta I, Birman K, Linga P, Demers A, van Renesse R. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems. 2003. http://iptps03.cs.berkeley.edu/

共引文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部