Search

Your search keyword '"Turletti, A"' showing total 42 results
Start Over Author "Turletti, A" Topic 02 engineering and technology
42 results on '"Turletti, A"'

1. Distrinet

Author

Chidung Lac, Andrea Tomassilli, Damien Saucez, Giuseppe Di Lena, Thierry Turletti, Frédéric Giroire, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Orange Labs [Lannion], France Télécom, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), EfdyNet, EfDyNet, ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017), COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM)

Subjects
Emulation, Virtual Extensible LAN, Computer Networks and Communications, Computer science, business.industry, Distributed computing, 020206 networking & telecommunications, Cloud computing, 02 engineering and technology, Virtualization, computer.software_genre, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Resource (project management), 0202 electrical engineering, electronic engineering, information engineering, business, computer, Host (network), Software
Abstract

Networks have become complex systems that combine various concepts, techniques, and technologies. As a consequence, modelling or simulating them now is extremely complicated and researchers massively resort to prototyping techniques. Mininet is the most popular tool when it comes to evaluate SDN propositions. Mininet allows to emulate SDN networks on a single computer but shows its limitations with resource intensive experiments as the emulating host may become overloaded. To tackle this issue, we propose Distrinet , a distributed implementation of Mininet over multiple hosts, based on LXD/LXC, Ansible, and VXLAN tunnels. Distrinet uses the same API than Mininet, meaning that it is compatible with Mininet programs. It is generic and can deploy experiments on Linux clusters (e.g., Grid'5000), as well as on the Amazon EC2 cloud platform.

Published
2021
Full Text
View/download PDF

2. RAN-aware Proxy-based Flow Control for High Throughput and Low Delay eMBB

Author

Mamoutou Diarra, Amine Ismail, Thierry Turletti, Walid Dabbous, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), EKINOPS, and entreprise

Subjects
Flow control (data), Radio access network, Radio Network Information Service, Computer science, business.industry, Multi-Access Edge Computing, 020206 networking & telecommunications, Throughput, self-inflicted bufferbloat, Performance Enhancing Proxy, 02 engineering and technology, 5G millimeter wave, Radio Link Control, eMBB, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020204 information systems, TCP Congestion and Flow control, 0202 electrical engineering, electronic engineering, information engineering, Bandwidth (computing), Performance-enhancing proxy, business, 5G, Edge computing, Computer network
Abstract

International audience; 5G enhanced Mobile broadband (eMBB) aims to provide users with a peak data rate of 20 Gbps in the Radio Access Network (RAN). However, since most Congestion Control Algorithms (CCAs) rely on startup and probe phases to discover the bottleneck bandwidth, they cannot quickly utilize the available RAN bandwidth and adapt to fast capacity changes without introducing large delay increase, especially when multiple flows are sharing the same Radio Link Control (RLC) buffer. To tackle this issue, we propose RAPID, a RANaware proxy-based flow control mechanism that prevents CCAs from overshooting more than the available RAN capacity while allowing near optimal link utilization. Based on analysis of up-todate radio information using Multi-access Edge Computing (MEC) services and packet arrival rates, RAPID is able to differentiate slow interactive flows from fast download flows and allocate the available bandwidth accordingly. Our experiments with concurrent Cubic and BBR flows show that RAPID can reduce delay increase by a factor of 10 to 50 in both Line-of-Sight (LOS) and Non-LOS (NLOS) conditions while preserving high throughput.

Published
2021
Full Text
View/download PDF

3. A Right Placement Makes a Happy Emulator: a Placement Module for Distributed SDN/NFV Emulation

Author

Thierry Turletti, Chidung Lac, Andrea Tomassilli, Frédéric Giroire, G. Di Lena, Damien Saucez, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Orange Labs [Lannion], France Télécom, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM), Inria Equipe associée EfdyNet, EfDyNet, ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017), ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), and COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015 - 2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM)

Subjects
010302 applied physics, Emulation, Network Functions Virtualization, Computer science, Distributed computing, Node (networking), Bandwidth (signal processing), 02 engineering and technology, Numerical models, Network emulation, 021001 nanoscience & nanotechnology, 01 natural sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Resource (project management), 0103 physical sciences, 0210 nano-technology, Cluster analysis
Abstract

International audience; To handle the ever growing demand of resource intensive experiments distributed, network emulation tools such as Mininet and Maxinet have been proposed. They automatically allocate experimental resources. In this work, we show that resources are poorly allocated, leading to resource overloading and hence to dubious experimental results. This is why 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 actual experiments , we show that our placement methods outperform existing ones and allowing to re-establish trust in experimental results.

Published
2021
Full Text
View/download PDF

4. Design of Robust Programmable Networks with Bandwidth-optimal Failure Recovery Scheme

Author

Thierry Turletti, Issam Tahiri, Ruslan Sadykov, Giuseppe Di Lena, Andrea Tomassilli, François Vanderbeck, Stéphane Pérennes, Frédéric Giroire, Damien Saucez, Chidung Lac, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Orange Labs [Meylan], Orange Labs, Design, Implementation and Analysis of Networking Architectures (DIANA), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Université de Bordeaux (UB), Reformulations based algorithms for Combinatorial Optimization (Realopt), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, EfDyNet, ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017), COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Institut de Mathématiques de Bordeaux (IMB), and Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest

Subjects
Computer Networks and Communications, computer.internet_protocol, Computer science, Distributed computing, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, Network topology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Internet protocol suite, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Bandwidth (computing), 020201 artificial intelligence & image processing, Column generation, Software-defined networking, computer, Dimensioning, ComputingMilieux_MISCELLANEOUS
Abstract

International audience; More than ever, data networks have demonstrated their central role in the world economy, but also in the well-being of humanity that needs fast and reliable networks. In parallel, with the emergence of Network Function Virtualization (NFV) and Software Defined Networking (SDN), efficient network algorithms considered too hard to be put in practice in the past now have a second chance to be considered again. In this context, as new networks will be deployed and current ones get significant upgrades, it is thus time to rethink the network dimensioning problem with protection against failures. In this paper, we consider a path-based protection scheme with the global rerouting strategy in which, for each failure situation, there may be a new routing of all the demands. Our optimization task is to minimize the needed amount of bandwidth. After discussing the hardness of the problem, we develop two scalable mathematical models that we handle using both Column Generation and Benders Decomposition techniques. Through extensive simulations on real-world IP network topologies and on randomly generated instances, we show the effectiveness of our methods: they lead to savings of 40 to 48% of the bandwidth to be installed in a network to protect against failures compared to traditional schemes. Finally, our implementation in OpenDaylight demonstrates the feasibility of the approach. Its evaluation with Mininet shows that our solution provides sub-second recovery times, but the way it is implemented may greatly impact the amount of signaling traffic exchanged. In our evaluations, the recovery phase requires only a few tens of milliseconds for the fastest implementation, compared to a few hundreds of milliseconds for the slowest one.

Published
2021
Full Text
View/download PDF

5. Dynamic Controller Assignment in Software Defined Internet of Vehicles through Multi-Agent Deep Reinforcement Learning

Author

Chadi Barakat, Tingting Yuan, Wilson Borba da Rocha Neto, Katia Obraczka, Christian Esteve Rothenberg, Thierry Turletti, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Computing [Campinas] (UNICAMP), Universidade Estadual de Campinas (UNICAMP), Jack Baskin School of Engineering (UCSC), University of California [Santa Cruz] (UCSC), University of California-University of California, This work was partly funded by Inria, supported by the French ANR 'Investments for the Future' Program reference #ANR-11-LABX-0031-01, and UNICAMP, through the FAPESP Grant number #2017/50361-0, both in the context of the DrIVE #EQA-041801 associated team., ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), Institute of Computing [Campinas] (IC), Universidade Estadual de Campinas = University of Campinas (UNICAMP), University of California [Santa Cruz] (UC Santa Cruz), and University of California (UC)-University of California (UC)

Subjects
Computer Networks and Communications, business.industry, Computer science, multi-agent deep reinforcement learning, Distributed computing, Control (management), 020206 networking & telecommunications, 02 engineering and technology, Software Defined Networking (SDN), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software, Control theory, Packet loss, controller assignment, Internet of Vehicles (IoV), 0202 electrical engineering, electronic engineering, information engineering, Forwarding plane, Reinforcement learning, The Internet, Electrical and Electronic Engineering, business, Assignment problem
Abstract

International audience; In this paper, we introduce a novel dynamic controller assignment algorithm targeting connected vehicle services and applications, also known as Internet of Vehicles (IoV). The proposed approach considers a hierarchically distributed control plane, decoupled from the data plane, and uses vehicle location and control traffic load to perform controller assignment dynamically. We model the dynamic controller assignment problem as a multi-agent Markov game and solve it with cooperative multi-agent deep reinforcement learning. Simulation results using real-world vehicle mobility traces show that the proposed approach outperforms existing ones by reducing control delay as well as packet loss. Index Terms-Internet of Vehicles (IoV), Software Defined Networking (SDN), multi-agent deep reinforcement learning, controller assignment.

