No abstract

O projeto Novel Enablers for Cloud Slicing (NECOS) propo ̃e uma soluc ̧a ̃o que visa automatizar o processo de configurac ̧a ̃o otimizada de nuvem e rede, fornecendo um gerenciamento uniforme com um alto n ́ıvel de autonomia para os recursos de computac ̧a ̃o, conectividade e armazenamento atualmente separados, baseado no conceito LSDC (Lightweight Slice Defined Cloud). Neste artigo, discute-se a motivac ̧a ̃o, objetivos, arquitetura, desafios de pesquisa e esforc ̧os iniciais do projeto NECOS atrave ́s dos casos de uso definidos.

Abstract-Internet eXchange Points (IXP) have become an increasing research target when aiming at understanding the complex and evolving Internet ecosystem. IXPs are shared infrastructures where Autonomous Systems (AS) implement peering agreements for their traffic exchange and thus represent an interesting microcosm of the Internet diversity and a strategic vantage point to deliver end-user services.In this article, we provide an in-depth analysis of the largest set of public IXPs in a single country, namely the case of Brazil. The Brazilian public peering ecosystem counts with over 25 IXPs maintained by an overarching project called IX.br following a non-profit business model that facilitates multilateral agreements. The nation-wide peering initiative provides an appealing environment for innovation and fostering IP connectivity market practices. Without IX.br, access providers are limited in terms of coverage, performance, cost, and dependence on transit providers. The open and incentive-rich IXP approach can be regarded as an interesting development that may inspire other development countries as well as more established regional markets. Based on BGP data from all looking glass servers in IX.br, we provide insights into the peering ecosystem per IXP and from a nation-wide perspective by inspecting properties of the connectivity graphs and the IPv4 and IPv6 prefix distribution. We propose peering affinity as a metric well-suited to measure the connectivity between different types of ASes and overall found lower peering density in IX.br when compared to more mature ecosystems, such as AMS-IX, DE-CIX, LINX, and MSK-IX. When dissecting AS-level graphs we also observe the formation of IXP-enabled k-clique communities. As a final contribution, we have shared our 16 GB dataset along all supporting code to allow for new research studies by the community.

A Comunicação entre dispositivos quânticos vem avançando em direção a redes de topologias complexas e de longa distâncias. No entanto, limitações intrínsecas dos sinais quânticos fazem com que eles não possam ser replicados ou amplificados, dificultando a adoção das técnicas tradicionais de roteamento. Além disso, a heterogeneidade de tecnologias e diferentes implementações de hardware, e a falta de um modelo de pilha de rede de Internet bem definido abrem diversos desafios para se realizar plenamente a comunicação entre dispositivos quânticos. Assim, este artigo apresenta os principais desafios no desenvolvimento de algoritmos e protocolos de roteamento para redes quânticas e discute possíveis alternativas que estão sendo desenvolvidas.

Datacenter (DC) design has been moved towards the edge computing paradigm motivated by the need of bringing cloud resources closer to end users. However, the Software Defined Networking (SDN) architecture offers no clue to the design of Micro Datacenters (MDC) for meeting complex and stringent requirements from next generation 5G networks. This is because canonical SDN lacks a clear distinction between functional network parts, such as core and edge elements. Besides, there is no decoupling between the routing and the network policy. In the thesis, we introduce Residue Defined Networking Architecture (RDNA) as a new approach for enabling key features like ultra-reliable and low-latency communication in MDC networks. RDNA explores theprogrammability of Residues Number System (RNS) as a fundamental concept to define a minimalist forwarding model for core nodes. Instead of forwarding packets based on classical table lookup operations, core nodes are tableless switches that forward packets using merely remainder of the division (modulo) operations. By solving a residue congruence system representing a network topology, we found out the algorithms and their mathematical properties to design RDNAs routing system that (i) supports unicast and multicast communication,(ii) provides resilient routes with protection for the entire route, and (iii) is scalable for 2-tier Clos topologies. Experimental implementations on Mininet and NetFPGA SUME show that RDNA achieves 600 ns switching latency per hop with virtually no jitter at core nodes and sub-millisecond failure recovery time.