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

  • Authors:

  • Jérôme Truffot;Christophe Duhamel;Philippe Mahey

  • Affiliations:

  • LIMOS, UMR 6158-CNRS, Université Blaise-Pascal, BP 10125, Aubière 63173, France;LIMOS, UMR 6158-CNRS, Université Blaise-Pascal, BP 10125, Aubière 63173, France;LIMOS, UMR 6158-CNRS, Université Blaise-Pascal, BP 10125, Aubière 63173, France

  • Venue:
  • Networks - Networks Optimization Workshop, August 22–25, 2006
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010