TY - CONF
T1 - Optical Tunnel Allocation for WDM Networks with Multi-granularity Switching Capabilities
AU - Lee, Steven S W
AU - Yuang, Maria C.
AU - Tien, Po-Lung
AU - Lin, S. H.
PY - 2003
Y1 - 2003
N2 - For WDM networks with multi-granularity switching, Optical Tunnel Allocation (OTA) deals with the real-time establishment of optical tunnels between optical nodes through various optical multi-granularity switching devices. OTA is in principle a dynamic Routing and Wavelength Assignment (RWA) problem with multi-granularity switching devices taken into account. In this paper, we propose a novel approximation approach, called Lagrangean Relaxation with Heuristics (LRH), aimed to resolve RWA considering both fiber and lambda switches. Such RWA is first formulated as a combinatorial optimization problem in which the bottleneck link utilization is to be minimized. To tackle the problem, the LRH approach performs constraint relaxation and derives a lower-bound solution index according to a set of Lagrangean multipliers generated through subgradient-based iterations. In parallel, using the generated Lagrangean multipliers, the LRH approach employs a new heuristic algorithm to arrive at a near-optimal upper-bound solution. Through numerical results and comparisons, we delineate that the LRH approach achieves a near-optimal solution, which is profoundly tight to its lower bound, at the expense of low computational time complexity.
AB - For WDM networks with multi-granularity switching, Optical Tunnel Allocation (OTA) deals with the real-time establishment of optical tunnels between optical nodes through various optical multi-granularity switching devices. OTA is in principle a dynamic Routing and Wavelength Assignment (RWA) problem with multi-granularity switching devices taken into account. In this paper, we propose a novel approximation approach, called Lagrangean Relaxation with Heuristics (LRH), aimed to resolve RWA considering both fiber and lambda switches. Such RWA is first formulated as a combinatorial optimization problem in which the bottleneck link utilization is to be minimized. To tackle the problem, the LRH approach performs constraint relaxation and derives a lower-bound solution index according to a set of Lagrangean multipliers generated through subgradient-based iterations. In parallel, using the generated Lagrangean multipliers, the LRH approach employs a new heuristic algorithm to arrive at a near-optimal upper-bound solution. Through numerical results and comparisons, we delineate that the LRH approach achieves a near-optimal solution, which is profoundly tight to its lower bound, at the expense of low computational time complexity.
KW - Combinatorial optimization problem
KW - Lagrangean relaxation
KW - Multi-granularity switching capabilities
KW - Optical tunnel allocation
KW - Routing and Wavelength Assignment (RWA)
KW - Subgradient method
KW - Wavelength Division Multiplexing (WDM)
UR - http://www.scopus.com/inward/record.url?scp=0842266833&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2003.1258732
DO - 10.1109/GLOCOM.2003.1258732
M3 - Paper
AN - SCOPUS:0842266833
SP - 2730
EP - 2734
T2 - IEEE Global Telecommunications Conference GLOBECOM'03
Y2 - 1 December 2003 through 5 December 2003
ER -