期刊文献+

一个MPLS流量工程的QoS路由算法 被引量:1

A QoS routing algorithm of MPLS traffic engineering
下载PDF
导出
摘要 传统Internet中,多媒体流量和实时电子商务应用会引起品质的降低。这可以通过在网络中动态地建立有带宽和延迟保证的路径来解决。讨论了基本算法,如最宽最短路径(WSP),复杂一些的算法如最小冲突路由(MIRA)或基于剖面的路由。提出了一个新的MPLS网络中的Diff-Serv流的QoS路由算法。这个方法在维持网络效率的同时,有效地传输多媒体流量。 Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet.These problems can be overcome in networks which feature dynamically set up paths with bandwidth and delay guarantees.This paper discuss es on basic algorithms such as widest shortest path(WSP) and more complicated ones such as the minimum interference routing(MIRA) or profile-based routing.Then it proposes a new QoS routing algorithm for Diff-Serv flows in MPLS networks.This method allows the network to transparently transport multimedia traffic whilst maintaining network efficiency.
出处 《信息技术》 2010年第8期153-155,共3页 Information Technology
关键词 流量工程 MPLS QOS路由 算法 traffic engineering MPLS QoS routing algorithm
  • 相关文献

参考文献7

二级参考文献35

  • 1Jeff Doyle.TCP/IP路由技术[M].清华大学出版社,1999,4..
  • 2E.米涅卡.网络和图的最优算法[M].中国铁道出版社,1998,4..
  • 3[1]S. Voss, Steiner problem in graphs: heuristic methods, Discrete Applied Mathematics, 1992.40(1), 271-287.
  • 4[2]F. Bauer, A. Varma, Degree-constrained multicasting in point-to-point networks, IEEE INFO COM'95, Los Alamitos, CA: IEEE Computer Society Press, 1995, 369-376.
  • 5[3]F. Bauer, Distributed degree-constrained multicasting in point-t,o-point networks, In http://www.cse.ucse.edu.
  • 6[4]M. Parsa, Qing Zhu, An iterative algorithm for delay-constrained minilnuin-cost multicasting,IEEE/ACM Trans. on Networking, 1998, 6(4), 461-474.
  • 7[5]H.F.Salama, Evaluation of multicast routing algorithms for real-time communication on high sped networks, IEEE J. on Select. Areas Commun, 1997, 15(3), 332-345.
  • 8[6]R. T. Wong, A dual ascent approach to Steiner tree problem on a directed graph, Mathematical Programming, 1984,28(3), 271-287.
  • 9[7]M.S. Bazaraa, Nonlinear Programming: Theory and Algorithms, New York: John Wiley &'. Sons,Inc., 1979, 84-89.
  • 10[8]B. Waxman, Routing of multipoint connections, IEEE J. on Select. Areas Commun, 1988, 6(9),1617- 1622.

共引文献28

同被引文献4

引证文献1

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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