2009 Sixth International Conference on Broadband Communications, Networks, and Systems. Broadnets 2009 (2009)
Sept. 14, 2009 to Sept. 16, 2009
Juan Segovia , Institute of Informatics and Applications (IIiA), University of Girona, 17071, Spain
Eusebi Calle , Institute of Informatics and Applications (IIiA), University of Girona, 17071, Spain
Pere Vila , Institute of Informatics and Applications (IIiA), University of Girona, 17071, Spain
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.
graph theory, multiprotocol label switching, telecommunication network routing
J. Segovia, E. Calle and P. Vila, "An improved method for discovering link criticality in transport networks," 2009 Sixth International Conference on Broadband Communications, Networks, and Systems. Broadnets 2009(BROADNETS), Madrid, 2009, pp. 1-8.