期刊文献+

多路径环境下电信流量模型研究 被引量:1

Research on Traffic Model of Multipath Environment based on Network Flow
下载PDF
导出
摘要 在下一代通信网络中,一个终端可同时拥有多个网络接口,在一对源、目的终端间存在多条可用路径。这为网络通信提供了一种全新的思路,即利用多条路径并发进行数据传输。针对多路径传输出现的问题,文章为多路径传输建立了流量模型,分析了多路径传输流媒体的优势,提出了"流体带宽"和"流体调度"的概念,并引入网络流理论计算了多路径环境下的目标流量。 In the next generation network,a host could have more than one network interface,and there are a number of available paths between a pair of source and destination hosts.This provides a novel idea of utilizing multiple paths between a set of senders and a receiver in data transmission.The benefit of multipath streaming media is summarized, the traffic of multipath transfer is modeled,the "Liquid Throughput"and"Liquid Scheduling"concept is proposed,and the maximum traffic is found in polynomial time through a standard max-flow algorithm.By considering a more expressive model for characterizing the path continuous losses,a system with two paths is modeled by a 4-state Markov chain depend on the correlation of paths.
作者 吴畏 杜靖红
出处 《现代电信科技》 2011年第10期33-36,共4页 Modern Science & Technology of Telecommunications
关键词 网络流 多宿主 多路径传输 流量模型 network flow multihoming multipath transfer traffic model
  • 相关文献

参考文献7

  • 1Golubchik L. & J.C.S. Lui, T.F. Tung, et al. Multi-path continuous me- dia streaming: what are the benefits[J]. Performance Evaluation. 2002, (49): 429-449.
  • 2Stewart R. & Stream Control Transmission Prot~ol [S]. RFC 4960.2007.
  • 3Iyengar J. R. & P. Amer, R. Stewart. Concurrent multipath transfer us- ing SCTP multihoming over independent end-to-end paths [J]. IEEE/ACM Transactions on Networking.2006,14(5): 951-964.
  • 4Ford A. & C. Raiciu.TCP Extensions for Multipath Operation with Mul- tiple Addresses IS]. IETF Intemet-Draft, draft-ford-mptcpmultiad- dressed. 2010.
  • 5Melamed B. & K. Sohraby, Y. Wardi. Measurement-Based Hybrid Flu- id-Flow Models for Fast Multi-Scale Simulation [R]. DARPA/NMS Pro- ject.2000.
  • 6Ahuja R. K. & T. L. Magnanti, J. B. Orlin. Network Flows: Theory, Al- gorithm, and Apphcations [M]. Englewood Cliffs, N J: Prentice Hall, 1993.
  • 7张宪超,陈国良,万颖瑜.网络最大流问题研究进展[J].计算机研究与发展,2003,40(9):1281-1292. 被引量:52

二级参考文献126

  • 1R K Ahuja, J B Orlin. A fast and simple algorithm for the maximum flow problem. Oper Res, 1989, 37(5) : 748~759.
  • 2R K Ahuja, J B Orlin, R E Tarjan. Improved time bounds for the maximum flow problem. SIAM J Computing, 1989, 18(5): 939-954.
  • 3N Alon. Generating pseudo-random permutations and maximum flow algorithms. Information Processing Letters, 1990, 35 ( 4 ) :201-203.
  • 4V King, S Rao, R Tarjan. A faster deterministic maximum flow algorithm. J Algorithms, 1994, 17(3): 447~474.
  • 5J Cheriyan, T Hagerup, K Mehlhom. An O( n^3)-time maximum flow algorithm. SIAMJ Computing, 1996, 25(6): 1144~1170.
  • 6H N Gabow. Scaling algorithms for network problems. J Comput System Sci, 1985, 31(2): 148-168.
  • 7R K Ahuja, J B Orlin. Distance-directed augmenting path algorithms for the maximum flow problem. Naval Research Logisties Quarterlv. 1991. 38(2): 413~430.
  • 8V M Malhotra, M P Kumar, S N Mahesh-wari. An O ( | V^3| )algorithm for finding maximum flows in networks. Information Processing Letters, 1978, 7(6) : 277~278.
  • 9A V Goldberg, R E Tarjan. Finding minimum-cost circulations by successive approximation. Math Oper Res, 1990, 15(3): 430~466.
  • 10D Hochbuam. The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem. In: R E Bixby, E A Boyd, Roger et al eds. Proc of the Integer Programming and Combinatorial Optimization 6th Int' l Conf ( LNCS 1412 ) .Heidelberg: Springer-Verlag, 1998. 325~337.

共引文献51

同被引文献2

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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