Algebraic connectivity metric for spare capacity allocation problem in survivable networks

Authors:
William Liu;Krzysztof Pawlikowski;Harsha Sirisena
Affiliations:
School of Computing and Mathematical Sciences, Auckland University of Technology, Auckland, New Zealand;Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand;Electrical and Computer Engineering, University of Canterbury, Christchurch, New Zealand
Venue:
Computer Communications
Year:
2011

Citing 6
Cited 1

Eigen values and expanders

Combinatorica
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Approximating optimal spare capacity allocation by successive survivable routing

IEEE/ACM Transactions on Networking (TON)
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Comparison of network criticality, algebraic connectivity, and other graph metrics

Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners
New options and insights for survivable transport networks

IEEE Communications Magazine

A new BlueGreen methodology for designing next generation networks

International Journal of Internet Protocol Technology

Quantified Score

Hi-index	0.24

Visualization

Abstract

For studying survivability of telecommunication networks, one should be able to differentiate topologies of networks by means of a robust numerical measure that can characterize the degree of immunity of a given network to possible failures of its elements. An ideal metric should be also sensitive to such topological features as the existence of nodes or links whose failures are catastrophic in that they lead to disintegration of a given network structure. In this paper, we show that the algebraic connectivity, adopted from spectral graph theory, namely the second smallest eigenvalue of the Laplacian matrix of the network topology, is a numerical index that characterizes a network's survivability better than the average node degree that has been traditionally used for this purpose. This proposition is validated by extensive studies involving solutions of the spare capacity allocation problem for a variety of networks.