|
|
A Global Routing Optimization Algorithm with Minimum Congestion in MPLS Network |
Liu Hong①;Bai Dong②;Ding Wei① |
①Broadband Comm. Network Lab Beijing Univ. of Posts and Telecomm.,Beijin66100876 China;②Satellite Communication Lab Peking University Beijing 100871 China |
|
|
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.
|
Received: 30 December 2002
|
|
|
|
|
|
|
|