Alocação de recursos em redes ópticas elásticas baseadas em multiplexação por divisão espacial

Orientador: Nelson Luis Saldanha da FonsecaDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: Tecnologias de redes ópticas baseadas em fibras mono-núcleo e mono-modo possuem limite de capacidade e não conseguem suprir a demanda crescente de largura de banda. Um forma de resolver esse problema se dá através do uso de multiplexação por divisão espacial (SDM - \textit{Space-Division Multiplexing}). A transmissão de dados em SDM ocorre através de múltiplos núcleos agrupados em um único filamento de fibra, ou utilizando múltiplos modos transversais suportados por um núcleo. A combinação da flexibilidade de redes ópticas elásticas (EON - \textit{Elastic Optical Networks}) e a alta capacidade do SDM é promissora para o futuro das redes ópticas. Na camada de enlace, quando uma nova solicitação para estabelecimento de conexão chega, é necessário fazer a reserva de recursos para realizar essa conexão. A determinação dos recursos a serem alocados é dada pela solução do problema de roteamento, alocação de núcleo e \textit{slots} (RCSA - \textit{Routing, Core and Spectrum Allocation}). Na alocação de recursos, algumas restrições devem ser respeitadas, tais como a contiguidade e continuidade dos \textit{slots} de frequência, e tolerância ao \textit{crosstalk} espacial. Estas restrições implicam em uma maior complexidade para a acomodação do tráfego das conexões. A virtualização de redes permite que redes virtuais compartilhem recursos físicos, simplificando o gerenciamento de recursos na camada óptica, oferecendo flexibilidade na alocação de recursos e segurança dos serviços. Um dos principais desafios da virtualização é configurar de forma eficiente as redes virtuais, que consiste na alocação de recursos físicos para acomodá-las. Esta tese propõe soluções para o problema do RCSA em redes SDM-EON. A primeira contribuição desta tese é um algoritmo que considera o equilíbrio entre eficiência energética e bloqueio de requisições. Propõe-se um algoritmo de agregação de tráfego em lote, capitalizando na flexibilidade temporal para satisfazer requisições com o objetivo de formar lotes de requisições, aumentando assim a probabilidade de serem atendidas as requisições em um outro momento. A segunda contribuição desta tese é direcionada para a solução do problema da fragmentação, que ocorre em cenários onde pequenos conjuntos de \textit{slots} disponíveis ficam espalhados no espectro, causando o bloqueio de novas requisição. Propõem-se um conjunto de algoritmos proativos e reativos. Os algoritmos proativos utilizam diferentes técnicas, tais como, múltiplos caminhos, priorização de núcleo e área, bem como métricas de avaliação da fragmentação na composição de caminhos. O algoritmo reativo utiliza aprendizagem de máquina para fazer um rearranjo espectral e aumentar a capacidade de prevenção da fragmentação no RCSA. A terceira contribuição desta tese é uma solução para aumentar a eficiência do compartilhamento de recursos em redes virtuais. Este problema consiste na configuração de enlaces e nós virtuais para caminhos e nós físicos, respectivamente. A solução proposta introduz uma arquitetura utilizando aprendizado de máquina, que age como um assistente no processo de configuração de redes virtuaisAbstract: Optical network technologies based on a single-core and single-mode fibers have a limited capacity and cannot provide enough resources to a constant increase of bandwidth demands. One approach to overcome this is the use of Space-Division Multiplexing (SDM) which relies on sending data through multiple cores embedded into a single strand of fiber or using multiple transverse modes supported by a core. The combination of the flexibility of Elastic Optical Networks (EONs) and the high capacity of SDM is a promising solution to cope with the bandwidth demands. At the network level, when a traffic request arrives, it needs to reserve network resources to establish it. One approach to accommodate traffic demand over optical networks is the Routing, Core and Spectrum Allocation (RCSA), in which end-to-end lightpaths are offered for each individual request. In these scenarios, during the allocation process, some constraints need to be respected, such as contiguity and continuity of slots (selected in the resource selection process), and spatial crosstalk. These constraints pose extra complexity to accommodate the requests for the lightpath establishment. As one of the possible solutions, network virtualization is capable of improving the efficiency of optical networks, by allowing virtual networks to share the resources of physical networks, simplifying the management of resource and providing flexibility in resource allocation. One of the main challenges of network virtualization is to configure a virtual network efficiently which comprises allocating physical resources to accommodate incoming virtual networks. This thesis proposes solutions to the RCSA problem and the virtual network configuration problem for SDM-EON networks. The first contribution of this thesis is an algorithm to promote an equilibrium between reduction of the network energy consumption and reduction of the blocking of requests. For this purpose, we introduce a traffic grooming algorithm using batches, which takes advantage of the deadline of each request to form batches, increasing the chances of the requests to be established at another time. The second contribution of this thesis is a set of algorithms using different techniques to handle the fragmentation problem, where a small portion of available slot sequences end up scattered in a fiber link, blocking future requests, called the fragmentation problem. For this purpose, we propose proactive and reactive algorithms. Proactive algorithms use different techniques, such as multipath routing, core, and area prioritization, and metrics to use in the route selection process. The reactive algorithm uses machine learning to rearrange the spectrum and tune the RCSA algorithm to prevent the fragmentation. The third contribution of this thesis proposes a solution to improve resource sharing in network virtualization. This problem consists in configuring virtual links and nodes to physical nodes and paths. For this purpose, we propose a learning assistant control loop to handle the virtual network configuration problemMestradoCiência da ComputaçãoMestra em Ciência da Computação131025/2017-1CNP

