k-splittable delay constrained routing problem: A branch and price approach

Routing problems which include a QoS based path control play a key role in broadband communication networks. We analyze here an algorithmic procedure based on branch and price algorithm and on the flow deviation method to solve a nonlinear k-splittable flow problem. The model can support end-to-end delay bounds on each path and we compare the behavior of the algorithm with and without these constraints. The trade-off between QoS guarantees and CPU time is clearly established and we show that minimizing the average delay on all arcs will yield solutions close to the optimal one at a significant computational saving.

[1]  Alper Atamtürk,et al.  On splittable and unsplittable flow capacitated network design arc–set polyhedra , 2002, Math. Program..

[2]  Ronald Koch,et al.  Approximation and Complexity of k-Splittable Flows , 2005, WAOA.

[3]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[4]  Daniel Bienstock,et al.  Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

[5]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[6]  Martin Skutella,et al.  Flows on Few Paths: Algorithms and Lower Bounds , 2004, ESA.

[7]  Anthony E. Krzesinski,et al.  Path selection and bandwidth allocation in MPLS networks , 2003, Perform. Evaluation.

[8]  Christophe Duhamel,et al.  A Branch and Price algorithm for the k-splittable maximum flow problem , 2008, Discret. Optim..

[9]  Song Xu,et al.  Smoothing Method for Minimax Problems , 2001, Comput. Optim. Appl..

[10]  Martin Skutella,et al.  The k-Splittable Flow Problem , 2002, Algorithmica.

[11]  Daniel Bienstock,et al.  Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem , 2002, Math. Program..

[12]  Walid Ben-Ameur,et al.  Mathematical Models of the Delay Constrained Routing Problem , 2006, Algorithmic Oper. Res..

[13]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[14]  Stavros G. Kolliopoulos.  Minimum-cost single-source 2-splittable flow , 2005, Inf. Process. Lett..

[15]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[16]  Marina Thottan,et al.  A simple polynomial time framework for reduced-path decomposition in multipath routing , 2004, IEEE INFOCOM 2004.

[17]  P. Mahey,et al.  Multicommodity flow problems with a bounded number of paths: A flow deviation approach , 2007 .

[18]  J. M. Valério de Carvalho,et al.  Comparing Branch-and-price Algorithms for the Unsplittable Multicommodity Flow Problem , 2003 .