Published
2021
Full Text
View/download PDF

6. Machine Learning for Next-Generation Intelligent Transportation Systems: A Survey

Author

Yuan, Tingting, Da Rocha Neto, Wilson Borba, Rothenberg, Christian, Obraczka, Katia, Barakat, Chadi, Turletti, Thierry, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), University of Campinas [Campinas] (UNICAMP), Jack Baskin School of Engineering (UCSC), University of California [Santa Cruz] (UCSC), University of California-University of California, This work was also partly funded by UNICAMP, through the FAPESP Grant number #2017/50361-0, both in the context of the DrIVE #EQA-041801 Associated Team., ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), Universidade Estadual de Campinas = University of Campinas (UNICAMP), University of California [Santa Cruz] (UC Santa Cruz), and University of California (UC)-University of California (UC)

Subjects
050210 logistics & transportation, Machine Learning (ML), 05 social sciences, 02 engineering and technology, Intelligent Transportation System (ITS), Cooperative Driving, Autonomous Vehicles, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 13. Climate action, 11. Sustainability, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering
Abstract

International audience; Intelligent Transportation Systems, or ITS for short, includes a variety of services and applications such as road traffic management, traveler information systems, public transit system management, and autonomous vehicles, to name a few. It is expected that ITS will be an integral part of urban planning and future cities as it will contribute to improved road and traffic safety, transportation and transit efficiency, as well as to increased energy efficiency and reduced environmental pollution. On the other hand, ITS poses a variety of challenges due to its scalability and diverse quality-of-service needs, as well as the massive amounts of data it will generate. In this survey, we explore the use of Machine Learning (ML), which has recently gained significant traction, to enable ITS. We provide a comprehensive survey of the current state-of-the-art of how ML technology has been applied to a broad range of ITS applications and services, such as cooperative driving and road hazard warning, and identify future directions for how ITS can use and benefit from ML technology.

Published
2020
Full Text
View/download PDF

7. Harnessing UAVs for Fair 5G Bandwidth Allocation in Vehicular Communication via Deep Reinforcement Learning

Author

Thierry Turletti, Tingting Yuan, Christian Esteve Rothenberg, Chadi Barakat, Katia Obraczka, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Institute of Computing [Campinas] (UNICAMP), Universidade Estadual de Campinas (UNICAMP), Jack Baskin School of Engineering (UCSC), University of California [Santa Cruz] (UCSC), University of California-University of California, This work was partly funded by Inria, supported by the French ANR 'Investments for the Future' Program reference #ANR-11-LABX-0031-01, and UNICAMP, through the FAPESP Grant number #2017/50361-0, both in the context of the DrIVE #EQA-041801 associated team., ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), Institute of Computing [Campinas] (IC), Universidade Estadual de Campinas = University of Campinas (UNICAMP), University of California [Santa Cruz] (UC Santa Cruz), and University of California (UC)-University of California (UC)

Subjects
Vehicular ad hoc network, Fairness, Computer Networks and Communications, Computer science, business.industry, Distributed computing, Fifth-generation (5G), 020206 networking & telecommunications, Throughput, ComputerApplications_COMPUTERSINOTHERSYSTEMS, 02 engineering and technology, Unmanned aerial vehicles (UAV), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Bandwidth allocation, Deep reinforcement learning (DRL), 0202 electrical engineering, electronic engineering, information engineering, Path loss, Reinforcement learning, Resource allocation, Wireless, Electrical and Electronic Engineering, business, 5G
Abstract

International audience; Terrestrial wireless infrastructure-based networks do not always guarantee that their resources will be shared uniformly by nodes in vehicular networks mostly due to the uneven and dynamic distribution of vehicles in the network as well as path loss effects. In this paper, we leverage multiple fifth-generation (5G) unmanned aerial vehicles (UAVs) to enhance network resource allocation among vehicles by positioning UAVs on-demand as "flying communication infrastructure". We propose a deep reinforcement learning (DRL) approach to determine the position of UAVs in order to improve the fairness and efficiency of network resource allocation while considering the UAVs' flying range, communication range, and limited energy resources. We use a parametric fairness function for resource allocation that can be tuned to reach different allocation objectives ranging from maximizing the total throughput of vehicles, maximizing minimum throughput, as well as achieving proportional band-width allocation. Simulation results show that the proposed DRL approach to UAV positioning can help improve network resource allocation according to the targeted fairness objective.

Published
2020
Full Text
View/download PDF

8. An Availability-aware SFC placement Algorithm for Fat-Tree Data Centers

Author

Thierry Turletti, Ghada Moualla, Damien Saucez, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Inria, and Turletti, Thierry

Subjects
Service (business), 020203 distributed computing, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], SFC, business.industry, Computer science, Approximation algorithm, 020206 networking & telecommunications, Cloud computing, Availability, 02 engineering and technology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], High availability, Server, 0202 electrical engineering, electronic engineering, information engineering, Virtual function, Data center, business, Fat tree, Algorithm, Cloud, Data Center, Placement
Abstract

International audience; Complex inter-connections of virtual functions form the so-called Service Function Chains (SFCs) deployed in the Cloud. Such service chains are used for critical services like e-health or autonomous transportation systems and thus require high availability. Respecting some availability level is hard in general, but it becomes even harder if the operator of the service is not aware of the physical infrastructure that will support the service, which is the case when SFCs are deployed in multi-tenant data centers. In this paper, we propose an algorithm to solve the placement of topology-oblivious SFC demands such that placed SFCs respect availability constraints imposed by the tenant. The algorithm leverages Fat-Tree properties to be computationally doable in an online manner. The simulation results show that it is able to satisfy as many demands as possible by spreading the load between the replicas and enhancing the network resources utilization.

Published
2018

9. Efficient Pull-based Mobile Video Streaming leveraging In-Network Functions

Author

Indukala Naladala, Thierry Turletti, Hitoshi Asaeda, Kazuhisa Matsuzono, National Institute of Information and Communications Technology [Tokyo, Japan] (NICT), National Institute of Technology Karnataka [Surathkal] (NITK), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), This work was supported by the bilateral program of the Japanese Society for the Promotion of Science (JSPS), by JSPS KAKENHI Grant Number JP19K20264, by the French government through the UCA JEDI (ANR-15-IDEX-01) and by the UHDon5G Associated Team between NICT and Inria., ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI (2016), and ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015)

Subjects
Computer science, business.industry, 020206 networking & telecommunications, Content delivery, 02 engineering and technology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Packet loss, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, The Internet, Quality of experience, Video streaming, business, Computer network
Abstract

International audience; There has been a considerable increase in the demand for high quality mobile video streaming services, while at the same time, the video traffic volume is expected to grow exponentially. Consequently, maintaining high quality of experience (QoE) and saving network resources are becoming crucial challenges to solve. In this paper, we propose a name-based mobile streaming scheme that allows efficient video content delivery by exploiting a smart pulling mechanism designed for information-centric networks (ICNs). The proposed mechanism enables fast packet loss recovery by leveraging in-network caching and coding. Through an experimental evaluation of our mechanism over an open wireless testbed and the Internet, we demonstrate that the proposed scheme leads to higher QoE levels than classical ICN and TCP-based streaming mechanisms.

Published
2020

10. Bandwidth-optimal Failure Recovery Scheme for Robust Programmable Networks

Author

Andrea Tomassilli, Chidung Lac, Frédéric Giroire, Ruslan Sadykov, Stéphane Pérennes, Damien Saucez, Issam Tahiri, François Vanderbeck, Thierry Turletti, G. Di Lena, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Orange Labs [Lannion], France Télécom, COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Reformulations based algorithms for Combinatorial Optimization (Realopt), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS), EfDyNet, ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017), ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), Centre National de la Recherche Scientifique (CNRS), INRIA Sophia Antipolis - I3S, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, and Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)

Subjects
network resilience strategies, 021103 operations research, Computer science, computer.internet_protocol, Software Defined Networking, Distributed computing, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0211 other engineering and technologies, 020206 networking & telecommunications, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Network topology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Internet protocol suite, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Bandwidth (computing), Column generation, Routing (electronic design automation), Software-defined networking, computer, Dimensioning, Network Function Virtualization
Abstract

ISP networks are taking a leap forward thanks to emerging technologies such as Software Defined Networking(SDN) and Network Function Virtualization (NFV). Efficient algorithms considered too hard to be put in practice on legacy networks now have a second chance to be considered again. In this context, we rethink the ISP network dimensioning problem with protection against Shared Risk Link Group (SLRG) failures.In this paper, we consider a path-based protection scheme with a global rerouting strategy, in which, for each failure situation, we may have a new routing of all the demands. Our optimization task is to minimize the needed amount of bandwidth. After discussing the hardness of the problem, we develop a scalable mathematical model that we handle using the Column Generation technique. Through extensive simulations on real-world IP network topologies and on random generated instances, we show the effectiveness of our method. Finally, our implementation in OpenDaylight demonstrates the feasibility of the approach and its evaluation with Mininet shows that technical implementation choices may have a dramatic impact on the time needed to reestablish the flows after a failure takes place.

