Search

International audience; New cellular technologies combine complex software stacks and heterogeneous hardware. As a result, even if models and simulators are still essential to understand them, validation must go to the next level and rely on real software and hardware testbeds. Unfortunately, building comprehensive testbeds is expensive and this is why we propose the Sophianode, a cloud-native cellular network testbed accessible to the community. In this demonstration, we show how to run arbitrary *G experiments in this testbed by following DevOps techniques.

This document describes the LISP (Locator/ID Separation Protocol) Map-Versioning mechanism, which provides in-packet information about Endpoint ID to Routing Locator (EID-to-RLOC) mappings used to encapsulate LISP data packets. The proposed approach is based on associating a version number to EID-to-RLOC mappings and the transport of such a version number in the LISP-specific header of LISP-encapsulated packets. LISP Map-Versioning is particularly useful to inform communicating Ingress Tunnel Routers (ITRs) and Egress Tunnel Routers (ETRs) about modifications of the mappings used to encapsulate packets. The mechanism is transparent to implementations not supporting this feature, since in the LISP- specific header and in the Map Records, bits used for Map-Versioning can be safely ignored by ITRs and ETRs that do not support the mechanism.

With the increased complexity of today’s networks, emulation has become an essential tool to test and validate a new proposed networking solution. As these solutions also become more and more complex with the introduction of softwarization, network function virtualization, andartificial intelligence, there is a need of scalable tools to carry out resource intensive emulations. To this end, distributed emulation has been proposed. However, distributing a network emulation over a physical platform requires to choose carefully how the experiment is run over the equipment at disposal. In this work, we evaluate the placement algorithms which were proposed for, and implemented in, existing distributed emulation tools. We show that they may lead to bad placements in which several hardware resources such as link bandwidth, CPU, and memory are overloaded. Through extensive experiments, we exhibit the impact of such placements on important network metrics such as real network bandwidth usage and emulation execution time, and show that they may lead to unreliable results and to a waste of platform resources.To deal with this issue, we propose and implement a new placement module for distributed emulation. Our algorithms take into account both link and node resources and minimize the number of physical hosts needed to carry out the emulation. Through extensive numerical evaluations, simulations, and experiments, we show that our placement methods outperform existing ones leading to reliable experiments using a minimum number of resources.; Avec la complexité croissante des réseaux actuels, l’émulation est devenue un outil essentiel pour tester et valider une nouvelle solution réseau.Comme ces solutions deviennent également de plus en plus complexes avec l’introduction des réseaux logiciels, de la virtualisation des fonctions réseau et de l’intelligence artificielle, il est nécessaire de disposer d’outils qui passent à l’échelle pour réaliser des émulations intensives en ressources. A cette fin, il a été proposé de distribuer les émulations. Cependant, la distribution d’une émulation de réseau sur une plate-forme physique nécessite de choisir avec soin la manière dont l’expérience est menée sur l’équipement à disposition. Dans ce travail, nous évaluons les algorithmes de placement qui ont été proposés et implémentés dans les outils d’émulation distribuée existants. Nous montrons qu’ils peuvent conduire à de mauvais placements dans lesquels plusieurs ressources matérielles telles que la bande passante de liens, le processeur et la mémoire peuvent être surchargés. Grâce à des expériences approfondies, nous montrons l’impact de ces placements sur des paramètres importants du réseau tels que l’utilisation réelle de la bande passante et le temps d’exécution de l’émulation, et nous montrons qu’ils peuvent conduire à des résultats peu fiables et `a un gaspillage des ressources de la plate-forme. Pour traiter cette question, nous proposons et implémentons un nouveau module de placement pour l’émulation distribuée. Nos algorithmes prennent en compte les ressources des liens et des nœuds et minimisent le nombre d’hôtes physiques nécessaires pour réaliser l’émulation. Grâce à des évaluations numériques, des simulations et des expériences poussées, nous montrons que nos méthodes de placement sont plus performantes que les méthodes existantes, ce qui permetde réaliser des expériences fiables en utilisant un nombre minimal de ressources.

With the increased complexity of today’s networks, emulation has become an essential tool to test and validate a new proposed networking solution. As these solutions also become more and more complex with the introduction of softwarization, network function virtualization, andartificial intelligence, there is a need of scalable tools to carry out resource intensive emulations. To this end, distributed emulation has been proposed. However, distributing a network emulation over a physical platform requires to choose carefully how the experiment is run over the equipment at disposal. In this work, we evaluate the placement algorithms which were proposed for, and implemented in, existing distributed emulation tools. We show that they may lead to bad placements in which several hardware resources such as link bandwidth, CPU, and memory are overloaded. Through extensive experiments, we exhibit the impact of such placements on important network metrics such as real network bandwidth usage and emulation execution time, and show that they may lead to unreliable results and to a waste of platform resources.To deal with this issue, we propose and implement a new placement module for distributed emulation. Our algorithms take into account both link and node resources and minimize the number of physical hosts needed to carry out the emulation. Through extensive numerical evaluations, simulations, and experiments, we show that our placement methods outperform existing ones leading to reliable experiments using a minimum number of resources.; Avec la complexité croissante des réseaux actuels, l’émulation est devenue un outil essentiel pour tester et valider une nouvelle solution réseau.Comme ces solutions deviennent également de plus en plus complexes avec l’introduction des réseaux logiciels, de la virtualisation des fonctions réseau et de l’intelligence artificielle, il est nécessaire de disposer d’outils qui passent à l’échelle pour réaliser des émulations intensives en ressources. A cette fin, il a été proposé de distribuer les émulations. Cependant, la distribution d’une émulation de réseau sur une plate-forme physique nécessite de choisir avec soin la manière dont l’expérience est menée sur l’équipement à disposition. Dans ce travail, nous évaluons les algorithmes de placement qui ont été proposés et implémentés dans les outils d’émulation distribuée existants. Nous montrons qu’ils peuvent conduire à de mauvais placements dans lesquels plusieurs ressources matérielles telles que la bande passante de liens, le processeur et la mémoire peuvent être surchargés. Grâce à des expériences approfondies, nous montrons l’impact de ces placements sur des paramètres importants du réseau tels que l’utilisation réelle de la bande passante et le temps d’exécution de l’émulation, et nous montrons qu’ils peuvent conduire à des résultats peu fiables et `a un gaspillage des ressources de la plate-forme. Pour traiter cette question, nous proposons et implémentons un nouveau module de placement pour l’émulation distribuée. Nos algorithmes prennent en compte les ressources des liens et des nœuds et minimisent le nombre d’hôtes physiques nécessaires pour réaliser l’émulation. Grâce à des évaluations numériques, des simulations et des expériences poussées, nous montrons que nos méthodes de placement sont plus performantes que les méthodes existantes, ce qui permetde réaliser des expériences fiables en utilisant un nombre minimal de ressources.

