Dynamic Constrained Multipath Routing for MPLS Networks

Abstract|Multipath routing employs multiple parallel paths between a traÆc source and destination in order to relax the most heavily congested link in Internet backbone. A large bandwidth path can be easily set up too. Although multi-path routing is useful, the total network resources, i.e. sum of link bandwidths consumed, could be wasted when the acquired path is larger(in terms of number of hops) than the conventional shortest path. In addition, even though we can accommodate more traÆc by establishing more paths between the same node pair, it is advised to limit the num-ber of paths for practical reason such as manageability. This paper presents a heuristic algorithm for hop-count and path-count constrained dynamic multipath routing. The objec-tive we adopted in this paper is to minimize the maximum of link utilization. We also obtain the traÆc split ratio among the paths, for routers based on traÆc partitioning by hash-ing at ow level. The extensive simulation results show that the proposed algorithm always minimizes the maximum of link utilization and reduces the number of blocked requests. I