Abstract

We study the optimal survivability design problem under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. We formulate the joint routing and wavelength assignment problems as integer linear programs that maximally exploit network resource reuse in both space and time. Moreover, we propose efficient heuristic algorithms to solve large survivable routing and wavelength assignment problems under the scheduled traffic model. Our simulation results indicate that the optimization of resource sharing in space and time enabled by our connection-holding-time-aware protection schemes can achieve significantly better resource utilization than schemes that are holding time unaware. In addition, the proposed heuristic algorithms are shown to be indeed very effective.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call