Converter-Aware Wavelength Assignment in WDM Networks with Limited-Range Conversion Capability

Quang-Dzung HO; Man-Seop LEE

doi:10.1093/ietcom/e89-b.2.436

Converter-Aware Wavelength Assignment in WDM Networks with Limited-Range Conversion Capability

Quang-Dzung HO, Man-Seop LEE

Full Text Views

0

Share
Cite this

Summary :

In wavelength-routed optical networks, wavelength converters are considered as one of the most critical network resources because they can significantly reduce the blocking probability, but still remain quite expensive. Unfortunately, previous wavelength assignment algorithms have seldom considered their presence. Therefore, in this paper, we propose a novel dynamic algorithm that can minimize the number of wavelength translations. Our algorithm establishes lightpaths by connecting a minimum number of wavelength-continuous segments. We mathematically prove the correctness of our algorithm. Then, we carry out extensive performance evaluations over three typical topologies with full-range or limited-range converters to compare our proposed algorithm with first-fit and most-used algorithms. The simulations show that, to obtain similar blocking performance, our algorithm requires much fewer converters, or the same number of converters but with smaller conversion ranges. From another perspective, with the same conversion capacity, our algorithm can significantly improve the blocking performance. Our algorithm is also scalable due to its polynomial time complexity and insignificant local signaling overhead.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.2 pp.436-445

Publication Date: 2006/02/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.2.436

Type of Manuscript: PAPER

Category: Switching for Communications

Cite this

Copy

Quang-Dzung HO, Man-Seop LEE, "Converter-Aware Wavelength Assignment in WDM Networks with Limited-Range Conversion Capability" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 2, pp. 436-445, February 2006, doi: 10.1093/ietcom/e89-b.2.436.
Abstract: In wavelength-routed optical networks, wavelength converters are considered as one of the most critical network resources because they can significantly reduce the blocking probability, but still remain quite expensive. Unfortunately, previous wavelength assignment algorithms have seldom considered their presence. Therefore, in this paper, we propose a novel dynamic algorithm that can minimize the number of wavelength translations. Our algorithm establishes lightpaths by connecting a minimum number of wavelength-continuous segments. We mathematically prove the correctness of our algorithm. Then, we carry out extensive performance evaluations over three typical topologies with full-range or limited-range converters to compare our proposed algorithm with first-fit and most-used algorithms. The simulations show that, to obtain similar blocking performance, our algorithm requires much fewer converters, or the same number of converters but with smaller conversion ranges. From another perspective, with the same conversion capacity, our algorithm can significantly improve the blocking performance. Our algorithm is also scalable due to its polynomial time complexity and insignificant local signaling overhead.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.2.436/_p

Copy

@ARTICLE{e89-b_2_436,
author={Quang-Dzung HO, Man-Seop LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Converter-Aware Wavelength Assignment in WDM Networks with Limited-Range Conversion Capability},
year={2006},
volume={E89-B},
number={2},
pages={436-445},
abstract={In wavelength-routed optical networks, wavelength converters are considered as one of the most critical network resources because they can significantly reduce the blocking probability, but still remain quite expensive. Unfortunately, previous wavelength assignment algorithms have seldom considered their presence. Therefore, in this paper, we propose a novel dynamic algorithm that can minimize the number of wavelength translations. Our algorithm establishes lightpaths by connecting a minimum number of wavelength-continuous segments. We mathematically prove the correctness of our algorithm. Then, we carry out extensive performance evaluations over three typical topologies with full-range or limited-range converters to compare our proposed algorithm with first-fit and most-used algorithms. The simulations show that, to obtain similar blocking performance, our algorithm requires much fewer converters, or the same number of converters but with smaller conversion ranges. From another perspective, with the same conversion capacity, our algorithm can significantly improve the blocking performance. Our algorithm is also scalable due to its polynomial time complexity and insignificant local signaling overhead.},
keywords={},
doi={10.1093/ietcom/e89-b.2.436},
ISSN={1745-1345},
month={February},}

Copy

TY - JOUR
TI - Converter-Aware Wavelength Assignment in WDM Networks with Limited-Range Conversion Capability
T2 - IEICE TRANSACTIONS on Communications
SP - 436
EP - 445
AU - Quang-Dzung HO
AU - Man-Seop LEE
PY - 2006
DO - 10.1093/ietcom/e89-b.2.436
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2006
AB - In wavelength-routed optical networks, wavelength converters are considered as one of the most critical network resources because they can significantly reduce the blocking probability, but still remain quite expensive. Unfortunately, previous wavelength assignment algorithms have seldom considered their presence. Therefore, in this paper, we propose a novel dynamic algorithm that can minimize the number of wavelength translations. Our algorithm establishes lightpaths by connecting a minimum number of wavelength-continuous segments. We mathematically prove the correctness of our algorithm. Then, we carry out extensive performance evaluations over three typical topologies with full-range or limited-range converters to compare our proposed algorithm with first-fit and most-used algorithms. The simulations show that, to obtain similar blocking performance, our algorithm requires much fewer converters, or the same number of converters but with smaller conversion ranges. From another perspective, with the same conversion capacity, our algorithm can significantly improve the blocking performance. Our algorithm is also scalable due to its polynomial time complexity and insignificant local signaling overhead.
ER -