In this paper we give a mathematical model and propose a heuristic approach for the dimensioning of 3G multimedia networks with both a radio and a core components. We assume that we know a priori the traffic over the planning period. Moreover the dimensioning is defined with a best possible call admission control procedure. We will briefly show that solving this problem with an optimal method is not an easy task because of its exponential computational time, so we propose a heuristic approach using tabu search. We then give some experimental results for some multimedia network dimensioning problems.

We propose a tabu search metaheuristic for the optimal management of a set of satellite views. This optimization problem was proposed for the 2003 ROADEF challenge and sponsored by CNES-ONER. Details of the problem description can be found at http://www.prism.uvsq.fr/~vdc/ROADEF/CHALLENGES/2003. It consists of selecting and ordering a set of views, for a given satellite half revolution. We will describe the Tabu Search algorithm that we designed in order to solve this problem, and compare it with the other results presented at the 2003 ROADEF conference last February in Avignon, France.

We explore column generation models for the dimensioning of 3G multiservice networks in order to exploit the natural decomposition between the radio and the core network. Several reformulations of an earlier mixed 0-1 linear program will be proposed and discussed.

We investigate aggregate scheduling algorithms for the management of multiservice networks. We will discuss the advantages and disadvantages of the aggregate scheduling policies with respect to several quality of service criteria, as well as with respect to congestion control in multimedia networks. Preliminary computational results will be presented.