DocumentCode
687817
Title
Hierarchical traffic grooming formulations
Author
Hui Wang ; Rouskas, George N.
Author_Institution
Oper. Res. & Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA
fYear
2013
fDate
9-13 Dec. 2013
Firstpage
2319
Lastpage
2324
Abstract
Hierarchical traffic grooming facilitates the control and management of multigranular WDM networks. We define the hierarchical virtual topology and traffic routing (H-VTTR) problem, the grooming-specific subproblem of traffic grooming, and we present a suite of ILP formulations to solve it. The formulations represent various tradeoffs between solution quality and running time.
Keywords
integer programming; linear programming; telecommunication network management; telecommunication network routing; telecommunication network topology; telecommunication traffic; wavelength division multiplexing; H-VTTR problem; ILP formulations; grooming-specific subproblem; hierarchical traffic grooming formulations; hierarchical virtual topology and traffic routing problem; multigranular WDM network management; Network topology; Optical fiber networks; Optical switches; Routing; Topology; WDM networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Communications Conference (GLOBECOM), 2013 IEEE
Conference_Location
Atlanta, GA
Type
conf
DOI
10.1109/GLOCOM.2013.6831420
Filename
6831420
Link To Document