Keywords
Computer Science and Digital Science
 A1.1.9. Fault tolerant systems
 A1.2.2. Supervision
 A1.2.4. QoS, performance evaluation
 A1.2.5. Internet of things
 A1.3.3. Blockchain
 A1.3.4. Peer to peer
 A3.4.1. Supervised learning
 A3.4.2. Unsupervised learning
 A3.4.3. Reinforcement learning
 A3.4.6. Neural networks
 A3.4.8. Deep learning
 A6.1.2. Stochastic Modeling
 A6.2.3. Probabilistic methods
 A6.2.4. Statistical methods
 A9.2. Machine learning
 A9.7. AI algorithmics
Other Research Topics and Application Domains
 B1.2.1. Understanding and simulation of the brain and the nervous system
 B6.2.1. Wired technologies
 B6.2.2. Radio technology
 B6.2.4. Optic technology
 B6.3.2. Network protocols
 B6.3.3. Network Management
 B6.3.5. Search engines
 B6.4. Internet of things
1 Team members, visitors, external collaborators
Research Scientists
 Gerardo Rubino [Team leader, Inria, Senior Researcher, HDR]
 Bruno Sericola [Inria, Senior Researcher, HDR]
 Bruno Tuffin [Inria, Senior Researcher, HDR]
Faculty Members
 Soraya Ait Chellouch [Univ de Rennes I, Associate Professor]
 Yann Busnel [IMT Atlantique, Professor, HDR]
 Yassine HadjadjAoul [Univ de Rennes I, Associate Professor, HDR]
 Sofiene Jelassi [Univ de Rennes I, Associate Professor]
 Patrick Maillé [IMT Atlantique, Professor, HDR]
 Raymond Marie [Univ de Rennes I]
 César Viho [Univ de Rennes I, Professor, until May 2021, HDR]
PostDoctoral Fellows
 Ghina Dandachi [Inria]
 Renzo Efrain Navas [Inria, from Feb 2021 until Aug 2021]
PhD Students
 Ahcene Boumhand [Orange Labs, CIFRE, until May 2021]
 Abdelmounaim Bouroudi [Bell Labs (Alcatel), CIFRE, from Oct 2021]
 Ximun Castoreo [Inria, until Apr 2021]
 Hiba Dakdouk [Orange, CIFRE]
 Khalil El Houssni [IMT Atlantique, from Dec. 2021]
 Sid Ali Hamideche [Nokia, CIFRE, until May 2021]
 Soumeya Kaada [Nokia, CIFRE]
 PierreMarie Lechevalier [IMT Atlantique, from Oct. 2021, coadvise with ADOPNET]
 Amine Rguez [Exfo solutions, CIFRE]
 Anouar Rkhami [Inria, until Sep 2021]
Interns and Apprentices
 Sid Ali Aioula [Inria, from Apr 2021 until Sep 2021]
 Lydia Ait Oucheggou [Univ de Rennes I, from Mar 2021 until Sep 2021]
 Lea Barberon [Inria, from Jul 2021 until Aug 2021]
 Fouad Himdi [PREPA DIGITALE Buroscope Rennes, until Feb 2021]
 Jorge Jenschke Oddo [Inria, from Jul 2021 until Sep 2021]
Administrative Assistants
 Fabienne Cuyollaa [Inria, until Jun 2021]
 Gwenaelle Lannec [Inria, from Sep 2021]
