TY - GEN
T1 - A bandwidth bottleneck resolution approach to node configuration optimization in WDM ring networks
AU - Isogai, Megumi
AU - Funabiki, Nobuo
AU - Isshiki, Yosuke
AU - Nakanishi, Toru
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - The wavelength-division multiplexing (WDM) technology has been extensively studied as a key technology to solve global information explosions. WDM multiplexes plural signal paths using different wavelengths into one optical fiber. Among WDM-based network architectures, this paper focuses on a double-ring network for a next-generation metropolitan area network (MAN). 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 depending on its design requirement, so that the bandwidth bottleneck can be resolved both on nodes and fibers. This paper formulates this node configuration problem as a combinatorial optimization problem and presents its two-phase heuristic algorithm using the greedy and variable depth search (VDS) methods. Our approach is evaluated through network simulations, where the results verify the effectiveness of this joint assignment approach.
AB - The wavelength-division multiplexing (WDM) technology has been extensively studied as a key technology to solve global information explosions. WDM multiplexes plural signal paths using different wavelengths into one optical fiber. Among WDM-based network architectures, this paper focuses on a double-ring network for a next-generation metropolitan area network (MAN). 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 depending on its design requirement, so that the bandwidth bottleneck can be resolved both on nodes and fibers. This paper formulates this node configuration problem as a combinatorial optimization problem and presents its two-phase heuristic algorithm using the greedy and variable depth search (VDS) methods. Our approach is evaluated through network simulations, where the results verify the effectiveness of this joint assignment approach.
UR - http://www.scopus.com/inward/record.url?scp=49049092207&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=49049092207&partnerID=8YFLogxK
U2 - 10.1109/SARNOF.2008.4520106
DO - 10.1109/SARNOF.2008.4520106
M3 - Conference contribution
AN - SCOPUS:49049092207
SN - 1424418437
SN - 9781424418435
T3 - Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF
BT - Proceedings of the 2008 IEEE Sarnoff Symposium, SARNOFF
T2 - 2008 IEEE Sarnoff Symposium, SARNOFF
Y2 - 28 April 2008 through 30 April 2008
ER -