TTThierry Turletti

Thierry Turletti

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Thierry Turletti has a total of 41 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    D4: Dynamic, Decentralized, Distributed, Delegation-Based Network Control and Its Applications to Autonomous Vehicles

    by Anuj Kaul, Katia Obraczka, Ramon Fontes, Thierry Turletti

    Connected autonomous vehicles technology is expected to be an important component of Intelligent Transportation Systems (ITS). With the help of artificial intelligence, cognitive methods, software-hardware and sensor platforms, several relevant industry standards are being developed to enable connected vehicles. One significant challenge raised by connected vehicles is how the underlying communication infrastructure will be able to efficiently support them. In this article, we propose the Dynamic, Decentralized, Distributed, Delegation-based (D4) network control plane architecture, which aims at providing adequate communication support for connected vehicles. To our knowledge, D4 is the first framework to support on-demand network control decentralization. At its core, D4’s flexible network control delegation framework allows network control to be dynamically distributed on demand to address quality-of-service requirements of different connected vehicle services and applications. We demonstrate the benefits of D4 through a proof-of-concept prototype running on a fully reproducible emulation platform. Experimental results using a variety of real-world scenarios demonstrate that D4 delivers lower latency with minimal additional overhead. We also showcase the benefits of D4 when compared to traditional vehicular ad hoc network (VANET) approaches.


  • Troubleshooting distributed network emulation

    by Houssam ElBouanani, Chadi Barakat, Walid Dabbous, Thierry Turletti

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

    by Tingting Yuan, Christian Esteve Rothenberg, Katia Obraczka, Chadi Barakat, Thierry Turletti

    Terrestrial infrastructure-based wireless networks do not always guarantee their resources will be shared uniformly by nodes in vehicular networks. This is due mainly to the uneven and dynamic geographical distribution of vehicles and path loss effects. In this paper, we leverage multiple fifth-generation (5G) unmanned aerial vehicles (UAVs) to enhance fairness in network resource allocation among vehicles by positioning UAVs on-demand as “flying communication infrastructure”. We propose a deep reinforcement learning (DRL) approach to determine UAVs’ position to improve network resource allocation fairness and efficiency while considering the UAVs’ flying range, communication range, and energy constraints. We use a parametric fairness function to attain a number of resource allocation objectives ranging from maximizing the total throughput of vehicles, maximizing minimum throughput, and achieving proportional bandwidth allocation. Simulation results show that the proposed DRL approach to UAV positioning can improve network resource allocation according to the targeted fairness objective.


  • Open Access

    Cross-layer Loss Discrimination Algorithms for MEC in 4G networks

    by Mamoutou Diarra, Walid Dabbous, Amine Ismail, Thierry Turletti

    Traditional loss-based Congestion Control Algorithms (CCAs) suffer from performance issues over wireless networks mostly due to their inability to distinguish wireless random losses from congestion losses. Different loss discrimination algorithms have been proposed to tackle this issue but they are not efficient for 4G networks since they do not consider the impact of various link layer mechanisms such as adaptive modulation and coding and retransmission techniques on congestion in LTE Radio Access Networks (RANs). We propose MELD (MEC-based Edge Loss Discrimination), a novel server-side loss discrimination mechanism that leverages recent advancements in Multi-access Edge Computing (MEC) services to discriminate packet losses based on real-time RAN statistics. Our approach collects the relevant radio information via MEC’s Radio Network Information Service and uses it to correctly distinguish random losses from congestion losses. Our experimental study made with the QUIC transport protocol shows over 80% higher goodput when MELD is used with NewReno and 8% higher goodput when used with Cubic.


  • Design of robust programmable networks with bandwidth-optimal failure recovery scheme

    by Andrea Tomassilli, Giuseppe Di Lena, Frédéric Giroire, Issam Tahiri, Damien Saucez, Stéphane Pérennes, Thierry Turletti, Ruslan Sadykov, François Vanderbeck, Chidung Lac


  • Dynamic Controller Assignment in Software Defined Internet of Vehicles Through Multi-Agent Deep Reinforcement Learning

    by Tingting Yuan, Wilson da Rocha Neto, Christian Esteve Rothenberg, Katia Obraczka, Chadi Barakat, Thierry Turletti

    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.


    • 12 November 2020
    • Published by HAL in HAL
    Open Access

    Cross-layer Loss Discrimination Algorithms for MEC in 4G networks

    by Mamoutou Diarra, Thierry Turletti, Walid Dabbous, Amine Ismail

    Traditional loss-based Congestion Control Algorithms (CCAs) suffer from performance issues over wireless networks mostly because they fail to distinguish wireless random losses from congestion losses. Different loss discrimination algorithms have been proposed to tackle this issue but they are not efficient for 4G networks since they do not consider the impact of various link layer mechanisms such as adaptive modulation and coding and retransmission techniques on congestion in LTE Radio Access Networks (RANs). We propose MELD (MEC-based Edge Loss Discrimination), a novel server-side loss discrimination mechanism that leverages recent advancements in Multi-access Edge Computing (MEC) services to discriminate packet losses based on real-time RAN statistics. Our approach collects the relevant radio information via MEC's Radio Network Information Service and uses it to correctly distinguish random losses from congestion losses. Our experimental study made with the QUIC transport protocol shows over 80% higher goodput when MELD is used with New Reno and 8% higher goodput when used with Cubic.

    • 12 November 2020
    • Published by HAL in HAL
    Open Access

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

    by Giuseppe Lena, Andrea Tomassilli, Frédéric Giroire, Damien Saucez, Thierry Turletti

    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.

  • Open Access

    Demo Proposal - Distrinet

    by Giuseppe Di Lena, Andrea Tomassilli, Damien Saucez, Frédéric Giroire, Thierry Turletti, Chidung Lac

    Networks became so complex and technical that it is now hard if not impossible to model or simulate them. Consequently, more and more researchers rely on prototypes emulated in controlled environments and Mininet is by far the most popular tool. Mininet implements a simple, yet powerful API to define and run network experiments on a single machine. In most cases, running experiments on one machine is adequate but for resource intensive applications one machine may not be sufficient. For that reason we propose Distrinet, a way to distribute Mininet over multiple hosts. Distrinet uses the same API than Mininet, granting full compatibility with Mininet programs. Distrinet is generic and can optimally deploy experiments in Linux clusters or in public clouds and automatically minimizes the resource consumed in the experimental infrastructure.


  • NFV-Based Scalable Guaranteed-Bandwidth Multicast Service for Software Defined ISP Networks

    by Hardik Soni, Walid Dabbous, Thierry Turletti, Hitoshi Asaeda

    New applications where anyone can broadcast high quality video are becoming very popular. Internet services providers (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 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.