A Weighted Iterative Conflict Reducing Algorithm for Sliding Scheduled Lightpath Provisioning in WDM Optical Networks

DOI

10.2991/icmmita-15.2015.341How to use a DOI?

Keywords

WDM optical networks; sliding scheduled lightpath provisioning; weighted iterative conflict reducing.

Abstract

In WDM optical networks, the consistent variation of quality of service (QoS) demand has conducted the advent of sliding scheduled traffic, which does not have a rigid deadline and allows flexible sliding within a large time window. In this paper, the static sliding scheduled lightpath demand (SSLD) provisioning problem is formulated into a weighted partition coloring model. Then, a heuristic algorithm named weighted iterative conflict reducing (WICR) is proposed to solve the SSLD provisioning problem by iteratively reducing conflict degree and minimizing the redundant hops. Simulation results show that our approach can efficiently reduce the overall route length with the same wavelengths utilization performance compared to previous heuristics.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Cheng Zheng
PY  - 2015/11
DA  - 2015/11
TI  - A Weighted Iterative Conflict Reducing Algorithm for Sliding Scheduled Lightpath Provisioning in WDM Optical Networks
BT  - Proceedings of the 2015 3rd International Conference on Machinery, Materials and Information Technology Applications
PB  - Atlantis Press
SP  - 1824
EP  - 1829
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmita-15.2015.341
DO  - 10.2991/icmmita-15.2015.341
ID  - Zheng2015/11
ER  -