A heuristic multi-path routing scheme for online traffic in MPLS networks

Abstract

Offline routing algorithms are used for network administrators to route flows on pre-optimized paths obtained through the traffic matrix. Online routing algorithms, however, find paths for dynamic LSP setup requests under multiple constraints such as bandwidth, delay and hop count. These both kinds of routing algorithms have key problems for traffic engineering. This paper presents a new Hybrid Optimization Algorithm (HOA) for dynamic routing of bandwidth guaranteed flows. The newly proposed algorithm decides the appropriate path among the route set which is predetermined by the offline routing algorithm. The simulation results show that the proposed algorithm is far better than previously developed algorithms on metrics such as total bandwidth accepted and rejection ratio.