Survivable scheduled service provisioning in WDM optical networks with iterative routing

Kuri, 2003, Routing and wavelength assignments of scheduled lightpath demands, IEEE Journal on Selected Areas in Communications, 21, 1231, 10.1109/JSAC.2003.816622 T. Li, B. Wang, Approximating optimal survivable scheduled service provisioning in wdm optical networks with iterative survivable routing, in: Proceedings of Broadnets 2006, San Jose, CA, October 2006 T. Li, B. Wang, On optimal survivability design in wdm optical networks under a scheduled traffic model, in: Proceedings of the 5th IEEE International Workshop on Design of Reliable Communication Networks (DRCN), Island of Ischia (Naples), Italy, October 2005 T. Li, B. Wang, C. Xin, X. Zhang, On survivable service provisioning in wdm optical networks under a scheduled traffic model, in: Proceedings of IEEE Globecom’05, St. Louis, MO, November/December 2005 Wu, 1995, Emerging technologies for fiber network survivability, IEEE Communications Magazine, 33, 58, 10.1109/35.350377 Zang, 2003 Mouftah, 2003 H. Zang, C. Ou, B. Mukherjee, Path-protection routing and wavelength-assignment in wdm mesh networks under shared-risk-group constraints, in: Proc. SPIE APOC’01, Beijing, China, November 2001 Zang, 2003, Path-protection routing and wavelength assignment (rwa) in wdm mesh networks under duct-layer constraints, IEEE/ACM Transactions on Networking, 11, 248, 10.1109/TNET.2003.810313 Miyao, 1998, Optimal design and evaluation of survivable WDM transport networks, IEEE Journal on Selected Areas in Communications, 16, 1190, 10.1109/49.725189 M. Clouqueur, W.D. Grover, Mesh-restorable networks with complete dual failure restorability and with selectively enhanced dual-failure restorability properties. in: Proceedings of OPTICOM, Boston, MA, pp. 1–12, July 2002 J. Doucette, W.D. Grover, Capacity design studies of span-restorable mesh transport networks with shared-risk link group (SRLG) effects. in: Proceedings of OPTICOMM, Boston, MA, pages 25–38, July 2002 Li, 2004, Cost-effective shared path protection in WDM optical mesh networks with partial wavelength conversion, Photonic Network Communications, 8, 251, 10.1023/B:PNET.0000041237.55229.17 Zang, 2001, Connection management for survivable wavelength-routed WDM mesh networks, SPIE Optical Networks Magazine, 2, 17 Yuan, 2002, Shared protection routing algorithm for optical network, Optical Networks Magazine, 3, 32 A. Todimala, B. Ramamurthy, A dynamic partitioning sub-pathprotection routing technique in wdm mesh networks, in: Proceedings of ICCC’02, Mumbai, India, August 2002 Li, 2005, Efficient online algorithms for dynamic shared path protection in optical WDM networks, Photonic Network Communications, 9, 207, 10.1007/s11107-004-5588-1 J. Kuri, Optimization problems in WDM optical transport networks with scheduled lightpath demands, Ph.D. thesis, ENST Paris, September 2003 J. Kuri, N. Puech, M. Gagnaire, Diverse routing of scheduled lightpath demands in an optical transport network, in: Proceedings of Fourth International Workshop on the Design of Reliable Communication Networks, DRCN 2003, Banff, Alberta, Canada, October 2003 M. Tornatore, A. Pattavina, J. Zhang, B. Mukherjee, C. Ou, Efficient shared-path protection exploiting the knowledge of connection-holding time, in: Proceedings of OFC’05, Anaheim, CA, March 2005 C.V. Saradhi, L.K. Wei, M. Gurusamy, Provisioning fault-tolerant scheduled lightpath demands in wdm mesh networks, in: Proceedings of Broadnets’04, San Jose, CA, October 2004, pp. 150–159 B. Wang, T. Li, X. Luo, Y. Fan, C. Xin, Routing and wavelength assignment under a scheduled traffic model in reconfigurable WDM optical networks, in: Proceedings of Broadnets’05, Boston MA, October 2005 Liu, 2005, Approximating optimal spare capacity allocation by successive survivable routing, IEEE/ACM Transactions on Networking, 13, 198, 10.1109/TNET.2004.842220 Massaro, 2002, A complementary pivoting approach to the maximum weight clique problem, SIAM Journal on Optimization, 12, 928, 10.1137/S1052623400381413 Shyu, 1990, A parallel algorithm for finding a maximum weight clique of an interval graph, Parallel Computing, 12, 253, 10.1016/0167-8191(90)90152-Y B. Wang, T. Li, X. Luo, Y. Fan, Traffic grooming under a sliding scheduled traffic model in WDM optical networks, in: Proceedings of IEEE Workshop on Traffic Grooming in WDM Networks, San Jose, CA, October 2004 Wang, 2005, An all hops optimal algorithm for dynamic routing of sliding scheduled traffic demands, IEEE Communications Letters, 9, 936, 10.1109/LCOMM.2005.10015