Algebraic connectivity metric for spare capacity allocation problem in survivable networks
暂无分享,去创建一个
[1] M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .
[2] Mark Jerrum,et al. Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved , 1988, STOC '88.
[3] P. Diaconis,et al. Geometric Bounds for Eigenvalues of Markov Chains , 1991 .
[4] B. Forst,et al. Factors affecting the efficiency of Demand-wise Shared Protection , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.
[5] Noga Alon,et al. Eigenvalues and expanders , 1986, Comb..
[6] A. Leon-Garcia,et al. Comparison of network criticality, algebraic connectivity, and other graph metrics , 2009, SIMPLEX '09.
[7] Yu Liu,et al. Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.
[8] M. Fiedler. Algebraic connectivity of graphs , 1973 .
[9] Bojan Mohar,et al. Eigenvalues, diameter, and mean distance in graphs , 1991, Graphs Comb..
[10] Fan Chung,et al. Spectral Graph Theory , 1996 .
[11] W. Liu,et al. Utility of algebraic connectivity metric in topology design of survivable networks , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.
[12] Wayne D. Grover,et al. Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .
[13] John Doucette,et al. Multi-Flow Optimization Model for Design of a Shared Backup Path Protected Network , 2008, 2008 IEEE International Conference on Communications.
[14] Wayne D. Grover,et al. New options and insights for survivable transport networks , 2002, IEEE Commun. Mag..
[15] Brian W. Kernighan,et al. AMPL: A Modeling Language for Mathematical Programming , 1993 .