一種MPLS網(wǎng)絡(luò)擁塞最小化的全局路由優(yōu)化算法
A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network
-
摘要: 提出一種啟發(fā)式群搜索雙螺旋優(yōu)化算法,求解MPLS網(wǎng)絡(luò)路由全局優(yōu)化問題,優(yōu)化目標是使網(wǎng)絡(luò)擁塞最小化。算法采用群局部搜索,利用混沌變量產(chǎn)生一組分布好的初始解,在鄰域搜索過程中融入啟發(fā)式信息,并設(shè)計了特別的貪婪重路由以及擴展貪婪原則,提高了算法效率和全局搜索能力。通過仿真比較說明了所提算法的有效性,及其顯著改善網(wǎng)絡(luò)性能的意義。
-
關(guān)鍵詞:
- 流量工程; MPLS; 局部搜索; 貪婪原則; 混沌
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. -
[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]王凌.智能優(yōu)化算法及其應(yīng)用[M].北京:清華大學出版社,2001:12-13.[7]李兵,蔣慰孫.混沌方法及其應(yīng)用[J].控制理論與應(yīng)用,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. -
計量
- 文章訪問數(shù): 2566
- HTML全文瀏覽量: 115
- PDF下載量: 600
- 被引次數(shù): 0