Resource provisioning for survivable WDM networks under a sliding scheduled traffic model

Authors:
A. Jaekel;Y. Chen
Affiliations:
School of Computer Science, University Of Windsor, Windsor, Canada;School of Computer Science, University Of Windsor, Windsor, Canada
Venue:
Optical Switching and Networking
Year:
2009

Citing 8
Cited 4

Optical networks: a practical perspective

Optical networks: a practical perspective
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

IEEE/ACM Transactions on Networking (TON)
Provisioning Fault-Tolerant Scheduled Lightpath Demands in WDM Mesh Networks

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
On Optimal Survivability Design under a Scheduled Traffic Model in Wavelength-Routed Optical Mesh Networks

CNSR '06 Proceedings of the 4th Annual Communication Networks and Services Research Conference
Quality of service based resource allocation for scheduled lightpath demands

Computer Communications
Fault management in IP-over-WDM networks: WDM protection versus IP restoration

IEEE Journal on Selected Areas in Communications
A practical approach to operating survivable WDM networks

IEEE Journal on Selected Areas in Communications
Routing and wavelength assignment of scheduled lightpath demands

IEEE Journal on Selected Areas in Communications

Flexible scheduling of multicast sessions with different granularities for large data distribution over WDM networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A new model for allocating resources to scheduled lightpath demands

Computer Networks: The International Journal of Computer and Telecommunications Networking
A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks

Photonic Network Communications
A proof of wavelength conversion not improving Lagrangian bounds of the sliding scheduled RWA problem

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Resource allocation in WDM networks, under both the static and dynamic traffic models have been widely investigated. However, in recent years there has been a growing number of applications with periodic bandwidth demands. Resources for such applications can be scheduled in advance, leading to a more efficient utilization of available network capacity. The setup and teardown times of the scheduled demands may be fixed, or may be allowed to slide within a larger window. A number of optimal integer linear program (ILP) solutions for the first problem (fixed setup/teardown times) have been presented in the literature. In this paper we present two new ILP formulations for the more general sliding scheduled traffic model, where the setup and teardown times may vary within a specified range. We first consider wavelength convertible networks and then extend our model to networks without wavelength conversion. Our ILP formulations jointly optimize the problem of scheduling the demands (in time) and allocating resources for the scheduled lightpaths. The fixed window model can be treated as a special case of our formulations. Our formulations are able to generate optimal solutions for practical sized networks. For larger networks, we have proposed a fast two-step optimization process. The first step schedules the demands optimally in time, so that the amount of overlap is minimized. The second step uses a connection holding time aware heuristic to perform routing and wavelength assignment for the scheduled demands.