Architectural Exploration and Design Methodologies of Photonic Interconnection Networks

Photonic technology is becoming an increasingly attractive solution to the problems facing today's electronic chip-scale interconnection networks. Recent progress in silicon photonics research has enabled the demonstration of all the necessary optical building blocks for creating extremely high-bandwidth density and energy-efficient links for on- and off-chip communications. From the feasibility and architecture perspective however, photonics represents a dramatic paradigm shift from traditional electronic network designs due to fundamental differences in how electronics and photonics function and behave. As a result of these differences, new modeling and analysis methods must be employed in order to properly realize a functional photonic chip-scale interconnect design. In this work, we present a methodology for characterizing and modeling fundamental photonic building blocks which can subsequently be combined to form full photonic network architectures. We also describe a set of tools which can be utilized to assess the physical-layer and system-level performance properties of a photonic network. The models and tools are integrated in a novel open-source design and simulation environment called PhoenixSim. Next, we leverage PhoenixSim for the study of chip-scale photonic networks. We examine several photonic networks through the synergistic study of both physical-layer metrics and system-level metrics. This holistic analysis method enables us to provide deeper insight into architecture scalability since it considers insertion loss, crosstalk, and power dissipation. In addition to these novel physical-layer metrics, traditional system-level metrics of bandwidth and latency are also obtained. Lastly, we propose a novel routing architecture known as wavelength-selective spatial routing. This routing architecture is analogous to electronic virtual channels since it enables the transmission of multiple logical optical channels through a single physical plane (i.e. the waveguides). The available wavelength channels are partitioned into separate groups, and each group is routed independently in the network. Each partition is spectrally multiplexed, as opposed to temporally multiplexed in the electronic case. The wavelength-selective spatial routing technique benefits network designers by provider lower contention and increased path diversity

Control Plane Hardware Design for Optical Packet Switched Data Centre Networks

Optical packet switching for intra-data centre networks is key to addressing traffic requirements. Photonic integration and wavelength division multiplexing (WDM) can overcome bandwidth limits in switching systems. A promising technology to build a nanosecond-reconfigurable photonic-integrated switch, compatible with WDM, is the semiconductor optical amplifier (SOA). SOAs are typically used as gating elements in a broadcast-and-select (B\&S) configuration, to build an optical crossbar switch. For larger-size switching, a three-stage Clos network, based on crossbar nodes, is a viable architecture. However, the design of the switch control plane, is one of the barriers to packet switching; it should run on packet timescales, which becomes increasingly challenging as line rates get higher. The scheduler, used for the allocation of switch paths, limits control clock speed. To this end, the research contribution was the design of highly parallel hardware schedulers for crossbar and Clos network switches. On a field-programmable gate array (FPGA), the minimum scheduler clock period achieved was 5.0~ns and 5.4~ns, for a 32-port crossbar and Clos switch, respectively. By using parallel path allocation modules, one per Clos node, a minimum clock period of 7.0~ns was achieved, for a 256-port switch. For scheduler application-specific integrated circuit (ASIC) synthesis, this reduces to 2.0~ns; a record result enabling scalable packet switching. Furthermore, the control plane was demonstrated experimentally. Moreover, a cycle-accurate network emulator was developed to evaluate switch performance. Results showed a switch saturation throughput at a traffic load 60\% of capacity, with sub-microsecond packet latency, for a 256-port Clos switch, outperforming state-of-the-art optical packet switches

Machine learning-based routing and wavelength assignment in software-defined optical networks

Recently, machine learning (ML) has attracted the attention of both researchers and practitioners to address several issues in the optical networking field. This trend has been mainly driven by the huge amount of available data (i.e., signal quality indicators, network alarms, etc.) and to the large number of optimization parameters which feature current optical networks (such as, modulation format, lightpath routes, transport wavelength, etc.). In this paper, we leverage the techniques from the ML discipline to efficiently accomplish the routing and wavelength assignment (RWA) for an input traffic matrix in an optical WDM network. Numerical results show that near-optimal RWA can be obtained with our approach, while reducing computational time up to 93% in comparison to a traditional optimization approach based on integer linear programming. Moreover, to further demonstrate the effectiveness of our approach, we deployed the ML classifier into an ONOS-based software defined optical network laboratory testbed, where we evaluate the performance of the overall RWA process in terms of computational time.The authors would like to acknowl-edge the support of the project TEXEO (TEC2016-80339-R), funded by Spanish MINECO and the EU-H2020 Metrohaul project (grant no. 761727)

