Yann Busnel

Prof. Yann Busnel

IMT Atlantique
+1
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 May 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
LLLeo Lavaur
Leo Lavaur
MPMarc-Oliver Pahl
Marc-Oliver Pahl
Yann BusnelYann Busnel
Yann Busnel
FAFabien Autrel
Fabien Autrel
In 2016, Google introduced the concept of Federated Learning (FL), enabling collaborative Machine Learning (ML). FL does not share local data but ML models, offering applications in diverse domains. This paper focuses on the application of FL to Intrusion Detection Systems (IDSs). There, common criteria to compare existing solutions are missing. In particular, this survey shows: (i) how FL-based IDSs are used in different domains; (ii) what differences exist between architectures; (iii) the state of the art of FL-based IDS. With a structured literature survey, this work identifies the relevant state of the art in FL–based intrusion detection from its creation in 2016 until 2021. It provides a reference architecture and a taxonomy to serve as guidelines to compare and design FL-based IDSs. Both are validated with the existing works. Finally, it identifies research directions for the application of FL to intrusion detection systems.

1 March 2021 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
PNPranav Nerurkar
Pranav Nerurkar
DPDhiren Patel
Dhiren Patel
Yann BusnelYann Busnel
Yann Busnel
RLRomaric Ludinard
Romaric Ludinard
SKSaru Kumari
Saru Kumari
MKMuhammad Khurram Khan
Muhammad Khurram Khan

20 November 2020 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
PNPranav Nerurkar
Pranav Nerurkar
SBSunil Bhirud
Sunil Bhirud
DPDhiren Patel
Dhiren Patel
RLRomaric Ludinard
Romaric Ludinard
Yann BusnelYann Busnel
Yann Busnel
SKSaru Kumari
Saru Kumari

1 May 2017
Verified
Conference Paper
Closed access
ASAlassane Samba
Alassane Samba
Yann BusnelYann Busnel
Yann Busnel
ABAlberto Blanc
Alberto Blanc
PDPhilippe Dooze
Philippe Dooze
GSGwendal Simon
Gwendal Simon

24 June 2015
Verified
Conference Paper
Open access
NRNicoló Rivetti
Nicoló Rivetti
LQLeonardo Querzoni
Leonardo Querzoni
EAEmmanuelle Anceaume
Emmanuelle Anceaume
Yann BusnelYann Busnel
Yann Busnel
BSBruno Sericola
Bruno Sericola
Key grouping is a technique used by stream processing frameworks to simplify the development of parallel stateful operators. Through key grouping a stream of tuples is partitioned in several disjoint sub-streams depending on the values contained in the tuples themselves. Each operator instance target of one sub-stream is guaranteed to receive all the tuples containing a specific key value. A common solution to implement key grouping is through hash functions that, however, are known to cause load imbalances on the target operator instances when the input data stream is characterized by a skewed value distribution. In this paper we present DKG, a novel approach to key grouping that provides near-optimal load distribution for input streams with skewed value distribution. DKG starts from the simple observation that with such inputs the load balance is strongly driven by the most frequent values; it identifies such values and explicitly maps them to sub-streams together with groups of less frequent items to achieve a near-optimal load balance. We provide theoretical approximation bounds for the quality of the mapping derived by DKG and show, through both simulations and a running prototype, its impact on stream processing applications.

26 July 2020
Verified
Book Chapter
Closed access
PDF file
SKShreya Khatal
Shreya Khatal
JRJayant Rane
Jayant Rane
DPDhiren Patel
Dhiren Patel
PPPearl Patel
Pearl Patel
Yann BusnelYann Busnel
Yann Busnel