A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network

Liu Hong; Bai Dong; Ding Wei

Volume 26 Issue 4

Apr. 2004

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2004 > 26(4): 531-535

Liu Hong, Bai Dong, Ding Wei. A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network[J]. Journal of Electronics & Information Technology, 2004, 26(4): 531-535.

Citation:

Liu Hong, Bai Dong, Ding Wei. A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network[J]. Journal of Electronics & Information Technology, 2004, 26(4): 531-535.

Liu Hong, Bai Dong, Ding Wei. A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network[J]. Journal of Electronics & Information Technology, 2004, 26(4): 531-535.

Citation:

Liu Hong, Bai Dong, Ding Wei. A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network[J]. Journal of Electronics & Information Technology, 2004, 26(4): 531-535.

PDF( 1192 KB)

A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network

Liu Hong^①;白栋,
Bai Dong,
Ding Wei

Received Date: 2002-12-30
Rev Recd Date: 2003-07-03
Publish Date: 2004-04-19

Abstract

Abstract

A heuristic algorithm based on group local search and double spiral process is proposed in this article, which is applied to optimizing global routing with the objective of network congestion minimization. It makes use of chaos variable to find initial solutions with favorable distribution, combines with heuristic knowledge in local search process, and puts forward especial greedy rerouting and extended greedy principal, all of which are to increase efficiency and global search ability. Simulations manifest its effectiveness and notable virtual value in improving network performance.

FullText(HTML)

References(1)

References

［1］Awduche D, Malcolm J, Agogbua J, et al.. Requirements for traffic engineering over MPLS[S].RFC 2702, Sept. 1999.[2]Xiao X P. Traffic engineering with MPLS in the Internet. IEEE Networking[J], 2000, 14(2):28-33.[3]Girish M K, Zhou B, Hu J Q. Formulation of the traffic engineeringproblems in MPLS based IP networks[A]. Fifth IEEE ISCC[C], Antibes, France, 2000: 214-219.[4]Wang Y F.[J].Wang Z. Explicit routing algorithms for Internet traffic engineering[A]. IEEE ICCCN99[C], Boston, MA.1999,:-[5]Lee Y, Seok Y, Choi Y. A constrained multipath traffic engineering scheme for MPLS networks[A].ICC 2002[C], New York, 2002, 2431-2436.[6]王凌.智能优化算法及其应用[M].北京:清华大学出版社,2001:12-13.[7]李兵,蒋慰孙.混沌方法及其应用[J].控制理论与应用,1997,14(4):613-615.[8]Waxman B M. Routing of multipoint connections[J].IEEE J. on Selected Areas in Communications.1988, 6(9):1617-1622[9]Fortz B, Thorup M. Internet traffic engineering by optimizing OSPF weights[A]. INFOCOM2000[C], Israel, 2000: 519-528.

Relative Articles

Supplements(0)

Cited By

Proportional views