**Friday, 15:45 - 16:10 h, Room: H 3503**

**Sara Mattia**

The robust network loading problem

**Abstract:**

The Robust Network Loading (RNL) problem is a generalization of the well known Network Loading (NL) problem. Given a graph with capacity installation costs for the edges, the RNL problem consists of choosing minimum cost integer capacities to serve all the demands belonging to a given polyhedron of feasible traffic matrices. If the routing scheme must be the same for all the matrices, it is called static or oblivious; if it can be changed according to the matrix, it is called dynamic. If each point-to-point demand in the matrix must be routed using a single path, the flows are called unsplittable, otherwise they are said to be splittable. In this talk we present an algorithm for solving the RNL with dynamic routing and splittable flows and a preliminary comparison between the static and the dynamic approach.

Talk 2 of the invited session Fri.3.H 3503

**"Robust network design and applications"** [...]

Cluster 23

**"Telecommunications & networks"** [...]