QoS-Constrained Multi-Path Routing for High-End Network Applications

We present a multi-path computation algorithm to find a set of paths for the given demand and use Integer Linear Programming (ILP) approach to derive an optimal solution to maximize the achievable bandwidth and minimize the required memory size. We discuss the applicability of the proposed methods in multi-domain settings and present three application schemes in a multi-homing environment. Numerical and simulation results show that the proposed multi-path routing algorithm has better performance in bandwidth as compared to traditional single path routing. Especially the multi-path multi-domain application schemes can provision more bandwidth even with partial visibility. Therefore, it can be used as a viable solution to accommodate the emerging high-end applications with extremely high bandwidth requirements in current networks.