2 Overall objectives
The main objectives of the project are the identification, the conception and the selection of the most appropriate network architectures for a communication service, as well as the development of computing and mathematical tools for the fulfillment of these tasks. These objectives lead to two types of complementary research fields: the systems' qualitative aspects (e.g. protocol testing and design) and the quantitative aspects which are essential to the correct dimensioning of these architectures and the associated services (performance, dependability, Quality of Service (QoS), Quality of Experience (QoE) and performability); our activities lie essentially in the latter.
The Dionysos group works on different problems related to the design and the analysis of communication services. Such services require functionality specifications, decisions about where and how they must be deployed in a system, and the dimensioning of their different components. The interests of the project concern not only particular classes of systems but also methodological aspects.
Concerning the communication systems themselves, we focus on IP networks, at different levels. Concerning the types of networks considered, we mainly work in the wireless area, in particular on sensor networks, on Content Delivery Networks for our work around measuring the perceived quality, the main component of QoE, and on some aspects of optical networks. We also work on the assessment of interoperability between specific network components, which is essential to ensure that they interact correctly before they get deployed in a real environment. Our team contributes in providing solutions (methods, algorithms and tools) which help in obtaining efficient interoperability test suites for new generation networks. From the application point of view, we also have activities in network economics methodologies, a critical multidisciplinary area for telecommunications providers, with many defying open problems for the near future.
For most of previous mentioned problems, our work concerns their quantitative aspects. The quantitative aspects we are interested in are QoE, performance, dependability, performability, QoS, vulnerability, etc. We develop techniques for the evaluation of these different aspects of the considered systems through models and through measurement techniques. In particular, we develop techniques to measure in an automatic way the quality of a video or audio communication as perceived by the final user. The methods we work with range from discrete event simulation and Monte Carlo procedures to analytical techniques, and include numerical algorithms as well. Our main mathematical tools are stochastic processes in general and queuing models and Markov chains in particular, optimization techniques, graph theory, combinatorics, etc. We are also strongly involved in the use of Machine Learning techniques in many different classes of problems, mainly in networking, and we are also developpers of learning procedures, for instance for specific classes of Neural Networks and/or for different objectives (in Reinforcement Learning, in predicting time series, in graphbased learning tools, etc.)
3 Research program
3.1 Introduction
The scientific foundations of our work are those of network design and network analysis. Specifically, this concerns the principles of packet switching and in particular of IP networks (protocol design, protocol testing, routing, scheduling techniques), and the mathematical and algorithmic aspects of the associated problems, on which our methods and tools are based.
These foundations are described in the following paragraphs. We begin by a subsection dedicated to Quality of Service (QoS) and Quality of Experience (QoE), since they can be seen as unifying concepts in our activities. Then we briefly describe the specific subarea of model evaluation and about the particular multidisciplinary domain of network economics.
3.2 Quality of Service and Quality of Experience
Since it is difficult to develop as many communication solutions as possible applications, the scientific and technological communities aim towards providing general services allowing to give to each application or user a set of properties nowadays called “Quality of Service” (QoS), a terminology lacking a precise definition. This QoS concept takes different forms according to the type of communication service and the aspects which matter for a given application: for performance it comes through specific metrics (delays, jitter, throughput, etc.), for dependability it also comes through appropriate metrics: reliability, availability, or vulnerability, in the case for instance of WAN (Wide Area Network) topologies, etc.
QoS is at the heart of our research activities: We look for methods to obtain specific “levels” of QoS and for techniques to evaluate the associated metrics. Our ultimate goal is to provide tools (mathematical tools and/or algorithms, under appropriate software “containers” or not) allowing users and/or applications to attain specific levels of QoS, or to improve the provided QoS, if we think of a particular system, with an optimal use of the resources available. Obtaining a good QoS level is a very general objective. It leads to many different areas, depending on the systems, applications and specific goals being considered. Our team works on several of these areas. We also investigate the impact of network QoS on multimedia payloads to reduce the impact of congestion.
Some important aspects of the behavior of modern communication systems have subjective components: the quality of a video stream or an audio signal, as perceived by the user, is related to some of the previous mentioned parameters (packet loss, delays, ...) but in an extremely complex way. We are interested in analyzing these types of flows from this useroriented point of view. We focus on the user perceived quality, in short, PQ, the main component of what is nowadays called Quality of Experience (in short, QoE), to underline the fact that, in this case, we want to center the analysis on the user. In this context, we have a global project called PSQA, which stands for PseudoSubjective Quality Assessment, and which refers to a technology we have developed allowing to automatically measure this PQ.
Another special case to which we devote research efforts in the team is the analysis of qualitative properties related to interoperability assessment. This refers to the act of determining if endtoend functionality between at least two communicating systems is as required by the base standards for those systems. Conformance is the act of determining to what extent a single component conforms to the individual requirements of the standard it is based on. Our purpose is to provide such a formal framework (methods, algorithms and tools) for interoperability assessment, in order to help in obtaining efficient interoperability test suites for new generation networks, mainly around IPv6related protocols. The interoperability test suites generation is based on specifications (standards and/or RFCs) of network components and protocols to be tested.
3.3 Stochastic modeling
The scientific foundations of our modeling activities are composed of stochastic processes theory and, in particular, Markov processes, queuing theory, stochastic graphs theory, etc. The objectives are either to develop numerical solutions, or analytical ones, or possibly discrete event simulation or Monte Carlo (and QuasiMonte Carlo) techniques. We are always interested in model evaluation techniques for dependability and performability analysis, both in static (network reliability) and dynamic contexts (depending on the fact that time plays an explicit role in the analysis or not). We look at systems from the classical socalled call level, leading to standard models (for instance, queues or networks of queues) and also at the burst level, leading to fluid models.
In recent years, our work on the design of the topologies of WANs led us to explore optimization techniques, in particular in the case of very large optimization problems, usually formulated in terms of graphs. The associated methods we are interested in are composed of simulated annealing, genetic algorithms, TABU search, etc. For the time being, we have obtained our best results with GRASP techniques.
Network pricing is a good example of a multidisciplinary research activity halfway between applied mathematics, economy and networking, centered on stochastic modeling issues. Indeed, the Internet is facing a tremendous increase of its traffic volume. As a consequence, real users complain that large data transfers take too long, without any possibility to improve this by themselves (by paying more, for instance). A possible solution to cope with congestion is to increase the link capacities; however, many authors consider that this is not a viable solution as the network must respond to an increasing demand (and experience has shown that demand of bandwidth has always been ahead of supply), especially now that the Internet is becoming a commercial network. Furthermore, incentives for a fair utilization between customers are not included in the current Internet. For these reasons, it has been suggested that the current flatrate fees, where customers pay a subscription and obtain an unlimited usage, should be replaced by usagebased fees. Besides, the future Internet will carry heterogeneous flows such as video, voice, email, web, file transfers and remote login among others. Each of these applications requires a different level of QoS: for example, video needs very small delays and packet losses, voice requires small delays but can afford some packet losses, email can afford delay (within a given bound) while file transfer needs a good average throughput and remote login requires small roundtrip times. Some pricing incentives should exist so that each user does not always choose the best QoS for her application and so that the final result is a fair utilization of the bandwidth. On the other hand, we need to be aware of the tradeoff between engineering efficiency and economic efficiency; for example, traffic measurements can help in improving the management of the network but is a costly option. These are some of the various aspects often present in the pricing problems we address in our work. More recently, we have switched to the more general field of network economics, dealing with the economic behavior of users, service providers and content providers, as well as their relations.
4 Application domains
4.1 Networking
Our global research effort concerns networking problems, both from the analysis point of view, and around network design issues. Specifically, this means the IP technology in general, with focus on specific types of networks seen at different levels: wireless systems, optical infrastructures, peertopeer architectures, Software Defined Networks, Content Delivery Networks, ContentCentric Networks, clouds.
A specific aspect of network applications and/or services based on video or voice content, is our PSQA technology, able to measure the Perceptual Quality automatically and in real time. PSQA provides a MOS value as close as it makes sense to the value obtained from subjective testing sessions. The technology has been tested in many environments, including one way communications as, for instance, in video streaming, and bidirectional communications as in IP telephony, UDP or TCPbased systems, etc. It has already served in many collaborative projects as the measuring tool used.
4.2 Stochastic modeling
Many of the techniques developed at Dionysos are related to the analysis of complex systems in general, not only in telecommunications. For instance, our Monte Carlo methods for analyzing rare events have been used by different industrial partners, some of them in networking but recently also by companies building transportation systems. We develop methods in different areas: numerical analysis of stochastic models, bound computations in the same area, Discrete Event Simulation, or, as just mentioned, rare event analysis. In this last case, we focus on the main Monte Carlo approaches (Importance Sampling, Splitting, Recursive Variance Reduction, etc.) and we are mainly interested in the case of rare events of “artificial origins” (components' failures, congestion problems) as opposed to natural disasters, that need other specific mathematical tools.
5 Highlights of the year
5.1 Awards
5.1.1 Best paper awards
The publication 45 obtained the Best Paper Award at the 22nd IEEE International Conference on High Performance Switching and Routing. The paper is about network tomography in the context of slicing services, and it consists of an application of Machine Learning techniques to solve a hard combinatorial problem, plus of tranfer learning methods for improving the efficiency of the solution.
6 New results
6.1 Probabilistic analysis of systems
Participants: Yann Busnel, Jérome Henry, Gerardo Rubino, Bruno Sericola.
In 2021 the activities have been concentrated around different topics related to the analysis of distributed systems. We also continued the study of the transient regime of Markov models, and we also worked on some aspects of cellular networks in the area of this subsection.
Probabilistic analysis of population protocols. The computational model of population protocols is a formalism that allows the analysis of properties emerging from simple and pairwise interactions among a very large number of anonymous finitestate agents. We analyze in 38 a new asynchronous rumor spreading protocol to deliver a rumor to all the nodes of a largescale distributed network. This protocol relies on successive pull operations involving $k$ different nodes, with $k=2$ or $k=3$, and called $k$pull operations. Specifically during a $k$pull operation, an uninformed node $a$ contacts $k1$ other nodes at random in the network, and if at least one of them knows the rumor, then node $a$ learns it. We perform a detailed study in continuoustime of ${\Theta}_{k,n}$, the total time needed for all the $n$ nodes to learn the rumor. We obtain, for $k\in \{2,3\}$, the mean value, the variance and the distribution of ${\Theta}_{k,n}$ together with their asymptotic behavior when the number of nodes $n$ tends to infinity.
These results are extended in the discretetime case in 27, where we propose and analyze the general case of a $k$pull operation, with $k\ge 2$. We perform a thorough study of the total number ${T}_{k,n}$ of $k$pull operations needed for all the $n$ nodes to learn the rumor. We compute the expected value and the variance of ${T}_{k,n}$, together with their limiting values when $n$ tends to infinity. We also analyze the limiting distribution of $({T}_{k,n}E\left({T}_{k,n}\right))/n$ and prove that it has a double exponential distribution when $n$ tends to infinity. Finally, we show that when $k>2$, our new protocol requires less operations than the traditional 2pushpull and 2push protocols by using stochastic dominance arguments. All these results generalize the standard case $k=2$.
The averagebased distributed algorithms, analysed in 24, rely on simple and pairwise random interactions among a large and unknown number of anonymous agents. This allows the characterization of global properties emerging from these local interactions. Agents start with an initial integer value, and at each interaction keep the average integer part of both values as their new value. The convergence occurs when, with high probability, all the agents possess the same value, which means that they all know a property of the global system. Using a well chosen stochastic coupling, we improve upon existing results by providing explicit and tight bounds of the convergence time. We apply these general results to both the proportion problem and the system size problem.
Collecting data in large scale systems. We propose and analyse in 46 the performance and the vulnerability to attacks of three algorithms for collecting longitudinal data in a large scale system. A monitoring device is in charge of continuously collecting measurements from enddevices. The communication graph is connected but not necessarily complete. For scalability reasons, at each collect, a single enddevice is randomly selected among all the enddevices to send the content of its local buffer of data to the monitoring device. Once sent, the enddevice resets its buffer, and resumes its measurement process. Two of the three algorithms are randomized algorithms while the third one is deterministic. We study the transient and stationary maximum load distribution at enddevices when collects are made using the first and third algorithm, and we provide bounds via a coupling argument when the second algorithm is used. While the third algorithm provides the best performance, it is highly vulnerable to attacks.
Data streaming and sampling. Distributed systems increasingly require the processing of large amounts of data, for metrology, safety or security purposes. We consider the problem of achieving uniform node sampling in large scale systems in presence of Byzantine nodes. The uniform node sampling service offers to applications using it a single simple primitive that returns, upon invocation, the identifier of a random node that belongs to the system. We first propose an omniscient strategy that processes on the fly an unbounded and arbitrarily biased input stream made of node identifiers exchanged within the system, and outputs a stream that preserves the uniformity property. Informally, uniformity states that any node in the system should have the same probability to appear in the sample of any correct node of the system. We show through a Markov chain analysis that this property holds despite any arbitrary bias introduced by the adversary. We then propose a strategy based on a sketch data structure that is capable of approximating the omniscient strategy without requiring any prior knowledge on the composition of the input stream. We show through both theoretical analysis and extensive simulations that this "knowledgefree" strategy accurately approximates the omniscient one. We evaluate the resilience of the knowledgefree strategy by studying two representative attacks (flooding and targeted attacks). We quantify the minimum number of identifiers that Byzantine nodes must insert in the input stream to prevent uniformity. Finally, we propose a new construction that processes each input stream with sketches put in series that allows to both increase the accuracy of a single sketch and decrease the time to converge to a uniform output stream. To our knowledge, such a work has never been proposed before 17.
Phenotypic characteristics of a plant specie refer to its physical properties as cataloged by plant biologists at different research centers around the world. Clustering species based upon their phenotypic characteristics is used to obtain diverse sets of parents that are useful in their breeding programs. The Hierarchical Clustering (HC) algorithm is the current standard in clustering of phenotypic data. This algorithm suffers from low accuracy and high computational complexity issues. To address the accuracy challenge, we propose the use of Spectral Clustering (SC) algorithm. To make the algorithm computationally cheap, we propose using sampling, specifically, Pivotal Sampling that is probability based. Since application of samplings to phenotypic data has not been explored much, for effective comparison, another sampling technique called Vector Quantization (VQ) is adapted for this data as well. VQ has recently given promising results for genotypic data. The novelty of our SC with Pivotal Sampling algorithm is in constructing the crucial similarity matrix for the clustering algorithm and defining probabilities for the sampling technique. Although our algorithm can be applied to any plant species, we test it on the phenotypic data obtained from about 2400 Soybean species. SC with Pivotal Sampling achieves substantially more accuracy (in terms of Silhouette Values) than all the other proposed competitive clustering with sampling algorithms (i.e. SC with VQ, HC with Pivotal Sampling, and HC with VQ) 28. The complexities of our SC with Pivotal Sampling algorithm and these three variants are almost the same because of the involved sampling. In addition to this, SC with Pivotal Sampling outperforms the standard HC algorithm in both accuracy and computational complexity. We experimentally show that we are up to 45% more accurate than HC in terms of clustering accuracy. The computational complexity of our algorithm is more than a magnitude less than that of HC.
Due to the large sizes of data, clustering algorithms often take too much time. Sampling this data before clustering is commonly used to reduce this time. In this work, we propose a probabilistic sampling technique called cube sampling along with KPrototype clustering. Cube sampling is used because of its accurate sample selection. KPrototype is most frequently used clustering algorithm when the data is numerical as well as categorical (very common in today's time). The novelty of this work is in obtaining the crucial inclusion probabilities for cube sampling using Principal Component Analysis (PCA). Experiments on multiple datasets from the UCI repository demonstrate that cube sampled KPrototype algorithm gives the best clustering accuracy among similarly sampled other popular clustering algorithms (KMeans, Hierarchical Clustering (HC), Spectral Clustering (SC)). When compared with unsampled KPrototype, KMeans, HC and SC, it still has the best accuracy with the added advantage of reduced computational complexity (due to reduced data size) 51.
Blockchain and AI. Bitcoin system (or Bitcoin) is a peertopeer and decentralized payment system that uses a cryptocurrency named bitcoin (BTC) and was released as opensource software in 2009. Unlike fiat currencies, there is no centralized authority or any statutory recognition, backing, or regulation for BTCs. All transactions are confirmed for validity by a network of volunteer nodes (miners) and after that, a collective agreement is recorded into a distributed ledger “Blockchain”. The Bitcoin platform has attracted both social and antisocial elements. On the one hand, it is social as it ensures the exchange of values, maintaining trust in a cooperative, communitydriven manner without the need for a trusted third party. At the same time, it is antisocial as it creates hurdles for law enforcement to trace suspicious transactions due to anonymity and privacy. To understand how the social and antisocial tendencies in the user base of BTC affect its evolution, there is a need to analyze the BTC system as a network. A first study has explored the local topology and geometry of the network during its first decade of existence. The characteristics, local and global network properties of the user's graph were analyzed at ten intervals between 20092020 with a gap of one year 26. Afterwards, we focused on illegal activities using BTC systems. We thus utilize machine learning for identifying these illicit entities and addressed the issue by implementing an ensemble of decision trees for supervised learning. More parameters allow the ensemble model to learn discriminating features that can categorize multiple groups of illicit users from licit ones 11. The proposed model provided a reliable tool for forensic study. In parallel, we conducted an experiment on a dataset of 1216 reallife entities 25.
Transient analysis of Markovian models. Classic performance evaluation using queueing theory is usually done assuming a stable model in equilibrium. However, there are situations where we are interested in the transient phase. In this case, the main metrics are built around the model’s state distribution at an arbitrary point in time. In dependability, a significant part of the analysis is done in the transient phase. In previous work, we developed an approach to derive distributions of some continuous time Markovian models, built around uniformization (also called Jensen’s method), transforming the problem into a discrete time one, and the concept of stochastic duality. This combination of tools provides significant simplifications in many cases. However, stochastic duality does not always exist. Recently, we discovered that an idea of algebraic duality, formally similar to stochastic duality, can be defined and applied to any linear differential system (or equivalently, to any matrix). In this case, there is no limitation, the transformation is always possible. We call it the exponentialdual matrix method. In 56, we describe the limitations of stochastic duality and how the exponentialdual matrix method operates for any system, stochastic or not. These concepts are illustrated throughout our article with specific examples, including the case of infinite matrices. The heart of the content of this chapter was presented in the JMM conference 53. In the same forum, we presented some views on the discrete time case (matrix powers)analyzing specific particluar cases 52.
Cellular Networks with DelayTolerant Users. In 29, we analyze the impact of delaying delaytolerant calls under certain conditions in cellular networks. We propose to queue the call if the user agrees when the terminal has bad radio conditions and the system is loaded. The call is served as soon as radio conditions become good or the current load goes below a given threshold. We model the system as a continuoustime Markov chain, which allows us to compute the blocking probability, the mean waiting time and the mean service time. For instance, numerical results show that when the proportion of users with delay tolerance is 20%, the system can bear 16% more calls with the same blocking probability, and 113% more calls if 80% of users are delay tolerant.
6.2 Machine learning
Participants: Yassine HadjadjAoul, Gerardo Rubino, César Viho, Yann Busnel, Ahcene Boumhand, Sid Ali Hamideche, Illyyne Saffar, Anouar Rkhami, Imane Taibi.
Our activities around machine learning tools continue to grow. We describe in this subsection only the approaches proposing new learning methodologies.
Monitoring with Machine Learning. The use of artificial intelligence techniques in monitoring is becoming an essential building block for the new techniques developed in recent years. In this context, we proposed an application in a specific use cases.
Multilabel scene classification has emerged as a critical research area in the domain of remote sensing. Contemporary classification models primarily emphasize on a single object or multiobject scene classification of satellite remote sensed images. These classification models rely on feature engineering from images, deep learning, or transfer learning. Comparatively, multilabel scene classification of Very High Resolution (VHR) images is a fairly unexplored domain of research. Models trained for single label scene classification are unsuitable for the application of recognizing multiple objects in a single remotely sensed VHR satellite image. To overcome this research gap, the current inquiry proposes to fine‐tune state of the art Convolutional Neural Network (CNN) architectures for multilabel scene classification. The proposed approach pretrains CNNs on the ImageNet dataset and further fine‐tunes them to the task of detecting multiple objects in VHR images. To understand the efficacy of this approach, the final models are applied on a VHR data base: the UCMERCED image dataset containing 21 different terrestrial land use categories with a submeter resolution. The performance of the final models is compared with the graph convolutional network‐based model by Khan et al. From the results on performance metrics, it was observed that the proposed models achieve comparable results in significantly fewer epochs 22.
Mixing Reservoir Computing end Evolutionary algorithms. Reservoir Computing models are a class of recurrent neural networks that have enjoyed recent attention, in particular, their main family, Echo State Networks (ESNs). These models have a large number of hiddenhidden weights (in the socalled reservoir) forming a recurrent topology. The reservoir is randomly connected with fixed weights during learning: only readout parameters (from reservoir to output neurons) are trained; the reservoir weights are frozen after initialized. Since the reservoir structure is fixed during learning, only its initialization process has an impact on the model’s performance. In 32, we introduce an evolutionary method for adjusting the reservoir nonnull weights. The evolutionary process runs on the frequency space corresponding to a Fourier transformation of the weights. This allows to reduce the dimension of the space where learning takes place. We combine an evolutionary search in the Fourier space with supervised learning for the readout weights. The resulting algorithm, called EvoESN (Evolutionary ESN), obtains promising results modeling two wellknown problems of the chaotic timeseries area.
Combining FFT/LSTM for Timeseries forecasting. Over the last few years, networks' infrastructures are experiencing a profound change initiated by Software Defined Networking (SDN) and Network Function Virtualization (NFV). In such networks, avoiding the risk of service degradation increasingly involves predicting the evolution of metrics impacting the Quality of Service (QoS), in order to implement appropriate preventive actions. Recurrent neural networks, in particular Long Short Term Memory (LSTM) networks, already demonstrated their efficiency in predicting time series, in particular in networking, thanks to their ability to memorize long sequences of data. In 35, we propose an improvement that increases their accuracy by combining them with filters, especially the Fast Fourier Transform (FFT), in order to better extract the characteristics of the time series to be predicted. The proposed approach allows improving prediction performance significantly, while presenting an extremely low computational complexity at runtime compared to classical techniques such as AutoRegressive Integrated Moving Average (ARIMA), which requires costly online operations.
Collaborative Exploration and Exploitation in massively MultiPlayer Bandits. In 57, we propose an approach to optimize the performance of Internet of Things (IoT) networks. We formulate the optimization problem as a massive multiplayer multiarmed bandit problem, where the devices are the players and the radio channels are the arms, with collisions possibly preventing message reception. For handling a realistic IoT network, we do not assume that sensing information is available (i.e. that the collision are observed) or that the number of players is smaller than the number of arms. As the optimization problem is intractable, we propose two greedy policies: the first one focusing on the number of successful communications, while the second one also takes into account fairness between players. In order to implement an approximation of the targeted policies, we propose an explorethenexploit approach, and establish a regret lower bound. For estimating the mean reward of arms, we propose a decentralized exploration algorithm with controlled information exchanges between players. Then we state that the regret of the estimated target policy is optimal with respect to the time horizon T. Finally, we provide some experimental evidences that the proposed algorithms outperform several baselines.
Federated learning in security management for IT and OT. The Internet of Things has begun to spread over a variety of domains, including industry and finance. It represents an increasing threat for both IT and OT. The lack of collaboration results in the same attacks targeting different organizations one after the other. Often employed as an answer to this problem, cyber threatintelligence sharing induces its own set of challenges: trust, privacy, and traceability. This work 54 takes advantages of a distributed sharingoriented architecture and to enhance the security of industrial infrastructures. We study Federated Learning algorithms to build a distributed, autonomic system for detecting and characterizing attacks, as well as providing countermeasures. Experiments on realworld testbeds at the chair Cyber CNI allow us to validate the theoretical assumptions against realistic infrastructures and scenarios, fitting industrial usecases.
6.3 Future networks and architectures
Participants: Yassine HadjadjAoul, Yann Busnel, Gerardo Rubino, Sofiene Jelassi, Ghina Dandachi, Rahali Mohamed, Anouar Rkhami, Soumaya Kaada, Amine Rguez.
The general field dealing with next generation networks and architectures analyzes the architectural evolutions of networks while addressing the need to develop new algorithms to support the new functions of the network.
In 2021, we still have had a particular focus on network resources' orchestration, in particular through network slicing. We have also continued our work on the monitoring of these networks by trying to minimize the costs of monitoring while allowing better detection of failures.
Network slicing and resources' orchestration. Resource allocation of 5G and beyond 5G (B5G) network slices is one of the most important challenges for network operators. Network slicing mainly consists in placing constrained services, which are typically expressed in the form of a Virtual Network FunctionForwarding Graph (VNFFG). Several solutions have already been proposed in the literature to address these types of problems. However, in these approaches, past placement experiences yield no benefit to new placements (i.e., noting is learnt from the obeserved past).
In 47, we propose a highly reliable solution for systematically placing network services, touching the optimal results while maintaining the scalability, making it suitable for online scenarios with strict time constraints. We organized our solution as a Branch and Bound search structure, which leverages Artificial Intelligence (AI) search strategies (Especially AStar) to address the placement problem, following the popular objective of Service Acceptance (SA). Extensive empirical analysis has been carried out and the results confirm a significant improvements compared to existing work.
In 62, we introduced a platform for dynamic virtual network embedding. The proposed solution is based on a combination of a deep reinforcement learning strategy and a Monte Carlo (MC) approach. The main idea is to learn to generate, using a Deep QNetwork (DQN), a distribution of the placement solution, on which a MCbased search technique is applied. This makes the agent’s exploration of the solution space more efficient.
Due to the explorationexploitation dilemma, the solutions obtained by DRLbased approaches can be infeasible. This can lead to reliability concerns. To overcome this issue, we combine, in 43, DRL and relational Graph Convolutional Neural (GCN) networks in order to automatically learn how to improve the quality of heuristics in the placement of services. Simulation results show the effectiveness of our procedure. Starting with an initial solution given by the heuristics it can find an improvement of about 35% on average.
To address the diversity of use cases envisioned by the 5G technology, it is critical that the design of the future network allows maximum flexibility and cost effectiveness. This requires that network functions should be designed in a modular fashion to enable fast deployment and scalability. This expected efficiency can be achieved with the cloud native paradigm where network functions can be deployed as containers. Virtualization tools such as Kubernetes offer multiple functionalities for the automatic management of the deployed containers hosting the network functions. These tools must be applied efficiently to improve the network functions availability and resilience. Our paper 41 focuses on resource allocation in a Kubernetes infrastructure hosting different network services. The objective of the proposed solution is to avoid resource shortage in the cluster nodes while protecting the most critical functions. A statistical approach is followed for the modeling of the problem as well as for its resolution, given the random nature of the treated information.
Future networks monitoring. Network Slicing (NS) is a key technology that enables network operators to accommodate different types of services with varying needs on a single physical infrastructure. Despite the advantages it brings, NS raises some technical challenges, mainly ensuring the Service Level Agreements (SLA) for each slice. Hence, monitoring the state of these slices will be a priority for ISPs.
In 42, a new monitoring procedure for anomaly localization, customized for NFVbased network infrastructures deployed with the Service Function Chaining (SFC) mechanism, one of the most important key enablers for NFV networks. Our solution allows the deployment of efficient probing schemes that guarantee the localization of multiple simultaneously failed nodes with a minimum cost. This is formulated as a graph matching problem and solved with a maxflow approach. Simulations show that our solution localizes the failed nodes with a small rate of false positives and false negatives.
To overcome high measurements overhead, network tomography (NT) is a promising solution, in future virtualised networks. Indeed, network tomography consists of a set of methods to infer unmeasured network metrics using endtoend measurements between monitors. In 45, we focus on inferring the additive metrics of slices such as delays or logarithms of loss rates. We model the inference task as a regression problem that we solve using neural networks. In our approach, we train the model on an artificial dataset. This not only avoids the costly process of collecting a large set of labeled data but has also a nice covering property useful for the procedure's accuracy. Moreover, to handle a change on the topology or the slices we monitor, we propose a solution based on transfer learning in order to find a tradeoff between the quality of the solution and the cost to get it. Simulation results with both, emulated and simulated traffic show the efficiency of our method compared to existing ones in terms of both accuracy and computation time.
NTbased solutions require constraining monitoring traffic to follow specific paths, which we can achieve by using segmentbased routing (SR). This allows deploying customized probing scheme, such as cycles' probing. A major challenge with SR is, however, the limited length of the monitoring path. In 44, we focus on the complexity of that task and propose MonGNN, a standalone solution based on Graph Neural Networks (GNNs) and genetic algorithms to find a tradeoff between the quality of monitors' placement and the cost to achieve it. Simulation results show the efficiency of our approach compared to existing methods.
Toward operative QoE models for streaming services. The measurement of the Quality of Experience (QoE) of multimedia streaming services (MMSS) over IP networks may be done using objective QoE models. These are mathematical functions transforming metrics from technical to user domains. An interesting category of QoE models predicts QoE scores of MMSS at runtime, letting use them for the monitoring operation. This requires integrating them inside the production environments, i.e., where the actual MMSS are consumed by endusers. This aspect is often neglected by QoE modelers that focus mainly on the accuracy and fitness of their designed models with respect to a given set of settings and conditions. As a consequence, a considerable technical effort should be made in order to bring them from the laboratory to the production environments. This obviously discourages MMSS providers to easily accept and adopt them.
For the sake of enhancing QoE models integration, in 37 we propose Mesukal, a softwarelayer ensuring portability of QoE models over a variety of underlying MMSS, e.g. YouTube or Netflix. Specifically, Mesukal acts as a Java Virtual Machine (JVM) enabling to build portable applications over different OS, e.g. Windows, Linux or MacOS. Mesukal can be considered as a virtual MMSS that is able to seamlessly interact with QoE models, on the one hand, and arbitrary real MMSS, on the other hand. Each considered MMSS over IP networks is appropriately virtualized by a dedicated Mesukal App. Besides real MMSS, Mesukal can be used to instantiate experimental MMSS where the accuracy and portability of QoE models may be inspected and checked under controlled conditions. The inputs needed by the concerned QoE models are fetched from each real MMSS using probes that are tailored following the technology used by the considered multimedia service. In addition, Mesukal includes a rich GUI dashboard that enables to inspect QoE results.
6.4 Wireless Networks
Participants: Soraya AitChellouche, Yann Busnel, Yassine HadjadjAoul, Ali Hodroj, Bruno Sericola, Gerardo Rubino, César Viho.
The general domain dealing with wireless networks covers the optimization of these networks at multiples levels.
In 2021, we have continued our activities on improving the support of a large (i.e., massive) number of wireless IoT devices. We also continued our activities on improving video streaming in these networks through the improvement of multihoming support.
Optimizing wireless IoT Networks. Driven by various services and applications, Machine Type Communications (MTC) will become an integral part of our daily life over the next few years. Meeting the ITUT requirements, in terms of density, battery longevity, coverage, price, and supported mechanisms and functionalities, Cellular IoT, and particularly NarrowbandInternet of Things (NBIoT), is identified as a promising candidate to handle massive MTC accesses. However, this massive connectivity would pose a huge challenge for network operators in terms of scalability. Indeed, the connection to the network in cellular IoT passes through a random access procedure and a high concentration of IoT devices would, very quickly, lead to a bottleneck. The latter procedure needs, then, to be enhanced as the connectivity would be considerable. With this in mind, we propose, in 55, to apply the access class barring (ACB) mechanism to regulate the number of devices competing for the access. In order to derive the blocking factor, we formulate the access problem as a Markov decision process that we were able to solve using one of the most advanced deep reinforcement learning techniques. The evaluation of the proposed access control, through simulations, shows the effectiveness of our approach compared to existing techniques such as the adaptive one and the Proportional Integral Derivative (PID) controller. Indeed, it manages to keep the proportion of access attempts close to the optimum, despite the lack of accurate information on the number of access attempts.
Despite the multiple benefits that such technology offers, the quick depletion of sensors’ battery power represents a major concern, mainly due to the extensive computational tasks and communication operations performed by individual sensors. Indeed, the cost of replacing batteries can be prohibitively expensive, especially when sensors are deployed in areas where access is difficult, in urbanized cities. To extend sensors’ lifetime, we proposed in 30 a new variant of the LEACH protocol named LEACH enhanced with probabilistic cluster head selection (LEACHPRO). LEACHPRO introduces several measures to extend WSNs nodes’ lifetime such as cluster head node selection using a probabilistic function based on maximum residual energy and minimum distance to the sink. The obtained simulation results have proven the supremacy of LEACHPRO over LEACH and direct transmission protocol in terms of the achieved network lifetime and the generated traffic overhead. Most importantly, LEACHPRO will significantly extend the sensors’ lifetime, which would make this type of deployment more viable in smart city scenarios.
Enhancing dynamic adaptive streaming over HTTP for multihomed users. Nowadays, multimedia streaming traffic reaches 71% of the mobile data traffic over the world and most of the multimedia services use Dynamic adaptive streaming over HTTP (DASH) to adjust video delivery to the dynamic network environment and achieve higher user Quality of Experience (QoE) levels. Moreover, 90% of the video traffic is consumed by smart devices equipped with multiple network interfaces (Wifi, 3G, and 4G) known as multihomed devices. In 20, we proposed a survey analyzing the protocols, the mechanisms, and the latest standards proposed in the literature for improving the performance and quality of video content in multipath and multihomed overlay networks. Multipath is a broader term, but in the context of this survey, we define multipath as enhancing network routing technique by using various paths that are not necessarily completely disjoint. Most existing surveys are specialized in one specific domain area related to multipath or multihoming. This study covers the research proposals at the different layers/sublayers of an overlay network from transport to the application and extends to cover the latest technologies like machine learning, Fog and Mobile Edge computing, VR 360 video, and the Internet of Multimedia Things (IoMT). As such, our work tries to be as comprehensive as possible to relate multipath and multihoming research solutions for video streaming to the current and emerging video streaming technologies.
For enhancing the video quality received by “multihomed client” (i.e., clients with multiple network interfaces), we proposed, in 21, a network selection algorithm based on the MultiArmed Bandit heuristic on top of the DASH protocol. For choosing the best network at each progression powerfully, DASH gives mobile video quality dependent on the apparent exhibition from the preowned system association through the Adaptive Bitrate Rules (ABR) without investigating the system conditions through the other network(s) which could give better quality. Subsequently, a few alterations for DASH ABR is required to enhance the video quality. Two of the MAB algorithms (UCB and Epsilon Greedy) were embraced for improving MPEGDash. The investigations are performed through a proving ground execution to show that UCB surpasses Epsilon Greedy, in stable system conditions, regarding goodput received by the Dash customer. Additionally, UCB can discover the harmony between investigating new choices, and abusing the triumphant variation. Index TermsDASH, Multihomed, video streaming .
Indoor localization with FTM. Metric Multidimensional Scaling is commonly used to solve multisensor location problems in 2D or 3D spaces. In this paper, we show that such technique provides poor results in the case of indoor location problems based on 802.11 Fine Timing Measurements, because the number of anchors is small and the ranging error asymmetrically distributed. We then propose a twostep iterative approach based on geometric resolution of angle inaccuracies 49. The first step reduces the effect of poor ranging exchanges. The second step reconstructs the anchor positions, starting from the distances of highest likelyaccuracy. We show that this geometric approach provides better location accuracy results than other Euclidean Distance Metric techniques based on Least Square Error logic. We also show that the proposed technique, with the input of one or more known location, can allow a set of fixed sensors to autodetermine their position on a floor plan 19.
Because it is unauthenticated and unprotected, our experiments indicate that an adversary can implement ranging and location attacks, causing an unsuspecting client to incorporate forged values into its location computation. FTM clients tend to range against a small set of responders (top 3 to 6 responders with strongest signal). Once ranges have been collected, the client can compute its location using various techniques, such as 3sphere intersection, matrix error minimization techniques or Kalman filter. Irrespective of the technique, we show in this paper that an attacker can cause a ranging client to deviate from its intended path, which can have dire consequences in some settings (e.g., automatic shuttle in public venue causing damages). We also show that protection intended for attacks on comparable ranging techniques, like GPS, are ineffective in the case of FTM 36. We finally show that protection intended for attacks on comparable ranging techniques, like GPS, are ineffective in the case of FTM. However, we also show that a crowdsourcing technique that confirms that one AP is known by the others can mitigate the attack exposure 50.
6.5 Network Economics
Participants: Bruno Tuffin, Patrick Maillé, Ximun Castoreo.
The general field of network economics, analyzing the relationships between all actors of the digital economy, has been an important subject for years in the team.
In 2021, we still have had a particular focus on network neutrality issues (basically saying that in the network all flows/packets should be “considered” equal), but trying to look at them from original perspectives, and investigating socalled grey zones not yet addressed in the debate. The problems have been addressed from the following angles.
Non neutrality can be pushed by content providers. There is a trend for big content providers such as Netflix and YouTube to give grades to ISPs, to incentivize those ISPs to improve at least the quality offered to their service; this behavior can be seen as an incentive to be favored by ISPs and therefore not stick to neutrality rules as usually pushed by content providers. We have designed in 23 a model analyzing ISPs' optimal allocation strategies in a competitive context and in front of qualitysensitive users. We have showed that the optimal strategy is nonneutral, that is, it does not allocate bandwidth proportionally to the traffic share of content providers. On the other hand, we have showed that nonneutrality does not benefit ISPs but is surprisingly favorable to users' perceived quality.
Apparent difficulties to apply neutrality principles in next generation networks. Slicing is seen as one of the key characteristics of 5G and beyond networks but seems in apparent contradiction with neutrality principles promoted worldwide. We have discussed in 59 the two contradictory but considered compulsory notions.
Heterogeneity of neutrality rules. Network neutrality has recently been repealed in the United States, leading to a worldwide Internet with different imposed policies. We have built and analyzed in 31 a gametheoretic model representing the interactions between users, network providers and content providers in this heterogeneous regulation context, and investigated the impact of two neutrality relaxation policies in a part of the world on all actors, compared with a fullyneutral network. Our results show that neutrality repeal may only favor the ISP in the differentiationauthorized zone, but no other actor, and that it can be worse off for everybody if the regulation procedures are very strict in the neutral area.
Monitoring neutrality. Network Neutrality is protected by law in many countries over the world, but monitoring has to be performed to ensure operators conform to the rules. The Wehe application, jointly developed by Northeastern University and the French regulator ARCEP, allows users to take measurements and analyze them to detect possible traffic differentiation. The paper 33 presents a test bed designed to evaluate the detection capacities of Wehe; by computing the detection probabilities and estimating the potential benefit of an operator willing to differentiate while avoiding detection, we finetune and compare the main differentiation types (throughput, packet loss and delay) that an operator could implement.
Neutrality of search engines. Neutrality should not be restricted to access providers: it concerns all other intermediaries between end users and content. Following this idea, the search neutrality debate has appeared from content or service providers complaining about being discriminated and therefore losing market shares due to an unfairly low ranking given by search engines. Those questions stress the need for methodologies and tools to verify bias in search engine rankings and analyze their potential impact. We have developed in 58 and the popularization paper 63 a simple yet effective framework comparing the results of existing search engines. We have presented statistical tests based on outlier detection pointing out potential biases, and introduce two meta engines aiming at reducing bias. All this is implemented in a publiclyavailable tool from which extensive comparisons and bias investigations are carried out.
Estimation of spectrum valuation for 5G dynamic frequency. The high data rates and diversity of services in 5G require a flexible and efficient use of all the available frequencies. In 5G networks, new approaches of dynamic spectrum sharing will be deployed, allowing Mobile Network Operators (MNOs) to access other incumbents’ spectrum, after obtaining a license from the regulator. The attribution of licenses will be made via auction mechanisms valid for given geographical areas and durations. To determine how to bid, each MNO has to estimate their valuation for spectrum i.e., how much they are willing to pay for it. In 34, we propose a model for estimating that valuation. The model is based on Markov chain modeling of user behavior, to compute the MNO satisfaction as a function of the obtained spectrum, and is illustrated by applying it to real operator data.
6.6 Monte Carlo
Participants: Bruno Tuffin, Gerardo Rubino.
We maintain a research activity in different areas related to dependability, performability and vulnerability analysis of communication systems, using both the Monte Carlo and the QuasiMonte Carlo approaches to evaluate the relevant metrics. Monte Carlo (and QuasiMonte Carlo) methods often represent the only tool able to solve complex problems of these types.
Central Limit Theorem for Randomized QuasiMonte Carlo. Randomized quasiMonte Carlo (RQMC) can produce an estimator of a mean (i.e., integral) with root meansquare error that shrinks at a faster rate than Monte Carlo's. While RQMC is often employed to provide a confidence interval (CI) for the mean, this approach implicitly assumes that the RQMC estimator obeys a central limit theorem (CLT), which has not been established for most RQMC settings. To address this, we have provided in 39, and extended in 60, various conditions that ensure an RQMC CLT, as well as an asymptotically valid CI, and examine the tradeoffs in our restrictions. Our sufficient conditions, based on the Lindeberg condition and depending on the regularity of the integrand, generally require that the number of randomizations grows sufficiently fast relative to the number of points used from the lowdiscrepancy sequence.
Gradientbased optimization and sensitivity analysis. The generalized likelihood ratio (GLR) method is a recently introduced gradient estimation method for handling discontinuities for a wide scope of sample performances. We have put in 40, 61 the GLR methods from previous work into a single framework, simplify regularity conditions for justifying unbiasedness of GLR, and relax some of those conditions that are difficult to verify in practice. Moreover, we have combineed GLR with conditional Monte Carlo methods and randomized quasiMonte Carlo methods to reduce the variance. Numerical experiments show that the variance reduction could be significant in various applications.
Rare event simulation of regenerative systems. Consider the hitting time $T$ to a rarely visited set $A$ of a regenerative process $X$. Let $F$ be the cumulative distribution function (CDF) of $T$, and assume we want to estimate $F$, along with its $q$quantile and conditional tail expectation (CTE). In various asymptotic settings, the distribution of $T/E\left[T\right]$ converges to an exponential as the set $A$ becomes rarer. Thus, we can approximate $F$ by an exponential with mean $E\left[T\right]$. As the mean $E\left[T\right]$ is unknown, we estimate it via simulation with measurespecific importance sampling to calibrate the approximation. This leads to our socalled exponential estimators of $F$ and the corresponding risk measures. Moreover, as $X$ is regenerative, we can write $T=S+V$, where $S$ is a geometric sum of lengths of cycles before the one that hits $A$ and $V$ is the time to hit $A$ in the first cycle that visits $A$. In various asymptotic settings, we also have that $S/E\left[S\right]$ converges weakly to an exponential. As $S$ and $V$ are independent, we can then write the CDF $F$ of $T$ as the convolution of the CDF $G$ of $S$ and the CDF $H$ of $V$. We then exploit this to construct socalled convolution estimators of $F$ and its corresponding risk measures. We have examined in 48 the behavior of the exponential and convolution estimators. Through simple models, we have shown that the weak convergence to an exponential may hold for $S/E\left[S\right]$ but not for $T/E\left[T\right]$. Thus, the convolution estimator may be valid, but the exponential estimator may not be. We have also discussed the bias of estimators. Indeed, for moderately rare events, bias could potentially surpass variance. For this reason, we have proposed other estimators, still based on the same regenerative principle, and have compared all of them numerically.
A new Importance Sampling approach for large sums of i.i.d. variables.
In 18 we study a well known problem in the area, the estimation of the probability that the sum of $N$ nonnegative independent and identically distributed random variables falls below a given threshold $\gamma $, using importance sampling (IS). We are particularly interested in the rare event regime when $N$ is large and/or $\gamma $ is small. To deal with this problem, we have the exponential twisting change of measure, a popular technique that, in most of the cases, compares favorably to other existing estimators. However, it has two main limitations: it assumes the knowledge of the moment generating function of the terms and sampling under the new measure is not straightforward and might be expensive. The aim of this work is to propose an alternative change of measure called Gamma IS, that yields, in the rare event regime, at least the same performance as the exponential twisting technique, without introducing previous limitations. For distributions whose probability density functions (PDFs) are $O\left({x}^{d}\right)$, as $x\to 0$ and $d>1$, we prove that the Gamma IS PDF with appropriately chosen parameters retrieves asymptotically, in the rare event regime, the same performance of the estimator based on the use of the exponential twisting approach. Moreover, in the Lognormal setting, where the PDF at zero vanishes faster than any polynomial, we numerically show that a Gamma IS PDF with optimized parameters clearly outperforms the exponential twisting change of measure. Numerical experiments validate the efficiency of the proposed estimator in delivering a highly accurate estimate in the regime of large $N$ and/or small $\gamma $.
7 Bilateral contracts and grants with industry
7.1 Bilateral contracts with industry
7.1.1 Common Lab INRIA  Nokia
Participants: Yassine HadjadjAoul, Gerardo Rubino.
Gerardo Rubino is the coordinator of the research action “Analytics and machine learning”, between Nokia Bell Labs and INRIA. The objective is to carry out common research on an integrated framework for 5G, programmable networks, IoT and clouds that aims at statically and dynamically managing and optimizing the 5G infrastructure using, in particular, Machine Learning techniques. The project ivolves several teams in INRIA and involves the work of several PhD students.
7.1.2 Common lab IMT Atlantique  b<>com with AI@IMT project
Participants: Yann Busnel, Patrick Maillé.
Yann Busnel is the coordinator of the research action “AI&Cyber”, between IRT b<>com and IMT Atlantique, cofunded by ANR within the project AI@IMT. The objective is to carry out common research on the usage of AI in Cybersecurity for Networking context. The project ivolves several researchers in IMT Atlantique (Patrick Maillé and Romaric Ludinard at least) and involves the work of several PhD students.
7.1.3 Cyber CNI chair at IMT Atlantique
Participants: Yann Busnel.
Yann Busnel is the financial chair of the industrial chair Cybersecurity for Critical Networked Infrastructures (Cyber CNI: cybercni). This is an industrial research chair, founded in 2016, with the following current industry partners in phase 2 (20192021) : Airbus, Amossys, BNP Paribas, EDF, Nokia Bell Labs, and SNCF.
7.2 Bilateral grants with industry
7.2.1 Cifre on Automation for beyond 5G Mobile Networks, with Nokia
Participants: César Viho.
Our goal in this Cifre contract 2020–2023 including a PhD thesis supervision (PhD of Sid Ali Hamideche) done with Nokia Bell Labs (Nozay) and IRISA is to focus on designing automatic user profiling based on artificial intelligence and machine learning.
7.2.2 Cifre on Resiliency as a Service for 5G, with Nokia
Participants: Sofiene Jelassi, Gerardo Rubino.
This is a Cifre contract 2020–2023 including a PhD thesis supervision (PhD of Soumaya Kaada), done with Nokia (ParisSaclay), about Resiliency as a Service for 5G networks using Machine Learning. It concerns providing on demand and evolving resiliency schemes over 5G network using advanced Machine Learning algorithms. It relies on a highly flexible network infrastructure supporting both wired and wireless programmable data planes through a highlyefficient distributed network operating system.
7.2.3 Cifre on availabilityaware NFVs placements, with Exfo
Participants: Yassine HadjadjAoul, Gerardo Rubino.
This is a Cifre contract 2020–2023 including a PhD thesis supervision (PhD of Amine Rguez), done with Exfo (Rennes), about availabilityaware NFVs placements of network services, using Deep Reinforcement Learning. The objective of the thesis is to exploit the potential of Deep Learning, and more particularly, of Deep Reinforcement Learning, in order to guarantee the high availability of placed network services.7.2.4 Cifre on multitask learning, with Orange
Participants: Yassine HadjadjAoul, César Viho.
This is a Cifre contract 2020–2023 including a PhD thesis supervision (PhD of Ahcene Boumhand), done with Orange Labs (Rennes) and IRISA, on multitask learning for the discovery of home contexts. The objective of the thesis is to propose and implement a new solution to discover several home context information by exploiting and classifying home data with a unique model based on multitasking learning.7.2.5 Cifre on network slicing, with Nokia
Participants: Yassine HadjadjAoul, Gerardo Rubino.
This is a Cifre contract 2021–2024 including a PhD thesis supervision (PhD of Abdelmounaim Bouroudi), done with Nokia Bell Labs (Nozay) and INRIA, on multiagent reinforcement learning for resource allocation and scheduling in post5G networks. The objective of the thesis is to propose a distributed resource placement and control system allowing automating network operations in their whole lifecycle from the creation of an endtoend network slice to its deletion, while continuously optimally selftuning the resource allocation to match the targeted performances.7.2.6 Cifre contract on FTM efficiency, with Cisco
Participants: Yann Busnel.
This is a Cifre contract 2019–2022 including a PhD thesis supervision (PhD of Jerome Henry), done with Cisco (US)cosupervised with the Adopnet and OCIF teams. The objective of the thesis is to propose and implement a new solution to FTM efficiency for indoor location.7.2.7 Cifre on Cognitive Autonomic Networks in 5G, with Nokia
Participants: César Viho.
This is a Cifre contract 2017–2020 including a PhD thesis supervision (PhD of Illyyne Saffar), done with Nokia, on the proposition to use machine learning and data analytics to transform user and network data into actionable knowledge which in turn can be automatically exploited by Autonomic Networking approaches for cognitive self management of the 5G network.
8 Partnerships and cooperations
8.1 International initiatives
ACCON

Title:
Algorithms for the Capacity Crunch problem in Optical Networks

Begin date:
Tue Jan 01 2019

End date:
Fri Dec 31 2021

Local supervisor:
Gerardo Rubino

Project head:
Gerardo Rubino

Partners:
 Universidad de Valparaíso, Chile
 Universidad Tecnica Federico Santa María, Valparaíso, Chile
 Universidad de la República, Uruguay

Inria contact:
Gerardo Rubino

Summary:
The rapid increase in demand for bandwidth from existing networks has caused a growth in the use of telecommunications technologies, especially WDM optical networks. So far, communication technologies have been able to meet the bandwidth demand. Nevertheless, this decade researchers have anticipated a coming “Capacity Crunch” potential problem associated with these networks. It refers to fact that the transmission capacity limit on optical fibers is close to be reached in the near future. It is then urgent to make the current network architectures evolve, in order to satisfy the relentless exponential growth in bandwidth demand. In other words, the performance bottleneck for optical infrastructures is concentrated around this limiting situation, and the most efficient way of preparing the future of these fundamental technological systems that support the backbone of the Internet is to focus on solving the related management problems. In the previously described scientific context, the ACCON project has a main scientific goal: the development of new strategies capable to provide better resource management techniques to face the threat of the Capacity Crunch. To this end, we will explore the utilization of different analytical techniques to evaluate the performance of several network architecture paradigms, in order to assess their viability in the near future. This will provide us the needed insight leading to finding new strategies for efficiently managing the network resources, and consequently, to contribute addressing this coming Capacity Crunch problem.
8.1.1 Other international partners
Participants: Yann Busnel, Bruno Sericola, Gerardo Rubino, Bruno Tuffin.
 G. Rubino works with Alan Krinik from Cal Poly, Pomona, US, on transient analysis of Markovian models.
 G. Rubino collaborates with S. Basterrech from the VSBTechnical University of Ostrava, Czech Republic, on Machine Learning problems, these days on time series prediction using Reservoir Computing techniques.
 Bruno Sericola works with MarieAnge Remiche from the university of Namur, Belgium, France, on the analysis of fluid queues.
 Yann Busnel has taken part in several events to develop IndoFrench collaborations, notably within the framework of Campus France. In particular, he led the partnership ith VJTI Mumbai and coorganized the IndoFrench Seminar on Artificial Intelligence in Bordeaux in October 2020.
 Yann Busnel works with Dhiren Patel from VJTI, Mumbai, India, on Blockchain and cybersecurity.
 Bruno Tuffin works with P.W. Glynn from Stanford University and M.K. Nakayama from NJIT on rare event simulation.
 Bruno Tuffin works with Y. Peng (Peking University), M. Fu (University of Maryland), J. Hu (Stony Brook University) and P. L’Ecuyer (Université de Montréal) on Generalized Likelihood Ratio Methods.
8.2 National initiatives
8.2.1 PIA “Beyond 5G” project
Participants: Yann Busnel.
Yann Busnel is member of the “Beyond 5G” Project: Institut MinesTélécom is drawing on the research of its schools – IMT Atlantique, IMT LilleDouai, Télécom Paris, Télécom SudParis – and of its subsidiary, EURECOM, to contribute to the industry recovery plan by teaming up with Thales SIX GTS France and Ericsson France to address the strategic challenge of digital sovereignty posed by 5G. "Beyond 5G" is one of the first four winning projects selected through the call for projects launched by the Strategic Sector Committee (CSF) for Digital Infrastructure: Sovereignty in Telecommunications Networks to Accelerate 5G Applications in Vertical Markets", with a 7m€ funding.
The participants in the "Beyond 5G" program will work together for three years to design technical solutions for the development of sovereign and secure nextgeneration 5G networks, while developing innovative uses for the industry of the future. This project goes far beyond a simple technical improvement by paving the way for a wide range of industrial uses based on new cognitive, predictive and contextual capabilities in order to provide an unprecedented experience. The project teams will also focus on post5G developments, which will be driven by the introduction of disruptive technologies with severe constraints in terms of digital security.
8.2.2 ANR “INTELLIGENTSIA”
Participants: Soraya AitChelouche, Yassine HadjadjAoul, Patrick Maillé, Gerardo Rubino.
INTELLIGENTSIA

Title:
INTelligent Edge using Learning Loops & Information GEneration for NeTwork State Inferencebased Automation.

Begin date:
Nov. 2020

End date:
Nov. 2024

Funding:
ANR (ANR20CE25001103)

Partners:
 Orange Labs
 INRIA Rennes
 CNAM
 Acklio
 Aguila

Summary:
The Intelligentsia project aims at (1) specifying novel media access protocols and resources sharing policies to be able to support network slicing for IoT access networks in general, and LoRa networks in particular; (2) designing of a network automation framework that incorporates novel learning algorithms to configure the IoT access network.
8.2.3 AAP PME “NaviDEC”
Participants: Soraya AitChelouche, Yassine HadjadjAoul.
NaviDEC

Title:
Network for Automated Virtual services placement in Deep Edge Computing.

Begin date:
Nov. 2021

End date:
Nov. 2023 2021

Funding:
AAP PME 20202021

Partners:
 SODIRA Connect
 University of Rennes 1
 INPIXAL

Summary:
For beyond 5G/6G, the project NaviDEC will extend the edge computing paradigm, with a goal of intelligent connectivity, storage and computing anywhere, anytime. More specifically, the objective of the project is to propose a deep edge platform for the placement of services in distributed environments with an intermittent Internet connection.
8.2.4 Inria Exploratory Action “SNIDE”
Participants: Patrick Maillé, Tuffin Bruno.
We are leading of the Inria Exploratory Action SNIDE (Search Non neutratlIty DEtection) 20192023, involving Dionysos and MIMR (Grenoble). The involved researchers are Patrick Maillé and Bruno Tuffin.
Search engines play a key role to access content and are accused to bias their results to favor their own services among others. This has led to the sensitive search neutrality debate, similar to the network neutrality debate currently discussed on the role of ISPs. Our goal in this project is to develop and apply a methodology aiming at highlighting a bias and quantifying its impact.
An initial version of our metaengine (which will be further develop by incorporating outlier detection tests) can be found at Snide.
9 Dissemination
Participants: all .
9.1 Promoting scientific activities
9.1.1 Scientific events: organisation
General chair, scientific chair
 Yann Busnel has acted as General cochair of the Workshop on Artificial Intelligence for Healthcare (AI&Health) collocated with the Knowledge Summit 3, in Pune, India (virtual), in November 2021 (Workshop link).
 Yassine HadjadjAoul has acted as General cochair of the Cloud Days 2021 seminar, in Brest, France, in November 2021 (Cloud days link).
9.1.2 Scientific events: selection
Chair of conference program committees
 Yassine HadjadjAoul was the TPC cochair of the 13th Wireless Days Conference (WD'21), 30 June  02 July, 2021 (online event).
 Bruno Tuffin was the TPC cochair of the 18th International Conference on Economics of Grids, Clouds, Systems & Services (GECON), 2123. September 2021 (online event).
Member of the conference program committees
 Bruno Tuffin was TPC member of the following conferences:
 2021 Asia Pacific Conference on Wireless and Mobile (APWiMob), Bandung, Indonesia, April 810, 2021.
 The 2021 International Symposium on Ubiquitous Networking (UNet'21), Marrakesh, Morocco, May 1922, 2021.
 ITC 33  Networked Systems and Services Aug. 31st  Sep. 3rd 2021, Avignon, France.
 IEEE 5G World Forum, October 1315 2021, Montreal, Canada.
 VALUETOOLS 2021  14th EAI International Conference on Performance Evaluation Methodologies and Tools, October 2931, 2021, Guangzhou, People's Republic of China.
 Globecom2021 CSSMA (2021 IEEE Global Communications Conference: Communications Software, Services and Multimedia Apps), Madrid, Spain, 7 11 December 2021.
 Patrick Maillé served as a TPC member for GECON 2021 and Globecom 2021.
 Bruno Sericola served as a TPC member for ASMTA 2021 conference (26th International conference on Analytical and Stochastic Modelling Techniques and Applications, 914 December 2021 Tsukuba, Japan.
 Yann Busnel served as a TPC member for AlgoTel 2021: 23es Rencontres Francophones sur l'Algorithmique des Télécommunications, La Rochelle, France, September 2021.
 Gerardo Rubino served or serves at TPC member of the following international conferences:
 MASCOTS'21 (29th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, virtual, Nov. 35, 2021).
 MCQMC'22 (15th International Conference on Monte Carlo and QuasiMonte Carlo Methods in Scientific Computing, Linz, July 1722, 2022).
 QEST'22 (19th International Conference on Quantitative Evaluation of SysTems, Warsaw, Poland, Sep. 1216, 2022).
 Yassine HadjadjAoul served or serves at TPC member of the following international conferences:
 MASCOTS'21, the 29th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, virtual, Nov. 35, 2021.
 Globecom 2021 (2021 IEEE Global Communications Conference), Madrid, Spain, 7 11 December 2021.
 ICC 2021, (2021 IEEE International Conference on Communications), Virtual, Montreal, Canada, 1423 June 2021.
 HPCC 2021, (2021, 23rd IEEE International Conference on High Performance Computing and Communications), Haikou, Hainan, 2022 December 2021.
 WD 2021, (2021, 13th Wireless Days Conference), 30 June  02 July, 2021.
9.1.3 Journal
Member of the editorial boards
 Bruno Tuffin is Area Editor (simulation) for INFORMS Journal on Computing (since Jan. 2015) and Associate Editor for ACM Transactions on Modeling and Computer Simulation (since July 2009).
 Patrick Maillé serves as an Associate Editor for Electronic Commerce Research and Applications (ECRA) and for the IEEE Open Journal of the Communications Society (OJCOMS).
 Bruno Sericola serves as associate editor for Performance Evaluation, since April 2015. He is also Editor in Chief of the books series “Stochastic Models in Computer Science and Telecom muni cations Networks”, ISTE/WILEY, since March 2015.
 Gerardo Rubino is Associate Editor of the Journal of Dynamics & Games.
9.1.4 Invited talks
Patrick Maillé and Bruno Tuffin gave an invited talk at Peren (Pôle d’Expertise de la Régulation Numérique) in December 2021 on Evaluating the performance and neutrality/bias of search engines.
Bruno Tuffin gave an invited talk Estimating by Simulation the Mean and Distribution of Hitting Times of Rare Events at the UQ hybrid seminar, RWTH Aachen University, April 13, 2021 (virtual).
Yann Busnel gave 2 invited taks in 2021:
 Blockchain Technology: Fundamentals of Synchronization and Distributed Consensus. Invited talk (virtual) at VJTI Mumbai, India, September 2021
 How selforganisation and decentralisation should make a smarter world? Keynote (virtual) at International Conference on Smart Computing and Communication, Kochi, India, July 2021
Yassine HadjadjAoul gave 3 invited talks in 2021:
 Safe Deep Reinforcement learningbased Network Slicing, at the Cores/Algotel Seminar, in La Rochelle, France.
 Access control in NBIoT networks: a deep reinforcement learning strategy, at a seminar of University of Paris 13, France (virtual).
 Safe Deep Reinforcement learningbased Network Slicing, at an Orange Labs Webinar (virtual).
9.1.5 Leadership within the scientific community
 Gerardo Rubino is the coordinator of the research action “Analytics and Machine Learning” between INRIA and Nokia Bell Labs.
 Gerardo Rubino and Bruno Tuffin are members of the Steering Committee of the International Workshop on Rare Event Simulation (RESIM).
 Yassine HadjadjAoul is chairing the steering committee of the International Conference on Information and Communication Technologies for Disaster Management (ICTDM), since 2016.
 Bruno Tuffin is chairing the Steering Committee of the International Conference on Monte Carlo Methods and Applications (MCM) series, since August 2021.
9.1.6 Research administration
 Bruno Sericola is responsible for the Inria RennesBretagne Atlantique budget.
 Bruno Sericola is the leader of the research group MAPI (Math Appli Pour l’Info) the goal of which is to improve the collaboration between computer scientists and mathematicians.
 Yann Busnel is head of D2 – Network, Telecommunication and Services department – at UMR IRISA
 Yann Busnel is head of Network Systems, Cybersecurity and Digital Law department at IMT Atlantique
 Yann Busnel is IMT Atlantique representative on the Scientific and Pedagogical Committee of the EUR CyberSchool
 Yann Busnel is cohead of the MOOC Editorial Board at Institut MinesTélécom
 Gerardo Rubino belongs to the CSV (the technical committee) of the Images and Networks Cluster of Brittany, France, since its foundation.
9.2 Teaching  Supervision  Juries
9.2.1 Teaching
 Master: Bruno Tuffin, MEPS (probablility, queuing systems, simulation), 35 hours, M1, University of Rennes 1, France
 Master: Bruno Tuffin, GTA (Game Theory and Applications), 15 hours, M2, University of Rennes 1, France
 MOOC on Queuing Theory, available on EdX: Patrick Maillé (in charge of one week of class)
 MOOC on “Ose les métiers de l'industrie du futur”, available on Fun: Yann Busnel (in charge of one week of class)
 IMT Atlantique 3rd year: Yann Busnel, Blockchain: Synchronisation and Token Economy, 3 hours.
 Licence: Bruno Sericola, Mathematics, 14h, L2, IUT/University of Rennes 1, France.
 Master: Bruno Sericola, Logistic and performance, 12h, M2, Faculté de sciences économiques, Univ of Rennes 1, France
 Master: Bruno Sericola, MEPS (performance evaluation), 36h, M1, Univ Rennes and ENS Rennes, France
 Master M1: César Viho, Networks:Rennes 1 from Services to protocols, 36 hours, Istic/University of Rennes 1, France
 Master M2: César Viho, Algorithms on graphs, 40 hours, Istic/University of Rennes 1, France
 Bachelor L2: César Viho, Network architecture and components, 16 hours, Istic/University of Rennes 1, France
 Master, 2nd year: Yassine HadjadjAoul, Scalable Network Infrastructure (SNI), 10 hours, The Research in Computer Science (SIF) master and EIT Digital Master/University of Rennes 1, France
 Master, pro 2nd year: Yassine HadjadjAoul, Multimedia streaming over IP (MMR), 48 hours, Esir/University of Rennes 1, France
 Master, pro 2nd year: Yassine HadjadjAoul, Multimedia services in IP networks (RSM), 29 hours, Esir/University of Rennes 1, France
 Master, pro 2nd year: Yassine HadjadjAoul, Software Defined Networks, 6 hours, Istic/University of Rennes 1, France
 Master, 2nd year: Yassine HadjadjAoul, Video streaming over IP, 8 hours, Istic/University of Rennes 1, France
 Master: Yassine HadjadjAoul, Introduction to networking (IR), 26 hours, Esir/University of Rennes 1, France
 Master: Yassine HadjadjAoul, Mobile and wireless networking (RMOB), 20 hours, Esir/University of Rennes 1, France
 Master 2nd year: Yassine HadjadjAoul, Overview of IoT technologies: focus on LPWAN, 2 hours, INSA, France
 Sofiene Jelassi is the manager of the master program “Heterogeneous Networks and Systems”, Istic/University of Rennes 1, France
 Master pro 2nd year: Sofiene Jelassi, Supervision of heterogeneous networks, 32 hours, Istic/University of Rennes 1, France
 Master pro 2nd year: Sofiene Jelassi, Cloud & SDN virtualization, 32 hours, Istic/University of Rennes 1, France
 Master pro 2nd year: Sofiene Jelassi, Multimedia networks, 32 hours, Istic/University of Rennes 1, France
 Bachelor L1: Sofiene Jelassi, Programming Algorithms, 12 hours, SPM/University of Rennes 1, France
 Master, 2nd year: Gerardo Rubino, Scalable Network Infrastructure (SNI), 10 hours, The Research in Computer Science (SIF) master and EIT Digital Master/University of Rennes 1, France
 Supelec Rennes 3rd year: Gerardo Rubino, Dependability Analysis, 12 hours.
 Master 2nd year: Gerardo Rubino, Quality of Experience, twice 4 hours (two different groups of students), Esir/University of Rennes 1, France
 Master Pro 2nd year: Gerardo Rubino, Quality of Experience, 4 hours Esir/University of Rennes 1, France
 Esir/University of Rennes 1, 1st year, Gerardo Rubino, Graph theory and algorithms, 24 hours, France
 Esir/University of Rennes 1, 2nd year, Gerardo Rubino, Introduction to graph algorithmes in routing, 8 hours, France
9.2.2 Supervision
PhD in progress: Hiba DAKDOUK, “Asynchronous and frugal algorithms for the optimization of communications in IoT networks”, CIFRE Thesis with Orange Labs/IMT Atlantique, started in January 2019, supervised by Patrick Maillé.
PhD in progress: Khalil EL HOUSSNI, “Analysis of the interactions between cybersecurity IA systems using game theory”, Thesis with IMT Atlantique and B<>Com, Started in December 2021, supervised by Yann Busnel and Patrick Maillé.
PhD in progress: Léo Lavaur, Threat intelligence tools for IoT threat indexing and cooperative sharing, started in October 2020; supervisors: Yann Busnel, MarcOliver Pahl, Fabien Autrel, IMT Atlantique.
PhD in progress: PierreMarie Lechevalier, trust and security in the composition of distributed network services and functions, started in October 2021; supervisors: Yann Busnel, Géraldine Texier, Hélène Le Bouder, Romaric Ludinard, IMT Atlantique.
PhD in progress: Antoine Rebstock, extraction of probable scenarios by correlation of alerts, started in October 2021; supervisors: Yann Busnel, Romaric Ludinard, IMT Atlantique, and Stéphane Paquelet, IRT b<>com.
PhD in progress: Ali Hodroj, Enhancing content delivery to multihomed users in broadband mobile networks, started in November 2015; supervisors: Bruno Sericola, Marc Ibrahim and Yassine HadjadjAoul, University of Rennes 1 and St Joseph University of Beyrouth.
PhD in progress: Amine RGUEZ, “An availabilityaware NFVs placement using Deep Reinforcement Learning”, CIFRE Thesis with EXFO/INRIA, started in November 2020, supervised by Yassine HadjadjAoul and Gerardo Rubino.
PhD in progress: Soumeya KAADA, “Resiliency as a Service for 5G networks using Machine Learning”, CIFRE Thesis with Nokia Bell Labs/INRIA, started in January 2020, supervised by Sofiene Jelassi and Gerardo Rubino.
9.2.3 Juries
 Bruno Tuffin was rapporteur of the PhD of Gabriel Sarazin. Analyse de sensibilité fiabiliste en présence d'incertitudes épistémiques introduites par les données d'apprentissage. Institut Supérieur de l'Aéronautique et de l'Espace (ISAE), Université de Toulouse, Mai 2021.
 Yann Busnel was rapporteur of the PhD of Rohit Agarwal. Indian Institute of Technology, Indore, India, September 2021.
 Gerardo Rubino was one of the reviewers of the PhD of Youssef Ait El Mahjoub, intitled “Évaluation des performances pour des réseaux IT économes en énergie”, université de ParisSaclay, March 18, 2021.
 Yassine HadjadjAoul was a member in the following juries:
 Ahmed Fadel, Univ. Rennes 1 (Sept. 2021)
 José Jurandir Alves Esteves, Sorbonne Université (Dec. 2021), as a reviewer.
 Ogechi Akudo Nwogu, University Sorbonne Paris Nord (Dec. 2021), as a reviewer.
 Aymen Shaafi, University of Paris (Dec. 2021)
9.3 Popularization
 Patrick Maillé and Bruno Tuffin published Neutralité du Net : l’Europe doitelle déréguler en réponse aux ÉtatsUnis? in The Conversation.
 Gerardo Rubino makes regular presentations to high school students about the research work in general, and specific technical topics in particular. Current talks:
 Randomness as a tool
 Internet as a research problem
 Great challenges in maths: the Riemann Hypothesis
 Great challenges in math/computer science: the “P versus NP” problem
10 Scientific production
10.1 Major publications
 1 articleA Distributed Information Divergence Estimation over Data Streams.IEEE Transactions on Parallel and Distributed Systems252February 2014, 478487
 2 articleByzantinetolerant Uniform Node Sampling Service in Largescale Networks.International Journal of Parallel, Emergent and Distributed Systems365June 2021, 128
 3 articleAn adaptive fuzzybased CAC scheme for uplink and downlink congestion control in converged IP and DVBS2 networks.IEEE Transactions on Wireless Communications82Feb. 2009, 816825
 4 inproceedingsLessthanBestEffort Services: Pricing and Scheduling.23rd IEEE Infocom ConferenceHongKong, ChinaMarch 2004
 5 articleA Geometric Approach to Noisy EDM Resolution in FTM Measurements.Computers103March 2021, 33
 6 articleA perceptionoriented Markov model of loss incidents observed over VoIP networks.Computer Communications128September 2018, 8094
 7 articleTransient analysis of the M/M/1 queue.Advances in Applied Probability253September 1993, 702713
 8 bookTelecommunication Network Economics: From Theory to Applications.Cambridge University Press2014, 288
 9 articleA study of realtime packet video quality using random neural networks.IEEE Trans. Circuits Syst. Video Techn.12122002, 10711083URL: https://doi.org/10.1109/TCSVT.2002.806808
 10 articlePerformability analysis: a new algorithm.IEEE Transactions on Computers4541996, 491494
 11 inproceedingsDetecting Illicit Entities in Bitcoin using Supervised Learning of Ensemble Decision Trees.ICICM 2020 : 10th International Conference on Information Communication and ManagementParis, FranceACMAugust 2020, 2530
 12 articleRateBased Daily Arrival Process Models with Application to Call Centers.Operations Research6422016
 13 articleA finite characterization of weak lumpable Markov processes. Part II: The continuous time case.Stochastic Processes and their Applications451993, 115126
 14 bookG.Gerardo RubinoB.Bruno TuffinRare Event Simulation using Monte Carlo Methods.John Wiley & Sons2009
 15 articlePredicting file downloading time in cellular network: LargeScale analysis of machine learning approaches.Computer Networks145November 2018, 243254
 16 articleBounded Normal Approximation in Highly Reliable Markovian Systems.Journal of Applied Probability3641999
10.2 Publications of the year
International journals
 17 articleByzantinetolerant Uniform Node Sampling Service in Largescale Networks.International Journal of Parallel, Emergent and Distributed Systems365June 2021, 128
 18 articleEfficient importance sampling for large sums of independent and identically distributed random variables.Statistics and Computing316November 2021, 121
 19 articleA Geometric Approach to Noisy EDM Resolution in FTM Measurements.Computers103March 2021, 33
 20 articleA survey on video streaming in multipath and multihomed overlay networks.IEEE Access92021, 6681666828
 21 articleMultiarmed bandit algorithms over DASH for multihomed client.International Journal of Sensor Networks3742021, 110
 22 articleMultilabel classification of remote sensed satellite imagery.Transactions on emerging telecommunications technologies327July 2021, e3988
 23 articleBig Content Providers Weighing on NonNeutrality?Netnomics: Economic Research and Electronic2021, 120
 24 articleStochastic Analysis of Average Based Distributed Algorithms.Journal of Applied Probability582June 2021, 394  410
 25 articleSupervised Learning model for Identifying illegal activities in Bitcoin.Applied Intelligence512021, 3824–3843
 26 articleDissecting bitcoin blockchain: Empirical Analysis of Bitcoin network (20092020).Journal of Network and Computer Applications (JNCA)177March 2021, 102940

27
articleStochastic analysis of rumor spreading with
$k$ pull operations.Methodology and Computing in Applied ProbabilityOctober 2021  28 articleProbabilistically Sampled and Spectrally Clustered Plant Species using Phenotypic Characteristics.PeerJ92021, e11927
 29 articlePerformance Analysis of Cellular Networks with Delay Tolerant Users.Telecommunication Systems772021, 241–253
 30 articleA Novel EnergyEfficient Clustering Algorithm for More Sustainable Wireless Sensor Networks Enabled Smart Cities Applications.Journal of sensor and actuator networks103September 2021, 121
International peerreviewed conferences
 31 inproceedingsImpact of Heterogeneous Neutrality Rules with Competitive Content Providers.IFIP/IEEE International Symposium on Integrated Network ManagementBordeaux, FranceMay 2021
 32 inproceedingsEvolving reservoir weights in the frequency domain.GECCO 2021  Genetic and Evolutionary Computation ConferenceLille, FranceACMJuly 2021, 271272
 33 inproceedingsAnalyzing the Wehe Network Neutrality Monitoring Tool.GECON 2021  18th International Conference on the Economics of Grids, Clouds, Systems, and ServicesOnline, FranceSeptember 2021, 17
 34 inproceedingsEstimation of spectrum valuation for 5G dynamic frequency allocation and auctions.VTC 2021Spring  IEEE 93rd Vehicular Technology ConferenceHelsinki (Online), FinlandIEEEApril 2021, 16
 35 inproceedingsMobile traffic forecasting using a combined FFT/LSTM strategy in SDN networks.HPSR 2021  22nd IEEE International Conference on High Performance Switching and RoutingParis, FranceIEEEJune 2021, 16
 36 inproceedingsRanging and Location attacks on 802.11 FTM.PIMRC 2021: IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio CommunicationsOulu, FinlandIEEESeptember 2021, 16
 37 inproceedingsToward Operative QoE Models using Virtual Multimedia IPbased Streaming Services.ICIN 2021  24th Conference on Innovation in Clouds, Internet and Networks and WorkshopsParis, FranceIEEEMarch 2021, 134136
 38 inproceedingsAnalysis of Rumor Spreading with 2pull or 3pull Operations.NCA 2021  20th IEEE International Symposium on Network Computing and ApplicationsOnline, FranceIEEENovember 2021, 18
 39 inproceedingsSufficient Conditions for a Central Limit Theorem to Assess the Error of Randomized QuasiMonte Carlo Methods.2021  Winter Simulation ConferencePhoenix, United StatesDecember 2021, 112
 40 inproceedingsVariance Reduction for Generalized Likelihood Ratio Method in Quantile Sensitivity Estimation.2021  Winter Simulation ConferencePhoenix, United StatesDecember 2021, 112
 41 inproceedingsKRS: Kubernetes Resource Scheduler for resilient NFV networks.GLOBECOM 2021  IEEE Global Communications ConferenceMadrid, SpainIEEEDecember 2021, 16
 42 inproceedingsA network tomography approach for anomaly localization in Service Function Chaining.ISNCC 2021  International Symposium on Networks, Computers and CommunicationsDubai, United Arab EmiratesIEEEOctober 2021, 16
 43 inproceedingsLearn to improve: A novel deep reinforcement learning approach for beyond 5G network slicing.CCNC 2021  IEEE 18th Annual Consumer Communications & Networking ConferenceLas Vegas, United StatesIEEEJanuary 2021, 16
 44 inproceedingsMonGNN: A neuroevolutionarybased solution for 5G network slices monitoring.LCN 2021  46th IEEE Conference on Local Computer NetworksEdmonton, CanadaIEEEOctober 2021, 185192
 45 inproceedingsBest paperOn the use of machine learning and network tomography for network slices monitoring.HPSR 2021  22nd IEEE International Conference on High Performance Switching and RoutingParis, FranceIEEEJune 2021, 17
 46 inproceedingsStochastic analysis of algorithms for collecting longitudinal data.NCA 2021  20th IEEE International Symposium on Network Computing and Applicationsonline, FranceIEEENovember 2021, 120
 47 inproceedingsAn Approach to Network Service Placement using Intelligent Search Strategies over BranchandBound.GLOBECOM 2021  IEEE Global Communications ConferenceMadrid, SpainIEEEDecember 2021, 17
Conferences without proceedings
 48 inproceedingsRegenerativeSimulationBased Estimators of Risk Measures for Hitting Times to Rarely Visited Sets.RESIM 2021 13th International Workshop on Rare Event SimulationParis, FranceMay 2021
 49 inproceedingsAutolocalisation en intérieur à l'aide de mesures FTM.CORES 2021 – 6ème Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de CommunicationLa Rochelle, FranceMay 2021, 14
 50 inproceedingsReducing FTM ranging and location attack exposure with crowdwisdom.IPIN 2021  9th International Conference on Indoor Positioning and Indoor NavigationLloret de Mar, SpainNovember 2021, 116
 51 inproceedingsCube Sampled KPrototype Clustering for Featured Data.INDICON 2021  IEEE 18th India Council International ConferenceGuwahati, IndiaIEEEDecember 2021, 16
 52 inproceedingsExplicit expressions for M^k for k = 2,3,4,etc.and exp(Mt), for certain matrices M.JMM 2021  Joint Mathematics MeetingVirtual, United StatesJanuary 2021
 53 inproceedingsThe powerdual and the exponentialdual of a matrix.JMM 2021  Joint Mathematics MeetingMountain / Virtual, United StatesJanuary 2021, 128
 54 inproceedingsFederated security approaches for IT and OT.SSLR 2021  Journée thématique du GT sur la Sécurité des Systèmes, Logiciels et Réseauxonline, FranceMay 2021, 12
Scientific book chapters
 55 inbookGestion des accès massifs des équipements dans les réseaux NBIoT : une stratégie basée sur l'apprentissage par renforcement.La gestion et le contrôle intelligents des performances et de la sécurité dans l’IoTNovember 2021, 129
 56 inbookThe ExponentialDual Matrix Method: Applications to Markov Chain Analysis.774Stochastic Processes and Functional Analysis: New PerspectivesContemporary MathematicsAmerican Mathematical Society2021, 123
Reports & preprints
 57 miscCollaborative Exploration and Exploitation in massively MultiPlayer Bandits.October 2021
 58 miscAre Search Engines Biased? Detecting and Reducing Bias using Meta Search Engines.2021
 59 misc La 5G et la neutralité du Net ; un mariage difficile ? 2021
 60 miscSufficient Conditions for Central Limit Theorems and Confidence Intervals for Randomized QuasiMonte Carlo Methods.2021
 61 miscVariance Reduction for Generalized Likelihood Ratio Method By Conditional Monte Carlo and Randomized QuasiMonte Carlo.Phoenix, United States2021
Other scientific publications
 62 inproceedingsOn Combining Reinforcement Learning and Monte Carlo for Dynamic Virtual Network Embedding.LCN 2021  46th IEEE Conference on Local Computer NetworksEdmonton, CanadaIEEE; Informa HealthcareOctober 2021, 13
10.3 Other
Scientific popularization
 63 article Tester les biais des moteurs de recherche : pourquoi et comment ? Interstices October 2021