Published
2019

11. Mininet on steroids: exploiting the cloud for Mininet performance

Author

Frédéric Giroire, Damien Saucez, Giuseppe Di Lena, Andrea Tomassilli, Thierry Turletti, Chidung Lac, Orange Labs [Lannion], France Télécom, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Combinatorics, Optimization and Algorithms for Telecommunications (COATI), COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), EfDyNet, ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
Computer science, business.industry, Distributed computing, Complex system, 020206 networking & telecommunications, Cloud computing, 02 engineering and technology, Python (programming language), Network topology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer cluster, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, business, computer, computer.programming_language
Abstract

International audience; Networks have become complex systems that combine various concepts, techniques, and technologies. As a consequence , modelling or simulating them is now extremely complicated and researchers massively resort to prototyping techniques. Among other tools, Mininet is the most popular when it comes to evaluate SDN propositions. It allows to emulate SDN networks on a single computer. However, under certain circumstances experiments (e.g., resource intensive ones) may overload the host running Mininet. To tackle this issue, we propose Distrinet, a way to distribute Mininet over multiple hosts. Distrinet uses the same API than Mininet, meaning that it is compatible with Mininet programs. Distrinet is generic and can deploy experiments in Linux clusters or in the Amazon EC2 cloud. Thanks to optimization techniques, Distrinet minimizes the number of hosts required to perform an experiment given the capabilities of the hosting infrastructure, meaning that the experiment is run in a single host (as Mininet) if possible. Otherwise, it is automatically deployed on a platform using a minimum amount of resources in a Linux cluster or with a minimum cost in Amazon EC2.

Published
2019
Full Text
View/download PDF

12. Poster: design of survivable SDN/NFV-enabled networks with bandwidth-optimal failure recovery

Author

Chidung Lac, G. Di Lena, Damien Saucez, Thierry Turletti, Stéphane Pérennes, Andrea Tomassilli, Issam Tahiri, François Vanderbeck, Ruslan Sadykov, Frédéric Giroire, Combinatorics, Optimization and Algorithms for Telecommunications (COATI), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Orange Labs [Lannion], France Télécom, Reformulations based algorithms for Combinatorial Optimization (Realopt), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)-Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Design, Implementation and Analysis of Networking Architectures (DIANA), Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS), EfDyNet, ANR-15-IDEX-0001,UCA JEDI,Idex UCA JEDI(2015), ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017), COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Inria Sophia Antipolis - Méditerranée (CRISAM), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, and Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)

Subjects
021103 operations research, Computer science, business.industry, 0211 other engineering and technologies, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, Task (project management), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Scalability, 0202 electrical engineering, electronic engineering, information engineering, Bandwidth (computing), Column generation, Routing (electronic design automation), business, Software-defined networking, Dimensioning, Computer network
Abstract

International audience; ISP networks are taking a leap forward thanks to emerging technologies such as Software Defined Networking (SDN) and Network Function Virtualization (NFV). Efficient algorithms considered too hard to be put in practice on legacy networks now have a second chance to be considered again. In this context, we rethink the ISP network dimensioning problem with protection against Shared Risk Link Group (SLRG) failures. We consider a path-based protection scheme with a global rerouting strategy in which, for each failure situation, we may have a new routing of all the demands. Our optimization task is to minimize the needed amount of bandwidth. We develop a scalable mathematical model that we handle using the Column Generation technique. We show the effectiveness of our methods and demonstrate the feasibility of our approach using Mininet.

Published
2019
Full Text
View/download PDF

13. Peer-Assisted Information-Centric Network (PICN): A Backward Compatible Solution

Author

Massoud Reza Hashemi, Zeinab Zali, Thierry Turletti, Mohammad Hossein Manshaei, Ehsan Aslanian, Isfahan University of Technology, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Web server, General Computer Science, Computer science, CPU cache, 02 engineering and technology, Caching, Peer-to-peer, computer.software_genre, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Server, 0202 electrical engineering, electronic engineering, information engineering, General Materials Science, business.industry, Peer-to-Peer, General Engineering, 020206 networking & telecommunications, Information Centric Network, Proxy server, 020201 artificial intelligence & image processing, The Internet, lcsh:Electrical engineering. Electronics. Nuclear engineering, Cache, Enhanced Data Rates for GSM Evolution, business, lcsh:TK1-9971, computer, Computer network
Abstract

Information-centric networking (ICN) is a promising solution for most of Internet applications where the content represents the core of the application. However, the proposed solutions for the ICN architecture are associated with many complexities including pervasive caching in the Internet and incompatibility with legacy IP networks, so the deployment of ICN in real networks is still an open problem. In this paper, we propose a backward-compatible ICN architecture to address the caching issue in particular. The key idea is implementing edge caching in ICN, using a coalition of end clients and edge servers. Our solution can be deployed in IP networks with HTTP requests. We performed a trace-driven simulation for analyzing peer-assisted information-centric networking (PICN) benefits using IRCache and Berkeley trace files. The results show that on average, PICN decreases the latency for 78% and increases the content retrieval speed for 69% compared with a direct download from the original Web servers. When comparing PICN with a solution based on central proxy servers, we show that the hit ratio obtained using a small cache size in each PICN client is almost 14% higher than the hit ratio obtained with a central proxy server using an unlimited cache storage.

Published
2017
Full Text
View/download PDF

14. R2Lab Testbed Evaluation for Wireless Mesh Network Experiments

Author

Mohamed Naoufal Mahfoudi, Thierry Turletti, Walid Dabbous, Farzaneh Pakzad, Marius Portmann, Thierry Parmentelat, Aptira Pty Ltd, School of Information Technology and Electrical Engineering [Brisbane], University of Queensland [Brisbane], Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Routing protocol, Wireless mesh network, Anechoic chamber, business.industry, Computer science, Testbed, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020302 automobile design & engineering, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Computer architecture, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), Wireless, business, 5G
Abstract

International audience; We have provided critical evaluations of new potential testbeds for the evaluation of SDN-based WMNs. We evaluated the R2Lab wireless testbed platform at INRIA Sophia-Antipolis, France. This testbed has 37 customisable wireless devices in an anechoic chamber for reproducible research in wireless WiFi and 4G/5G networks. Our work presents the first initial evaluation of the testbed for wireless multi-hop experiments , using traditional WMN routing protocols. Our results demonstrate the potential for SDN experiments. We believe this is an important contribution in its own right, since experimental validation is a key research methodology in this context, and trust in the validity of experimental results is absolutely critical.

Published
2018

15. nepi-ng: an efficient experiment control tool in R2lab

Author

Francesco Bronzino, Mohamed Naoufal Mahfoudi, Walid Dabbous, Thierry Turletti, Thierry Parmentelat, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Middleware on the Move (MIMOVE), Inria de Paris, ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), Dabbous, Walid, and Laboratoires d'excellence - Réseau orienté utilisateur - - UCN@SOPHIA2011 - ANR-11-LABX-0031 - LABX - VALID

Subjects
Fine grain, Computer science, Distributed computing, 02 engineering and technology, [INFO] Computer Science [cs], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software, 0202 electrical engineering, electronic engineering, information engineering, Wireless, [INFO]Computer Science [cs], Experimentation, computer.programming_language, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, Wireless network, Orchestration, 020206 networking & telecommunications, 020207 software engineering, Modular design, Python (programming language), Reproducibility, Experiment control, Programming paradigm, Asyncio, Asynchronous programming, business, computer, Python
Abstract

International audience; Experimentation is an essential step for realistic evaluation of wireless network protocols. The evaluation methodology entails controllable environment conditions and a rigorous and efficient experiment control and orchestration for a variety of scenarios. Existing experiment control tools such as OMF often lack in efficiency in terms of resource management and rely on abstractions that hide the details about the wireless setup. In this paper, we propose nepi-ng, an efficient experiment control tool that leverages job oriented programming model and efficient single-thread execution of parallel programs using asyncio. nepi-ng provides an efficient and modular fine grain synchronization mechanism for networking experiments with light software dependency footprint. We present and discuss our design choices and compare to the state of the art tools, mainly OMF.

Published
2018

16. Handover and Load Balancing for Distributed Network Control: Applications in ITS Message Dissemination

Author

Anuj Kaul, Katia Obraczka, Thierry Turletti, Li Xue, Mateus A. S. Santos, University of California [Santa Cruz] (UCSC), University of California, Ericsson Research [Brazil], Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), DrIVE Associated Team, ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), University of California [Santa Cruz] (UC Santa Cruz), and University of California (UC)

