An Algorithm for Dynamic Routing and Wavelength Assignment in WDM Network

DOI

10.2991/jimec-16.2016.51How to use a DOI?

Keywords

wavelength; transmitters' installment; degree constrained; improvement Dijkstra

Abstract

In WDM network, it is still a core issue to research routing. According to the characteristics of multi wavelength optical network and the setting of the wavelength converter, we change multi wavelength network to single wavelength dynamic network through the conversion function of wavelength converter, and put forward an equivalent model of degree-constrained shortest path calculation. Through the analysis of the model, we use the method of adding the critical point set and adding the virtual node, put forward an improved algorithm based on the the Dijkstra shortest path algorithm. The time complexity of the Dijkstra algorithm is O(n^5) , and that of the improved algorithm is O(n^3) . The time complexity reduces greatly. This improved algorithm can allocate network resource more reasonably, improve the utilization rate of load-balanced links, and save the time of data transmission and the resource of link.

Copyright

© 2016, 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  - Yun Wu
AU  - Songming Xu
PY  - 2016/10
DA  - 2016/10
TI  - An Algorithm for Dynamic Routing and Wavelength Assignment in WDM Network
BT  - Proceedings of the 2016 Joint International Information Technology, Mechanical and Electronic Engineering
PB  - Atlantis Press
SP  - 293
EP  - 299
SN  - 2352-5401
UR  - https://doi.org/10.2991/jimec-16.2016.51
DO  - 10.2991/jimec-16.2016.51
ID  - Wu2016/10
ER  -