Item


An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network’s resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

© Sixth International Conference on Broadband Communications, Networks, and Systems : 2009 : BROADNETS 2009, 2009, p. 1-8

IEEE

Author: Segovia Silvero, Juan
Calle Ortega, Eusebi
Vilà Talleda, Pere
Date: 2009
Abstract: Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network’s resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio
Format: application/pdf
Citation: Segovia Silvero, Juan, Calle Ortega, Eusebi, i Vilà Talleda, Pere(2009). An improved method for discovering link criticality in transport networks. Sixth International Conference on Broadband Communications, Networks, and Systems : 2009 : BROADNETS 2009, 1-8. Recuperat 04 juny 2010, a http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5336385
ISBN: 978-963-9799-49-3
Document access: http://hdl.handle.net/10256/2495
Language: eng
Publisher: IEEE
Collection: Reproducció digital del document publicat a: http://dx.doi.org/10.4108/ICST.BROADNETS2009.7266
Articles publicats (D-ATC)
Is part of: © Sixth International Conference on Broadband Communications, Networks, and Systems : 2009 : BROADNETS 2009, 2009, p. 1-8
Rights: Tots els drets reservats
Subject: Grafs, Teoria de
Dades -- Transmissió
MPLS (Norma)
Telecomunicació de banda ampla, Sistemes de
Telecomunicació -- Tràfic
Broadband communication systems
Data transmission systems
Graph theory
MPLS standard
Telecommunication -- Traffic
Title: An improved method for discovering link criticality in transport networks
Type: info:eu-repo/semantics/article
Repository: DUGiDocs

Subjects

Authors


Warning: Unknown: write failed: No space left on device (28) in Unknown on line 0

Warning: Unknown: Failed to write session data (files). Please verify that the current setting of session.save_path is correct (/var/lib/php5) in Unknown on line 0