Subjects
Handover, Computer science, business.industry, Quality of service, 020206 networking & telecommunications, 020302 automobile design & engineering, 02 engineering and technology, Load balancing (computing), Load management, Software defined networking, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Distributed network control, 0202 electrical engineering, electronic engineering, information engineering, Process control, Intelligent transport systems, Software-defined networking, business, Intelligent transportation system, Next-generation vehicular network, Computer network
Abstract

International audience; In this paper, we build upon our prior work on D2-ITS, a flexible and extensible framework to dynamically distribute network control to enable message dissemination in Intelligent Transport Systems (ITS), and extend it with handover and load balancing capabilities. More specifically, D2-ITS' new handover feature allows a controller to automatically "delegate" control of a vehicle to another controller as the vehicle moves. Control delegation can also be used as a way to balance load among controllers and ensure that required application quality of service is maintained. We showcase D2-ITS' handover and load-balancing features using the Mininet-Wifi network simula-tor/emulator. Our preliminary experiments show D2-ITS' ability to seamlessly handover control of vehicles as they move.

Published
2018

17. Cost Optimization of Cloud-RAN Planning and Provisioning for 5G Networks

Author

Osama Arouk, Katia Obraczka, Thierry Turletti, Navid Nikaein, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Eurecom [Sophia Antipolis], Jack Baskin School of Engineering (UCSC), University of California [Santa Cruz] (UC Santa Cruz), University of California (UC)-University of California (UC), University of California [Santa Cruz] (UCSC), and University of California-University of California

Subjects
Service (systems architecture), Computer science, business.industry, Distributed computing, 020302 automobile design & engineering, 020206 networking & telecommunications, Provisioning, Cloud computing, 02 engineering and technology, Network planning and design, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Software deployment, Scalability, 0202 electrical engineering, electronic engineering, information engineering, business, 5G, Integer (computer science)
Abstract

International audience; In this paper, we propose a network planning and provisioning framework that optimizes deployment cost in C-RAN based 5G networks. Our framework is based on a Mixed Integer Quadratically Constrained Programming (MIQCP) model which optimizes " virtualized " 5G service chain deployment cost while performing adequate provisioning to address user demand and performance requirements. We use two realistic scenarios to showcase that our framework can be applied to different types of deployments and discuss the computational cost and scalability of our solution.

Published
2018

18. On the Necessity of Accounting for Resiliency in SFC

Author

Thierry Turletti, Mathieu Bouet, Ghada Moualla, Damien Saucez, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), THALES COMMUNICATIONS & SECURITY, THALES [France], ANR-14-CE28-0019,REFLEXION,Infrastructure résiliente et flexible pour des réseaux ouverts(2014), THALES, Turletti, Thierry, and Appel à projets générique - Infrastructure résiliente et flexible pour des réseaux ouverts - - REFLEXION2014 - ANR-14-CE28-0019 - Appel à projets générique - VALID

Subjects
Physical infrastructure, Operations research, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer science, business.industry, 020206 networking & telecommunications, Cloud computing, 02 engineering and technology, Virtual Network Functions, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Risk analysis (engineering), Software deployment, Network service, 0202 electrical engineering, electronic engineering, information engineering, Resiliency, Position paper, Service Function Chaining, 020201 artificial intelligence & image processing, Latency (engineering), business, Placement
Abstract

International audience; When deploying network service function chains the focus is usually given on metrics such as the cost, the latency, or the energy and it is assumed that the underlying cloud infrastructure provides resiliency mechanisms to handle with the disruptions occurring in the physical infrastructure. In this position paper, we advocate that while usual performance metrics are essential to decide on the deployment of network service function chains, the notion of resiliency should not be neglected as the choice of virtual-to-physical placement may dramatically improve the ability of the service chains to handle with failures of the infrastructure without requiring complex resiliency mechanisms.

Published
2016

19. Slice Orchestration for Multi-Service Disaggregated Ultra Dense RANs

Author

Osama Arouk, Chia-Yu Chang, Thierry Turletti, Adlen Ksentini, Konstantinos Samdanis, Kostas Katsalis, Navid Nikaein, EURECOM, Eurecom [Sophia Antipolis]-Centre National de la Recherche Scientifique (CNRS), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Huawei Technologies [Dusseldorf], ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), and European Project: 762057,H2020,5G-PICTURE(2017)

Subjects
Service (systems architecture), Computer Networks and Communications, Computer science, Distributed computing, 050801 communication & media studies, 02 engineering and technology, Network Embedding, RAN slicing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, Resource (project management), 0202 electrical engineering, electronic engineering, information engineering, Resource management, Orchestration (computing), Electrical and Electronic Engineering, Radio access network, 05 social sciences, Orchestration, 020206 networking & telecommunications, Computer Science Applications, Shared resource, Software deployment, Network Slicing, Service Chaining, 5G
Abstract

International audience; Ultra Dense Networks (UDNs) are a natural deployment evolution for handling the tremendous traffic increase related to the emerging 5G services, especially in urban environments. However, the associated infrastructure cost may become prohibitive. The evolving paradigm of network slicing can tackle such a challenge while optimizing the network resource usage, enabling multi-tenancy and facilitating resource sharing and efficient service-oriented communications. Indeed, network slicing in UDN deployments can offer the desired degree of customization in both vanilla Radio Access Network (RAN) designs, but also in the case of disaggregated multi-service RANs. In this article, we devise a novel multi-service RAN environment, i.e., RAN runtime, capable to support slice orchestration procedures and to enable flexible customization of slices as per tenant needs. Each network slice can exploit a number of services, which can either be dedicated or shared between multiple slices over a common RAN. The novel architecture we present concentrates on the orchestration and management systems. It interacts with the RAN modules, through the RAN runtime, via a number of new interfaces enabling a customized dedicated orchestration logic for each slice. We present results for a disaggregated UDN deployment where the RAN runtime is used to support slice-based multi-service chain creation and chain placement, with an auto-scaling mechanism to increase the performance.

Published
2018
Full Text
View/download PDF

20. NFV-based Scalable Guaranteed-Bandwidth Multicast Service for Software Defined ISP networks

Author

Hitoshi Asaeda, Walid Dabbous, Hardik Soni, Thierry Turletti, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), National Institute of Information and Communications Technology [Tokyo, Japan] (NICT), UHD-on-5G associated team between Inria and NICT, ANR-13-INFR-0013,DISCO,Controlleurs SDN Distribués pour des services réseaux complexes et élastiques(2013), and ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011)

Subjects
Computer Networks and Communications, Computer science, computer.internet_protocol, Distributed computing, QoS, 050801 communication & media studies, 02 engineering and technology, Software Defined ISP Neworks, Load Balancing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, 0202 electrical engineering, electronic engineering, information engineering, Multicast address, Xcast, Electrical and Electronic Engineering, Pragmatic General Multicast, Network Function Virtualization, Multicast, Protocol Independent Multicast, business.industry, Inter-domain, Open vSwitch, 05 social sciences, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, Source-specific multicast, IP multicast, Multicast Routing, business, computer, Computer network
Abstract

International audience; —New applications where anyone can broadcast high quality video are becoming very popular. ISPs may take the opportunity to propose new high quality multicast services to their clients. Because of its centralized control plane, Software Defined Networking (SDN) enables the deployment of such a service in a flexible and bandwidth-efficient way. But deploying large-scale multicast services on SDN requires smart group membership management and a bandwidth reservation mechanism with QoS guarantees that should neither waste bandwidth nor impact too severely best effort traffic. In this paper, we propose; (1) a scalable multicast group management mechanism based on a Network Function Virtualization (NFV) approach for Software Defined ISP networks to implement and deploy multicast services on the network edge, and (2) the Lazy Load Balancing Multicast (L2BM) routing algorithm for sharing the core network capacity in a friendly way between guaranteed-bandwidth multicast traffic and best-effort traffic and that does not require costly real-time monitoring of link utilization. We have implemented the mechanism and algorithm, and evaluated them both in a simulator and a testbed. In the testbed, we experimented the group management at the edge and L2BM in the core with an Open vSwitch based QoS framework and evaluated the performance of L2BM with an exhaustive set of experiments on various realistic scenarios. The results show that L2BM outperforms other state-of-the art algorithms by being less aggressive with best-effort traffic and accepting about 5-15% more guaranteed-bandwidth multicast join requests.

Published
2017
Full Text
View/download PDF

21. Dynamically Distributed Network Control for Message Dissemination in ITS

Author

Anuj Kaul, Katia Obraczka, Mateus A. S. Santos, Christian E. Rothenberg, Thierry Turletti, Jack Baskin School of Engineering (UCSC), University of California [Santa Cruz] (UC Santa Cruz), University of California (UC)-University of California (UC), Faculdade de Ciências e Tecnologia = School of Science & Technology (FCT NOVA), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA), Universidade Estadual de Campinas = University of Campinas (UNICAMP), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), University of California [Santa Cruz] (UCSC), University of California-University of California, and University of Campinas [Campinas] (UNICAMP)

Subjects
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, V2V, ns-3/DCE, 0202 electrical engineering, electronic engineering, information engineering, 020206 networking & telecommunications, 020302 automobile design & engineering, 02 engineering and technology, ITS, distributed control plane
Abstract

