Optimal RWA for SDM Optical Network under Dynamic Traffic

With the rapid increase in demand for data transmission in our generation where Internet and cloud concepts play an essential role, it has become mandatory that we handle data most efficiently. A promising solution to overcome the capacity crunch problem which is so evident in future is applications of Space Division Multiplexing, where we explore the remaining unused domain that is the spectral and spatial domain. Space Division Multiplexing using multi-core fibers (MCF), and few-mode fibers (FMF) has been studied in our work to enhance the data-carrying capacity of optical fibers while minimizing the transmission cost per bit. The objective is to develop a path protection scheme to handle communication requests in the data center (DC) networks using elastic optical networking and space division multiplexing (SDM). Our approach to this problem is to 1) determining the initial allocation of light path on the topology, 2) possible spectrum allocation using the flex-grid flexible-SDM model, 3) choose the best possible route to minimize the number of subcarriers needed for data transfer. We propose to evaluate the developed Integer Linear Programming (ILP) formulation based on this scheme

Quality Analysis in Phase Modulated Radio Over Fiber in WDM/DWDM Network

There has been increasing demand for connection setup with a higher quality of service (QoS) in WDM/DWDM networks, especially in fields like radio over fibers, where phase modulation affects the link quality. Hence to meet guaranteed QoS in a phase modulated link, the effects of phase modulation on link quality is very much needed. The link quality is termed as quality factor (Q-factor). The primary objective is to use effectively the connections available to optimize the computed number of connections and reduce the blocked connections but at the same time guarantying QoS as per client’s need. The analysis has been done by taking care of routing and wavelength assignment (RWA) techniques. The performance analysis is presented in terms of blocking probability. This work includes detailed mathematical analysis of how phase modulation affects link Q-factor.Eight bands complimentary inner outer band, four bands complimentary inner outer band, and middle outer band wavelength assignment techniques are used for analysis.Blocking probability versus connection requests, blocking probability versus wavelengths assigned, connections accepted for a given source-destination pair were analyzed for different wavelength assignment techniques

Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper)

One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networks-on-Chip (ONoCs). Among them, wavelength routing can be used to route a signal to destination by univocally associating a routing path to the wavelength of the optical carrier. Such wavelengths should be chosen so to minimize interferences among optical channels and to avoid routing faults. As a result, physical parameter selection of such networks requires the solution of complex constrained optimization problems. In previous work, published in the proceedings of the International Conference on Computer-Aided Design, we proposed and solved the problem of computing the maximum parallelism obtainable in the communication between any two endpoints while avoiding misrouting of optical signals. The underlying technology, only quickly mentioned in that paper, is Answer Set Programming (ASP). In this work, we detail the ASP approach we used to solve such problem. Another important design issue is to select the wavelengths of optical carriers such that they are spread across the available spectrum, in order to reduce the likelihood that, due to imperfections in the manufacturing process, unintended routing faults arise. We show how to address such problem in Constraint Logic Programming on Finite Domains (CLP(FD)). This paper is under consideration for possible publication on Theory and Practice of Logic Programming.Comment: Paper presented at the 33nd International Conference on Logic Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017. 16 pages, LaTeX, 5 figure

Contributions to network planning and operation of Flex-Grid/SDM optical core networks