Network virtualization in next-generation cellular networks: a spectrum pooling approach

The hardship of expanding the cellular network market results from the tremendous high cost of mobile infrastructure, i.e. the capital expenditures (CAPEX) and the operational expenditures (OPEX). Spectrum Sharing is one of the proposed solution for the high-cost of scalability of cellular networks. However, most of the proposed spectrum pooling frameworks in the literature are mostly approached from a technical view besides there are no good cost models based on real datasets for quantifying the circumstances under which sharing the spectrum and network resources would be beneficial to mobile operators. In this thesis, by studying different sharing scenarios in a fiber-based backhaul mobile network, we assess the incentives for service providers (SPs) to share spectrum/infrastructure in different cellular market areas/economic areas (CMA/BEAs) with different population density, allocated bandwidth (BW), spectrum bid values and considering different network topologies. Moreover, we look at the technical problem of sharing the spectrum between two SPs sharing the same basestation (BS), yet they have different traffic demand as well as different QoS constraints. We design a resource allocation scheme to provision real-time (RT), non-real-time (NRT) as well as Ultra-reliable Low Latency Communications (URLLC) traffic in a single shared BS scenario such that SPs achieve isolation, fairness and enforce their QoS constraints. Finally, we exploit spectrum pooling to develop an approach for dynamically re-configuring the base stations that survive a disaster and are powered by a microgrid to form a multi-hop mesh network in order to provide local cellular service

Space station data system analysis/architecture study. Task 4: System definition report

Functional/performance requirements for the Space Station Data System (SSDS) are analyzed and architectural design concepts are derived and evaluated in terms of their performance and growth potential, technical feasibility and risk, and cost effectiveness. The design concepts discussed are grouped under five major areas: SSDS top-level architecture overview, end-to-end SSDS design and operations perspective, communications assumptions and traffic analysis, onboard SSDS definition, and ground SSDS definition

Space station data system analysis/architecture study. Task 2: Options development, DR-5. Volume 2: Design options

The primary objective of Task 2 is the development of an information base that will support the conduct of trade studies and provide sufficient data to make key design/programmatic decisions. This includes: (1) the establishment of option categories that are most likely to influence Space Station Data System (SSDS) definition; (2) the identification of preferred options in each category; and (3) the characterization of these options with respect to performance attributes, constraints, cost and risk. This volume contains the options development for the design category. This category comprises alternative structures, configurations and techniques that can be used to develop designs that are responsive to the SSDS requirements. The specific areas discussed are software, including data base management and distributed operating systems; system architecture, including fault tolerance and system growth/automation/autonomy and system interfaces; time management; and system security/privacy. Also discussed are space communications and local area networking

An investigation into the scale-free nature of heterogenous networks.