International audience; We propose D2-ITS, a flexible and extensible framework to dynamically distribute network control to enable message dissemination in Intelligent Transport Systems (ITS). By decoupling the control- from the data plane, D2-ITS leverages network programmability to address ITS scalability, delay intolerance and decentralization. It uses a distributed control plane based on a hierarchy of controllers that can dynamically adjust to environment and network conditions in order to satisfy ITS application requirements. We demonstrate the benefits of D2-ITS through a proof-of-concept prototype using the ns-3 simulation platform. Results indicate lower message delivery latency with minimal additional overhead.

Published
2017

22. How far can we go? Towards Realistic Software-Defined Wireless Networking Experiments

Author

Christian Esteve Rothenberg, Ramon dos Reis Fontes, Mohamed Naoufal Mahfoudi, Walid Dabbous, Thierry Turletti, Universidade Estadual de Campinas = University of Campinas (UNICAMP), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-10-EQPX-0031,FIT,Internet du Futur (des Objets)(2010), University of Campinas [Campinas] (UNICAMP), and ANR: FIT,equipex fit

Subjects
Emulation, General Computer Science, Wireless network, business.industry, Computer science, Testbed, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, OpenFlow, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer architecture, Software-Defined Wireless Networks, 020204 information systems, Embedded system, 0202 electrical engineering, electronic engineering, information engineering, Forwarding plane, Wireless, Use case, IEEE 80211, business, Protocol (object-oriented programming), Mininet-WiFi
Abstract

International audience; Software-Defined Wireless Networking (SDWN) is an emerging approach based on decoupling radio control functions from the radio data plane through programmatic interfaces. Despite diverse ongoing efforts to realize the vision of SDWN, many questions remain open from multiple perspectives such as means to rapid prototype and experiment candidate software solutions applicable to real world deployments. To this end, emulation of SDWN has the potential to boost research and development efforts by re-using existing protocol and application stacks while mimicking the behavior of real wireless networks. In this article, we provide an in-depth discussion on that matter focusing on the Mininet-WiFi emulator design to fill a gap in the experimental platform space. We showcase the applicability of our emulator in an SDN wireless context by illustrating the support of a number of use cases aiming to address the question on how far we can go in realistic SDWN experiments, including comparisons to the results obtained in a wireless testbed. Finally, we discuss the ability to replay packet-level and radio signal traces captured in the real testbed towards a virtual yet realistic emulation environment in support of SDWN research.

Published
2017

23. ORION: Orientation Estimation Using Commodity Wi-Fi

Author

Walid Dabbous, Mohamed Naoufal Mahfoudi, Leonardo Lizzi, Thierry Parmentelat, Thierry Turletti, Robert Staraj, Fabien Ferrero, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire d'Electronique, Antennes et Télécommunications (LEAT), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), ANR-10-EQPX-0031,FIT,Internet du Futur (des Objets)(2010), Université Nice Sophia Antipolis (... - 2019) (UNS), Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)

Subjects
3G MIMO, Signal processing, Orientation (computer vision), Computer science, 0208 environmental biotechnology, MIMO, Real-time computing, Phase (waves), 020206 networking & telecommunications, 02 engineering and technology, 020801 environmental engineering, Antenna array, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Chan- nel State Information (CSI), Angle of arrival, Localization, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Orientation estimation, Wi-Fi, Simulation, Communication channel
Abstract

International audience; With MIMO, Wi-Fi led the way to the adoption of antenna array signal processing techniques for fine-grained localization using commodity hardware. These techniques, previously exclusive to specific domains of applications, will spur interest to reach beyond localization, and now allow to consider estimating the device’s orientation in space, that once required other sources of information. Wi-Fi’s popularity and the availability of metrics related to channel propagation (CSI), makes it a candidate readily available for experimentation. Accordingly, we propose the ORION system to estimate the orientation (heading and yaw) of a MIMO Wi-Fi equipped object, relying on a joint estimation of the angle of arrival and the angle of departure. Although the CSI’s phase data is plagued by several phase inconsistencies, we demonstrate that an appropriate phase compensation strategy significantly improves estimation accuracy. By feeding the estimation to a Kalman filter, we further improve the overall system accuracy, and lay the ground for an efficient tracking. Our technique allows estimating orientations within high precision (millimeter-level).

Published
2017

24. Scalable Guaranteed-Bandwidth Multicast Service in Software Defined ISP networks

Author

Thierry Turletti, Walid Dabbous, Hitoshi Asaeda, Hardik Soni, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), National Institute of Information and Communications Technology [Tokyo, Japan] (NICT), Equipe associée UHD-on-5G, GRID5000, ANR-13-INFR-013,DISCO,DIstributed SDN COntrollers, and ANR-13-INFR-0013,DISCO,Controlleurs SDN Distribués pour des services réseaux complexes et élastiques(2013)

Subjects
Routing protocol, Computer science, computer.internet_protocol, Distributed computing, Distance Vector Multicast Routing Protocol, QoS, 050801 communication & media studies, 02 engineering and technology, Multimedia Broadcast Multicast Service, Load Balancing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, 0202 electrical engineering, electronic engineering, information engineering, Multicast address, Xcast, Routing control plane, Pragmatic General Multicast, Network Function Virtualization, Multicast, Protocol Independent Multicast, business.industry, Inter-domain, Open vSwitch, Quality of service, 05 social sciences, 020206 networking & telecommunications, Load balancing (computing), Software Defined ISP Networks, Source-specific multicast, IP multicast, Multicast Routing, business, Software-defined networking, computer, Computer network
Abstract

International audience; New applications where anyone can broadcast video are becoming very popular on smartphones. With the advent of high definition video, ISP providers may take the opportunity to propose new high quality broadcast services to their clients. Because of its centralized control plane, Software Defined Networking (SDN) seems an ideal way to deploy such a service in a flexible and bandwidth-efficient way. But deploying large scale multicast services on SDN requires smart group membership management and a bandwidth reservation mechanism to support QoS guarantees that should neither waste bandwidth nor impact too severely best effort traffic. In this paper, we propose a Network Function Virtualization based solution for Software Defined ISP networks to implement scalable multicast group management. Then, we propose the Lazy Load balancing Multicast (L2BM) routing algorithm for sharing the network capacity in a friendly way between guaranteed-bandwidth multicast traffic and best-effort traffic. Our implementation of the framework made on Floodlight controllers and Open vSwitches is used to study the performance of L2BM.

Published
2017

25. Low Latency Low Loss Streaming using In-Network Coding and Caching

Author

Hitoshi Asaeda, Kazuhisa Matsuzono, Thierry Turletti, National Institute of Information and Communications Technology [Tokyo, Japan] (NICT), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and Equipe Associée UHD-on-5G

Subjects
Multicast, Computer science, Network packet, business.industry, 020206 networking & telecommunications, 02 engineering and technology, Data loss, Video quality, Network congestion, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Packet loss, Linear network coding, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Cache, business, Computer network
Abstract

International audience; Owing to the rapid growth in high-quality video streaming over the Internet, preserving high-level robustness against data loss and low latency, while maintaining higher data transmission rates, is becoming an increasingly important issue for high-quality real-time delay-sensitive streaming. In this paper, we propose a low latency, low loss streaming mechanism, L4C2, convenient for high-quality delay-sensitive streaming. With L4C2, nodes in the network estimate the acceptable delay and packet loss probability in their uplinks, aiming at retrieving lost data packets from in-network cache and/or coded data packets using in-network coding within an acceptable delay, by extending the Content-Centric Networking (CCN) approach. Further, L4C2 naturally provides multiple paths and multicast technologies to efficiently utilize network resources while sharing network resources fairly with competing data flows by adjusting the video quality when necessary. We validate through comprehensive simulations that L4C2 achieves a high success probability of data transmission considering the acceptable one-way delay, and higher QoE while suppressing the interest and redundant data traffic than the proposed multipath congestion control mechanism in CCN.

Published
2017

26. Joint range extension and localization for low-power wide-area network

Author

Mohamed Naoufal Mahfoudi, Walid Dabbous, Thierry Turletti, Gayatri Sivadoss, and Othmane Bensouda Korachi

Subjects
LPWAN, Computer science, MIMO, Real-time computing, 020206 networking & telecommunications, 02 engineering and technology, law.invention, Wide area network, law, 020204 information systems, Default gateway, 0202 electrical engineering, electronic engineering, information engineering, Fading, Radar, Joint (audio engineering), Multipath propagation, Computer Science::Information Theory
Abstract

This papers introduces Snipe, a novel system offering joint localization and range extensions for LPWANs. Although LPWAN systems such as Long Range (LoRa) are designed to achieve high communication range with low energy consumption, they suffer from fading in obstructed environments with dense multipath components, and their localization system is sub-par in terms of accuracy. In this work, MIMO techniques are leveraged to achieve a higher signal-to-noise ratio at both the end device and the gateway while providing an opportunistic accurate radar-based system for localization with limited additional cost.

