Cost-Optimized Reservation and Routing for Scheduled Traffic in Optical Networks

Abstract

Connection requests for data-intensive applications can require a specific start time and end time/ duration when they are submitted. With the additional time domain information, cost-efficient connections can be established. In this paper, we propose two capital expenditure (CapEx) optimized approaches: the multilayer (ML) approach and a transponder/regenerator reuse (TRR) approach. Integer linear programming (ILP) is used to formulate the routing, wavelength assignment, and regenerator/multiplexer placement problem in a complex multilayer optical network to provide lower bounds for the optimized CapEx value. Due to the time and space complexity of ILP when it deals with large networks and traffic demands, we also propose a greedy heuristic and a tabusearch (TS) heuristic to solve the same problem in a less time-and resource-consuming manner. Finally, we compare the results in terms of computing time and optimized CapEx value across the ILP, greedy heuristic, and TS heuristic methods with the ML approaches for the Internet2 topology and a six-node ring topology. The performance of all three methods with the TRR approach is also tested with the same input traffic, which is composed of a mix of 10, 40, and 100 Gbps demands. The results show 30%-40% less CapEx when comparing ML with TRR. Further, our TS heuristic performs better than the greedy heuristic, and it can achieve near-optimal results compared to the ILPs.

A New Bi-Level Mathematical Model and Algorithm for VONs Mapping Problem

“…In addition, this paper also gives an outlook of the cost benefits for the operation of future optical transport networks. In order to minimize network cost in the multi-layer EONs, Two integer linear mathematical models are formulated, and a efficient algorithm, which based on greedy heuristic and tabu-search heuristic approach, is designed [11]. For the sake of minimizing EC and increasing spectrum usage [5], EC and spectrum usage aware VONs mapping methods are presented by using the minimum-sub-matrix scheme.…”

A survey of multi-layer network optimization

“…A rare paper that explicitly studies scheduled connections, i.e. reservations, with random traffic rates is [20]. The authors assume random traffic rates for the reservations and apply a tabu search heuristic to optimize their IP-over-WDM network design.…”

Hybrid Optimized Approaches for Routing and Resource Reservation Protocols in Optical Networks

“…Different algorithms have been used in the literature for wavelength reservation in optical networks including a trunk reservation policy which has been investigated in [23] for fair channel utilization. A resource reservation algorithm using tabu search has been proposed in [24] for scheduled traffic. A band reservation scheme has been proposed in [25] for passive optical networking to increase traffic aggregation at the access node and a wavelength reservation technique for different class services in [26].…”