A simple polynomial time framework for reduced-path decomposition in multipath routing

• Published in: IEEE INFOCOM 2004 Vol. 1
• Main Authors: Mirrokni, V.S., Thottan, M., Uzunalioglu, H., Paul, S.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2004
• Subjects: Bandwidth; Capacity planning; Intelligent networks; Knowledge management; Multiprotocol label switching; Path planning; Polynomials; Routing; Telecommunication traffic; Tiles
• ISBN: 0780383559; 9780780383555
• ISSN: 0743-166X; 2641-9874
• DOI: 10.1109/INFCOM.2004.1354544

The recent reduction in telecommunications spending has increased the importance of network planning to improve the return on investment on the existing network infrastructures. Therefore, tools that help in maximizing the bandwidth efficiency of the network at a minimum cost are essential. Previous work in this area focused on increasing bandwidth efficiency and reliability. In this work, in addition to increasing the bandwidth efficiency, we address the complexity of network management and operations. This issue is explicitly addressed by our novel framework, a simple polynomial time algorithm (SimPol) that achieves optimum network performance (in terms of congestion or bandwidth consumption) using only a small number of paths. The problem formulation is based on splittable multicommodity flows. Using SimPol we show that the total number of paths is at most k+m, where k and m are the numbers of demands and edges in the network, respectively. We extend the basic framework into an integer programming formulation to address the tradeoff between network congestion and the total number of paths. We also use SimPol to address the problem of implementing path/link policies such as bandwidth-limited paths. The performance of SimPol is evaluated through extensive simulations. Using the integer programming approach, we can get exactly one path while losing about 10% to 50% in congestion depending on the number of demands. This congestion is, however, far better than the traditional shortest path routing. The framework is general and can be used in capacity planning for transport networks such as MPLS and ATM.