A Minimum Cost Active and Backup Path Algorithm with SRLG Constraints
暂无分享,去创建一个
[1] A. Greenberg,et al. Auto-discovery of shared risk link groups , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).
[2] J. Y. Yen. Finding the K Shortest Loopless Paths in a Network , 1971 .
[3] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.
[4] Eusebi Calle Ortega. Enhanced fault recovery methods for protected traffic services in GMPLS networks , 2004 .
[5] Jennifer Yates,et al. Effectiveness of shared risk link group auto-discovery in optical networks , 2002, Optical Fiber Communication Conference and Exhibit.
[6] José-Luis Marzo,et al. Enhanced protection using shared segment backups in a multiservice GMPLS-based networks , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).
[7] Chung-Lun Li,et al. Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.
[8] Athina Markopoulou,et al. Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.
[9] Jian-Qiang Hu,et al. Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..
[10] Yuchun Guo,et al. Link‐disjoint paths for reliable QoS routing , 2003, Int. J. Commun. Syst..
[11] Ramesh Bhandari. Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.