Published
2019
Full Text
View/download PDF

27. Rules Placement Problem in OpenFlow Networks: a Survey

Author

Thierry Turletti, Chadi Barakat, Damien Saucez, Xuan-Nam Nguyen, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-13-INFR-0013 - DISCO,ANR-13-INFR-0013 - DISCO,DISCO - Controlleurs SDN Distribués pour des services réseaux complexes et élastiques(2014), and ANR-13-INFR-0013,DISCO,Controlleurs SDN Distribués pour des services réseaux complexes et élastiques(2013)

Subjects
OpenFlow, business.industry, Computer science, Distributed computing, 020206 networking & telecommunications, Access control, 02 engineering and technology, Network management, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Network element, Memory management, Scalability, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, business, Software-defined networking, Protocol (object-oriented programming), Computer network
Abstract

International audience; Software-Defined Networking (SDN) abstracts low- level network functionalities to simplify network management and reduce costs. The OpenFlow protocol implements the SDN concept by abstracting network communications as flows to be processed by network elements. In OpenFlow, the high-level policies are translated into network primitives called rules that are distributed over the network. While the abstraction offered by OpenFlow allows to potentially implement any policy, it raises the new question of how to define the rules and where to place them in the network while respecting all technical and administrative requirements. In this paper, we propose a comprehensive study of the so-called OpenFlow rules placement problem with a survey of the various proposals intending to solve it. Our study is multi-fold. First, we define the problem and its challenges. Second, we overview the large number of solutions proposed, with a clear distinction between solutions focusing on memory management and those proposing to reduce signaling traffic to ensure scalability. Finally, we discuss potential research directions around the OpenFlow rules placement problem.

Published
2016
Full Text
View/download PDF

28. Contrace: A Tool for Measuring and Tracing Content-Centric Networks

Author

Hitoshi Asaeda, Thierry Turletti, Kazuhisa Matsuzono, National Institute of Information and Communications Technology [Tokyo, Japan] (NICT), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and SIMULBED AYAME Associated team

Subjects
Ping (video games), Routing protocol, Virtual routing and forwarding, Computer Networks and Communications, Computer science, Distributed computing, Routing table, IP forwarding, 02 engineering and technology, Network topology, IP networks, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Routing protocols, 0202 electrical engineering, electronic engineering, information engineering, Electrical and Electronic Engineering, Measurement, business.industry, 020206 networking & telecommunications, Logic gates, IP forwarding algorithm, Computer Science Applications, Content management, traceroute, 020201 artificial intelligence & image processing, The Internet, Cache, Content centric, business, Computer network
Abstract

International audience; Content-Centric Networks (CCNs) are fundamental evolutionary technologies that promise to form the cornerstone of the future Internet. The information flow in these networks is based on named data requesting, in-network caching, and forwarding -- which are unique and can be independent of IP routing. As a result, common IP-based network tools such as ping and traceroute can neither trace a forwarding path in CCNs nor feasibly evaluate CCN performance. We propose "contrace," a network tool for CCNs (particularly, CCNx implementation running on top of IP) that can be used to investigate 1) the Round-Trip Time (RTT) between content forwarder and consumer, 2) the states of in-network cache per name prefix, and 3) the forwarding path information per name prefix. We report a series of experiments conducted using contrace on a CCN topology created on a local testbed and the GEANT network topology emulated by the Mini-CCNx emulator. The results confirm that contrace is not only a useful tool for monitoring and operating a network, but also a helpful analysis tool for enhancing the design of CCNs. Further, contrace can report the number of received interests per cache or per chunk on the forwarding routers. This enables us to estimate the content popularity and design more effective cache control mechanisms in experimental networks.

Published
2015
Full Text
View/download PDF

29. OFFICER: A general Optimization Framework for OpenFlow Rule Allocation and Endpoint Policy Enforcement

Author

Thierry Turletti, Damien Saucez, Chadi Barakat, Xuan-Nam Nguyen, Nguyen, Xuan Nam, Infrastructures matérielles et logicielles pour la société numérique - Controlleurs SDN Distribués pour des services réseaux complexes et élastiques - - DISCO2013 - ANR-13-INFR-0013 - INFRA - VALID, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), IEEE, ANR-13-INFR-0013 - DISCO,ANR-13-INFR-0013 - DISCO,DISCO - Controlleurs SDN Distribués pour des services réseaux complexes et élastiques(2014), and ANR-13-INFR-0013,DISCO,Controlleurs SDN Distribués pour des services réseaux complexes et élastiques(2013)

Subjects
Flexibility (engineering), Optimization, 020203 distributed computing, OpenFlow, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Network packet, Computer science, business.industry, Distributed computing, Rule Allocation, 020206 networking & telecommunications, 02 engineering and technology, Network topology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Control theory, Path (graph theory), 0202 electrical engineering, electronic engineering, information engineering, Routing (electronic design automation), business, Computer network
Abstract

International audience; The Software-Defined Networking approach permits to realize new policies. In OpenFlow in particular, a controller decides on behalf of the switches which forwarding rules must be installed and where. However with this flexibility comes the challenge of the computation of a rule allocation matrix meeting both high-level policies and the network constraints such as memory or link capacity limitations. Nevertheless, in many situations (e.g., data-center networks), the exact path followed by packets has not significant impact on performances as long as packets are delivered to their final destination decided by the endpoint policy. It is thus possible to deviate part of the traffic to alternative paths so to better use network resources without violating the endpoint policy. In this paper, we propose a linear optimization model of the rule allocation problem in resource constrained OpenFlow networks with loose routing policies. We show that the general problem is NP-hard and propose a polynomial time heuristic, called OFFICER, that aims to maximize the amount of carried traffic in under-provisioned networks. Our numerical evaluation on four different topologies show that exploiting various paths allows to increase the amount of traffic supported by the network without significantly increasing the path length.

Published
2015

30. A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks

Author

Katia Obraczka, Xuan Nam Nguyen, Marc Mendonca, Thierry Turletti, Bruno A. A. Nunes, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Jack Baskin School of Engineering (UCSC), University of California [Santa Cruz] (UC Santa Cruz), and University of California (UC)-University of California (UC)

Subjects
OpenFlow, business.industry, Computer science, 020206 networking & telecommunications, 02 engineering and technology, Virtualization, computer.software_genre, Programmable Networks, Network management, Software Defined Networking (SDN), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software, 0202 electrical engineering, electronic engineering, information engineering, Forwarding plane, 020201 artificial intelligence & image processing, The Internet, Electrical and Electronic Engineering, Architecture, business, Telecommunications, Software-defined networking, computer, Computer network
Abstract

accepted in IEEE Communications Surveys & Tutorials; International audience; The idea of programmable networks has recently re-gained considerable momentum due to the emergence of the Software-Defined Networking (SDN) paradigm. SDN, often referred to as a ''radical new idea in networking'', promises to dramatically simplify network management and enable innovation through network programmability. This paper surveys the state-of-the-art in programmable networks with an emphasis on SDN. We provide a historic perspective of programmable networks from early ideas to recent developments. Then we present the SDN architecture and the OpenFlow standard in particular, discuss current alternatives for implementation and testing of SDN-based protocols and services, examine current and future SDN applications, and explore promising research directions based on the SDN paradigm.

Published
2014
Full Text
View/download PDF

31. DCE: Test the real code of your protocols and applications over simulated networks

Author

Mathieu Lacage, Emilio Mancini, Daniel Camara, Hajime Tazaki, Walid Dabbous, Thierry Turletti, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), The University of Tokyo (UTokyo), ALCMEON, FRANCE, ALCMEON [Antibes], and ALCMEON-ALCMEON

Subjects
Configuration management, Web server, Computer Networks and Communications, Address space, Computer science, media_common.quotation_subject, Distributed computing, 020206 networking & telecommunications, Linux kernel, 02 engineering and technology, computer.software_genre, Computer Science Applications, Network simulation, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Debugging, 0202 electrical engineering, electronic engineering, information engineering, Code (cryptography), 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Traffic generation model, computer, media_common
Abstract

International audience; We present the Direct Code Execution (DCE) environment for ns-3, notable for being the first free, open source framework for integrating Linux kernel and application code within a leading discrete-event network simulator. This new approach has many potential advantages over virtual machine-based frameworks in terms of realism, reproducibility, avoidance of real-time execution constraints, configuration management and ability to debug a network-wide experiment from a single address space using common debugging tools. We provide an overview of DCE and illustrate some key features of this framework with two use cases, one involving thttpd, an HTTP server implementation, and another one involving the udp-perf traffic generator.

Published
2014

32. Direct code execution: Revisiting library os architecture for reproducible network experiments

Author

