%0 Journal Article
%T A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network<br>一种MPLS网络拥塞最小化的全局路由优化算法
%A Liu Hong
%A Bai Dong
%A Ding Wei
%A <br>刘红
%A 白栋
%A 丁炜
%J 电子与信息学报
%D 2004
%I 
%X 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.
%K Traffic engineering
%K MPLS
%K Local search
%K Greedy principle
%K Chaos<br>流量工程
%K MPLS
%K 局部搜索
%K 贪婪原则
%K 混沌
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=024FF81306E61E6A&yid=D0E58B75BFD8E51C&vid=96C778EE049EE47D&iid=E158A972A605785F&sid=20ADD38F841C6A4B&eid=A726E84831FE609B&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=2&reference_num=9