Two strategies for spare capacity placement in mesh restorable networks
暂无分享,去创建一个
[1] Wayne D. Grover,et al. Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..
[2] A. Gibbons. Algorithmic Graph Theory , 1985 .
[3] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[4] C. H. Yang,et al. FITNESS-failure immunization technology for network services survivability , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.
[5] Hideki Sakauchi,et al. A self-healing network with an economical spare-channel assignment , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.
[6] Bradley David. Venables. Algorithms for the spare capacity design of mesh restorable networks , 1992 .
[7] W.D. Grover,et al. Performance studies of a selfhealing network protocol in Telecom Canada long haul networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.
[8] W. D. Grover,et al. The selfhealing network : A fast distributed restoration technique for networks using digital crossconnect machines , 1987 .
[9] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .