Emmanuel Lochin

Prof. Emmanuel Lochin received his Ph.D from the LIP6 laboratory of Pierre and Marie Curie University - Paris VI in December 2004 and the Habilitation Thesis (Habilitation à Diriger des Recherches) in October 2011 from Institut National Polytechnique de Toulouse (INPT). From July 2005 to August 2007, he held a researcher position in the Networks and Pervasive Computing research program at National ICT Australia, Sydney. He joined ISAE in September 2007 as researcher and network security officer. He is member of TéSA laboratory and networking expert in the TeSA scientific committee.

His research interests are mainly related to transport protocols and congestion control.

 Last news

• 30/10/2018 Following our paper Improving RFC5865 Core Network Scheduling with a Burst Limiting Shaper, Priority Switching Scheduler (PSS) code has been released and is publicly available here
• 25/10/2018 Comparative Analysis of Scheduling Strategies for Heterogeneous Avionics Application has been accepted for publication at ERDN 2018

 Research

My research interests are mainly related to transport protocols and congestion control.
See my publications and my projects and softwares page for further details.

TETRYS

TETRYS enables a new reliability algorithm specifically useful when retransmission is either problematic or not possible. In case of multimedia or multicast communications and in the context of the Delay Tolerant Networking (DTN), the classical retransmission schemes can be counterproductive in terms of data transfer performance or not possible when the acknowledgment path is not always available. Indeed, over long delay links, packets retransmission has a meaning of cost and must be minimized. The purpose of Tetrys is to propose a novel reliability mechanism with an implicit acknowledgment strategy that could be used either within these new DTN proposals, for multimedia traffic or in the context of multicast transport protocols. This proposal is based on a new on-the-fly erasure coding concept specifically designed to operate efficient reliable transfer over bi-directional links. Tetrys allows to unify a full reliability with an error correction scheme. Tetrys is not sensitive to the loss of acknowledgments while ensuring a faster data availability to the application compared to other traditional acknowledgment schemes. See this paper for detail :

• On-the-Fly Coding for Time-Constrained Applications- In IEEE Transactions on Multimedia

More information available on the projetc website : TETRYS

FLOWER Fuzzy Lower-than-Best-Effort Transport Protocol

Among the different transport protocols providing a LBE service, Low Extra Delay Background Transport (LEDBAT) is the most used. LEDBAT is a delay-based congestion control protocol that has been standardized by the Internet Engineering Task Force (IETF). LEDBAT aims to exploit the remaining capacity while limiting the queuing delay around a predefined target which may be set up to 100 ms according to RFC 6817. Consequently, LEDBAT flows limits the amount of queuing delay introduced in the network and thus lower their impact on best-effort flows such as TCP.
Despite being a widely deployed protocol, the two main LEDBAT parameters (i.e., target and gain) have been revealed to be complex to determine as their tuning highly depends on the network conditions and not dynamically configurable.
Indeed, LEDBAT may become more aggressive than TCP in case of misconfiguration.

Our protocol, FLOWER (Fuzzy LOWer-than-Best-EffoRt Transport Protocol), is a promising alternative of LEDBAT.
With FLOWER, we aim to overcome the LEDBAT shortcomings while still fulfilling its goals. The principal difference with LEDBAT is that FLOWER replaces the linear P-type controller (proportional controller) of LEDBAT by a fuzzy controller to modulate the congestion window.

FLOWER code is based on LEDBAT and TCP Vegas ns-2 implementations and is available for ns-2 and GNU/Linux here :

FLOWER protocol ns-2 and Linux codes

Jungle Networking

Recent theoretical works, investigating the possibility to dispense the Internet with end-to-end congestion control, demonstrate that this new paradigm seems to be sustainable for the Internet and would not lead to a congestion collapse. Unlike congestion-controlled networks that depend on end-hosts to achieve the max-min-fairness, over anarchical networks, the traffic assignment is network based. This allows to be robust to network attacks or misbehaving end-hosts. However, the price of this anarchy is that loss recovery should be done with an ideal erasure coding scheme.

In this context we propose DeCongestion Transport Protocol (DCTP), a transport protocol based on Tetrys erasure coding scheme to perform over anarchical networks. We evaluate this protocol over a realistic ISP topology and show
that : 1) the efficiency of such networks remains close to TCP ; 2) they support small buffer size which is a key property for optical networks and 3) real-time flows can be supported while reducing the end-to end-delay in the case of small buffer size.

See our presentation here

Projects and softwares

For other projects and softwares check this page.

Some videos linked to my research activity

 Linkages

Université Pierre et Marie Curie, Université de la Réunion, Université de Franche-Comté, Université de Nice, ENAC, Macquarie University, University of New South Wales, University of Delaware, CSIRO/Data61, Thales Alenia Space, CNES, Expway, INRIA Grenoble

 Honors and Awards

IEEE Communications Letters exemplary reviewer 2015

IEEE Communications Letters exemplary reviewer 2013

I am, with Guillaume Jourjon and Patrick Sénac, the recipient of the best paper award of the Multimedia Communications & Home Services Symposium of IEEE International Conference on Communications (IEEE ICC 2007)
Glasgow, UK - 24-27 June, 2007

Mention spéciale du jury CFIP2009 à Pierre Ugo Tournoux, CNRS-LAAS et Université de Toulouse pour son article avec Amine Bouabdallah, Emmanuel Lochin et Jérôme Lacan. Tetrys : Un mécanisme de fiabilisation polyvalent

 Teaching

ISAE-SUPAERO 1A
 TCS1-IN - Algorithmes et Programmation en C

ISAE-SUPAERO 2A
 TCS3-IN - Langage Java et Réseaux

ISAE-SUPAERO 3A
 F-ITR301 - Architecture informatique et réseaux
 F-ITR316 - Internet et services multimédia par satellite

Master of Science in Aerospace Engineering
 1MAE703 - System Architecture

Mastère SPAPS
 APS401 - Telecommunications and networks
 APS402 - Broadband satellite communication systems

CNAM 3A
 Introduction aux Systèmes et Réseaux

 Responsabilités d’enseignements

 Responsable des stages/années de césures
 Responsable du module 1MAE703 - System Architecture
 Responsable du module systèmes embarqués FPA
 Correspondant formation informatique FPA

 PhD and postdoc students

On going

 Marina Dehez Clementi, thèse en cotutelle ISAE-SUPAERO, Macquarie University, ENAC, Blockchain for cybersecurity
 Frédéric Giroudot, thèse MESR, Conception et optimisation des calculateurs embarqués avioniques de nouvelle génération

Alumni

 Bastien Tauran, Sur l’intéraction entre protocoles de transport et fiabilisation couche liaison pour service mobile satellite, thèse co-financée CNES/TAS soutenue le 6 décembre 2018
 Jonathan Detchart, Optimisation de codes correcteurs d’effacements par application de transformées polynomiales, thèse ISAE soutenue le 5 décembre 2018
 Anais Finzi, Specification and Analysis of an Extended AFDX with TSN/BLS shapers for Mixed-Criticality Avionics Applications, thèse DGAC-AIRBUS soutenue le 11 juin 2018
 Antoine Auger, Qualité des Observations pour les systèmes Sensor Webs : de la théorie à la pratique, thèse DGA/Région Midi-Pyrénées soutenue le 20 avril 2018
 Gwilherm Baudic, HINT - from opportunistic network characterization to application development, thèse MESR soutenue le 6 décembre 2016
 Si Quoc Viet Trang, FLOWER, an Innovative Fuzzy LOWer-than-Best-EffoRt Transport Protocol, thèse co-financée CNES/Thales Alenia Space soutenue le 3 décembre 2015
 Victor Alejandro Ramiro Cid, Characterization and applications of random walks over opportunistic networks, thèse BECAS CHILE - ISAE-SUPAERO soutenue le 4 novembre 2015
 Guillaume Smith, Enabling Private Real-Time Applications by Exploiting the Links Between Erasure Coding and Secret Sharing Mechanisms, thèse en co-tutelle TéSA-NICTA soutenue le 4 décembre 2014
 Golam Sarwar, Analysis and Design of Multipath Transport Protocols, thèse en co-tutelle NICTA-ISAE soutenue le 9 juillet 2014
 Nicolas Kuhn, Cross-layer interactions and long delay links : link layer mechanisms and TCP performance, thèse co-financée TéSA-NICTA soutenue le 21 novembre 2013
 Rémi Diana, Routing based congestion control for DTN satellite topology, thèse co-financée CNES/Thales Alenia Space soutenue le 6 décembre 2012
 Pierre-Ugo Tournoux, Protocoles de transports basés sur le Network Coding, thèse LAAS-ISAE soutenue le 15 décembre 2010
 Dino Matin Lopez Pacheco post-doctorat ISAE septembre 2008 à aout 2009
 Guillaume Jourjon, Towards a Versatile Transport Protocol, thèse de l’université du New South Wales (UNSW) et de l’Université de Toulouse soutenue le 23 janvier 2008