A GRASP-based network re-optimization strategy for improving RWA in multi-constrained optical transport infrastructures

被引:10
作者
Palmieri, Francesco [1 ]
Fiore, Ugo [1 ]
Ricciardi, Sergio [2 ]
机构
[1] Univ Naples Federico II, Complesso Univ Monte S Angelo, CSI, I-80126 Naples, Italy
[2] Univ Politecn Cataluna, DAC, ES-08034 Barcelona, Catalunya, Spain
关键词
Network Re-optimization; GRASP meta-heuristic; Wavelength-routing; RWA; Grooming; PATH-RELINKING; RECONFIGURATION;
D O I
10.1016/j.comcom.2010.05.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In wavelength-routed optical networks, end-to-end connection demands are dynamically routed according to the current network status. Naive path selection schemes, the wavelength continuity constraint and the limited or inaccurate information available can cause the virtual topology resulting from the currently allocated lightpaths to become sub-optimal. We propose an efficient re-optimization technique based on a GRASP meta-heuristic. Our work is focused on a hybrid online-offline scenario: connections are ordinarily routed dynamically using one of the available algorithms for online routing, but occasionally, when reorganization of the current virtual topology is desirable, existing paths are re-routed in order to improve load balancing and hence the ability to efficiently accept further connections. Because global changes of the logical topology and/or routing scheme can be disruptive for the provided connection services, we used iterative stepwise approaches based on a sequence of small actions (i.e., single connection re-routing and on local search from a given configuration). Simulation results demonstrate that several network performance metrics - including connection blocking ratios and bandwidth gains - are significantly improved by such approach. In particular, we achieved to accept more connection requests in our re-optimized networks with respect to the same networks without re-optimization, thus lowering the blocking ratio. Besides, in all tests we measured a notable gain in the number of freed bandwidth OC-units thanks to our re-optimization approach. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:1809 / 1822
页数:14
相关论文
共 40 条
[1]  
AIEX RM, 2003, INFORMS J COMPUTING
[2]  
BALDINE I, 1999, P IEEE INFOCOM 1999
[3]   Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and a reconfiguration study [J].
Banerjee, D ;
Mukherjee, B .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (05) :598-607
[4]   Fast network re-optimization schemes for MPLS and optical networks [J].
Bhatia, R ;
Kodialam, M ;
Lakshman, TV .
COMPUTER NETWORKS, 2006, 50 (03) :317-331
[5]   Lightpath re-optimization in mesh optical networks [J].
Bouillet, E ;
Labourdette, JF ;
Ramamurthy, R ;
Chaudhuri, S .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (02) :437-447
[6]  
Casetti C, 2001, GLOB TELECOMM CONF, P1882, DOI 10.1109/GLOCOM.2001.965901
[7]   LIGHTPATH COMMUNICATIONS - AN APPROACH TO HIGH BANDWIDTH OPTICAL WANS [J].
CHLAMTAC, I ;
GANZ, A ;
KARMI, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (07) :1171-1182
[8]   Solving virtual topology reconfiguration problem on survivable WDM networks by using simulated annealing and genetic algorithms [J].
Din, Der-Rong .
PHOTONIC NETWORK COMMUNICATIONS, 2009, 18 (01) :1-13
[9]   GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES [J].
FEO, TA ;
RESENDE, MGC .
JOURNAL OF GLOBAL OPTIMIZATION, 1995, 6 (02) :109-133
[10]   A PROBABILISTIC HEURISTIC FOR A COMPUTATIONALLY DIFFICULT SET COVERING PROBLEM [J].
FEO, TA ;
RESENDE, MGC .
OPERATIONS RESEARCH LETTERS, 1989, 8 (02) :67-71