DocumentCode :
3005418
Title :
Efficacy of Fiedler value versus nodal degree in spare capacity allocation
Author :
Liu, W. ; Sirisena, H. ; Pawlikowski, K.
Author_Institution :
Electr. & Comput. Eng., Univ. of Canterbury, Christchurch, New Zealand
fYear :
2009
fDate :
8-10 Oct. 2009
Firstpage :
678
Lastpage :
681
Abstract :
In this paper, instead of using the average nodal degree metric, we suggest to use the Fiedler value metric, adopted from the spectral graph theory, namely the 2nd smallest eigenvalue of the Laplacian matrix of a given network topology, to quantify network connectivity in studies of spare capacity allocation problem. Ideally, such a robustness measure should be sensitive to the existence of nodes or links which are more important than others, for example, if their failures cause total network´s disintegration. Our extensive simulation-based studies show that this metric is a more informative and more accurate parameter than the average nodal degree for characterizing network topologies´ connectivity in network survivability studies.
Keywords :
eigenvalues and eigenfunctions; graph theory; telecommunication network topology; Fiedler value; Laplacian matrix; connectivity; eigenvalue; network survivability; network topology; nodal degree; spare capacity allocation; spectral graph theory; Computer networks; Computer science; Eigenvalues and eigenfunctions; Graph theory; Laplace equations; Network topology; Protection; Robustness; Routing protocols; Software engineering; 2nd smallest eigenvalue; Fiedler value; Laplacian matrix; Network survivability; network connectivity; spare capacity allocation; topology design;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2009. APCC 2009. 15th Asia-Pacific Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-4784-8
Type :
conf
DOI :
10.1109/APCC.2009.5375511
Filename :
5375511
Link To Document :
بازگشت