International audience; This document describes the LISP (Locator/ID Separation Protocol) Map-Versioning mechanism, which provides in-packet information about Endpoint ID to Routing Locator (EID-to-RLOC) mappings used to encapsulate LISP data packets. The proposed approach is based on associating a version number to EID-to-RLOC mappings and the transport of such a version number in the LISP-specific header of LISP-encapsulated packets. LISP Map-Versioning is particularly useful to inform communicating Ingress Tunnel Routers (ITRs) and Egress Tunnel Routers (ETRs) about modifications of the mappings used to encapsulate packets. The mechanism is optional and transparent to implementations not supporting this feature, since in the LISP- specific header and in the Map Records, bits used for Map-Versioning can be safely ignored by ITRs and ETRs that do not support or do not want to use the mechanism. This document obsoletes RFC 6834 "Locator/ID Separation Protocol (LISP) Map-Versioning", which is the initial experimental specifications of the mechanisms updated by this document.

International audience; MPEG-DASH and MPTCP are two technologies growing in interest and put together they promise greater quality of experience for video consumers and better network resource usage. However, while independent MPEG-DASH and MPTCP implementations exist for ns-3, they are not directly usable together as they suffer from incompatibilities. In this work, we introduce a new ns-3 distribution that packages the AMuSt Framework DASH implementation and the ns-3 MPTCP implementation from University of Sussex such that they can be used together to nourish the flourishing research on Internet video streaming.

International audience; A prominent portion of the traffic carried by In-ternet Service Providers (ISP) is delivered by Content Delivery Networks (CDNs). CDNs usually deploy their own caches at ISPs in addition to the servers deployed in their own premises. With the adoption of multipath transport protocols such as MPTCP, content consumers are able to retrieve their data from either caches deployed in their ISPs or server in the CDN premises using multiple paths in parallel. In this paper we present a study on the interplay between actors of a multipath-enabled video delivery system. For that we design a realistic numerical evaluation experiment; results obtained suggest that multipath can be both beneficial and harmful for ISP and CDN in different representative scenarios.

The Locator/ID Separation Protocol (LISP) aims to improve the Internet routing scalability properties by leveraging three principles: address role separation, encapsulation, and mapping. In this document, based on implementation work, deployment experiences, and theoretical studies, we discuss the impact that the deployment of LISP can have on both the routing infrastructure and the end user.

Ensuring the reproducibility of results is an essential part of experimentalsciences, including computer networking. Unfortunately, as highlightedrecently, a large portion of research results are hardly, if not at all,reproducible, raising reasonable lack of conviction on the research carriedout around the world.Recent years have shown an increasing awareness about reproducibility ofresults as an essential part of research carried out by members of the ACMSIGCOMM community. To address this important issue, ACM has introduced a newpolicy on results and artifacts review and badging. The policy defines theterminology to be used to assess results and artifacts but does not specify thereview process or how to make research reproducible.During SIGCOMM'17 a side workshop has been organized with the specific purposeto tackle this issue. The objective being to trigger discussion and activity inorder to craft recommendations on how to introduce incentives for authors toshare their artifacts, and the details on how to use them, as well as definingthe process to be used.This editorial overviews the workshop activity and summarizes the maindiscussions and outcomes.

