Share Email Print

Proceedings Paper

A dynamic heuristic wavelength assignment algorithm for optical network with wavelength conversion
Author(s): Dinh Thi Thuy Nga; XuanTung Hoang; Viet-Thang Nguyen; Minho Kang
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The blocking performance of wavelength routing WDM optical networks can be enhanced by applying routing and wavelength assignment. In this paper, we consider wavelength assignment problem in the optical network. Specifically, we propose a dynamic heuristic wavelength assignment algorithm, called Longest Segment (LS) algorithm, for WDM networks. In comparison to other proposed algorithms, the blocking performance of LS algorithm is better. In addition, the LS algorithm minimizes the usage of converters by chaining the minimum number of continuous segments which have at least one same available wavelength. Furthermore, the low algorithm’ complexity is an another advantage of the algorithm

Paper Details

Date Published: 8 February 2005
PDF: 8 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.576826
Show Author Affiliations
Dinh Thi Thuy Nga, Information and Communications Univ. (South Korea)
XuanTung Hoang, Information and Communications Univ. (South Korea)
Viet-Thang Nguyen, Univ. of Trento (Italy)
Minho Kang, Information and Communications Univ. (South Korea)

Published in SPIE Proceedings Vol. 5626:
Network Architectures, Management, and Applications II
S. J. Ben Yoo; Gee-Kung Chang; Guangcheng Li; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top