| Summary: | This paper proposes three novel integer linear programming (ILP) formulations, where the first model deals with the Grooming, Routing, Wavelength Assignment, and Carrier Ethernet Interface Allocation Problem (GRWA-I); the second to Traffic Re-Grooming Problem (TRGP) to accommodate demand changes in a GRWA-I network scenarios; and the third to Traffic Re-Grooming demands in case of failures. The traffic re-grooming problem consists basically in assigning demands change in a working network, without affect others requests. In addition, in this work, it problem is formulated for the first time using ILP model. As TRGP needs a configured network scenario as input parameter, the first model proposed accomplish this task for the first network scenario. In numerical results, it was used a 14-node network (NSFnet) and 6 traffic matrix. Moreover, the models proposed were compared with a shortest path (SP) routing method. Results show the difference for network cost between an optimal method and a heuristic design over time, as well as the importance of an initial optimal configuration for future network growth.
|
|---|
