To access the full text documents, please follow this link:

An improved method for discovering link criticality in transport networks
Segovia Silvero, Juan; Calle Ortega, Eusebi; Vilà Talleda, Pere
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
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
Tots els drets reservats

Show full item record

Related documents

Other documents of the same author

Calle Ortega, Eusebi; Marzo i Lázaro, Josep Lluís; Urra i Fàbregas, Anna; Vilà Talleda, Pere
Marzo i Lázaro, Josep Lluís; Vilà Talleda, Pere; Bueno Delgado, Antonio; Fàbrega i Soler, Lluís; Calle Ortega, Eusebi
Vilà Talleda, Pere; Marzo i Lázaro, Josep Lluís; Calle Ortega, Eusebi; Carrillo, Liliana