Thierry Turletti, Emilio Mancini, Daniel Camara, Mathieu Lacage, Frédéric Uarbani, Walid Dabbous, Hajime Tazaki, The University of Tokyo (UTokyo), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
021103 operations research, Address space, Computer science, media_common.quotation_subject, Packet processing, 0211 other engineering and technologies, Code coverage, 020206 networking & telecommunications, Linux kernel, 02 engineering and technology, computer.software_genre, Multipath TCP, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS, Protocol stack, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Debugging, Computer architecture, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Operating system, computer, media_common
Abstract

International audience; We describe the first capability, to our knowledge, to execute nearly unmodified applications and Linux kernel code in the context of a widely-used open source discrete event networking simulator (ns-3). We propose Direct Code Execution (DCE), a framework that dramatically increases the number of available protocol models and realism available for ns-3 simulations. DCE meets the goals recently proposed for fully reproducible networking research and runnable papers, with the added benefits of 1) the ability of completely deterministic reproducibility, 2) the scalability that simulation time dilation offers, 3) capabilities supporting automated code coverage analysis, and 4) improved debuggability via execution within a single address space. In this paper, we describe in detail DCE, report on packet processing benchmark and showcase key features of the framework with different use cases. Next, we reproduce a previously published Multipath TCP (MPTCP) experiment and highlight how code coverage testing can be automated by showing results achieving 55-86% coverage of the MPTCP implementation. Then we demonstrate how network stack debugging can be easily performed and reproduced across a distributed system. Our first benchmarks are promising and we believe this framework can benefit the network community by enabling realistic, reproducible experiments and runnable papers.

Published
2013
Full Text
View/download PDF

33. A multi-platform event-driven controller for network experiments

Author

Thierry Turletti, Alina Quereilhac, Walid Dabbous, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Emulation, Engineering, Event (computing), Event scheduling, business.industry, Controller (computing), Testbed, 020206 networking & telecommunications, Provisioning, 02 engineering and technology, User requirements document, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software deployment, Embedded system, 0202 electrical engineering, electronic engineering, information engineering, Experiment Control, business, Simulation
Abstract

International audience; Network researchers rely on a wide variety of experimentation platforms, ranging from simulators to emulators and live testbeds, to validate new ideas. Many experiment management frameworks have been created to ease up the complexity and time cost of deploying experiments on different platforms. However, providing flexible deployment capabilities for arbitrary platforms remains a challenging problem. In this work we propose an experiment controller architecture based on event scheduling, designed to enable flexible experiment deployment on diverse platforms. This architecture is capable of handling arbitrary deployment dependencies , both imposed by user requirements and by platform restrictions. It additionally enables flexible resource provi-sioning, at any point in time during experiment execution, and flexible experiment monitoring events.

Published
2012
Full Text
View/download PDF

34. Automated Deployment and Customization of Routing Overlays on PlanetLab

Author

Walid Dabbous, Alina Quereilhac, Thierry Turletti, Claudio Daniel Freire, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
010302 applied physics, Computer science, business.industry, Distributed computing, Testbed, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, networking, PlanetLab, Overlay network, 020206 networking & telecommunications, overlays, 02 engineering and technology, Overlay, 01 natural sciences, NEPI, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Software deployment, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, The Internet, Traffic shaping, Routing (electronic design automation), business
Abstract

International audience; PlanetLab testbed is widely used to evaluate protocols and applications under realistic Internet conditions, but this realism comes at the cost of uncontrolled topology and traffic behavior. The use of overlay networks on PlanetLab can solve this problem by giving more control to the experimenter. However, manually creating such overlays is far from simple, and existing solutions are either not available for all PlanetLab nodes, or lack support for low level overlays. Deployment and customization of overlay architectures are also poorly supported. In this paper we present a flexible solution to support overlay networks on Plan-etLab, providing deployment automation, tunneling, routing, and traffic shaping capabilities. By building our solution into NEPI, a general framework for network experimentation, which automates design, deployment, and management of experiments, we simplify the complexity of building overlays on PlanetLab, and foster reusability and extensibility though NEPI's modular structure.

Published
2012
Full Text
View/download PDF

35. Hybrid Approach for Experimental Networking Research

Author

Farouk Kamoun, Amine Abidi, Arnaud Legout, Thierry Turletti, Sonia Mettali Gammar, Walid Dabbous, Laboratoire d'Electronique et Microélectronique, Faculté des Sciences de Monastir (FSM), Université de Monastir - University of Monastir (UM)-Université de Monastir - University of Monastir (UM), Centre de Recherche Réseau Image SysTème Architecture et MuLtimédia (CRISTAL), École Nationale des Sciences de l'Informatique [Manouba] (ENSI), Université de la Manouba [Tunisie] (UMA)-Université de la Manouba [Tunisie] (UMA), Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Grid network, Computer science, Distributed computing, 020206 networking & telecommunications, 02 engineering and technology, Grid, Hybrid approach, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Real-time simulation, Mapping algorithm, 0202 electrical engineering, electronic engineering, information engineering, Code (cryptography), [INFO]Computer Science [cs], Communications protocol, Protocol (object-oriented programming)
Abstract

International audience; Simulation is often used for the evaluation of new network protocols and architectures. In order to perform more realistic simulations , modern simulators such as ns-3 integrate more detailed models and even support direct execution of real protocol code. However, such complex models require more computational and memory requirements. In this paper, we study the feasibility of a hybrid approach based on distributing a complex simulation scenario on several nodes in a grid network. We show that by exploiting the real time operation of the ns-3 simulator, it is possible to map such complex scenarios on grid nodes. We run experiments to define the operational zone in which the obtained results are accurate. We also propose a basic mapping algorithm to distribute a simulation scenario in several nodes.

Published
2012
Full Text
View/download PDF

36. Certified Internet Coordinates

Author

Mohamed Ali Kaafar, Walid Dabbous, Thierry Turletti, Kave Salamatian, Chadi Barakat, Laurent Mathy, Protocols and applications for the Internet (PLANETE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Computing Department [Lancaster], Lancaster University, Laboratoire d'Informatique, Systèmes, Traitement de l'Information et de la Connaissance (LISTIC), and Université Savoie Mont Blanc (USMB [Université de Savoie] [Université de Chambéry])

Subjects
Internet, Theoretical computer science, business.industry, Computer science, Coordinate system, Testing, 020206 networking & telecommunications, 02 engineering and technology, Network servers, Distributed computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Delay estimation, Web server, Node (computer science), 0202 electrical engineering, electronic engineering, information engineering, Embedding, 020201 artificial intelligence & image processing, The Internet, Extraterrestrial measurements, business, Algorithm, Distance measurement, Embedded computing, Weibull distribution, Coordinate measuring machines
Abstract

International audience; We address the issue of asserting the accuracy of coordinates advertised by nodes of Internet coordinate systems during distance estimations. Indeed, some nodes may lie deliberately about their coordinates to mount various attacks against applications and overlays. Our proposed method consists in two steps: 1) establish the correctness of a node's claimed coordinate (which leverages our previous work on securing the coordinates embedding phase using a Surveyor infrastructure); and 2) issue a time limited validity certificate for each verified coordinate. Validity periods are computed based on an analysis of coordinate inter-shift times observed on PlanetLab, and shown to follow a long-tail distribution (lognormal distribution in most cases, or Weibull distribution otherwise). The effectiveness of the coordinate certification method is validated by measuring the impact of a variety of attacks on distance estimates.

Published
2009

37. Coping with episodic connectivity in heterogeneous networks

Author

