Reformulation and decomposition approaches for traffic routing in optical networks

Abstract

We consider a multilayer network design model arising from a real‐life telecommunication application where traffic routing decisions imply the installation of expensive nodal equipment. Customer requests come in the form of bandwidth reservations for a given origin destination pair. Bandwidth demands are expressed as multiples of nominal granularities. Each request must be single‐path routed. Grooming several requests on the same wavelength and multiplexing wavelengths in the same optical stream allow a more efficient use of network capacity. However, each addition or withdrawal of a request from a wavelength requires optical to electrical conversion and the use of cross‐connect equipment with expensive ports of high densities. The objective is to minimize the number of required ports of the cross‐connect equipment. We deal with backbone optical networks, therefore with networks with a moderate number of nodes (14 to 20) but thousands of requests. Further difficulties arise from the symmetries in wavelength assignment and traffic loading. Traditional multicommodity network flow approaches are not suited for this problem. Instead, four alternative models relying on Dantzig–Wolfe and/or Benders' decomposition are introduced and compared. The formulations are strengthened using symmetry breaking restrictions, variable domain reduction, zero‐one discretization of integer variables, and cutting planes. The resulting dual bounds are compared to the values of primal solutions obtained through hierarchical optimization and rounding procedures. For realistic size instances, our best approaches provide solutions with optimality gap of approximately 5% on average in around 2 h of computing time. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 67(4), 277–298 2016

Routing Optimization Algorithm of Spatial DTN Network Based on Multiattribute Decision

“…Therefore, based on the verification process, intelligent methods are adopted to solve the routing problem, which opens up new strategies for the routing research of the new generation information network. The basic mode of network routing is "forward-forward" [13]. Therefore, the routing problem can be transformed into a problem of finding a "proactive" suitable meeting.…”

Minimizing Time Delay of Information Routed Across Dynamic Temporal Sensor Networks

“…Examples include high-resolution video, telephone intercepts, traffic congestion reports, internal vehicle system states, among others. In commercial telecommunication networks, there are instances where the capacity across the network is in the ter-abytes per second range [8]. Networks of this type have the ability to transmit all data that is collected without restrictions or delays.…”

Nested Column Generation decomposition for solving the Routing and Spectrum Allocation problem in Elastic Optical Networks

“…Hennig et al (2012) proposed a Nested Column Generation algorithm for the Crude Oil Tanker Routing and Scheduling problem such that the first subproblem generates a cargo-route for each ship. This subproblem is solved using a Branch-and-Price algorithm with the help of a second-level subproblem which generates a route for each ship.Closer to the applications in optical networks,Vignac et al (2016) presented multiple models for the Grooming, Routing and Wavelength Assignment problem, among which, a Column Generation algorithm where a subproblem for each wavelength is defined to find the traffic carried by this wavelength, called a Wavelength Routing Configuration. This subproblem is itself decomposed into arc-disjoint grooming-patterns, thus leading to a nested decomposition.Similarly toVanderbeck (2001), the bounds of the Pricing Problems are used to compute Lagrangian dual bounds on the master LP, thus resulting into a heuristic Caprara et al (2016).…”