Traffic Engineering in G-MPLS networks with QoS guarantees

In this paper a new Traffic Engineering (TE) scheme to efficiently route sub-wavelength requests with different QoS requirements is proposed for G-MPLS networks. In most previous studies on TE based on dynamic traffic grooming, the objectives were to minimize the rejection probability by respecting the constraints of the optical node architecture, but without considering service differentiation. In practice, some high-priority (HP) connections can instead be characterized by specific constraints on the maximum tolerable end-to-end delay and packet-loss ratio. The proposed solution consists of a distributed two-stage scheme: each time a new request arrives, an on-line dynamic grooming scheme finds a route which fulfills the QoS requirements. If a HP request is blocked at the ingress router, a preemption algorithm is executed locally in order to create room for this traffic. The proposed preemption mechanism minimizes the network disruption, both in term of number of rerouted low-priority connections and new set-up lightpaths, and the signaling complexity. Extensive simulation experiments are performed to demonstrate the efficiency of our scheme

Design and provisioning of WDM networks for traffic grooming

Wavelength Division Multiplexing (WDM) is the most viable technique for utilizing the enormous amounts of bandwidth inherently available in optical fibers. However, the bandwidth offered by a single wavelength in WDM networks is on the order of tens of Gigabits per second, while most of the applications\u27 bandwidth requirements are still subwavelength. Therefore, cost-effective design and provisioning of WDM networks require that traffic from different sessions share bandwidth of a single wavelength by employing electronic multiplexing at higher layers. This is known as traffic grooming. Optical networks supporting traffic grooming are usually designed in a way such that the cost of the higher layer equipment used to support a given traffic matrix is reduced. In this thesis, we propose a number of optimal and heuristic solutions for the design and provisioning of optical networks for traffic grooming with an objective of network cost reduction. In doing so, we address several practical issues. Specifically, we address the design and provisioning of WDM networks on unidirectional and bidirectional rings for arbitrary unicast traffic grooming, and on mesh topologies for arbitrary multipoint traffic grooming. In multipoint traffic grooming, we address both multicast and many-to-one traffic grooming problems. We provide a unified frame work for optimal and approximate network dimensioning and channel provisioning for the generic multicast traffic grooming problem, as well as some variants of the problem. For many-to-one traffic grooming we propose optimal as well as heuristic solutions. Optimal formulations which are inherently non-linear are mapped to an optimal linear formulation. In the heuristic solutions, we employ different problem specific search strategies to explore the solution space. We provide a number of experimental results to show the efficacy of our proposed techniques for the traffic grooming problem in WDM networks

Resource allocation in disaggregated optical networks

The recently introduced disaggregation model is gaining interest due to its benefits when compared with traditional models.In essence, it consists on the separation of traditional hardware appliances (e.g. servers, network nodes) into commodity components, which then are mounted independently for their exploitation into customized physical infrastructures. Such an approach allows telecommunication operators and service providers to appropriately size their infrastructure and grow as needed. One of the main key benefits of the disaggregation model is the break of the vendor lock-in, pushing towards interoperability between equipment from different vendor with minimum standardization of software and hardware specifications, allowing operators to build the best solutions for their needs. Moreover, efficient scaling is also an important benefit introduced by the disaggregation approach. Due to these benefits, among others, the disaggregation model is gaining momentum and is being adopted into multiple fields and domains of nowadays telecom infrastructures. In this regard, the scenario under study of this master thesis focuses on disaggregated optical transport networks. Disaggregation allows for more open and customized optical networks, reducing both capital and operational expenditures for infrastructure owners.However, despite of these positive aspects, disaggregated optical networks face several challenges, beingthe degradation of the network performance when compared to traditional integrated solutions the most important one. In this regard, this thesis investigates the impact of disaggregation in optical networks and investigates regeneration as a potential solution to compensate the performances’ degradation. Under this premise, optimal solutions for regenerator placement, exploiting the inherent grooming capabilities of regenerators, are proposed and evaluatedIncomin

Reformulation and Decomposition Approaches for Traffic Routing in Optical Networks

International audienceWe consider a multi-layer network design model arising from a real-life telecommunication application where traffic routingdecisions imply the installation of expensive nodal equipment. Customer requests come in the form of bandwidthreservations 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 multi-commodity network flowapproaches are not suited for this problem. Instead, four alternative models relying on Dantzig-Wolfe and/or Benders' decomposition areintroduced and compared. The formulations are strengthened using symmetry breaking restrictions, variable domain reduction, zero-onediscretization 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 two hours of computing time

Reformulation and Decomposition Approaches for Traffic Routing in Optical Networks

International audienceWe consider a multi-layer network design model arising from a real-life telecommunication application where traffic routingdecisions imply the installation of expensive nodal equipment. Customer requests come in the form of bandwidthreservations 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 multi-commodity network flowapproaches are not suited for this problem. Instead, four alternative models relying on Dantzig-Wolfe and/or Benders' decomposition areintroduced and compared. The formulations are strengthened using symmetry breaking restrictions, variable domain reduction, zero-onediscretization 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 two hours of computing time

Proceedings of ONDM2002 — Kluwer 1 A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh Logical Topologies

In this paper we consider a logical topology design problem on DWDM optical networks where the traffic is quantized at sub-wavelength resolution and the critical factor to determine the fitness of a solution is the number of lightpaths required, that is proportional to the number of hardware modules to handle the traffic. The problem has been shown to be NP-hard. We review some of the previous work in the field, examine a number of regular but unsatisfactory solutions and describe a greedy-based iterated heuristic belonging to the GRASP family to minimise the number of lightpaths. At the end we present some experimental results that compare our GRASP heuristic with other greedy-based methods and with regular topologies