Premi Extraordinari de Doctorat, promoció 2018-2019. Àmbit de les TICThe ever demanding bandwidth requirements for supporting emerging telecom services such as ultra-high-definition video streaming, cloud computing, connected car, virtual/augmented reality, etc., bring to the fore the necessity to upgrade continuously the technology behind transport networks in order to keep pace with this exponential traffic growth. Thus, everything seems to indicate that fixed-grid Wavelength-Division Multiplexed (WDM) networks will be upgraded by adopting a flexible-grid, thus providing finer bandwidth allocation granularities, and therefore, increasing the Grade-of-Service by packing more information in the same spectral band of standard Single-Mode Fibers (SMFs). Nevertheless, unfortunately, the fundamental Shannon’s limit of SMFs is rapidly approaching, and, then, the research efforts to increase the SMFs' capacity will be useless. One solution to overcome this capacity crunch effect is to enable one extra dimension in addition to the frequency one, namely, the spatial dimension, thus deploying S parallel paths in order to multiply, in the best case, by S the capacity of SMF-based networks. However, additionally, it is necessary to decrease the cost and energy per bit in order to provide economically attractive solutions. For this purpose, a smooth upgrade path has to be carried out as new integrated devices and system components are developed for Space Division Multiplexing (SDM). This thesis is concentrated on the planning and operation of the combined flexible WDM and SDM networks (i.e., Flex-Grid/SDM networks) proposing several strategies aimed at optimizing network resources usage with hardware complexity analysis. For this purpose, firstly, network problems are carefully studied and stated, and then, mathematical and/or heuristic algorithms are designed and implemented in an optical network simulator. Specifically, after an introduction to the thesis, chapter 2 presents the background and related work. Next, chapter 3 concentrates on the study of spatially fixed Flex-Grid/SDM networks, i.e., when a rigid number of spatial channels are reserved per allocated traffic demand. In its turn, chapter 4 studies the case of Spectrally-Spatially Flexible Optical Networks (SS-FONs), as the ones providing the upper-bound network capacity. Costs and hardware requirements implied on providing this flexibility are analyzed. Network nodes aimed at reducing the cost of SS-FONs are presented and evaluated in chapter 5. Finally, this thesis ends with the presentation of the main contributions and future research work in chapter 6.La demanda de ancho de banda cada vez más exigente para soportar servicios de telecomunicación emergentes tales como la transmisión de video de alta calidad, computación en la nube, vehículo conectado, realidad virtual/aumentada, etc.…, ha puesto de manifiesto la necesidad de actualizar constantemente la tecnología detrás de las redes de transporte óptico con la finalidad de ir a la par de este incremento exponencial del tráfico. De esta manera, todo parece indicar que las redes basadas en la multiplexación por division de longitud de onda (Wavelength Division Multiplexing, WDM) de ancho espectral fijo serán actualizadas adoptando un ancho de banda espectral flexible, que ofrece asignaciones de ancho de banda con granularidad más fina acorde a las demandas de tráfico; y por lo tanto, incremanta el Grado de Servicio de la red, ya que se permite acomodar mayor información en la misma banda espectral de las fibras monomodo (Single Mode Fibers, SMFs). Sin embargo, desafortunadamente, el límite de Shannon de las fibras monomodo se está aproximando cada vez más, y cuando esto ocurra las investigaciones para incrementar la capacidad de las fibras monomodo serán infructuosas. Una posible solución para superar este colapso de las fibras monomodo es habilitar la dimensión espacial a más de la frecuencial, desplegando � caminos paralelos con la finalidad de multiplicar por � (en el mejor de los casos) la capacidad de las fibras monomodo. No obstante, es necesario disminuir el costo y la energía por bit con la finalidad de proveer soluciones comerciales atractivas. Para tal propósito debe llevarse a cabo una actualización moderada conforme nuevos dispositivos y componentes integrados son desarrollados para la implementación de la tecnología basada en la multiplexación por división de espacio (Space Division Multiplexing, SDM). Esta tesis se concentra en la planificación y operación de la combinación de las redes WDM flexibles y SDM (es decir, de las redes Flex-Grid/SDM) proponiendo varias estrategias dirigidas a optimizar el uso de los recursos de red junto con el análisis de la complejidad del hardware que viene acompañada. Para este fin, primeramente, los problemas de red son cuidadosamente estudiados y descritos. A continuación, se han diseñado e implementado algoritmos basados en programación lineal entera o heurísticas en un simulador de redes ópticas. Después de una introducción inicial, el capítulo 2 de esta tesis presenta el marco teórico sobre los conceptos tratados y los trabajos publicados anteriormente. A continuación, el capítulo 3 se concentra en el estudio de las redes Flex-Grid/SDM con la dimensión espacial rígida; es decir, cuando un número fijo de canales espaciales son reservados por cada demanda de tráfico establecida. Por su parte, el capítulo 4 estudia las redes Flex-Grid/SDM considerando flexibilidad tanto en el dominio espacial como espectral (Spectrally and Spatially Flexible Optical Networks, SS-FONs), las cuales proveerían la capacidad máxima de las redes SDM. Adicionalmente, los costos y requerimientos de hardware implicados en la provisión de esta flexibilidad son analizados. El capítulo 5 presenta la evaluación de nodos orientados a reducir los costos de las SS-FONs. Finalmente, el capítulo 6 expone las principales contribuciones y las posibles líneas de trabajo futuroEls requisits incessants d’ample de banda per al suport de nous serveis de telecomunicació, com poden ser la difusió en directe de vídeo de molt alta definició, la informàtica en el núvol, els cotxes intel·ligents connectats a la xarxa, la realitat virtual/augmentada, etc…, han exigit una millora contínua de les tecnologíes de les actuals xarxes de transport de dades. Tot sembla indicar que les xarxes de transport òptiques actuals, basades en la tecnologia de multiplexació per divisió de longitud d’ona (Wavelength Division Multiplexing, WDM) sobre un grid espectral rígid, hauran de ser reemplaçades per tecnologies òptiques més flexibles, amb una granularitat més fina a l’hora de suportar noves connexions, incrementat el grau de servei de les xarxes gràcies a aprofitament major de l’ample de banda espectral proporcionat per les fibres òptiques monomode (Single Mode Fibers, SMFs). Tanmateix, estem exhaurint ja la capacitat màxima de les fibres òptiques SMF segons ens indica el límit fonamental de Shannon. Per tant, qualsevol esforç enfocat a millorar la capacitat d’aquestes xarxes basades en SMFs pot acabar sent infructuós. Una possible solució per superar aquestes limitacions de capacitat és explorar la dimensió espacial, a més de l’espectral, desplegant camins en paral·lel per tal de multiplicar per , en el millor cas, la capacitat de les SMFs. Tot i això, és necessari reduir el cost i el consum energètic per bit transmès, per tal de proporcionar solucions econòmicament viables. Amb aquest propòsit, pot ser necessària una migració progressiva, a mesura que es desenvolupen nous dispositius i components per aquesta nova tecnologia de multiplexació per divisió espacial (Spatial Division Multiplexing, SDM). La present tesi es centra en la planificació i operació de xarxes òptiques de nova generació que combinin tecnologies de xarxa WDM flexible i SDM (és a dir, xarxes Flex-Grid/SDM), proposant estratègies per a l’optimització de l’ús dels recursos de xarxa i, en definitiva, el seu cost (CapEx). Amb aquest propòsit, s’analitzen en primer moment els problemes adreçats. Tot seguit, es dissenyen algorismes per tal de solucionar-los, basats en tècniques de programació matemàtica i heurístiques, els quals s’implementen i es proven en un simulador de xarxa òptica. Després d’una introducció inicial, el capítol 2 d’aquesta tesi presenta tots els conceptes tractats i treballs relacionats publicats amb anterioritat. Tot seguit, el capítol 3 es centra en l’estudi de les xarxes Flex-Grid/SDM fixes en el domini espai, és a dir, on sempre es reserva un nombre rígid de canals espacials per qualsevol demanda suportada. El capítol 4 estudia les xarxes flexibles en els dominis espectrals i espacials (Spectrally-Spatially Flexible Optical Nextworks, SS-FONs), com aquelles que poden proporcionar una capacitat de xarxa màxima. En aquest context, s’analitzen els requeriments en termes de cost i hardware per tal de proporcionar aquesta flexibilitat. Llavors, en el capítol 6 es presenten opcions de node de xarxa capaces de reduir els costos de les xarxes SS-FONs. Finalment, en el capítol 7 es repassen totes les contribucions de la tesi, així com posibles línies de treball futurAward-winningPostprint (published version

