Framework of spare capacity re-allocation with S-SLSP for mesh WDM networks
暂无分享,去创建一个
[1] Murali S. Kodialam,et al. Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[2] Wayne D. Grover,et al. Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).
[3] Murali S. Kodialam,et al. Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[4] Ramesh Bhandari. Survivable Networks: Algorithms for Diverse Routing , 1998 .
[5] Carsten Thomassen. On the Complexity of Finding a Minimum Cycle Cover of a Graph , 1997, SIAM J. Comput..
[6] Arun K. Somani,et al. Routing dependable connections with specified failure restoration guarantees in WDM networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[7] Pin-Han Ho,et al. A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..
[8] H. T. Mouftah,et al. Issues on diverse routing for WDM mesh networks with survivability , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).
[9] Sheng Chen,et al. Proceedings IEEE Globecom`93 , 1993 .
[10] O. J. Wasem,et al. An algorithm for designing rings for survivable fiber networks , 1991 .
[11] Wayne Grover,et al. Network Restorability Design Using Pre-configured Trees, Cycles, and Mixtures of Pattern Types , 2000 .
[12] Thomas E. Stern,et al. Automatic protection switching for link failures in optical networks with bi-directional links , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.
[13] Suresh Subramaniam,et al. Survivability in optical networks , 2000, IEEE Netw..
[14] Dimitri Papadimitriou,et al. Inference of Shared Risk Link Groups , 2001 .
[15] H.T. Mouftah,et al. SLSP: a new path protection scheme for the optical Internet , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).
[16] Srinivas V. Makam,et al. Framework for MPLS - based Recovery , 2000 .
[17] Narsingh Deo,et al. On Algorithms for Enumerating All Circuits of a Graph , 1976, SIAM J. Comput..
[18] O. J. Wasem. Optimal topologies for survivable fiber optic networks using SONET self-healing rings , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.
[19] W. D. Grover,et al. Optimized design of ring-based survivable networks , 1995, Canadian Journal of Electrical and Computer Engineering.
[20] H. T. Mouftah,et al. A framework of a survivable optical Internet using short leap shared protection (SLSP) , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).
[21] Thomas E. Stern,et al. Protection cycles in mesh WDM networks , 2000, IEEE Journal on Selected Areas in Communications.