Hybrid Multi-commodity-Based Widest Disjoint Path Algorithm (HMBWDP)

The paper deals with the Traffic Engineering for online multi-path routing in MPLS networks. The algorithm presented is inspired from the concept of profile classes (in which the traffic demands are classified into various profile classes which are generated based on the SLAs signed by the Internet users). In the proposed algorithm, multi-commodity network flow formulation is used to prevent network bottlenecks and to ensure minimum rejected requests/traffic demands. In the proposed algorithm SLAs, Global and Local quasi-static knowledge about the network are used to generate multi-commodities based “profile classes” in the first phase and then these multi-commodities flows are distributed over Widest Disjoint Paths with respect to the bottleneck links in the second phase. The combination of multi-commodity-based flows and the disjoint paths w.r.t. bottlenecks prevents the network from saturation point which helps in minimizing the congestion, delays, rejected requests, and maximizing the throughput, i.e., improving the overall performance of the network.