Intelligent approaches to VLSI routing

Very Large Scale Integrated-circuit (VLSI) routing involves many large-size and complex problems and most of them have been shown to be NP-hard or NP-complete. As a result, conventional approaches, which have been successfully used to handle relatively small-size routing problems, are not suitable to be used in tackling large-size routing problems because they lead to \u27combinatorial explosion\u27 in search space. Hence, there is a need for exploring more efficient routing approaches to be incorporated into today\u27s VLSI routing system. This thesis strives to use intelligent approaches, including symbolic intelligence and computational intelligence, to solve three VLSI routing problems: Three-Dimensional (3-D) Shortest Path Connection, Switchbox Routing and Constrained Via Minimization. The 3-D shortest path connection is a fundamental problem in VLSI routing. It aims to connect two terminals of a net that are distributed in a 3-D routing space subject to technological constraints and performance requirements. Aiming at increasing computation speed and decreasing storage space requirements, we present a new A* algorithm for the 3-D shortest path connection problem in this thesis. This new A*algorithm uses an economical representation and adopts a novel back- trace technique. It is shown that this algorithm can guarantee to find a path if one exists and the path found is the shortest one. In addition, its computation speed is fast, especially when routed nets are spare. The computational complexities of this A* algorithm at the best case and the worst case are O(Ɩ) and 0(Ɩ3), respectively, where Ɩ is the shortest path length between the two terminals. Most importantly, this A\u27 algorithm is superior to other shortest path connection algorithms as it is economical in terms of storage space requirement, i.e., 1 bit/grid. The switchbox routing problem aims to connect terminals at regular intervals on the four sides of a rectangle routing region. From a computational point of view, the problem is NP-hard. Furthermore, it is extremely complicated and as the consequence no existing algorithm can guarantee to find a solution even if one exists no matter how high the complexity of the algorithm is. Previous approaches to the switch box routing problem can be divided into algorithmic approaches and knowledge-based approaches. The algorithmic approaches are efficient in computational time, but they are unsucessful at achieving high routing completion rate, especially for some dense and complicated switchbox routing problems. On the other hand, the knowledge-based approaches can achieve high routing completion rate, but they are not efficient in computation speed. In this thesis we present a hybrid approach to the switchbox routing problem. This hybrid approach is based on a new knowledge-based routing technique, namely synchronized routing, and combines some efficient algorithmic routing techniques. Experimental results show it can achieve the high routing completion rate of the knowledge-based approaches and the high efficiency of the algorithmic approaches. The constrained via minimization is an important optimization problem in VLSI routing. Its objective is to minimize the number of vias introduced in VLSI routing. From computational perspective, the constrained via minimization is NP-complete. Although for a special case where the number of wire segments splits at a via candidate is not more than three, elegant theoretical results have been obtained. For a general case in which there exist more than three wire segment splits at a via candidate few approaches have been proposed, and those approaches are only suitable for tackling some particular routing styles and are difficult or impossible to adjust to meet practical requirements. In this thesis we propose a new graph-theoretic model, namely switching graph model, for the constrained via minimization problem. The switching graph model can represent both grid-based and grid less routing problems, and allows arbitrary wire segments split at a via candidate. Then on the basis of the model, we present the first genetic algorithm for the constrained via minimization problem. This genetic algorithm can tackle various kinds of routing styles and be configured to meet practical constraints. Experimental results show that the genetic algorithm can find the optimal solutions for most cases in reasonable time