Packet Routing in Telecommunication Networks with Path and Flow Restrictions

International audienc

Modelos de programação linear inteira para problemas de dimensionamento e engenharia de tráfego de redes de telecomunicações

Tese de doutoramento, Estatística e Investigação Operacional (Optimização), 2009, Universidade de Lisboa, Faculdade de CiênciasIn this thesis, we develop Integer Linear Programming models to address network dimensioning and traffic engineering problems in telecommunications networks. Given the ever increasing need for reliable and delay sensitive services, our main focus is on survivability and delay constraints. We study the theoretical properties of the proposed models and we test their efficiency. In particular: 1. We analyse different classes of (sub)models which guarantee the existence of D paths between two nodes; 2. Based on those submodels, we compare the different formulations thus obtained for a MPLS network design problem; 3. In the context of a MPLS over WDM network dimensioning problem, we analyse the extent to which network costs are determined by different survivability mechanisms. We also develop a heuristic approach to this problem; 4. We study two classes of models disaggregated and aggregated to address two traffic engineering problems defined over the network solutions mentioned in 3. The theoretical and computational results discussed in this thesis clearly demonstrate, we believe, the value of good problem formulations using Integer Linear Programming.Fundação para a Ciência e Tecnologia (SFRH/ BD/ 28837/ 2006