(Non-)reconfigurable virtual topology design under multihour traffic in optical networks

Authors:
Ramon Aparicio-Pardo;Nina Skorin-Kapov;Pablo Pavon-Marino;Belen Garcia-Manrubia
Affiliations:
Universidad Politécnica de Cartagena, Cartagena, Spain;Faculty of Electrical Engineering and Computing, University of Zagreb, Zagreb, Croatia;Universidad Politécnica de Cartagena, Cartagena, Spain;Universidad Politécnica de Cartagena, Cartagena, Spain
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 11
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks

IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network

IEEE/ACM Transactions on Networking (TON)
Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study

IEEE/ACM Transactions on Networking (TON)
Virtual-topology adaptation for WDM mesh networks under dynamic traffic

IEEE/ACM Transactions on Networking (TON)
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Domination Between Traffic Matrices

Mathematics of Operations Research
MatPlanWDM: an educational tool for network planning in wavelength-routing networks

ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
Routing and wavelength assignment of scheduled lightpath demands

IEEE Journal on Selected Areas in Communications
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

IEEE Journal on Selected Areas in Communications - Part Supplement
Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates offline virtual topology design in transparent optical networks under a multihour traffic demand. The main problem variant addressed here designs a reconfigurable virtual topology that evolves over time to more efficiently utilize network resources (the MH-VTD-R problem). The case of designing a static non-reconfigurable virtual topology that can accommodate the time-varying traffic (the MH-VTD-NR problem) is also considered. The objectives are to minimize: 1) the number of transceivers, which make up for the main network cost; and 2) the frequency of reconfiguration (for MH-VTD-R), which incurs additional overhead and potential service disruption. We formulate this multiobjective problem as an exact mixed integer linear program (MILP). Due to its high complexity, we propose a very efficient heuristic algorithm called Greedy Approach with Reconfiguration Flattening (GARF). GARF not only solves both (non-)reconfigurable problem variants, but it allows for tuning of the relative importance of the two objectives. Exhaustive experiments on real and synthetic traffic and comparison to previous proposals and bounds reveal the merits of GARF with respect to both solution quality and execution time. Furthermore, the obtained results indicate that the maximal transceiver cost savings achieved by the fully reconfigurable case may not be enough to justify the associated increase in reconfiguration cost. However, results show that an advantageous tradeoff between transceiver cost savings and reconfiguration cost can be achieved by a allowing a small number of virtual topology reconfigurations over time.