Abstract
The wavelength-division multiplexing (WDM) technology has been extensively studied and actually deployed as a key technology to solve global information explosions by multiplexing plural signal paths using different wavelengths into one optical fiber. Among WDM-based network architectures, this article focuses on a double-ring one for a next-generation metropolitan area network (MAN), where each node is normally equipped with two pairs of fast-tunable transmitters and wavelength-fixed receivers (TT-FR) as interface to two fibers. To enhance the network performance, additional transmitters/receivers at nodes and receiver wavelengths should be assigned optimally, so that the bandwidth bottleneck can be resolved both on nodes and fiber links. This article formulates this node configuration problem with bandwidth bottleneck resolution as a combinatorial optimization problem, and proves the NP-completeness of its decision version. Then, it presents the two-phase heuristic algorithm composed of a greedy method and a variable depth search (VDS) method. Our algorithm is evaluated through extensive network simulations, where the results support the effectiveness of this joint assignment approach.
| Original language | English |
|---|---|
| Pages (from-to) | 218-226 |
| Number of pages | 9 |
| Journal | Photonic Network Communications |
| Volume | 18 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Oct 2009 |
Fingerprint
Keywords
- Bandwidth bottleneck resolution
- Node configuration
- NP-complete
- Simulation
- VDS algorithm
- Wavelength assignment
- WDM ring network
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Hardware and Architecture
- Software
- Atomic and Molecular Physics, and Optics
Cite this
A node configuration algorithm with bandwidth bottleneck resolution for WDM ring networks. / Isogai, Megumi; Funabiki, Nobuo; Nakanishi, Toru; Isshiki, Yosuke.
In: Photonic Network Communications, Vol. 18, No. 2, 10.2009, p. 218-226.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A node configuration algorithm with bandwidth bottleneck resolution for WDM ring networks
AU - Isogai, Megumi
AU - Funabiki, Nobuo
AU - Nakanishi, Toru
AU - Isshiki, Yosuke
PY - 2009/10
Y1 - 2009/10
N2 - The wavelength-division multiplexing (WDM) technology has been extensively studied and actually deployed as a key technology to solve global information explosions by multiplexing plural signal paths using different wavelengths into one optical fiber. Among WDM-based network architectures, this article focuses on a double-ring one for a next-generation metropolitan area network (MAN), where each node is normally equipped with two pairs of fast-tunable transmitters and wavelength-fixed receivers (TT-FR) as interface to two fibers. To enhance the network performance, additional transmitters/receivers at nodes and receiver wavelengths should be assigned optimally, so that the bandwidth bottleneck can be resolved both on nodes and fiber links. This article formulates this node configuration problem with bandwidth bottleneck resolution as a combinatorial optimization problem, and proves the NP-completeness of its decision version. Then, it presents the two-phase heuristic algorithm composed of a greedy method and a variable depth search (VDS) method. Our algorithm is evaluated through extensive network simulations, where the results support the effectiveness of this joint assignment approach.
AB - The wavelength-division multiplexing (WDM) technology has been extensively studied and actually deployed as a key technology to solve global information explosions by multiplexing plural signal paths using different wavelengths into one optical fiber. Among WDM-based network architectures, this article focuses on a double-ring one for a next-generation metropolitan area network (MAN), where each node is normally equipped with two pairs of fast-tunable transmitters and wavelength-fixed receivers (TT-FR) as interface to two fibers. To enhance the network performance, additional transmitters/receivers at nodes and receiver wavelengths should be assigned optimally, so that the bandwidth bottleneck can be resolved both on nodes and fiber links. This article formulates this node configuration problem with bandwidth bottleneck resolution as a combinatorial optimization problem, and proves the NP-completeness of its decision version. Then, it presents the two-phase heuristic algorithm composed of a greedy method and a variable depth search (VDS) method. Our algorithm is evaluated through extensive network simulations, where the results support the effectiveness of this joint assignment approach.
KW - Bandwidth bottleneck resolution
KW - Node configuration
KW - NP-complete
KW - Simulation
KW - VDS algorithm
KW - Wavelength assignment
KW - WDM ring network
UR - http://www.scopus.com/inward/record.url?scp=69249218049&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=69249218049&partnerID=8YFLogxK
U2 - 10.1007/s11107-009-0185-y
DO - 10.1007/s11107-009-0185-y
M3 - Article
VL - 18
SP - 218
EP - 226
JO - Photonic Network Communications
JF - Photonic Network Communications
SN - 1387-974X
IS - 2
ER -