DORA: Efficient Routing for MPLS Traffic Engineering

被引：45

作者：

Boutaba R. ^{[1
,2
]}

Szeto W. ^{[1
]}

Iraqi Y. ^{[1
]}

机构：

[1] Department of Computer Science, University of Waterloo, Waterloo

[2] Department of Computer Science, University of Waterloo, Waterloo, Ont. N2L 3G1

来源：

Journal of Network and Systems Management | 2002年 / 10卷 / 03期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Constraint-based routing; MPLS; Traffic engineering;

D O I：

10.1023/A:1019810526535

中图分类号：

学科分类号：

摘要：

This paper introduces DORA, a dynamic online routing algorithm for construction of bandwidth guaranteed paths in MPLS-enabled networks. The main objective of DORA is to place paths with reserved bandwidth evenly across the network in order to allow more future paths to be accepted into the network and to balance the traffic load. During path computation, the key operation in DORA is to avoid routing over links that (1) have high potential to be part of any other path, and (2) have low residual bandwidth available. Our simulation results based on unsuccessful path-setup ratio and successful path-reroutes upon link failure, show that DORA offers better performance than some sophisticated algorithms, while at the same time being less computationally expensive.

引用

页码：309 / 325

页数：16

共 18 条

[1]

Kar K., Kodialam M., Lakshman T.V., Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications, IEEE Journal on Selected Areas in Communications: Quality of Service in the Internet, 18, 12, pp. 921-940, (2000)

[2]

Suri S., Waldvogel M., Warkhede P.R., Profile-based routing: A new framework for MPLS traffic engineering, Quality of Future Internet Services, (2001)

[3]

Fortz B., Thorup M., Internet traffic engineering by optimizing OSPF weights, Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communication Societies (IEEE INFOCOM), (2000)

[4]

Wang Y., Wang Z., Explicit routing algorithms for internet traffic engineering, Proceedings of the 8th Computer Communications and Networks, (1999)

[5]

Liu Z., Sun Y., Xue X., A static routing algorithm used in the Internet traffic engineering, Proceedings of the 7th Asian-Pacific Conference on Circuits and Systems (IEEE APCCAS), (2000)

[6]

Garey M.R., Johnson D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, (1979)

[7]

Katz D., Yeung D., Kompella K., Traffic engineering extensions to OSPF, Internet Draft, (2001)

[8]

Li T., Smit H., IS-IS extensions for traffic engineering, Internet Draft, (2001)

[9]

McCanne S., Floyd S., Network Simulator, 2

[10]

Goldberg A.V., Tarjan R.E., A new Approach to the maximum flow problem, Journal of ACM (JACM), 35, 4, (1988)

← 1 2 →