Home DE ES FR


Advanced Search

Our On-Line PhDs

Submit a Thesis
My Account Register Help

About
Fields
Mathematics and Applications
Information and Communication Sciences and Technologies
Physics, Optics
Materials Science, Mechanics and Mechanical Engineering
Fluid Mechanics and Energy
Chemistry, Physical Chemistry and Chemical Engineering
Life Sciences and Engineering
Earth Sciences and Environmental Engineering
Sciences of Economy, Management and Society
Optimization Techniques for the Dimensioning and Reconfiguration of MPLS Networks

Beker, Sergio Ariel (2004) Optimization Techniques for the Dimensioning and Reconfiguration of MPLS Networks. PhD thesis Informatique et Réseaux, ENST - INFRES Informatique et Réseaux, ENST.

Full text available as:

- These_Sergio_Beker.pdf ( 2615 Kb )
Licence: Copyright

Abstract

The calculation of virtual topologies on mapped onto physical topologies is one of the main techniques in traffic engineering. For a given physical network topology with fixed capacities, and a traffic matrix to route, the problem is the one of finding a virtual topology which will optimally route the given traffic matrix over the physical topology. When the traffic matrix evolves on long timescales, we will need to recalculate such optimal layout. Our first contribution consists in the definition of cost functions which better represent the actual costs of operation from an operator's standpoint. The second contribution consists in taking into account the costs of reconfiguring the layout to adapt it to the new optimal layout. Considering actual operation and maintenance costs, it would be interesting to reduce the layout complexity, measured as a function of the number of virtual paths required by the layout. We have formulated different optimization problems minimizing layout complexity, under QoS constraints. This realistic model results in hard to solve problems. We have developped heuristic methods to approximatelly solve large network topologies. We have shown the interest of reducing the layout complexity compared to results obtained when optimizing the layout with classical cost functions. The layout reconfiguration induces first a cost of operation, and second a cost associated to the service disruption times needed to reconfigure. We have formulated a family of problems which take into account the reconfiguration costs when calculating the new layout. One of the above mentioned heuristics has been adapted to solve the reconfiguration problem.

Item Type:PhD Thesis (PhD)
Thesis Supervisor:Kofman, Daniel
Date:May 2004
Board of examiners:Sabella, Roberto and Medhi, Deepankar and Ben Ameur, Walid and Moignard, Renaud and Altman, Eitan
Ecole Doctorale:ED 130 INFORMATIQUE, TELECOMMUNICATIONS ET ELECTRONIQUE (EDITE)
Discipline:Informatique et Réseaux
Collection (Fonds):ENST
Institution:ENST
Department:ENST - INFRES Informatique et Réseaux
Subjects:2. Information and Communication Sciences and Technologies
Uncontrolled Keywords:IP Convergent Networks, MPLS Networks, Traffic Engineering, MINLP Problems, Operational Research, Layout Dimensioning, Layout Reconfiguration, Tabu Search, Flow Deviation Algorithm, Réseaux Convergents, Réseaux MPLS, Ingénierie de Trafic, Problèmes MINLP, Recherche Operationnelle, Dimensionnement MPLS, Reconfiguratio MPLS, tabu Search, Algorithme de Deviation de Flots
ID Code:689
Deposited By:Sergio Ariel Beker
Deposited On:06 September 2004

Statistiques de consultation

Repository Staff Only: edit this item

© ParisTech 2007 - Réalisé par RILK.com - Graphisme par Winch Communication