期刊文献+

Round-Robin分配方式下多径传输的重排序性能分析 被引量:4

Analysis on Packet Reordering under Multi-path Transfers with Round-Robin Packet Assignment
下载PDF
导出
摘要 基于包分配的多径传输在接收端所引起的数据包乱序严重影响TCP的传输性能。针对此问题,从排队论的角度出发对Round-Robin分配方式下多径传输的重排序问题进行了分析。从数据包的乱序率、重排序时间和端到端总时间3个方面考察了路径差异与路径数目对多径传输的性能的影响。结果表明,在采用两条路径传输时,应使得两条路径的传输速率近似相同;在路径传输速率相同的条件下,为明显地提升多径传输的重排序性能,路径数目应不超过4条。 Packet-level multi-path transfers can cause packets reordering at the destination,this profoundly affects TCP performance.Addressing with this problem,reordering performance under multi-path transfers with Round-Robin packet assignment is analyzed in the view of queuing theory.The influence of path difference and path numbers on reordering performance under multi-path transfers is discussed with respect to three criterions: disorder rate,resequencing time and end-to-end total time.Results demonstrate that it is preferable to make paths with closer transmission rate for two paths transfers,and the paths number dose not exceed four to significantly improve the reorder performance if the paths have the same transmission rate.
出处 《电子与信息学报》 EI CSCD 北大核心 2011年第8期1943-1948,共6页 Journal of Electronics & Information Technology
基金 国家十一五科技支撑计划基金(2008BAH37B02-2 2008BAH37B03)资助课题
关键词 多径传输 数据包重排序 排队系统 重排序时间 Multi-path transfers Packets reordering Queuing system Resequencing time
  • 相关文献

参考文献11

  • 1Iyengar J R, Amer P D, and Stewart R. Coneurrent multipath transfer using SCTP multihoming over independent end-to-end paths[J]. IEEE/AC'M Transactions on Networking, 2006, 14(5): 951-964.
  • 2Bing W, Wei W, Zheng W, et al.. Multipath live streaming via TCP: schenle, perfbrmanee and benefits[J]. ACM Transactions on Multimedia Computing, Communications, and Applications, 2009, 5(3): 1-23.
  • 3Evensen K, Kaspar D, Engelstand P, et al. A network-layer proxy tbr bandwidth aggregation and reduction of IP packet reordering[C]. 34th Annual IEEE Conference on Local Computer Networks, Zurich, Switzerland, 2009: 585-592.
  • 4Bai V, Weiping Z, Botta A, et al. A markovian approach to multipath data transfer in overlay networks[J]. IEEE Transactions on Par'allel and Distributed Systerms, 2010, 21(10): 1398-1411.
  • 5Jie F, Zhipeng O, Lisong X, et al. Packet reordering in high-speed networks and its impact on high-speed TCP variants[J]. Computer Communications, 2009, 32(1): 62-68.
  • 6Iliadis I and Lien L Y C. Resequencing delay for a queueing system with two heterogeneous servers under a threshold- type scheduling[J]. IEEE Transactions on Communicaltions, 1988, 36(6): 692-702.
  • 7Chowdhury S. An analysis of virtual circuits with parallel links[J]. IEEE Transaetions on Communications , 1991, 39(8) 1184-1188.
  • 8Jean-Marie A and Grin L. Parallel queues with resequencing[J]. Journal of the A CM, 1993, 40(5): 1188 1208.
  • 9Tsoukatos K and Makowski A. Asymptotic optimality of the Round-Robin policy in multipath routing with resequencing[J]. Queueing S?lstems, 2006, 52(3): 199-214.
  • 10Han Y and Makowski A. Resequencing delays under multipath routing-asymptotics in a simple queueing model[C] IEEE International Conference on Computer Communications, Piscataway, Spain, 2006:1-12.

同被引文献40

  • 1彭晓明,郭浩然,庞建民.多核处理器——技术、趋势和挑战[J].计算机科学,2012,39(S3):320-326. 被引量:20
  • 2吕聪颖,于哲舟,周春光,王康平,庞巍.动态自适应蚁群算法在二次分配问题中的应用[J].吉林大学学报(理学版),2005,43(4):477-480. 被引量:19
  • 3张哲,高小鹏,龙翔.适用于虚通道路由器的高性能round-robin仲裁器[J].北京航空航天大学学报,2007,33(6):743-747. 被引量:3
  • 4John H,Marburger I.Floyd Kvamme Leadership under challenge: Information technology R&D in a competitive world.An assessment of the federal networking and information technology R&D program 2010[Z].
  • 5Iyengar,J.R., Amer,P.D.,Stewart,R.Transactions on Networking[J].2006,14(05).
  • 6刘书明;罗勇江.ADSP TS20XS 系列 DSP 原理与应用设计[M]{H}北京:电子工业出版社,20071-7.
  • 7IEC. IEC61375-1:1999 Electric Railway Equipment Train Bus-Part 1: Train Communication Network IS]. Genva: IEC, 1999.
  • 8Shreedhar M, Varghese G. Efficient Fair Queueing Using Dedicit Round Robin [J]. IEEE/ACM Transactions on Networking, 1996, 4(3): 375-385.
  • 9Keshav Demers S, Shenker S. Design and analysis of a fair queuing algorithm. Proceedings of ACM SICCOMM, Austin, September, 1989, 1-12.
  • 10Bennett J C R, Zhang H. WF2Q: Worst-case fair weighted fair queueing. Proceedings of IEEE INFOCOM, San Francisco, CA, March 1996: 120-128.

引证文献4

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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