Pasar al contenido principal

ROBUSTEZ ANTE FALLOS A GRAN ESCALA EN REDES CON ENCAMINAMIENTO INTERDOMINIO

TEC2012-32336

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2012
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario UNIVERSITAT DE GIRONA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Robustness Comparison of 15 Real Telecommunication Networks: Structural and Centrality Measurements

  • Rueda Pepinosa, Diego Fernando
  • Calle Ortega, Eusebi
  • Marzo i Lázaro, Josep Lluís
Multiple failures can have catastrophic consequences on the normal operation of telecommunication networks. In this sense, guaranteeing network robustness to avoid users and services being disconnected is essential. A wide range of metrics have been proposed for measuring network robustness. In this paper the taxonomy of robustness metrics in telecommunication networks has been extended and a classification of multiple failures scenarios has been made. Moreover, a structural and centrality robustness comparison of 15 real telecommunication networks experiencing multiple failures was carried out. Through this analysis the topological properties which are common for grouping networks with similar robustness are able to be identified, This work is partiality supported by the Spanish Ministerio de Economı´a y Competitividad and the DURSI consolidated research group (CSI Ref. SGR-1469) through the RoGER project (TEC 2012-32336) being developed in the Broadband Communications and Distributed Systems (BCDS) research group at the Universitat de Girona (Spain)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Epidemic and Cascading Survivability of Complex Networks

  • Manzano Castro, Marc
  • Calle Ortega, Eusebi
  • Ripoll i Misse, Jordi
  • Manolova, Anna
  • Fagertun, V.
  • Torres Padrosa, Víctor
  • Pahwa, S.
  • Scoglio, Caterina
Our society nowadays is governed by complex networks, examples being the power grids, telecommunication networks, biological networks, and social networks. It has become of paramount importance to understand and characterize the dynamic events (e.g. failures) that might happen in these complex networks. For this reason, in this paper, we propose two measures to evaluate the vulnerability of complex networks in two different dynamic multiple failure scenarios: epidemic-like and cascading failures. Firstly, we present epidemic survivability (ES), a new network measure that describes the vulnerability of each node of a network under a specific epidemic intensity. Secondly, we propose cascading survivability (CS), which characterizes how potentially injurious a node is according to a cascading failure scenario. Then, we show that by using the distribution of values obtained from ES and CS it is possible to describe the vulnerability of a given network. We consider a set of 17 different complex networks to illustrate the suitability of our proposals. Lastly, results reveal that distinct types of complex networks might react differently under the same multiple failure scenario, This work is partially supported by Spanish Ministry of Science and Innovation projects TEC 2012-32336 and MTM 2011-27739-C04-03, SGR-1202, AGAUR FI-DGR 2012 and BE-DGR 2012 grants (M. M.)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Cluster-based localisation method for dense WSN: A distributed balance between accuracy and complexity fixed by cluster size

  • Marcelín Jiménez, Ricardo
  • Rodriguez Colina, Enrique
  • Pascoe-Chalke, Michael
  • Moreno Escobar, Carlos
  • Marzo i Lázaro, Josep Lluís
Localisation is a fundamental requirement for a monitoring and tracking system based on wireless sensor networks (WSN). In order to build an accurate set of measurements, sensor nodes must have information regarding their own position within a system of coordinates. When a considerable number of nodes are randomly scattered over a monitoring area, sensor nodes must be part of a self-organised system which provides a set of local position estimates. Nodes participate under very stringent conditions, for example, limited power supply and reduced computational capabilities. This work presents a GPS-free localisation method consisting of four stages that are executed only once during the network initialisation process. These stages are aimed to increase the overall system lifetime by reducing the signalling overhead commonly involved in distributed localisation procedures. The proposed localisation method turns the initial and complex node deployment to several smaller instances by dividing the network into clusters, which can be solved simultaneously based on local resources only. Simulation results show that this approach produces important savings in the involved overall complexity, which can translate into a trade-off between computational cost and localisation accuracy, This work was supported in part by research funds from CONACyT, PROMEP (12711445, 12711609 and 12711828) and MICINN (TEC 2012-32336)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Community-based traffic preservation in telecommunication networks

  • Torres Padrosa, Víctor
  • Manzano Castro, Marc
  • Calle Ortega, Eusebi
  • Marzo i Lázaro, Josep Lluís
Large-scale failures in telecommunication networks have been traditionally mitigated by attempting to preserve global connectivity in the network. However, although communication inside communities may be of high relevance, their preservation is a challenging task. To achieve this, we propose a new concept of community that combines not only the topological information of the network but also the traffic-level interaction. This new concept is then used to present six novel community-based strategies that, when working within a limited budget, are able to determine which are the best candidate nodes to protect. The strategies proposed have been tested over four different types of networks and have been compared with other well-known immunization or protection methods. Results show that community-based strategies better preserve the inner community traffic with respect to traditional approaches. Furthermore, in some cases, both global and intra-community traffic preservation is able to be improved, This work is partly supported by the Spanish Ministerio de Ciencia e Innovacion through project RoGER (Robustness against large-scale failures in interdomain routing, TEC2012-32336), Juan de la Cierva subprogram grant no. JCI-2010-08322, and by the Generalitat de Catalunya through the Research Support Program project SGR-1202 and AGAUR FI-DGR 2012 grant