In order to support a wide variety of services, to different user types, and under a variety of geographic situations, telecommunications networks are typically composed of a variety of layers and heterogeneous technologies. Layers (in terms of the OSI 7 layer model) such as the transmission layer (e.g. WDM), the data link layer (also known as the transport network e.g. SDH, Ethernet) and the network layer (e.g. IP). These layers may also contain logical layers within them such as virtual paths, as well as overlay networks such as a peer-to-peer system. No single layer is independent of the adjacent layer and the provisioning requirements of one layer become the demand on the layer below. Similarly the available resources become the delivered quality of service to the layer above. This thesis is concerned with the design aspects of various layers and how they affect each other's topology. The thesis' main focus is topological analysis and modelling of layers, and it presents a detailed analysis of a deployed national SDH network, examining bandwidth distribution, topology, geography and the demand pattern. The thesis finds that even the strictly planned and provisioned SDH network, whose architecture contains explicit structures and hierarchy, has notable power-law traits in various metrics of the topology traits similar to those which have been shown to exist in the Internet, as well as non-technological networks such as social graphs. There is also an examination of the protocols and architectures of the IP and SDH standards for features that affect topological development. With a better understanding of the layers, design goals and assumptions are deduced and implemented in a new topology simulator called MITIE. MITIE (Modular Inter-layer feedback Topology InvEstigation tool and simulator) is a tool designed to investigate inter-layer feedback and differs from existing topology generators in that it considers the effect of serviced demands and allows the capacity usage to affect the further development of the topology. The thesis presents results from a series of experiments with MITIE and demonstrates that as the network is re-designed to accommodate demand, it can tend to power-law compliant topologies under the correct circumstances. Such a reactive topology model could also be used to investigate the effect of topological change and the effect of increasing the number of layers (such as adding MPLS), or the use of peer-to- peer overlay networks, or the decrease of the number of layers (IP over WDM). The model could also be used to investigate link and node failure/addition and the real effect which will propagate through the rest of the multi-layer network

Design and performance optimization of asynchronous networks-on-chip

As digital systems continue to grow in complexity, the design of conventional synchronous systems is facing unprecedented challenges. The number of transistors on individual chips is already in the multi-billion range, and a greatly increasing number of components are being integrated onto a single chip. As a consequence, modern digital designs are under strong time-to-market pressure, and there is a critical need for composable design approaches for large complex systems. In the past two decades, networks-on-chip (NoC’s) have been a highly active research area. In a NoC-based system, functional blocks are first designed individually and may run at different clock rates. These modules are then connected through a structured network for on-chip global communication. However, due to the rigidity of centrally-clocked NoC’s, there have been bottlenecks of system scalability, energy and performance, which cannot be easily solved with synchronous approaches. As a result, there has been significant recent interest in combing the notion of asynchrony with NoC designs. Since the NoC approach inherently separates the communication infrastructure, and its timing, from computational elements, it is a natural match for an asynchronous paradigm. Asynchronous NoC’s, therefore, enable a modular and extensible system composition for an ‘object-orient’ design style. The thesis aims to significantly advance the state-of-art and viability of asynchronous and globally-asynchronous locally-synchronous (GALS) networks-on-chip, to enable high-performance and low-energy systems. The proposed asynchronous NoC’s are nearly entirely based on standard cells, which eases their integration into industrial design flows. The contributions are instantiated in three different directions. First, practical acceleration techniques are proposed for optimizing the system latency, in order to break through the latency bottleneck in the memory interfaces of many on-chip parallel processors. Novel asynchronous network protocols are proposed, along with concrete NoC designs. A new concept, called ‘monitoring network’, is introduced. Monitoring networks are lightweight shadow networks used for fast-forwarding anticipated traffic information, ahead of the actual packet traffic. The routers are therefore allowed to initiate and perform arbitration and channel allocation in advance. The technique is successfully applied to two topologies which belong to two different categories – a variant mesh-of-trees (MoT) structure and a 2D-mesh topology. Considerable and stable latency improvements are observed across a wide range of traffic patterns, along with moderate throughput gains. Second, for the first time, a high-performance and low-power asynchronous NoC router is compared directly to a leading commercial synchronous counterpart in an advanced industrial technology. The asynchronous router design shows significant performance improvements, as well as area and power savings. The proposed asynchronous router integrates several advanced techniques, including a low-latency circular FIFO for buffer design, and a novel end-to-end credit-based virtual channel (VC) flow control. In addition, a semi-automated design flow is created, which uses portions of a standard synchronous tool flow. Finally, a high-performance multi-resource asynchronous arbiter design is developed. This small but important component can be directly used in existing asynchronous NoC’s for performance optimization. In addition, this standalone design promises use in opening up new NoC directions, as well as for general use in parallel systems. In the proposed arbiter design, the allocation of a resource to a client is divided into several steps. Multiple successive client-resource pairs can be selected rapidly in pipelined sequence, and the completion of the assignments can overlap in parallel. In sum, the thesis provides a set of advanced design solutions for performance optimization of asynchronous and GALS networks-on-chip. These solutions are at different levels, from network protocols, down to router- and component-level optimizations, which can be directly applied to existing basic asynchronous NoC designs to provide a leap in performance improvement