International audience; To optimize routing of flows in datacenters, SDN controllers receive a packet-in message whenever a new flow appears in the network. Unfortunately, flow arrival rates can peak to millions per second [1], impairing the ability of controllers to treat them on time. Flow scheduling, e.g. [2], copes with such sheer numbers by segmenting the traffic between elephant and mice flows and by treating elephant flows in priority, as they disrupt short lived TCP flows and create bottlenecks. We formulate a flow segmentation problem that segment elephant from mice flows; the aim is to schedule a maximum amount of traffic under a constraint on the maximum rate of packet-in events. We propose a learning algorithm able to perform optimal online flow segmentation. Our solution, based on stochastic approximation techniques, is implemented at the switch level and updated by the controller, with minimal signaling over the control channel. Our approach is blind, i.e., it is agnostic to the flow size distribution. It is also adaptive, since it can track traffic variations over time. We prove its convergence properties and its message complexity. Moreover, we specialize our solution to be robust to traffic classification errors and we provide conditions under which our algorithm still converges to the optimal solution. Extensive numerical experiments characterize the performance of our approach in vitro. Finally, results of the implementation in a real OpenFlow controller demonstrate the viability of our method as a solution in production environments.

International audience; Ensuring the reproducibility of results is an essential part of experimental sciences, including computer networking. Unfortunately , as highlighted recently, a large portion of research results are hardly, if not at all, reproducible, raising reasonable lack of conviction on the research carried out around the world. Recent years have shown an increasing awareness about reproducibility of results as an essential part of research carried out by members of the ACM SIGCOMM community. To address this important issue, ACM has introduced a new policy on result and artifact review and badging. The policy defines the terminology to be used to assess results and artifacts but does not specify the review process or how to make research reproducible. During SIGCOMM'17 a side workshop has been organized with the specific purpose to tackle this issue. The objective being to trigger discussion and activity in order to craft recommendations on how to introduce incentives for authors to share their artifacts, and the details on how to use them, as well as defining the process to be used. This editorial overviews the workshop activity and summarizes the main discussions and outcomes.

International audience; This volume contains the extended abstract of the posters presented at RESCOM’17 Summer School. RESCOM 2017 held on June 19-23, 2017 in Le Croisic.

This document provides a threat analysis of the Locator/ID Separation Protocol (LISP).

Multihoming becomes popular in residential and SOHO networks indicating the absolute necessity of fully supporting multihoming in Homenet. While the approach followed in Homenet is to delegate multihoming management to hosts, we propose to enable multihoming in Homenet by the mean of the infrastructure instead of the hosts.

International audience; With the advent of virtualization and network function softwarization, the networking world shifts to Software Defined Networking (SDN) and OpenFlow is one of the most suitable candidates to implement the southbound API. In the meanwhile, the generalization of broadband Internet has led to massive content consumption. However, while content is usually retrieved via layer 7 protocols, OpenFlow operations are performed at lower layers (layer 4 or lower) making the protocol ineffective to deal with contents. To address this issue, we define an abstraction to unify network level and content level operations and present a straw-man logically centralized architecture proposal to support it. Our implementation demonstrates the feasibility of the solution and its advantage over fully centralized approach.

Commercial users of modern communications networks have benefited from a huge progress of the related technologies. However, Public Safety Networks (PSNs) and devices did not follow the same trend. Very often, they still rely on voice or low speed data communications, tempting first responders to use their own private devices when they need to exchange real-time video or geolocation information. Under this consideration, national authorities and specialized organizations have recently initiated the integration of more recent technologies, such as cellular Long Term Evolution (LTE), even though they need further developments to cope with the harsh usages that safety personnel may face. This report proposes to move the evolution of these networks towards the recent evolution of networking technologies started with Software Defined networking (SDN) and Network Functions Virtualization (NFV). Based on the requirements derived from a standardized earthquake scenario and a study of the main improvements brought by this network softwarization, it analyzes how SDN and NFV can solve part of the issues raised with commercial LTE and enhance PSN communications. The capabilities of these new technologies are applied to a list of characteristics required by mission-critical networks, e.g., rapid deployment, reliability, security or resilience, taking advantage of features such as the separation between control and data planes or the simplified dynamic resources management. The resulting enhancements are then illustrated using example frameworks published in the literature for Cloud Radio Access Networks, resilient backhaul solution , isolated base stations, SDN-based architecture or Service Function Chaining.

This document describes the architecture of the Locator/ID Separation Protocol (LISP), making it easier to read the rest of the LISP specifications and providing a basis for discussion about the details of the LISP protocols. This document is used for introductory purposes, more details can be found in RFC6830, the protocol specification.

This document proposes a threat analysis of the Locator/Identifier Separation Protocol (LISP).

The Locator/Identifier Separation Protocol (LISP) aims at improving the Internet scalability properties leveraging on three simple principles: address role separation, encapsulation, and mapping. In this document, based on implementation, deployment, and theoretical studies, we discuss the impact that deployment of LISP can have on both the Internet in general and for the end-users in particular.