Approximating optimal survivable scheduled service provisioning in WDM optical networks with iterative survivable routing

2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006

Volumn , Issue , 2006, Pages

  Li, Tianjian ^a   Wang, Bin ^a  

^a Wright State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; ELECTRIC BREAKDOWN; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; NUCLEAR PROPULSION; OPTICAL DATA PROCESSING; SCHEDULING; SET THEORY; SOLUTIONS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS; WAVELENGTH DIVISION MULTIPLEXING;

BROADBAND COMMUNICATIONS; NETWORK RESOURCES; SERVICE PROVISIONING;

COMPUTER NETWORKS;

EID: 51749109827     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BROADNETS.2006.4374348     Document Type: Conference Paper

References (26)

1. M. Clouqueur and W. D. Grover. Mesh-restorable networks with complete dual failure restorability and with selectively enhanced dual-failure restorability properties. Proceedings of OPTICOM, Boston, MA, pages 1-12, July 2002.
2. J. Doucette and W. D. Grover. Capacity design studies of span-restorable mesh transport networks with shared-risk link group (SRLG) effects. Proceedings of OPTICOMM, Boston, MA, pages 25-38, July 2002.
3. J. Kuri. Optimization problems in WDM optical transport networks with scheduled lightpath demands. Ph.D. thesis, ENST Paris, September 2003.
4. J. Kuri, N. Puech, and M. Gagnaire. Diverse routing of scheduled lightpath demands in an optical transport network. Proceedings of Fourth International Workshop on the Design of Reliable Communication Networks (DRCN 2003), Banff, Alberta, Canada, October 2003.
5. J. Kuri, N. Puech, M. Gagnaire, E. Dotaro, and R. Douville. Routing and wavelength assignments of scheduled lightpath demands. IEEE Journal on Selected Areas in Communications, 21(8):1231-1240, October 2003.
6. T. Li and B. Wang. Cost-Effective Shared Path Protection in WDM Optical Mesh Networks with Partial Wavelength Conversion. Photonic Network Communications, 8(3):251-266, November 2004.
7. T. Li and B. Wang. Efficient Online Algorithms for Dynamic Shared Path Protection in Optical WDM Networks. Photonic Network Communications, 9(2):207-222, March 2005.
8. T. Li and B. Wang. On Optimal Survivability Design in WDM Optical Networks Under a Scheduled Traffic Model. Proceedings of the 5th IEEE International Workshop on Design of Reliable Communication Networks (DRCN), Island of Ischia (Naples), Italy, October 2005.
9. T. Li, B. Wang, C. Xin, and X. Zhang. On Survivable Service Provisioning in WDM Optical Networks Under a Scheduled Traffic Model. IEEE Globecom '05, St. Louis, MO, November/December 2005.
10. Y. Liu, D. Tipper, and P. Siripongwutikorn. Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing. IEEE/ACM Transactions on Networking, 13(1):198-211, 2005.
11. A. Massaro, M. Pelillo, and I. M. Bomze. A Complementary Pivoting Approach to the Maximum Weight Clique Problem. SIAM Journal on Optimization, 12(4):928-948, 2002.
12. Y. Miyao and H. Saito. Optimal design and evaluation of survivable WDM transport networks. IEEE Journal on Selected Areas in Communications, 16:1190-1198, September 1998.
13. H.T. Mouftah and P.-H. Ho. Optical Networks: Architecture and Survivability. Kluwer Academic Publishers, 2003.
14. C. V. Saradhi, L. K. Wei, and M. Gurusamy. Provisioning Fault-Tolerant Scheduled Lightpath Demands in WDM Mesh Networks. Brondnets'2004, San Jose, CA, pages 150-159, October 2004.
15. C-H. Shyu. A Parallel Algorithm for Finding a Maximum Weight Clique of an Interval Graph. Parallel Computing, 12:253-256,1990.
16. A. Todimala and B. Ramamurthy. A Dynamic Partitioning Sub-Path Protection Routing Technique in WDM Mesh Networks. ICCC "02, Mumbai, India, August 2002.
17. M. Tornatore, A. Pattavina, J. Zhang, B. Mukherjee, and C. Ou. Efficient Shared-Path Protection Exploiting the Knowledge of Connection-Holding Time. Proceedings of OFC'2005, Anaheim, CA, March 2005.
18. B. Wang and A. Deshmukh. An All Hops Optimal Algorithm for Dynamic Routing of Sliding Scheduled Traffic Demands. IEEE Communications Letters, 2005.
19. B. Wang, T. Li, X. Luo, and Y Fan. Traffic Grooming under a Sliding Scheduled Traffic Model in WDM Optical Networks. Proceedings of IEEE Workshop on Traffic Grooming in WDMNetworks, San Jose, CA, October 2004.
20. B. Wang, T. Li, X. Luo, Y. Fan, and C. Xin. Routing and Wavelength Assignment Under a Scheduled Traffic Model in Reconfigurable WDM Optical Networks. Proceedings of Broadnets'05, Boston MA, October 2005.
21. T.-H. Wu. Emerging technologies for fiber network survivability. IEEE Communications Magazine, February 1995.
22. S. Yuan and J. Jue. Shared Protection Routing Algorithm for Optical Network. Optical Networks Magazine, 3(3):32-39, May/June 2002.
23. H. Zang. WDM Mesh Networks: Management and Survivability. Kluwer Academic Publishers, 2003.
24. H. Zang and B. Mukherjee. Connection management for survivable wavelength-routed WDM mesh networks. SPIE Optical Networks Magazine, Special Issue on Protection and Survivability in Optical Networks. 2(4): 17-28, July 2001.
25. H. Zang, C. Ou, and B. Mukherjee. Path-Protection Routing and Wavelength-Assignment in WDM Mesh Networks under Shared-Risk-Group Constraints. Proc. SPIE APOC'01, Beijing, China, November 2001.
26. H. Zang, C. Ou, and B. Mukherjee. Path-Protection Routing and Wavelength Assignment (RWA) in WDM Mesh Networks Under Duct-Layer Constraints. IEEE/ACM Transactions on Networking, 11(2), April 2003.