Architectural Model for Evaluating Space Communication Networks

[ANGLÈS] The space exploration endeavor started in 1957 with the launch and operation of the first manmade satellite, the URSS Sputnik 1. Since then, multiple space programs have been developed, pushing the limits of technology and science but foremost unveiling the mysteries of the universe. In all these cases, the need for flexible and reliable communication systems has been primordial, allowing the return of collected science data and, when necessary, ensuring the well-being and safety of astronauts. To that end, multiple space communication networks have been globally deployed, be it through geographically distributed ground assets or through space relay satellites. Until now most of these systems have relied upon mature technology standards that have been adapted to the specific needs of particular missions and customers. Nevertheless, current trends in the space programs suggest that a shift of paradigm is needed: an Internet-like space network would increase the capacity and reliability of an interplanetary network while dramatically reducing its overall costs. In this context, the System Architecting Paradigm can be a good starting point. Through its formal decomposition of the system, it can help determine the architecturally distinguishing decisions and identify potential areas of commonality and cost reduction. This thesis presents a general framework to evaluate space communication relay systems for the near Earth domain. It indicates the sources of complexity in the modeling process, and discusses the validity and appropriateness of past approaches to the problem. In particular, it proposes a discussion of current models vis-à-vis the System Architecting Paradigm and how they fit into tradespace exploration studies. Next, the thesis introduces a computational performance model for the analysis and fast simulation of space relay satellite systems. The tool takes advantage of a specifically built-in rule-based expert system for storing the constitutive elements of the architecture and perform logical interactions between them. Analogously, it uses numerical models to assess the network topology over a given timeframe, perform physical layer computations and calculate plausible schedules for the overall system. In particular, it presents a newly developed heuristic scheduler that guarantees prioritization of specific missions and services while ensuring manageable computational times.[CASTELLÀ] El inicio de la carrera espacial se inició en 1957 con el lanzamiento y operación del primer satélite artificial, el Sputnik 1 de la URSS. Desde entonces se han desarrollado múltiples programas espaciales que han llevado al límite tanto la tecnología como la ciencia y han permitido desvelar los misterios del universo. En todos estos casos, la necesidad de sistemas de comunicación flexibles y fiables ha sido primordial con el fin de asegurar el retorno de los datos científicos recopilados y, en ciertos casos, garantizar la seguridad de los astronautas. Como consecuencia, múltiples redes de comunicaciones espaciales han sido desplegadas, ya sea a través de antenas globalmente distribuidas a través de la superficie terrestre o mediante satélites repetidores. Hasta ahora la mayoría de estos sistemas se ha basado en estándares tecnológicos maduros y testeados, los cuales se han adaptado con el fin de satisfacer las necesidades específicas de cada misión y cliente. Sin embargo, las tendencias actuales en el diseño de los nuevos programas espaciales indica que un cambio de paradigma es necesario: una red espacial a imagen de Internet permitiría incrementar la capacidad y fiabilidad de las comunicaciones interplanetarias y, a la vez, reducir dramáticamente sus costes. En este contexto, el paradigma de arquitectura de sistemas puede ser un buen punto de partida. Mediante la descomposición formal del sistema, puede ayudar a determinar las decisiones que tienen un impacto cabal en el diseño de la arquitectura así como identificar las áreas con tecnologías similares y de menor coste. Esta tesis presenta un marco teórico general para evaluar sistemas de comunicaciones espaciales para misiones que orbitan la Tierra. Adicionalmente, la tesis indica los principales orígenes de complejidad durante el modelado del sistema y presenta una discusión sobre la validez de anteriores estrategias para analizar el problema. En concreto, propone una comparación de anteriores modelos respecto el paradigma de arquitectura de sistemas y su grado de adecuación para evaluar y comprar arquitecturas. A continuación, la tesis introduce un modelo computacional para simular y evaluar el rendimiento de sistemas de repetidores por satélite. La herramienta utiliza un rule-based expert system específicamente diseñado con el fin de almacenar los principales elementos constitutivos de la arquitectura y comprender las interacciones lógicas entre ellos. Análogamente, el modelo usa métodos numéricos con el fin de calcular la evolución temporal de la topología de la red en un determinado intervalo de tiempo, así como su capa física y un posible programa de contactos. En concreto, presenta un nuevo scheduler heurístico que garantiza la correcta ordenación de las misiones y servicios a la vez que asegura un tiempo computacional aceptable.[CATALÀ] L'inici de la cursa espacial va iniciar-se l'any 1957 amb el llançament i operació del primer satèl·lit artificial, l'Sputnik 1 de la URSS. Des d'aleshores s'han dut a terme múltiples programes espacials que han portat al límit tant la tecnologia com la ciència i han permès desvelar els misteris de l'univers. En tots aquests casos, la necessitat de sistemes de comunicació flexibles i fiables ha sigut primordial per tal d'assegurar el retorn de les dades científiques recopilades i, en certs casos, garantir el benestar i seguretat dels astronautes. Com a conseqüència, múltiples xarxes de comunicacions espacials han sigut desplegades, ja sigui a través d'antenes globalment distribuïdes a través de la superfície terrestre o mitjançant satèl·lits repetidors. Fins ara la majoria d'aquests sistemes s'han basat en estàndards tecnològics madurs i testats, els quals s'han adaptat per tal de satisfer les necessitats específiques de cada missió i client. Això no obstant, les tendències actuals en el disseny dels nous programes espacials indica que un canvi de paradigma és necessari: una xarxa espacial a imatge d'Internet permetria incrementar la capacitat i fiabilitat de les comunicacions interplanetàries i, alhora, reduir dramàticament els seu costs. En aquest context, el paradigma d'arquitectura de sistemes pot ser un bon punt de partida. Mitjançant la descomposició formal del sistema, pot ajudar a determinar les decisions que tenen un impacte cabdal en el disseny de l'arquitectura així com permetre identificar àrees amb tecnologies similars i de menor cost. Aquesta tesi presenta un marc teòric general per avaluar sistemes de comunicacions espacials per missions orbitant la Terra. Addicionalment, la tesi indica els principals orígens de complexitat durant el modelatge del sistema i presenta una discussió sobre la validesa d'anteriors estratègies per analitzar el problema. En concret, proposa una comparació d'anteriors models respecte el paradigma d'arquitectura de sistemes i el seu grau d'adequació per avaluar i comparar arquitectures. A continuació, la tesi introdueix un model computacional per simular i avaluar el rendiment de sistemes de repetidors per satèl·lit. L'eina empra un rule-based expert system específicament dissenyat per tal d'emmagatzemar els principals elements constitutius de l'arquitectura i comprendre les interaccions lògiques entre ells. Anàlogament, el model utilitza mètodes numèrics per tal de calcular l'evolució temporal de la topologia de la xarxa en un determinat interval de temps, així com calcular la seva capa física i un possible programa de contactes. En concret, presenta un nou scheduler heurístic que garanteix la correcte ordenació de les missions i serveis tot assegurant un temps de computació acceptable

