Diseño de redes de telecomunicación para el despliegue universal de servicios avanzados de telecomunicación

La revolución digital promete grandes avances y progresos. Sin embargo, la Sociedad de la Información está fuertemente vinculada al desarrollo de las redes de telecomunicación. El elevado coste de estas infraestructuras está obligando a las compañías a centrar sus esfuerzos inversores en aquellos sectores en que se presumen mayores beneficios. En este sentido la puesta en marcha de mecanismos que permitan cruzar la brecha digital se está convirtiendo en una acción necesaria. Presentamos aquí el estudio de un caso correspondiente al diseño de una red de alta velocidad construida mediante un sistema de ayuda a la toma decisiones a partir de una serie de modelos que hacen uso de un motor de optimización basado en algoritmos genéticos. Para ello se hace uso de datos reales procedentes de la Industria de las Telecomunicaciones y se presenta una familia de soluciones separada por niveles de cobertura.Ministerio de Ciencia y Tecnología TIC2003-04784-C02-0

An Improved Upper Bound for the Ring Loading Problem

The Ring Loading Problem emerged in the 1990s to model an important special case of telecommunication networks (SONET rings) which gained attention from practitioners and theorists alike. Given an undirected cycle on $n$ nodes together with non-negative demands between any pair of nodes, the Ring Loading Problem asks for an unsplittable routing of the demands such that the maximum cumulated demand on any edge is minimized. Let $L$ be the value of such a solution. In the relaxed version of the problem, each demand can be split into two parts where the first part is routed clockwise while the second part is routed counter-clockwise. Denote with $L^*$ the maximum load of a minimum split routing solution. In a landmark paper, Schrijver, Seymour and Winkler [SSW98] showed that $L \leq L^* + 1.5D$, where $D$ is the maximum demand value. They also found (implicitly) an instance of the Ring Loading Problem with $L = L^* + 1.01D$. Recently, Skutella [Sku16] improved these bounds by showing that $L \leq L^* + \frac{19}{14}D$, and there exists an instance with $L = L^* + 1.1D$. We contribute to this line of research by showing that $L \leq L^* + 1.3D$. We also take a first step towards lower and upper bounds for small instances

Planning a Ring-Tree Network to provide Telecommunication Services at Centres of Rural Population

Nowadays certain centres of rural population are experimenting difficulties to access high-speed telecommunication networks. This phenomenon avoids the possibility of accessing to the digital revolution for such areas. The private companies are focusing their invest ment efforts in other more profitable areas. In such conditions, the governments have to promote alternatives to bridge the digital divide between rural and urban areas. We present how ring-tree topologies can be used as an adequate architecture to incorporate such less favoured areas in the Information Society. We present a case study for Andalucia (a wide region in the south of Spain) where a decision support system based on a genetic algorithm is implemented providing cost effective solutions. We make use of real life data from the telecommunication industry and present different solutions separated by coverage as well as a sensitivity analysis based on the main factors of the cost function.Ministerio de Ciencia y Tecnología TIC2003 -04784-C02-0