Abstract

Provisioning survivable multicast sessions in wavelength-routed optical networks has already been studied under static or dynamic traffic. However, in many practical cases, customers tend to require a large bandwidth at a specified time interval. Scheduled traffic model, in which the setup and teardown times are known in advance or vary in a specified larger time window, is more appropriate to characterize this kind of traffic. In this paper, two scheduled traffic models are formulated and investigated for multicast protection in wavelength-routed optical networks, namely, Fixed Scheduled Traffic Model (FSTM) and Sliding Scheduled Traffic Model (SSTM). With the guaranteed 100% restorability against any single link failure, the FSTM formulation can achieve a global minimum cost for establishing all multicast sessions. A two-step optimization approach is further proposed to deal with the survivable multicast provisioning problem under SSTM. By optimizing the network resources jointly in space and time, survivable multicast sessions can be provisioned at much lower costs.

© 2011 IEEE

Provisioning Subwavelength Multicast Sessions With Flexible Scheduling Over WDM Networks

Dragos Andrei, Massimo Tornatore, Charles U. Martel, Dipak Ghosal, and Biswanath Mukherjee
J. Opt. Commun. Netw. 2(5) 241-255 (2010)

Power-Aware Connection Provisioning for All-Optical Multicast Traffic in WDM Networks

Ashraf M. Hamad and Ahmed E. Kamal
J. Opt. Commun. Netw. 2(7) 481-495 (2010)

Integrated Provisioning of Sliding Scheduled Services Over WDM Optical Networks [Invited]

Dragos Andrei, Hong-Hsu Yen, Massimo Tornatore, Charles U. Martel, and Biswanath Mukherjee
J. Opt. Commun. Netw. 1(2) A94-A105 (2009)

Survivable Multipath Routing of Anycast and Unicast Traffic in Elastic Optical Networks

Róża Goścień, Krzysztof Walkowiak, and Massimo Tornatore
J. Opt. Commun. Netw. 8(6) 343-355 (2016)

Stable Logical Topologies for Survivable Traffic Grooming of Scheduled Demands

Arunita Jaekel, Ying Chen, and Ataul Bari
J. Opt. Commun. Netw. 2(10) 793-802 (2010)