Wavelengths switching and allocation algorithms in multicast technology using m-arity tree networks topology

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.In this thesis, the m-arity tree networks have been investigated to derive equations for their nodes, links and required wavelengths. The relationship among all parameters such as leaves nodes, destinations, paths and wavelengths has been found. Three situations have been explored, firstly when just one server and the leaves nodes are destinations, secondly when just one server and all other nodes are destinations, thirdly when all nodes are sources and destinations in the same time. The investigation has included binary, ternary, quaternary and finalized by general equations for all m-arity tree networks. Moreover, a multicast technology is analysed in this thesis to transmit data carried by specific wavelengths to several clients. Wavelengths multicast switching is well examined to propose split-convert-split-convert (S-C-S-C) multicast switch which consists of light splitters and wavelengths converters. It has reduced group delay by 13% and 29% compared with split-convert (S-C) and split-convert-split (S-C-S) multicast switches respectively. The proposed switch has also increased the received signal power by a significant value which reaches 28% and 26.92% compared with S-C-S and S-C respectively. In addition, wavelengths allocation algorithms in multicast technology are proposed in this thesis using tree networks topology. Distributed scheme is adopted by placing wavelength assignment controller in all parents’ nodes. Two distributed algorithms proposed shortest wavelength assignment (SWA) and highest number of destinations with shortest wavelength assignment (HND-SWA) algorithms to increase the received signal power, decrease group delay and reduce dispersion. The performance of the SWA algorithm was almost better or same as HND-SWA related to the power, dispersion and group delay but they are always better than other two algorithms. The required numbers of wavelengths and their utilised converters have been examined and calculated for the researched algorithms. The HND-SWA has recorded the superior performance compared with other algorithms. It has reduced number of utilised wavelengths up to about 19% and minimized number of the used wavelengths converters up to about 29%. Finally, the centralised scheme is discussed and researched and proposed a centralised highest number of destinations (CHND) algorithm with static and dynamic scenarios to reduce network capacity decreasing (Cd) after each wavelengths allocation. The CDHND has reduced (Cd) by about 16.7% compared with the other algorithms