Rao Naveed Bin Rais, Thierry Turletti, Katia Obraczka, Protocols and applications for the Internet (PLANETE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Jack Baskin School of Engineering (UCSC), University of California [Santa Cruz] (UC Santa Cruz), and University of California (UC)-University of California (UC)

Subjects
Backbone network, Computer science, business.industry, 05 social sciences, Interoperability, 050801 communication & media studies, 020206 networking & telecommunications, 02 engineering and technology, law.invention, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, Relay, law, Bundle, Transport layer, 0202 electrical engineering, electronic engineering, information engineering, Link layer, The Internet, business, Heterogeneous network, Computer network
Abstract

International audience; In this paper, we present an efficient message delivery mechanism that enables distribution/dissemination of messages in an internet connecting heterogeneous networks and prone to disruptions in connectivity. We call our protocol MeDeHa (pronounced “medea”) for Message Delivery in Heterogeneous, Disruptionprone Networks. MeDeHa is complementary to the IRTF's Bundle Architecture: while the Bundle Architecture provides storage above the transport layer in order to enable interoperability among networks that support different types of transport layers, MeDeHa stores data at the link layer addressing heterogeneity at lower layers (e.g., when intermediate nodes do not support higher-layer protocols). MeDeHa also takes advantage of network heterogeneity (e.g., nodes supporting more than one network) to improve message delivery. For example, in the case of IEEE 802.11 networks, participating nodes may use both infrastructure- and ad hoc modes to deliver data to otherwise unavailable destinations. Another important feature of MeDeHa is that there is no need to deploy special-purpose nodes such as message ferries, data mules, or throwboxes in order to relay data to intended destinations, or to connect to the backbone network wherever infrastructure is available. The network is able to store data destined to temporarily unavailable nodes for some time depending upon existing storage as well as quality-of-service issues such as delivery delay bounds imposed by the application. We evaluate MeDeHa via simulations using indoor scenarios (e.g. convention centers, exposition halls, museums etc.) and show significant improvement in delivery ratio in the face of episodic connectivity. We also showcase MeDeHa's support for different levels of quality-of-service through traffic differentiation and message prioritization.

Published
2008
Full Text
View/download PDF

38. A new MAC scheme for very high-speed WLANs

Author

Tianji Li, David Malone, Yang Xiao, Qiang Ni, Thierry Turletti, and Douglas J. Leith

Subjects
Voice over IP, Network packet, Computer science, business.industry, Retransmission, 05 social sciences, Frame (networking), ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Physical layer, 050801 communication & media studies, 020206 networking & telecommunications, 02 engineering and technology, law.invention, 0508 media and communications, PHY, law, Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Overhead (computing), Wi-Fi, business, Computer network, Hamilton Institute
Abstract

We consider the medium access control (MAC) layer for very high-speed wireless LANs, which is designed to support rich multimedia applications such as high-definition television. In such networks, the physical (PHY) layer data rate is proposed to exceed 216 Mbps. The legacy MAC layer, however, greatly restricts the performance improvement due to its overhead. It has been shown that MAC utilizes less than 20% of the transportation ability provided by the PHY layer. To mitigate this inefficiency, we propose an aggregation with fragment retransmission (AFR) scheme, which supports transmissions of very large frames and partial retransmissions in the case of errors. Aggregation allows for increased performance despite per-transmission overhead while partial retransmission alleviates the risk of losing the entire frame. Extensive simulations show that AFR fundamentally outperforms the legacy MAC protocol. It is particularly effective for applications with high data rates and large packet sizes such as HDTV and high-rate UDP traffic. For applications with very low data rates and small packet sizes such as voice over IP, AFR performs slightly better.

Published
2006

39. An Evaluation of Media-Oriented Rate Selection Algorithm for Multimedia Transmission in MANETs

Author

Mohammad Hossein Manshaei, Thomas Guionnet, Thierry Turletti, Protocols and applications for the Internet (PLANETE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Digital image processing, modeling and communication (TEMICS), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
Computer Networks and Communications, Computer science, Image quality, Wireless ad hoc network, mode selection algorithms, cross-layer optimization, MANETs, lcsh:TK7800-8360, Throughput, Cross-layer optimization, 02 engineering and technology, Video quality, lcsh:Telecommunication, lcsh:TK5101-6720, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], IEEE 802.11 wireless LAN, Motion compensation, business.industry, lcsh:Electronics, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, Computer Science Applications, Transmission (telecommunications), Signal Processing, ad hoc networks, 020201 artificial intelligence & image processing, business, Encoder, Computer network, Communication channel
Abstract

International audience; We focus on the optimization of real-time multimedia transmission over 802.11-based ad hoc networks. In particular, we propose a simple and efficient cross-layer mechanism that considers both the channel conditions and characteristics of the media for dynamically selecting the transmission mode. This mechanism called media-oriented rate selection algorithm (MORSA) targets loss-tolerant applications such as VoD that do not require full reliable transmission. We provide an evaluation of this mechanism for MANETs using simulations with NS and analyze the video quality obtained with a fine-grain scalable video encoder based on a motion-compensated spatiotemporal wavelet transform. Our results show that MORSA achieves up to 4 Mbps increase in throughput and that the routing overhead decreases significantly. Transmission of a sample video flow over an 802.11a wireless channel has been evaluated with MORSA. Important improvement is observed in throughput, latency, and jitter while keeping a good level of video quality.

Published
2005
Full Text
View/download PDF

40. Network Tomography from Aggregate Loss Reports

Author

Thierry Turletti, Don Towsley, Nick Duffield, Vijay Arya, R. Bellino, Timur Friedman, Joseph Horowitz, Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), and Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Multicast, Protocol Independent Multicast, Computer Networks and Communications, Computer science, business.industry, Real-time computing, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Distance Vector Multicast Routing Protocol, 020206 networking & telecommunications, 02 engineering and technology, RTP Control Protocol, 01 natural sciences, 010104 statistics & probability, Source-specific multicast, Hardware and Architecture, Modeling and Simulation, Reliable multicast, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Xcast, 0101 mathematics, business, Software, Pragmatic General Multicast, Computer network
Abstract

International audience; Multicast applications and network monitors can potentially benefit from the ability to infer the loss rates along links within a multicast tree. Estimators, known generically by MINC, or multicast inference of network characteristics, have been developed to provide this ability. They consider multicast data packets to be probes, and conduct inference based upon reports of which probes reached each receiver. In practice, gathering reports from receivers in real time is a non-trivial task that presents scaling problems as the number of receivers increases. Prior work has led to an extension of the RTP data transport protocol to permit receivers to report per-probe information in packets known as RTCP XR packets. This paper demonstrates how MINC inference can, in fact, be conducted using only a default RTP packet format known as RTCP RR. RTCP RR packets contain summary information rather than per-probe information. They thus offer bandwidth savings, although this comes at the expense of an increase in estimator convergence time. Furthermore, this technique can be used by the observer of any standard RTP session, whereas estimation based upon per-probe information is only possible when a session explicitly employs the extended reporting format.

Published
2005
Full Text
View/download PDF

41. Source and Channel Adaptive Rate Control for Multicast Layered Video Transmission Based on a Clustering Algorithm

Author

Christine Guillemot, Thierry Turletti, Jerome Vieron, Kave Salamatian, Thomson Multimedia R&D France, Thomson, Protocols and applications for the Internet (PLANETE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Networks and Performance Analysis (NPA), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Digital image processing, modeling and communication (TEMICS), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Rennes – Bretagne Atlantique

Subjects
Computer science, multicast, Real-time computing, lcsh:TK7800-8360, 02 engineering and technology, Similarity measure, RTP Control Protocol, lcsh:Telecommunication, Network simulation, layered video, lcsh:TK5101-6720, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Electrical and Electronic Engineering, Cluster analysis, Multicast, business.industry, lcsh:Electronics, aggregation, 020206 networking & telecommunications, congestion control, Network congestion, Source-specific multicast, Hardware and Architecture, Signal Processing, FGS, 020201 artificial intelligence & image processing, business, Computer network, Communication channel
Abstract

International audience; This paper introduces source-channel adaptive rate control (SARC), a new congestion control algorithm for layered video transmission in large multicast groups. In order to solve the well-known feedback implosion problem in large multicast groups, we first present a mechanism for filtering RTCP receiver reports sent from receivers to the whole session. The proposed filtering mechanism provides a classification of receivers according to a predefined similarity measure. An end-to-end source and FEC rate control based on this distributed feedback aggregation mechanism coupled with a video layered coding system is then described. The number of layers, their rate, and their levels of protection are adapted dynamically to aggregated feedbacks. The algorithms have been validated with the NS2 network simulator.

Published
2004

42. Multi-objective placement of virtual network function chains in 5G

Author

Thierry Turletti, Navid Nikaein, Osama Arouk, Design, Implementation and Analysis of Networking Architectures (DIANA), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), EURECOM, Eurecom [Sophia Antipolis]-Centre National de la Recherche Scientifique (CNRS), ANR-11-LABX-0031,UCN@SOPHIA,Réseau orienté utilisateur(2011), European Project: 762057,H2020,5G-PICTURE(2017), Turletti, Thierry, Laboratoires d'excellence - Réseau orienté utilisateur - - UCN@SOPHIA2011 - ANR-11-LABX-0031 - LABX - VALID, and 5G Programmable Infrastructure Converging disaggregated neTwork and compUte REsources - 5G-PICTURE - - H20202017-06-01 - 2019-11-30 - 762057 - VALID

Subjects
Speedup, Computer science, Distributed computing, Real-time computing, 050801 communication & media studies, Cloud computing, 02 engineering and technology, Base station, NFV, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, 0202 electrical engineering, electronic engineering, information engineering, Virtual network, Radio access network, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, 05 social sciences, 020206 networking & telecommunications, Load balancing (computing), Embedding, C-RAN, business, 5G, function split, function placement
Abstract

International audience; In this paper we propose a novel algorithm, namely Multi-Objective Placement (MOP), for the efficient placement of Virtualized Network Function (VNF) chains in future 5G systems. Real datasets are used to evaluate the performance of MOP in terms of acceptance ratio and embedding time when placing the time critical radio access network (RAN) functions as a chain. In addition, we rely on a realistic infrastructure topology to assess the performance of MOP with two main objectives: maximizing the number of base stations that could be embedded in the Cloud and load balancing. The results reveal that the acceptance ratio of embedding RAN functions is only 5% less than the one obtained with the optimal solution for the majority of considered scenarios, with a speedup factor of up to 2000 times.

Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results