Proceedings ArticleDOI
Diverse routing of scheduled lightpath demands in an optical transport network
J. Kuri,N. Puech,Maurice Gagnaire +2 more
- pp 69-76
TLDR
The results show that backup-multiplexing improves the utilization of channels but requires significant computing capacity under a fixed computing capacity budget, and is useful in cases where there is little time disjointness among SLDs.Abstract:
This article addresses the problem of defining working and protection paths for scheduled lightpath demands (SLDs) in an optical transport network. An SLD is a demand for a set of lightpaths (connections), defined by a tuple (s, d, n, /spl alpha/, /spl omega/), where s and d are the source and destination nodes of the lightpaths, n is the number of requested lightpaths and /spl alpha/, /spl omega/ are the set-up and tear-down dates of the lightpaths. The problem is formulated as a combinatorial optimization problem where the objective is to minimize the number of channels required to instantiate the lightpaths. Two techniques are used to achieve this goal: channel reuse and backup-multiplexing. The former consists of assigning the same channel (either working or spare) to several lightpaths, provided that these lightpaths are not simultaneous in time. The latter consists of sharing a spare channel among multiple lightpaths. A spare channel cannot be shared if two conditions hold: a) the working paths of these lightpaths have at least one span in common and b) these lightpaths are simultaneous in time. In the other cases, the spare channel can be shared. We propose a simulated annealing (SA) based algorithm to find approximate solutions to this optimization problem since finding exact solutions is computationally intractable. The results show that backup-multiplexing improves the utilization of channels but requires significant computing capacity. Under a fixed computing capacity budget, the technique is useful in cases where there is little time disjointness among SLDs.read more
Citations
More filters
Journal ArticleDOI
Routing and wavelength assignment of scheduled lightpath demands
TL;DR: Algorithms that compute the routing and wavelength assignment (RWA) for scheduled lightpath demands in a wavelength-switching mesh network without wavelength conversion functionality are presented.
Journal ArticleDOI
A Survey of Advance Reservation Routing and Wavelength Assignment in Wavelength-Routed WDM Networks
TL;DR: A comprehensive survey of the past and current work on advance reservation for optical networks is provided and there have been many variations of the advance reservation concept proposed, so a broad classification is provided.
Posted Content
Deep Reinforcement Learning meets Graph Neural Networks: exploring a routing optimization use case
Paul Almasan,José Suárez-Varela,Arnau Badia-Sampera,Krzysztof Rusek,Pere Barlet-Ros,Albert Cabellos-Aparicio +5 more
TL;DR: This paper proposes to use Graph Neural Networks (GNN) in combination with DRL, and its novel DRL+GNN architecture is able to learn, operate and generalize over arbitrary network topologies.
Journal ArticleDOI
Static routing and wavelength assignment for multicast advance reservation in all-optical wavelength-routed WDM networks
TL;DR: This paper proves the MCAR problem is NP-complete, formulates the problem mathematically as an integer linear program (ILP), and develops three efficient heuristics, seqRWA, ISH, and SA, to solve the problem for practical size networks.
Journal ArticleDOI
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
TL;DR: Comparing the proposed algorithms with an existing tabu search algorithm for the same problem and with lower bounds derived indicates that the suggested algorithms not only yield solutions superior in quality to those obtained by the existing algorithm, but have drastically shorter execution times.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Finding the k Shortest Paths
TL;DR: K shortest paths are given for finding the k shortest paths connecting a pair of vertices in a digraph, and applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery are described.
Generalized Multi-Protocol Label Switching (GMPLS) Architecture
TL;DR: This document describes the architecture of GMPLS, which extends MPLS to encompass time-division, wavelength, and spatial switching and aims to cover both the signaling and the routing part of that control plane.
Journal ArticleDOI
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
TL;DR: A method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfermode (ATM) virtual path (VP)-based restoration and jointly optimizing working path routing and spare capacity placement.
Journal ArticleDOI
Restoration strategies and spare capacity requirements in self-healing ATM networks
Yijun Xiong,L.G. Mason +1 more
TL;DR: A new heuristic algorithm based on the minimum cost route concept is developed for the design of large self-healing ATM networks using path restoration, and results illustrate that the heuristicgorithm is efficient and gives near-optimal solutions for the spare capacity allocation and flow assignment.