Cross-layer modeling and optimization of next-generation internet networks

Scaling traditional telecommunication networks so that they are able to cope with the volume of future traffic demands and the stringent European Commission (EC) regulations on emissions would entail unaffordable investments. For this very reason, the design of an innovative ultra-high bandwidth power-efficient network architecture is nowadays a bold topic within the research community. So far, the independent evolution of network layers has resulted in isolated, and hence, far-from-optimal contributions, which have eventually led to the issues today's networks are facing such as inefficient energy strategy, limited network scalability and flexibility, reduced network manageability and increased overall network and customer services costs. Consequently, there is currently large consensus among network operators and the research community that cross-layer interaction and coordination is fundamental for the proper architectural design of next-generation Internet networks. This thesis actively contributes to the this goal by addressing the modeling, optimization and performance analysis of a set of potential technologies to be deployed in future cross-layer network architectures. By applying a transversal design approach (i.e., joint consideration of several network layers), we aim for achieving the maximization of the integration of the different network layers involved in each specific problem. To this end, Part I provides a comprehensive evaluation of optical transport networks (OTNs) based on layer 2 (L2) sub-wavelength switching (SWS) technologies, also taking into consideration the impact of physical layer impairments (PLIs) (L0 phenomena). Indeed, the recent and relevant advances in optical technologies have dramatically increased the impact that PLIs have on the optical signal quality, particularly in the context of SWS networks. Then, in Part II of the thesis, we present a set of case studies where it is shown that the application of operations research (OR) methodologies in the desing/planning stage of future cross-layer Internet network architectures leads to the successful joint optimization of key network performance indicators (KPIs) such as cost (i.e., CAPEX/OPEX), resources usage and energy consumption. OR can definitely play an important role by allowing network designers/architects to obtain good near-optimal solutions to real-sized problems within practical running times

Control plane routing in photonic networks

The work described in the thesis investigates the features of control plane functionality for routing wavelength paths to serve a set of sub-wavelength demands. The work takes account of routing problems only found in physical network layers, notably analogue transmission impairments. Much work exists on routing connections for dynamic Wavelength-Routed Optical Networks (WRON) and to demonstrate their advantages over static photonic networks. However, the question of how agile the WRON should be has not been addressed quantitatively. A categorization of switching speeds is extended, and compared with the reasons for requiring network agility. The increase of effective network capacity achieved with increased agility is quantified through new simulations. It is demonstrated that this benefit only occurs within a certain window of network fill; achievement of significant gain from a more-agile network may be prevented by the operator’s chosen tolerable blocking probability. The Wavelength Path Sharing (WPS) scheme uses semi-static wavelengths to form unidirectional photonic shared buses, reducing the need for photonic agility. Making WPS more practical, novel improved routing algorithms are proposed and evaluated for both execution time and performance, offering significant benefit in speed at modest cost in efficiency. Photonic viability is the question of whether a path that the control plane can configure will work with an acceptable bit error rate (BER) despite the physical transmission impairments encountered. It is shown that, although there is no single approach that is simple, quick to execute and generally applicable at this time, under stated conditions approximations may be made to achieve a general solution that will be fast enough to enable some applications of agility. The presented algorithms, analysis of optimal network agility and viability assessment approaches can be applied in the analysis and design of future photonic control planes and network architectures