Author: "Département Réseaux et Services de Télécommunications (TSP - RST)" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Département Réseaux et Services de Télécommunications (TSP - RST)"' showing total 88 results

Start Over Author "Département Réseaux et Services de Télécommunications (TSP - RST)"

88 results on '"Département Réseaux et Services de Télécommunications (TSP - RST)"'

1. Explainable artificial intelligence for cybersecurity: a literature survey

Author: Fabien Charmet, Harry Chandra Tanuwidjaja, Solayman Ayoubi, Pierre-François Gimenez, Yufei Han, Houda Jmila, Gregory Blanc, Takeshi Takahashi, Zonghua Zhang, National Institute of Information and Communications Technology [Tokyo, Japan] (NICT), SIMulating and Building IOT (SIMBIOT), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), CentraleSupélec [campus de Rennes], Sécurité et Confiance Numérique (SCN-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris), Mathematical and Algorithmic Science Lab, France Research Center, Huawei Technologies, and Huawei Technologies France [Boulogne-Billancourt]
Subjects: Electrical and Electronic Engineering, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: With the extensive application of deep learning (DL) algorithms in recent years, e.g., for detecting Android malware or vulnerable source code, artificial intelligence (AI) and machine learning (ML) are increasingly becoming essential in the development of cybersecurity solutions. However, sharing the same fundamental limitation with other DL application domains, such as computer vision (CV) and natural language processing (NLP), AI-based cybersecurity solutions are incapable of justifying the results (ranging from detection and prediction to reasoning and decision-making) and making them understandable to humans. Consequently, explainable AI (XAI) has emerged as a paramount topic addressing the related challenges of making AI models explainable or interpretable to human users. It is particularly relevant in cybersecurity domain, in that XAI may allow security operators, who are overwhelmed with tens of thousands of security alerts per day (most of which are false positives), to better assess the potential threats and reduce alert fatigue. We conduct an extensive literature review on the intersection between XAI and cybersecurity. Particularly, we investigate the existing literature from two perspectives: the applications of XAI to cybersecurity (e.g., intrusion detection, malware classification), and the security of XAI (e.g., attacks on XAI pipelines, potential countermeasures). We characterize the security of XAI with several security properties that have been discussed in the literature. We also formulate open questions that are either unanswered or insufficiently addressed in the literature, and discuss future directions of research.
Published: 2022

2. Modélisation et test des ambiguïtés de recouvrement de données pour l'obtention des politiques de ré-assemblage dans les protocoles réseaux

Author: Aubard, Lucas, Mazel, Johan, Guette, Gilles, Chifflier, Pierre, Levillain, Olivier, Blanc, Gregory, Mé, Ludovic, Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE), CentraleSupélec-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Agence nationale de la sécurité des systèmes d'information (ANSSI), Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Sécurité et Confiance Numérique (SCN-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), and Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)
Subjects: Donnée, Système de détection d'intrusion, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], IPv6, Protocole Internet, IPv4 Internet architecture Internetworking and data packet, Systèmes d'exploitation OS
Abstract: International audience; Les protocoles d'Internet, tels IPv4, TCP ou encore IPv6, disposent de mécanismes permettant de découper les données si nécessaire. Le découpage de ces morceaux peut donner lieu à du recouvrement, c'est-à-dire que plusieurs morceaux ainsi créés peuvent se chevaucher. Or, différentes politiques de réassemblage sont utilisées par les systèmes d'exploitation (OS), ce qui implique que selon l'OS de la machine destinataire, une même suite de fragments n'est pas ré-assemblée de la même manière. Dès lors, un système de détection d'intrusion (NIDS) qui ne ré-assemble pas ce type de fragments de la même manière que l'hôte surveillé est aveugle au flux réellement traité par cet hôte laissant la place à son contournement. Les derniers travaux qui documentent les politiques de ré-assemblage de fragments de données des OS datent de plus de 10 ans [1]-[3]. Dans ce papier, nous proposons une approche par raisonnement spatio-temporel afin de modéliser l'ensemble des cas de recouvrement pour un nombre quelconque de fragments, pour ce faire, nous utilisons l'algèbre des intervalles d'Allen. Cela nous permet de mettre à jour les politiques de ré-assemblage des OS les plus utilisés (Windows, Linux, FreeBSD, SunOS) pour des paires de fragments IPv4. En outre, nous montrons que les politiques de ré-assemblage obtenues en testant des paires de fragments IPv4 ne permettent pas de prédire le ré-assemblage de n > 2 fragments recouvrants.
Published: 2023

3. Data-Driven Evaluation of Intrusion Detectors: A Methodological Framework

Author: Solayman Ayoubi, Gregory Blanc, Houda Jmila, Thomas Silverston, Sébastien Tixeuil, SIMulating and Building IOT (SIMBIOT), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Sécurité et Confiance Numérique (SCN-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Networks and Performance Analysis (NPA), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), Guy-Vincent Jourdan, Laurent Mounier, Carlisle Adams, Florence Sèdes, Joaquin Garcia-Alfaro, and ANR-20-CE39-0011,GRIFIN,Sécurité cognitive et programmable pour la résilience des réseaux de nouvelle génération(2020)
Subjects: Data-driven Evaluation, Machine learning, [INFO]Computer Science [cs], Evaluation Framework, Intrusion Detection System
Abstract: International audience; Intrusion detection systems are an important domain in cybersecurity research. Countless solutions have been proposed, continuously improving upon one another. Yet, and despite the introduction of distinct approaches, including machine-learning methods, the evaluation methodology has barely evolved.In this paper, we design a comprehensive evaluation framework for Machine Learning (ML)-based intrusion detection systems (IDS) and take into account the unique aspects of ML algorithms, their strengths and weaknesses. The framework design is inspired by both i) traditional IDS evaluation methods and ii) recommendations for evaluating ML algorithms in diverse application areas. Data quality being the key to machine learning, we focus on data-driven evaluation by exploring data-related issues. Our approach goes beyond evaluating intrusion detection performance (also known as effectiveness) and aims at proposing standard data manipulation methods to tackle robustness and stability. Finally, we evaluate our framework through a qualitative comparison with other IDS evaluation approaches from the state of the art.
Published: 2023

4. Errors in the CICIDS2017 dataset and the significant differences in detection performances it makes

Author: Lanvin, Maxime, Gimenez, Pierre-François, Han, Yufei, Majorczyk, Frédéric, Mé, Ludovic, Totel, Eric, CentraleSupélec [campus de Rennes], Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE), CentraleSupélec-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), DGA Maîtrise de l'information (DGA.MI), Direction générale de l'Armement (DGA), Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), and Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], machine learning, intrusion detection, dataset labelling
Abstract: Among the difficulties encountered in building datasets to evaluate intrusion detection tools, a tricky part is the process of labelling the events into malicious and benign classes. The labelling correctness is paramount for the quality of the evaluation of intrusion detection systems but is often considered as the ground truth by practitioners and is rarely verified. Another difficulty lies in the correct capture of the network packets. If it is not the case, the characteristics of the network flows generated from the capture could be modified and lead to false results. In this paper, we present several flaws we identified in the labelling of the CICIDS2017 dataset and in the traffic capture, such as packet misorder, packet duplication and attack that were performed but not correctly labelled. Finally, we assess the impact of these different corrections on the evaluation of supervised intrusion detection approaches.
Published: 2022

5. A Study of Live VM Migration for Server Consolidation in Data Centers

Author: Brandwjan, Alexandre, Begin, Thomas, Castel-Taleb, Hind, Atmaca, Tülin, Jack Baskin School of Engineering (UCSC), University of California [Santa Cruz] (UC Santa Cruz), University of California (UC)-University of California (UC), Holistic Wireless Networks (hownet), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), and Télécom SudParis (TSP)
Subjects: VM migration, Server consolidation, [INFO]Computer Science [cs], Live migration, Energy performance trade-offs, Hierarchical model, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: International audience; This paper presents a theoretical study of the combined effect of Virtual Machine (VM) migration and Physical Machine (PM) consolidation on energy consumption, end-user task performance and equipment wear. Our numerical results indicate that a moderately aggressive consolidation strategy seems to be a good compromise. They indicate also the potential importance of distributional assumptions for time between VM launch requests and for VM lifetime.
Published: 2022

6. Cooperative and smart attacks detection systems in 6G-enabled Internet of Things

Author: Sedjelmaci, Hichem, Kheir, Nizar, Boudguiga, Aymen, Kaaniche, Nesrine, Département d'instrumentation Numérique (DIN (CEA-LIST)), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Sécurité et Confiance Numérique (SCN-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), and Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)
Subjects: Internet of things IoT, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 6G mobile communication, Satellite, [INFO]Computer Science [cs], Computer architecture, Technological innovation, 6G
Abstract: International audience; The Sixth Generation (6G) of mobile networks offers the promise of a global interconnected system, serving a large set of applications across multiple fields such as satellite, air, ground, and underwater networks. It will evolve towards a unified network compute fabric that facilitates convergence across ecosystems, fostering design and innovation of new Internet of Things (IoT) applications and services, further leading to an exponential growth of IoT use cases in the post-6G era. This profound evolution will also contribute to further evolving the threat landscape, adding new threat actors, and leading to a new set of cyber security challenges. This paper reviews 6G applications and analyzes their evolved security challenges and existing solutions, covering both the network, application and data layers. It introduces a new concept to security monitoring and attack detection in 6G-enabled IoT systems, leveraging on hierarchical and collaborative approaches, while also satisfying the main 6G's Key Performance Indicators (KPIs) such as trustworthiness, latency, connectivity, data rate and energy consumption. The proposed solution implements a multi-level Federated Learning (FL) approach between IoT devices and edge computing applications. As compared to current centralized security monitoring and detection solutions, it better conciliates between the attack detection accuracy and the network overhead for implementing this model. We demonstrate the use of the proposed solution through an example scenario involving an Internet of Vehicles that communicate over a 6G network.
Published: 2022

7. Towards generic quality assessment of synthetic traffic for evaluating intrusion detection systems

Author: Schoen, Adrien, Blanc, Gregory, Gimenez, Pierre-François, Han, Yufei, Majorczyk, Frédéric, Mé, Ludovic, Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE), CentraleSupélec-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), CentraleSupélec [campus de Rennes], DGA Maîtrise de l'information (DGA.MI), and Direction générale de l'Armement (DGA)
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Synthetic traffic, Intrusion detection, Data generation, Evaluation
Abstract: International audience; Network Intrusion Detection Systems (NIDSes) evaluation requires background traffic. However, real background traffic is hard to collect. We hence rely on synthetic traffic generated especially for this task. The quality of the generated traffic has to be evaluated according to some clearly defined criteria. In this paper, we show how to adapt the quality assessment solutions proposed for different fields of data generation such as image or text generation to network traffic. We summarize our study by discussing the criteria that evaluate the quality of a generated network traffic and by proposing functions to evaluate these criteria. This is the first contribution in the context of the Ph.D. thesis of Adrien Schoen.
Published: 2022

8. Detecting APT through graph anomaly detection

Author: Lanvin, Maxime, Gimenez, Pierre-François, Han, Yufei, Majorczyk, Frédéric, Mé, Ludovic, Totel, Éric, CentraleSupélec [campus de Rennes], Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE), CentraleSupélec-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), DGA Maîtrise de l'information (DGA.MI), Direction générale de l'Armement (DGA), Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), and Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Machine learning, Graph analysis, Intrusion detection, Anomaly detection
Abstract: International audience; Despite fruitful achievements made by unsupervised machine learning-based anomaly detection for network intrusion detection systems, they are still prone to the issue of high false alarm rates, and it is still difficult to reach very high recalls. In 2020, Leichtnam et al. proposed Sec2graph, an unsupervised approach applied to security objects graphs that exhibited interesting results on single-step attacks. The graph representation and the embedding allowed for better detection since it creates qualitative features. In this paper, we present new experiments to assess the performances of this approach for detecting APT attacks. We achieve better detection performances than the original work's baseline detection methods on the DAPT2020 dataset. This work is realised in the context of the Ph.D. thesis of Maxime Lanvin, which started in October 2021.
Published: 2022

9. Digital Twin for IoT Environments: A Testing and Simulation Tool

Author: Luong Nguyen, Mariana Segovia, Wissam Mallouli, Edgardo Montes de Oca, Ana R. Cavalli, Montimage (EURL) [Paris], Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Sécurité et Confiance Numérique (SCN-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), European Project: 780351,Enact, and European Project: 101021668,Precinct
Subjects: IoT, Sensors, Testing, [INFO]Computer Science [cs], Digital Twins IoT Sensors Actuators Gateway Simulation Testing, Digital Twins, Actuators, Simulation, Gateway
Abstract: International audience; Digital Twin (DT) is one of the pillars of modern information technologies that plays an important role on industry's digitalization. A DT is composed of a real physical object, a virtual abstraction of the object and a bidirectional data flow between the physical and virtual components. This paper presents a DT-based tool, called TaS, to easily test and simulate IoT environments. The objective is to improve the testing methodologies in IoT systems to evaluate the possible impact of it on the physical world. We provide the conditions to test, predict errors and stress application depending on hardware, software and real world physical process. The tool is based on the DT concept in order to detect and predict failures in evolving IoT environments. In particular, the way to prepare the DT to support fault injection and cybersecurity threats is analyzed. The TaS tool is tested through an industrial case study, the Intelligent Transport System (ITS) provided by the INDRA company. Results of experiments are presented that show that our DT is closely linked to the real world.
Published: 2022

10. Actes de la conférence CAID 2021 (Conference on Artificial Intelligence for Defense)

Author: Alexandre Dey, Benjamin Costé, Éric Totel, Adrien Bécue, Elkin Aguas, Anthony Lambert, Gregory Blanc, Hervé Debar, Yannick Chevalier, Amine Medad, Baptiste Gregorutti, Edouard Genetay, Alexandre Peter Nguema, Grégoire Menguy, Sébastien Bardin, Richard Bonichon, Cauim de de Souza Lima, Rémy Charayron, Thierry Lefèvre, Nathalie Bartoli, Joseph Morlier, Zakaria Chihani, Bruno Carron, Stephan Brunessaux, Léonard Caquot, Tristan Charrier, Badre El Bezzaz Semlali, Oudomsack Pierre Pasquero, Alexis Bazin, Pierre-Elisée Flory, Katarzyna Kapusta, Oana Stan, Vincent Thouvenot, Karel Hynek, Romain Ferrari, Aimen Boudguiga, Renaud Sirdey, Alice Héliou, Thomas Cejka, Daria La Rocca, Martin Zuber, George Vardoulias, Ioannis Papaioannou, Andreas Vekinis, Georgia Papadopoulou, Marc Vincent, Amal El Fallah-Seghrouchni, Vincent Corruble, Narayan Bernardin, Rami Kassab, Frédéric Barbaresco, Karim Tit, Teddy Furon, Mathias Rousset, Louis-Marie Traonouez, Pierre-Yves Lagrave, Vincent Vidal, Marie-Caroline Corbineau, Tugdual Ceillier, Aleksei Iancheruk, Ahmed Allali, Julien Rodriguez, Tejas Bhor, Ricardo Garcia, Jean-Eudes Guilhot-Gaudeffroy, Robert Plana, Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Airbus CyberSecurity [Rennes], Airbus CyberSecurity SAS [Élancourt], Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Orange Labs [Chatillon], Orange Labs, Télécom SudParis (TSP), Logique, Interaction, Langue et Calcul (IRIT-LILaC), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), Université Toulouse III - Paul Sabatier (UT3), LumenAI, CEA- Saclay (CEA), Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Nomadic Labs, ONERA / DTIS, Université de Toulouse [Toulouse], ONERA-PRES Université de Toulouse, Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO), Institut Clément Ader (ICA), Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-IMT École nationale supérieure des Mines d'Albi-Carmaux (IMT Mines Albi), Airbus Defence and Space [Les Mureaux], ASTRIUM, DGA Maîtrise de l'information (DGA.MI), Direction générale de l'Armement (DGA), ThereSIS lab - Thales, Thales SIX GTS France, CESNET [Prague], Czech Academy of Sciences [Prague] (CAS), Intracom Defense [Grèce] (IDE), Thales Land & Air Systems |Rennes], Systèmes Multi-Agents (SMA), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Centre international d’intelligence artificielle du Maroc (AI Movement), Université Mohammed VI Polytechnique [Ben Guerir] (UM6P), Creating and exploiting explicit links between multimedia fragments (LinkMedia), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-MEDIA ET INTERACTIONS (IRISA-D6), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), SIMulation pARTiculaire de Modèles Stochastiques (SIMSMART), Institut de Recherche Mathématique de Rennes (IRMAR), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Thales Research and Technology [Palaiseau], THALES [France], Preligens [Paris], Assystem France, and ANR-11-LABX-0020,LEBESGUE,Centre de Mathématiques Henri Lebesgue : fondements, interactions, applications et Formation(2011)
Subjects: Artificial intelligence, Defence, Intelligence artificielle, Défense, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: 6th European Cyber Week (6ème semaine européenne de la cybersécurité et de la cyberdéfense)
Published: 2021

11. Towards inference delivery networks: distributing machine learning with optimality guarantees

Author: Fabio Pianese, Andrea Araldo, Giovanni Neglia, Tareq Si Salem, Gabriele Castellano, Université Côte d'Azur (UCA), Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Nokia Bell Labs [Paris-Saclay], Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), and Département Réseaux et Services de Télécommunications (RST)
Subjects: Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, Computer science, business.industry, Distributed computing, Node (networking), Inference, 020206 networking & telecommunications, Cloud computing, 02 engineering and technology, Dynamic priority scheduling, Computer Science - Networking and Internet Architecture, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Data center, [INFO]Computer Science [cs], Enhanced Data Rates for GSM Evolution, Heuristics, business, Information exchange
Abstract: An increasing number of applications rely on complex inference tasks that are based on machine learning (ML). Currently, there are two options to run such tasks: either they are served directly by the end device (e.g., smartphones, IoT equipment, smart vehicles), or offloaded to a remote cloud. Both options may be unsatisfactory for many applications: local models may have inadequate accuracy, while the cloud may fail to meet delay constraints. In this paper, we present the novel idea of \emph{inference delivery networks} (IDNs), networks of computing nodes that coordinate to satisfy ML inference requests achieving the best trade-off between latency and accuracy. IDNs bridge the dichotomy between device and cloud execution by integrating inference delivery at the various tiers of the infrastructure continuum (access, edge, regional data center, cloud). We propose a distributed dynamic policy for ML model allocation in an IDN by which each node dynamically updates its local set of inference models based on requests observed during the recent past plus limited information exchange with its neighboring nodes. Our policy offers strong performance guarantees in an adversarial setting and shows improvements over greedy heuristics with similar complexity in realistic scenarios.
Published: 2021

12. Machine Learning Application to Priority Scheduling in Smart Microgrids

Author: Florence Ossart, Hossam Afifi, Hassine Moungla, Jordi Badosa, Aicha Dridi, Ahmed E. Kamal, Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Laboratoire d'Informatique Paris Descartes (LIPADE (URP_2517)), Université Paris Cité (UPCité), Institut Pierre-Simon-Laplace (IPSL (FR_636)), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-École polytechnique (X)-Centre National d'Études Spatiales [Toulouse] (CNES)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), Laboratoire de Météorologie Dynamique (UMR 8539) (LMD), Institut national des sciences de l'Univers (INSU - CNRS)-École polytechnique (X)-École des Ponts ParisTech (ENPC)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Département des Géosciences - ENS Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Laboratoire Génie électrique et électronique de Paris (GeePs), CentraleSupélec-Sorbonne Université (SU)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Iowa State University (ISU), Département Réseaux et Services de Télécommunications (RST), Université de Paris (UP), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-École polytechnique (X)-Centre National d'Études Spatiales [Toulouse] (CNES)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université de Paris (UP), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS Paris)
Subjects: Optimization, Energy management, Computer science, Heuristic (computer science), Smart microgrid, Distributed computing, Scheduling (production processes), Bin packing (BP), Artificial intelligence (AI), 01 natural sciences, 7. Clean energy, 010305 fluids & plasmas, Scheduling (computing), 03 medical and health sciences, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], 0103 physical sciences, Production (economics), 030304 developmental biology, 0303 health sciences, Artificial neural network, business.industry, Heuristic, Bin packing problem, Priority scheduling, Renewable energy, Deep learning (DL), Long short-term memory (LSTM), Microgrid, business
Abstract: International audience; The need to integrate flexible and intelligent mechanisms for energy management becomes a necessity. In this paper, we are considering a microgrid with infrastructures having production capacities and consumption needs. Several data and constraints related to the microgrid consumption have been collected, in addition to data concerning the production of renewable energy from Photovoltaic panels (PV). Data history is used as input to a neural network to predict one day ahead of consumption and production. Then, a prioritized scheduling family of algorithms is presented. First, we introduce a mathematical formulation to our problem. Then, we propose various scenarios that go from an exact solution to heuristic-based use cases, including scheduling of several energy classes with a maximum scheduling time lapse. Results show that prioritized scheduling, including time lapse based on predictions, can give more reliable results than scheduling based on bin packing.
Published: 2020

13. A two phase investment game for competitive opinion dynamics in social networks

Author: Walid Ben-Ameur, Swapnil Dhamal, Tijani Chahed, Eitan Altman, Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Département Réseaux et Services Multimédia Mobiles (RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), This work is partly supported by CEFIPRA grant No. IFC/DST-Inria-2016-01/448 'Machine Learning for Network Analytics, MALENA, Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: FOS: Computer and information sciences, 0209 industrial biotechnology, Mathematical optimization, Two phases, Computer science, 02 engineering and technology, Library and Information Sciences, Management Science and Operations Research, Social networks, Nash equilibrium, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], symbols.namesake, 020901 industrial engineering & automation, Order (exchange), 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Media Technology, Katz centrality, Time complexity, Opinion dynamics, Social and Information Networks (cs.SI), [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Node (networking), Computer Science - Social and Information Networks, Investment (macroeconomics), Computer Science Applications, Zero-sum game, Key (cryptography), symbols, Zero-sum games, Information Systems
Abstract: International audience; We propose a setting for two-phase opinion dynamics in social networks, where a node's final opinion in the first phase acts as its initial biased opinion in the second phase. In this setting, we study the problem of two camps aiming to maximize adoption of their respective opinions, by strategically investing on nodes in the two phases. A node's initial opinion in the second phase naturally plays a key role in determining the final opinion of that node, and hence also of other nodes in the network due to its influence on them. However, more importantly, this bias also determines the effectiveness of a camp's investment on that node in the second phase. In order to formalize this two-phase investment setting, we propose an extension of Friedkin-Johnsen model, and hence formulate the utility functions of the camps. We arrive at a decision parameter which can be interpreted as two-phase Katz centrality. There is a natural tradeoff while splitting the available budget between the two phases. A lower investment in the first phase results in worse initial biases in the network for the second phase. On the other hand, a higher investment in the first phase spares a lower available budget for the second phase, resulting in an inability to fully harness the influenced biases. We first analyze the non-competitive case where only one camp invests, for which we present a polynomial time algorithm for determining an optimal way to split the camp's budget between the two phases. We then analyze the case of competing camps, where we show the existence of Nash equilibrium and that it can be computed in polynomial time under reasonable assumptions. We conclude our study with simulations on real-world network datasets, in order to quantify the effects of the initial biases and the weightage attributed by nodes to their initial biases, as well as that of a camp deviating from its equilibrium strategy. Our main conclusion is that, if nodes attribute high weightage to their initial biases, it is advantageous to have a high investment in the first phase, so as to effectively influence the biases to be harnessed in the second phase.
Published: 2020

14. Diet-ESP: IP layer security for IoT

Author: Maryline Laurent, Tobias Guggemos, Sylvain Killian, Daniel Migault, Guy Pujolle, Jean Philippe Wary, Ericsson Security Research, Ericsson Universal Delivery Network, Ludwig-Maximilians-Universität München (LMU), Université Pierre et Marie Curie - Paris 6 (UPMC), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Orange Labs [Issy les Moulineaux], France Télécom, and Département Réseaux et Services de Télécommunications (RST)
Subjects: IoT, Computer Networks and Communications, Computer science, computer.internet_protocol, 02 engineering and technology, Performances, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0202 electrical engineering, electronic engineering, information engineering, Bandwidth (computing), Overhead (computing), ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS, Safety, Risk, Reliability and Quality, ESP, Network packet, business.industry, Frame (networking), Payload (computing), Compression, Byte, 020206 networking & telecommunications, IP tunnel, Diet-ESP, EHC, Hardware and Architecture, IPsec, Security, 020201 artificial intelligence & image processing, business, computer, Software, Computer network
Abstract: International audience; The number of devices connected through the Internet of Things (IoT) will significantly grow in the next few years while security of their interconnections is going to be a major challenge. For many devices in IoT scenarios, the necessary resources to send and receive bytes are extremely high and when such devices are powered with battery the amount of exchanged bytes directly impacts their life time. As a result, compression of existing protocols is a widely accepted technique to make IoT benefit from the protocols developed over the last decades. This paper presents ESP Header Compression (EHC), a framework that enables compression of packets protected with Encapsulating Security Payload (ESP). EHC is composed of EHC Rules, targeting the compression of a specific field and organized according to EHC Strategies. Further, the paper presents Diet-ESP, an EHC Strategy that highly reduces the networking overhead of ESP packets to address the IoT security and bandwidth requirements. Diet-ESP results in sending fewer bytes over the network which in turn reduces the number of required radio frames and thus battery consumption. For example, 10 byte application data on IEEE 802.15.4 radio networks secured with the standard ESP requires sending an additional frame, resulting into a 95% energy overhead compared to the unprotected data. In contrast, Diet-ESP results only in a 3% overhead compared to unprotected data. Diet-ESP remains fully security compliant to ESP and performs better than any other compression framework as far as ESP is considered. However, as some compression needs to be performed inside the ESP stack the implementation of EHC requires modifying the ESP protocol
Published: 2017

15. A stochastic game framework for analyzing computational investment strategies in distributed computing

Author: Dhamal, Swapnil, Ben-Ameur, Walid, Chahed, Tijani, Altman, Eitan, Sunny, Albert, Poojary, Sudheer, Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris), Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services de Télécommunications (TSP - RST), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), MALENA, Département Réseaux et Services Multimédia Mobiles (RS2M), and Département Réseaux et Services de Télécommunications (RST)
Subjects: FOS: Computer and information sciences, Computer Science::Computer Science and Game Theory, Computer Science - Distributed, Parallel, and Cluster Computing, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], Computer Science - Computer Science and Game Theory, [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], Computer Science - Multiagent Systems, Distributed, Parallel, and Cluster Computing (cs.DC), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Computer Science and Game Theory (cs.GT), Multiagent Systems (cs.MA)
Abstract: We study a stochastic game framework with dynamic set of players, for modeling and analyzing their computational investment strategies in distributed computing. Players obtain a certain reward for solving the problem or for providing their computational resources, while incur a certain cost based on the invested time and computational power. We first study a scenario where the reward is offered for solving the problem, such as in blockchain mining. We show that, in Markov perfect equilibrium, players with cost parameters exceeding a certain threshold, do not invest; while those with cost parameters less than this threshold, invest maximal power. Here, players need not know the system state. We then consider a scenario where the reward is offered for contributing to the computational power of a common central entity, such as in volunteer computing. Here, in Markov perfect equilibrium, only players with cost parameters in a relatively low range in a given state, invest. For the case where players are homogeneous, they invest proportionally to the `reward to cost' ratio. For both the scenarios, we study the effects of players' arrival and departure rates on their utilities using simulations and provide additional insights.
Published: 2019

16. Optimal investment strategies for competing camps in a social network: a broad framework

Author: Walid Ben-Ameur, Eitan Altman, Tijani Chahed, Swapnil Dhamal, Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Polytechnique de Paris (IP Paris), Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), MALENA, Département Réseaux et Services de Télécommunications (RST), and Département Réseaux et Services Multimédia Mobiles (RS2M)
Subjects: FOS: Computer and information sciences, 0209 industrial biotechnology, Physics - Physics and Society, Computer Networks and Communications, Investment strategy, Population, 0211 other engineering and technologies, FOS: Physical sciences, 02 engineering and technology, Physics and Society (physics.soc-ph), Stackelberg game, Elections, Social networks, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Quantitative Biology::Cell Behavior, Microeconomics, 020901 industrial engineering & automation, Stackelberg competition, education, Opinion dynamics, Social and Information Networks (cs.SI), education.field_of_study, 021103 operations research, Social network, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], business.industry, Node (networking), Computer Science - Social and Information Networks, Decision under uncertainty, Investment (macroeconomics), Computer Science Applications, Zero-sum game, Control and Systems Engineering, Common coupled constraints, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], business, Game theory, Zero-sum games
Abstract: We study the problem of optimally investing in nodes of a social network in a competitive setting, wherein two camps aim to drive the average opinion of the population in their own favor. Using a well-established model of opinion dynamics, we formulate the problem as a zero-sum game with its players being the two camps. We derive optimal investment strategies for both camps, and show that a random investment strategy is optimal when the underlying network follows a popular class of weight distributions. We study a broad framework, where we consider various well-motivated settings of the problem, namely, when the influence of a camp on a node is a concave function of its investment on that node, when a camp aims at maximizing competitor's investment or deviation from its desired investment, and when one of the camps has uncertain information about the values of the model parameters. We also study a Stackelberg variant of this game under common coupled constraints on the combined investments by the camps and derive their equilibrium strategies, and hence quantify the first-mover advantage. For a quantitative and illustrative study, we conduct simulations on real-world datasets and provide results and insights., Comment: The original version of this paper is accepted for publication in IEEE Transactions on Network Science and Engineering. The copyright for this article belongs to IEEE
Published: 2019

17. MOOC Sécurité des réseaux: un apprentissage massif de la sécurité par la théorie et la pratique

Author: Maryline Laurent, Olivier Paul, Gregory Blanc, Bruno Carron, Nicolas Charbonnier, Isabelle Chrisment, Jérôme François, Damien Hotz, Philippe Jaillon, Rida Khatoun, Christophe Kiennert, Marwan Lazrag, Souha Masmoudi, Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Airbus Defence and Space [Les Mureaux], ASTRIUM, Agence nationale de la sécurité des systèmes d'information (ANSSI), TELECOM Nancy, Université de Lorraine (UL), Resilience and Elasticity for Security and ScalabiliTy of dynamic networked systems (RESIST), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT), Institut Henri Fayol (FAYOL-ENSMSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Département Informatique et systèmes intelligents ( FAYOL-ENSMSE), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE), Département Systèmes et Architectures Sécurisés (SAS-ENSMSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-CMP-GC, Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Réseaux et Services de Télécommunications (RST), Airbus Defence and Space, Airbus Group, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Département Informatique pour les Systèmes Coopératifs Ouverts et Décentralisés (ISCOD-ENSMSE), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut Henri Fayol
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Mooc
Abstract: International audience; Le MOOC Sécurité des Réseaux, destiné à l’apprentissage massif à distance de la sécurité dans les réseaux informatiques, s’adresse à un public ayant des prérequis légers en informatique et des prérequis plus solides en réseaux (DNS, adressage, routage, ARP, ICMP). Il vise sur 5 semaines, à raison de 5h par semaine environ, à connaître, comprendre, pratiquer, mettre en oeuvre et/ou configurer plusieurs aspects clés de la sécurité dans les réseaux, telles que les menaces, les attaques réseaux, les techniques de filtrage, les VPNs, la détection d’intrusions, les architectures de sécurité, l’analyse de risques, les textes réglementaires, les normes, l’audit, etc. Grâce aux nombreux travaux pratiques proposés dans une machine virtuelle (environnement Docker sous GNU/Linux), les apprenants sont amenés à expérimenter les menaces (ex : ICMPredirect, ARP spoofing, détournement de session TCP), et à configurer plusieurs mécanismes de sécurité classiques (filtrage, VLAN, NAT, IPsec, TLS, IDS/IPS, certificats électroniques). L’originalité de ce MOOC tient dans le champ thématique restreint à la sécurité des réseaux,un niveau d’expertise élevé pour un apprentissage à distance, et l’offre conséquente de TPs proposés
Published: 2019

18. Reinforcement learning approach for Advanced Sleep Modes management in 5G networks

Author: Azeddine Gati, Eitan Altman, Tijani Chahed, Fatma Ezzahra Salem, Zwi Altman, Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Orange Labs [Chatillon], Orange Labs, Centre National de la Recherche Scientifique (CNRS), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Network Engineering and Operations (NEO ), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Computer science, 05 social sciences, 050801 communication & media studies, 020206 networking & telecommunications, 02 engineering and technology, Energy consumption, Constraint (information theory), Reduction (complexity), Base station, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, Control theory, 0202 electrical engineering, electronic engineering, information engineering, Reinforcement learning, Energy (signal processing), 5G
Abstract: International audience; Advanced Sleep Modes (ASMs) correspond to a gradual deactivation of the Base Station (BS)'s components in order to reduce its Energy Consumption (EC). Different levels of Sleep Modes (SMs) can be considered according to the transition time (deactivation and activation durations) of each component. We propose in this paper a management solution for ASMs based on Q-learning approach. The target is to find the optimal durations for each SM level according to the requirements of the network operator in terms of EC reduction and delay constraints. The proposed solution shows that even with a high constraint on the delay, we can achieve high energy savings (almost 57% of EC reduction) without inducing any impact on the delay. When the delay constraint is relaxed, we can achieve up to almost 90% of energy savings
Published: 2018

19. Resource Allocation Polytope Games: Uniqueness of Equilibrium, Price of Stability, and Price of Anarchy

Author: Swapnil Dhamal, Ben-Ameur, W., Chahed, T., Altman, E., Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Département Réseaux et Services Multimédia Mobiles (RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services de Télécommunications (RST), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), MALENA, Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Département Réseaux et Services de Télécommunications (TSP - RST), and Dhamal, Swapnil
Subjects: [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], ComputingMilieux_PERSONALCOMPUTING, TheoryofComputation_GENERAL, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.1: Applications and Expert Systems/I.2.1.1: Games, [INFO.INFO-MA] Computer Science [cs]/Multiagent Systems [cs.MA], General Medicine, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.11: Distributed Artificial Intelligence/I.2.11.3: Multiagent systems, ACM: K.: Computing Milieux/K.6: MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS/K.6.2: Installation Management/K.6.2.4: Pricing and resource allocation
Abstract: We consider a two-player resource allocation polytope game, in which the strategy of a player is restricted by the strategy of the other player, with common coupled constraints. With respect to such a game, we formally introduce the notions of independent optimal strategy profile, which is the profile when players play optimally in the absence of the other player; and common contiguous set, which is the set of top nodes in the preference orderings of both the players that are exhaustively invested on in the independent optimal strategy profile. We show that for the game to have a unique PSNE, it is a necessary and sufficient condition that the independent optimal strategies of the players do not conflict, and either the common contiguous set consists of at most one node or all the nodes in the common contiguous set are invested on by only one player in the independent optimal strategy profile. We further derive a socially optimal strategy profile, and show that the price of anarchy cannot be bound by a common universal constant. We hence present an efficient algorithm to compute the price of anarchy and the price of stability, given an instance of the game. Under reasonable conditions, we show that the price of stability is 1. We encounter a paradox in this game that higher budgets may lead to worse outcomes.
Published: 2018

20. A study of systems with multiple operating levels, probabilistic thresholds and hysteresis

Author: Alexandre Brandwajn, Tulin Atmaca, Thomas Begin, Hind Castel-Taleb, University of California [Santa Cruz] (UCSC), University of California, Dynamic Networks : Temporal and Structural Capture Approach (DANTE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Institut Rhône-Alpin des systèmes complexes (IXXI), École normale supérieure - Lyon (ENS Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010), ANR-12-MONU-0019,MARMOTE,Outils et environnements de modélisation markovienne(2012), University of California [Santa Cruz] (UC Santa Cruz), University of California (UC), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), École normale supérieure de Lyon (ENS de Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Département Réseaux et Services de Télécommunications (TSP - RST), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Institut Rhône-Alpin des systèmes complexes (IXXI)
Subjects: Steady state (electronics), Computer science, 02 engineering and technology, 01 natural sciences, Multiple operating levels, 010104 statistics & probability, Control theory, Server, 0202 electrical engineering, electronic engineering, information engineering, Probabilistic thresholds, Resource management, [INFO]Computer Science [cs], 0101 mathematics, Steady state, Level of service, Hysteresis, Probabilistic logic, 020206 networking & telecommunications, Workload, Energy consumption, Function (mathematics), Multi-server systems, Computational Theory and Mathematics, Hardware and Architecture, Signal Processing, Activation delays, General arrivals, Energy (signal processing)
Abstract: International audience; Current architecture of many computer systems relies on dynamic allocation of a pool of resources according to workload conditions to meet specific performance objectives while minimizing cost (e.g., energy or billing). In such systems, different levels of operation may be defined, and switching between operating levels occurs at certain thresholds of system congestion. To avoid rapid oscillations between levels of service, " hysteresis " is introduced by using different thresholds for increasing and decreasing workload levels, respectively. We propose a model of such systems with general arrivals, arbitrary number of servers and operating levels where each higher operating level may correspond to an arbitrary number of additional servers and soft (i.e. non-deterministic) thresholds to account for " inertia " in switching between operating levels. In our model, request service times are assumed to be memoryless and server processing rates may be a function of the current operating level and of the number of requests (users) in the system. Additionally, we allow for delays in the activation of additional operating levels. We use simple mathematics to obtain a semi-numerical solution of our model. We illustrate the versatility of our model using several case study examples inspired by features of real systems. In particular, we explore optimal thresholds as a tradeoff between performance and energy consumption
Published: 2018

21. Information and communications security: 20th International Conference, ICICS 2018, Lille, France, October 29-31, 2018, Proceedings

Author: Naccache, David, Xu, Shouhuai, Qing, Sihan, Samarati, Pierangela, Blanc, Gregory, Lu, Rongxing, Zhang, Zonghua, Meddahi, Ahmed, Télécom SudParis & Institut Mines-Télécom Business School, Médiathèque, Lecture Notes in Computer Science, Security and Cryptology, 11149, Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), The University of Texas at San Antonio (UTSA), Chinese Academy of Sciences [Beijing] (CAS), Dipartimento di Informatica Sistemistica e Comunicazione (DISCo), Università degli Studi di Milano-Bicocca = University of Milano-Bicocca (UNIMIB), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), University of New Brunswick (UNB), Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Lille Douai), Institut Mines-Télécom [Paris] (IMT), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Università degli Studi di Milano-Bicocca [Milano] (UNIMIB), and Département Réseaux et Services de Télécommunications (RST)
Subjects: Internet, Authentication, Software engineering, Computer Crime, Encryption, Network security, Cloud Computing, Computer systems, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Privacy, Security systems, Artificial Intelligence, Electronic document identification systems, Structural design, Cryptography, Wireless telecommunication systems, Public key cryptography, Data security, Data privacy, Computer networks, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract: International audience; This book constitutes the refereed proceedings of the 20th International Conference on Information and Communications Security, ICICS 2018, held in Lille, France, in October 2018. The 39 revised full papers and 11 short papers presented were carefully selected from 202 submissions. The papers are organized in topics on blockchain technology, malware, botnet and network security, real-world cryptography, encrypted computing, privacy protection, signature schemes, attack analysis and detection, searchable encryption and identity-based cryptography, verifiable storage and computing, applied cryptography, supporting techniques, formal analysis and cryptanalysis, attack detection, and security management
Published: 2018

22. Risks and security of internet and systems : 12th international conference, CRiSIS 2017, Dinard, France, September 19-21, 2017, revised selected papers

Author: Cuppens-Bouhlahia, Nora, Cuppens, Frédéric, Lanet, Jean-Louis, Legay, Axel, Garcia-Alfaro, Joaquin, Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Laboratoire de Haute Sécurité (LHS - Inria), Institut National de Recherche en Informatique et en Automatique (Inria)-Direction générale de l'Armement (DGA), Threat Analysis and Mitigation for Information Security (TAMIS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Centre National de la Recherche Scientifique (CNRS), Lecture Notes in Computer Science (vol. 10694), IMT Atlantique (IMT Atlantique), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Département Réseaux et Services de Télécommunications (TSP - RST), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1)
Subjects: Authentication, Mitigation and countermeasures, Computer crime, Formal methods, [INFO.INFO-WB]Computer Science [cs]/Web, Vulnerability analysis, System security, Network security, Security protocols, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Privacy, Cloud security, Cryptography, Intrusion detection systems, Access control, Blockchain technologies
Abstract: International audience; This book constitutes the revised selected papers from the 12th International Conference on Risk and Security of Internet and Systems, CRISIS 2017, held in Dinard, France, in September 2017.The 12 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 42 submissions. They cover diverse research themes, ranging from classic topics, such as vulnerability analysis and classification; apps security; access control and filtering; cloud security; cyber-insurance and cyber threat intelligence; human-centric security and trust; and risk analysis
Published: 2018

23. Securely outsourcing the ciphertext-policy attribute-based encryption

Author: Kim Nguyen, Nouha Oualha, Maryline Laurent, Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Laboratoire d'Intégration des Systèmes et des Technologies (LIST), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Centre National de la Recherche Scientifique (CNRS), Département Intelligence Ambiante et Systèmes Interactifs (DIASI), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Plaintext-aware encryption, Computer Networks and Communications, Computer science, Access control, 02 engineering and technology, Data_CODINGANDINFORMATIONTHEORY, computer.software_genre, Encryption, Computer security, Disk encryption hardware, Public-key cryptography, Multiple encryption, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Email encryption, Ciphertext, 0202 electrical engineering, electronic engineering, information engineering, Security rules, Secure outsourcing, business.industry, Sensors, Authorization, Client-side encryption, 020207 software engineering, Adversary, Disk encryption theory, C program, Bus encryption, Deterministic encryption, Disk encryption, Hardware and Architecture, Probabilistic encryption, Privacy, 40-bit encryption, 56-bit encryption, Keyfile, 020201 artificial intelligence & image processing, Attribute-based encryption, Link encryption, On-the-fly encryption, business, computer, Software
Abstract: Attribute-based Encryption (ABE) is a new and promising public key encryption that allows fine-grained authorization on data based on user attributes. Such property is favorable for multiple applications that require encrypted storage or access control on data, in particular: eHealth applications. However, ABE schemes are known not to be efficient in the encryption phase because ciphertext size and the time required to encrypt grow with the complexity of the access policy. Such drawback is critical in the context of pervasive computing, for instance, in the Internet of Things, where data producers are usually resource-constrained devices, e.g. smart phones or sensing platforms. In this work, we propose OEABE standing for Outsourcing mechanism for the Encryption of Ciphertext-Policy ABE (CP-ABE). We show how a user can offload expensive operations of CP-ABE encryption to a semi-trusted party in a secure manner. Our proposed mechanism requires only one exponentiation on resource-constrained devices. We provide also an informal security analysis of possible attacks from a semi-honest adversary against the proposed solution. To demonstrate the performance gains of our mechanism, we first conducted a performance estimation on an emulated Wismote sensor platform. Then, we implemented our proposal and did comparison to an existing implementation of CP-ABE on a laptop.
Published: 2018

24. Manipulating opinion dynamics in social networks in two phases

Author: Dhamal, Swapnil, Ben-Ameur, Walid, Chahed, Tijani, Altman, Eitan, Dhamal, Swapnil, Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire Informatique d'Avignon (LIA), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Département Réseaux et Services Multimédia Mobiles (RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services de Télécommunications (RST), Laboratory of Information, Network and Communication Sciences (LINCS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)-Sorbonne Université (SU), MALENA, Institut Mines-Telecom, Télécom SudParis, université Paris Saclay, CNRS UMR 5157 SAMOVAR, TELECOM SudParis, Network Engineering and Operations ( NEO ), Inria Sophia Antipolis - Méditerranée ( CRISAM ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ), Laboratoire Informatique d'Avignon ( LIA ), Université d'Avignon et des Pays de Vaucluse ( UAPV ) -Centre d'Enseignement et de Recherche en Informatique - CERI, Département Réseaux et Services Multimédia Mobiles ( RS2M ), Institut Mines-Télécom [Paris]-Télécom SudParis ( TSP ), Département Réseaux et Services de Télécommunications ( RST ), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: [ INFO.INFO-SI ] Computer Science [cs]/Social and Information Networks [cs.SI], [ INFO.INFO-GT ] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI]
Abstract: International audience; We propose a setting for two-phase opinion dynamics in social networks, where the final opinion of a node in the first phase acts as its initial biased opinion in the second phase. In this setting, we study the problem of two camps aiming to maximize adoption of their respective opinions by strategically investing on nodes, where the effectiveness of a camp's investment on a node depends on the node's initial bias. We propose an extension of Friedkin-Johnsen model for our setting, and hence formulate the utility functions of the camps. For the non-competitive case where only one camp invests, we present a polynomial time algorithm for determining an optimal way to split the camp's budget between the two phases. For the case of competing camps, we show the existence of Nash equilibria under reasonable assumptions, and that they can be computed in polynomial time. Our main conclusion is that, if nodes attribute high weightage to their initial biases, it is advantageous to have a high investment in the first phase, so as to exploit the manipulated biases in the second phase.
Published: 2018

25. Detection of intrusions and malware, and vulnerability assessment : 5th international conference, DIMVA 2018, Saclay, France, June 28-29, 2018, proceedings

Author: Giuffrida, Cristiano, Bardin, Sébastien, Blanc, Gregory, Department of Computer Science [Amsterdam], Vrije Universiteit Amsterdam [Amsterdam] (VU), Département Ingénierie Logiciels et Systèmes (DILS), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Lecture Notes in Computer Science (vol. 10885), Security and Cryptology (vol. 10885), Laboratoire d'Intégration des Systèmes et des Technologies (LIST), and Département Réseaux et Services de Télécommunications (RST)
Subjects: Malware and its mitigation, Computer crime, Network security, Attacks, Computer operating systems, Security and privacy for big data, Malware, Security protocols, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Privacy, Cryptography, Virtualization and security, Security and privacy metrics, Anonymity, Web security, Data security
Abstract: International audience; This book constitutes the refereed proceedings of the 15th International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment, DIMVA 2018, held in Saclay, France, in June 2018. The 17 revised full papers and 1 short paper included in this book were carefully reviewed and selected from 59 submissions. They present topics such as malware analysis; mobile and embedded security; attacks; detection and containment; web and browser security; and reverse engineering
Published: 2018

26. A Framework for Optimal Investment Strategies for Competing Camps in a Social Network

Author: Dhamal, Swapnil, Ben-Ameur, Walid, Chahed, Tijani, Altman, Eitan, Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Laboratoire Informatique d'Avignon (LIA), Centre d'Enseignement et de Recherche en Informatique - CERI-Avignon Université (AU), Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services Multimédia Mobiles (RS2M), Département Réseaux et Services de Télécommunications (RST), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Département Réseaux et Services de Télécommunications (TSP - RST), and Dhamal, Swapnil
Subjects: [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], decision under uncertainty, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], opinion dynamics, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], common coupled constraints, multiple phases, Social networks, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI]
Abstract: International audience; Opinion dynamics is a natural and well-known phenomenon in a system of cognitive agents, and is a well-studied topic across several disciplines. We study the problem of optimally investing in nodes of a social network in a competitive setting, wherein two camps attempt to maximize adoption of their opinions by the population. This problem is highly relevant to applications such as elections, viral marketing, propagation of ideas or behaviors, etc. In particular, we propose an extension of the popular DeGroot-Friedkin model, show its convergence, and hence formulate the problem as a zero-sum game, where the players are the two camps and their strategies are the amounts to be invested on each node of the social network. We consider several settings, namely, when the influence of a camp on a node is a concave function of its investment on that node, when one of the camps has uncertain information about the values of the model parameters, and when a camp aims at maximizing competitor's investment required to drive the average opinion in its favor. We also study this game under common coupled constraints concerning the combined investment of the camps on each node, and analytically derive the optimal investment strategies of both the camps. The introduction of common coupled constraints results in maxmin value to be greater than or equal to the minmax value, an opposite inequality to the case of general functions; this can be perceived as a consequence of the first mover advantage in our game. We further study the possibility of campaigning in multiple phases, where the final opinion of a node in a phase acts as its initial bias for the next phase. We show that the utility functions of the two camps involve what can be interpreted as a multiphase version of Katz centrality. Focusing on opinion dynamics in two phases, we analyze their optimal investment strategies and derive the extent of loss that a camp would incur if it acted myopically. We then look at the setting in which a camp's influence on a node depends on the node's initial bias, for which we present a polynomial time algorithm for optimally splitting the budget between the two phases. We conduct a simulation study on real-world social networks for all the considered settings.
Published: 2017

27. Analysis of performance and energy consumption in the cloud

Author: Emmanuel Hyon, Farah Aït-Salaht, Hind Castel-Taleb, Mohamed Mehdi Kandi, Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Économie et Statistique (CREST), Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI)-École polytechnique (X)-École Nationale de la Statistique et de l'Administration Économique (ENSAE Paris)-Centre National de la Recherche Scientifique (CNRS), Recherche Opérationnelle (RO), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Université Paris Nanterre (UPN), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Mathematical optimization, 021103 operations research, Markov chain, Computer science, business.industry, Computation, 0211 other engineering and technologies, 020207 software engineering, Cloud computing, 02 engineering and technology, Energy consumption, computer.software_genre, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], Virtual machine, Server, 0202 electrical engineering, electronic engineering, information engineering, Probability distribution, business, computer, Block (data storage)
Abstract: International audience; We analyze here a cloud system represented by hysteresis multi server queueing system. It is characterized by forward and backward thresholds for activation and deactivation of block of servers representing a set of VMs (Virtual Machines). The system is represented by a complex Markov Chain which is difficult to analyse when the size of the system is huge. We propose both analytical and numerical mathematical methods for deriving the steady-state probability distribution. We compute then performance and energy consumption measures and we define an overall cost taking into account both aspects. We compare the proposed methods with respect to the computation time and we analyse the impact of some parameters on the behaviour of the system
Published: 2017

28. A game theoretical real options framework for investment decisions in mobile TV infrastructure

Author: Yezekael Hayel, Amal Abdel Razzac, Tijani Chahed, Linda Salahaldin, Salah Eddine Elayoubi, Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Centre National de la Recherche Scientifique (CNRS), Département Management, Marketing et Stratégie (IMT-BS - MMS), Télécom Ecole de Management (TEM)-Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom Business School (IMT-BS), Institut Mines-Télécom [Paris] (IMT), Laboratoire en Innovation, Technologies, Economie et Management (EA 7363) (LITEM), Université d'Évry-Val-d'Essonne (UEVE)-Télécom Ecole de Management (TEM), Orange Labs [Issy les Moulineaux], France Télécom, Avignon Université (AU), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), and Département Management, Marketing et Stratégie (MMS)
Subjects: Service (systems architecture), Operations research, Computer science, 0211 other engineering and technologies, Ocean Engineering, 02 engineering and technology, Management Science and Operations Research, Competition (economics), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Digital Video Broadcasting, 0202 electrical engineering, electronic engineering, information engineering, Bi-level programming, Marketing, DVB-NGH, Real option, 021103 operations research, Competition, Profit maximization, Quality of service, Uncertainty, 020206 networking & telecommunications, Investment (macroeconomics), Mobile TV, LTE, Cooperation, Investment decisions, Cellular network
Abstract: HCERES C, ABS 1; International audience; This work presents a strategic investment framework for mobile TV infrastructure. We address the question of whether an operator should enter the mobile TV market and, if yes, how and when to do so. We perform a capacity and QoS analysis that shows that Mobile TV is not a simple added-on service but requires new planning strategies that need heavy investments. We consider two possible settings: a competitive mobile TV network where a digital video broadcasting (DVB) operator and a cellular network operator build their independent networks and a cooperative setting where the TV network is mainly relying on a DVB infrastructure whose coverage can be complemented by a cellular network. Two main issues alter the investment decision of the stakeholders, namely, the market uncertainty and the competition or the willingness of cooperation between the main technological players. We define a game theoretical real options framework and propose a novel bi-level dynamic programming algorithm that solves the underlying profit maximization problem. Our numerical results illustrate the optimal investment decisions of both actors and the impact of the system parameters as well as the degree of uncertainty on the investment dates
Published: 2017

29. Stochastic bounds for switched Bernoulli batch arrivals observed through measurements

Author: Jean-Michel Fourneau, Nihal Pekergin, Farah Aït-Salaht, Hind Castel-Taleb, Recherche Opérationnelle (RO), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Mathematical optimization, Computational complexity theory, Computer science, Quality of service, 020206 networking & telecommunications, 02 engineering and technology, 01 natural sciences, Stochastic ordering, Switched batch bernoulli process, 010104 statistics & probability, Bernoulli's principle, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], Histogram, 0202 electrical engineering, electronic engineering, information engineering, Applied mathematics, Transient (computer programming), 0101 mathematics, Queue
Abstract: International audience; We generalise to non stationary traffics an approach that we have previously proposed to derive performance bounds of a queue under histogram-based input traffics. We use strong stochastic ordering to derive stochastic bounds on the queue length and the output traffic. These bounds are valid for transient distributions of these measures and also for the steady-state distributions when they exist. We provide some numerical techniques under arrivals modelled by a Switched Batch Bernoulli Process (SBBP). Unlike approximate methods, these bounds can be used to check if the Quality of Service constraints are satisfied or not. Our approach provides a tradeoff between the accuracy of results and the computational complexity and it is much faster than the histogram-based simulation proposed in the literature
Published: 2017

30. A Zero-sum Game for Opinion Dynamics in a Social Network with Competing Camps

Author: Dhamal, Swapnil, Ben-Ameur, Walid, CHAHED, Tijani, Altman, Eitan, Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Laboratoire Informatique d'Avignon (LIA), Centre d'Enseignement et de Recherche en Informatique - CERI-Avignon Université (AU), Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services Multimédia Mobiles (RS2M), Département Réseaux et Services de Télécommunications (RST), Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI, Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Département Réseaux et Services de Télécommunications (TSP - RST), and Dhamal, Swapnil
Subjects: [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], ComputingMilieux_MISCELLANEOUS, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI]
Abstract: International audience
Published: 2017

31. Compromis entre énergie et performance dans le cloud

Author: Kandi, Mohamed, Ait Salaht, Farah, Castel-Taleb, Hind, Hyon, Emmanuel, Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (TSP - RST), Centre National de la Recherche Scientifique (CNRS), Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI), Recherche Opérationnelle (RO), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Université Paris Nanterre (UPN), ANR-12-MONU-0019,MARMOTE,Outils et environnements de modélisation markovienne(2012), and Département Réseaux et Services de Télécommunications (RST)
Subjects: Performances, Optimisation, [INFO]Computer Science [cs], Cloud, Energie, Politique hystérésis, Files d'attente
Abstract: International audience; Nous évaluons les performances et la consommation énergétique dans un cloud modélisé par un modèle de files d'attente multi serveurs. Nous cherchons à adapter les ressources en fonction de la demande. Nous travaillons sur des politiques de type hystérésis, dans lesquelles les serveurs sont activés et désactivés selon l'occupation de la file. Notre objectif est de calculer les séquences de seuils d'activation et de désactivation permettant d'optimiser à la fois les performances et l' énergie, afin d' établir un compromis entre les deux. Nous proposons d'analyser mathématiquement la chaine de Markov en calculant la distribution stationnaire par une forme close en partant de coupes sur l'espace d'état et de manière récursive en fonction de la probabilité du premier état. Nous définissons ensuite une mesure globale qui s' écrit comme une fonction de coût sur cette distribution stationnaire prenant en compte à la fois l'énergie et les performances, et nous proposons des heuristiques afin de définir des séquences de seuils permettant de minimiser cette mesure globale.
Published: 2017

32. A Study of Systems with Multiple Operating Levels, Soft Thresholds and Hysteresis

Author: Brandwajn, Alexandre, Begin, Thomas, Castel-Taleb, Hind, Atmaca, Tulin, University of California [Santa Cruz] (UC Santa Cruz), University of California (UC), Dynamic Networks : Temporal and Structural Capture Approach (DANTE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Institut Rhône-Alpin des systèmes complexes (IXXI), École normale supérieure de Lyon (ENS de Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Centre National de la Recherche Scientifique (CNRS), This work was supported in part by the LABEX MILYON (ANR-10-LABX-0070) of Université de Lyon, within the program 'Investissements d’Avenir' (ANR-11-IDEX-0007) operated by the French National Research Agency (ANR). Part of this work was also supported by ANR MARMOTE (ANR-12-MONU-0019) and Télécom SudParis and Pallas International Corporation under project RRC-2017-01., Inria - Research Centre Grenoble – Rhône-Alpes, ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010), ANR-11-IDEX-0007,Avenir L.S.E.,PROJET AVENIR LYON SAINT-ETIENNE(2011), ANR-12-MONU-0019,MARMOTE,Outils et environnements de modélisation markovienne(2012), University of California [Santa Cruz] (UCSC), University of California, Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Institut Rhône-Alpin des systèmes complexes (IXXI), École normale supérieure - Lyon (ENS Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Département Réseaux et Services de Télécommunications (RST), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), and Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])
Subjects: multiple operating levels, Multi-server systems, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], hysterésis, délais d'activation, activation delays, niveaux de fonctionnement multiples, soft thresholds, non-Poisson arrivals, seuils non-déterministes, arrivées non-Poisson, Systèmes multi-serveurs
Abstract: Current architecture of many computer systems relies on dynamic allocation of a pool of resources according to workload conditions to meet specific performance objectives while minimizing cost (e.g., energy or billing). In such systems, different levels of operation may be defined, and switching between operating levels occurs at certain thresholds of system congestion. To avoid rapid oscillations between levels of service, ”hysteresis” is introduced by using different thresholds for increasing and decreasing workload levels, respectively.We propose a model of such systems with non-Poisson arrivals, arbitrary number of servers and operating levels where each operating level may correspond to an arbitrary number of additional servers and soft (i.e. non-deterministic) thresholds to account for ”inertia” in switching between operating levels. Additionally, in our model server processing rates may be a function of the current operating level and of the number of requests (users) in the system. We also allow for delays in the activation of additional operating levels. We use simple mathematics to obtain a semi-numerical solution of our model. We illustrate the versatility of our model using several case study examples inspired by features of real systems. In particular, we explore optimal thresholds as a tradeoff between performance and energy consumption.
Published: 2017

33. Calcul des seuils optimaux d’une politique à hysteresis pour un modèle de cloud

Author: Kandi, Mohamed, Castel-Taleb, Hind, Ait Salaht, Farah, Hyon, Emmanuel, Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Recherche Opérationnelle (RO), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Université Paris Nanterre (UPN), ANR-12-MONU-0019,MARMOTE,Outils et environnements de modélisation markovienne(2012), Hyon, Emmanuel, Outils et environnements de modélisation markovienne - - MARMOTE2012 - ANR-12-MONU-0019 - MN - VALID, and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: calcul des seuils, optimisation d’énergie, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO.INFO-PF] Computer Science [cs]/Performance [cs.PF], Cloud computing, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Politique à hysteresis
Abstract: National audience; Notre objectif dans ce travail consiste à gérer les activations et désactivations des serveurs de façon à garantir à la fois Qualité de Service (QoS) et consommation énergétique. Nous nous focalisons sur les politiques à hysteresis qui sont des politiques avec séquences de seuils déclenchant soit l’activation soit la désactivation des machines virtuelles selon l’intensité de la charge du système.
Published: 2017

34. Understanding bike trip patterns leveraging bike sharing system open data

Author: Thi-Mai-Trang Nguyen, Xiaojuan Ma, Gang Pan, Jeremie Jakubowicz, Longbiao Chen, Département Réseaux et Services Multimédia Mobiles (RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Centre National de la Recherche Scientifique (CNRS), Hong Kong University of Science and Technology (HKUST), Phare, Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science - Zhejiang University (Zhejiang University), Département Réseaux et Services de Télécommunications (RST), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: General Computer Science, Operations research, Computer science, Locality, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, ComputingMilieux_PERSONALCOMPUTING, Poison control, 020206 networking & telecommunications, 02 engineering and technology, Destinations, 01 natural sciences, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Theoretical Computer Science, Scheduling (computing), [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, 010104 statistics & probability, Open data, ComputingMethodologies_PATTERNRECOGNITION, Urban computing, 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, TRIPS architecture, Bike sharing, 0101 mathematics
Abstract: International audience; Bike sharing systems are booming globally as a green and flexible transportationmode, but the flexibility also brings difficulties in keeping the bike stations balanced with enough bikes and docks. Understanding the spatio-temporal bike trip patterns in a bike sharing system, such as the popular trip origins and destinations during rush hours, is important for researchers to design models for bike scheduling and station management. However, due to privacy and operational concerns, bike trip data are usually not publicly available in many cities. Instead, the station feeds about real-time bike and dock number in stations are usually public, which we refer to as bike sharing system open data. In this paper, we propose an approach to infer the spatio-temporal bike trip patterns from the public station feeds. Since the number of possible trips (i.e., origin-destination station pairs) is much larger than the number of stations, we define the trip inference as an ill-posed inverse problem. To solve this problem, we identify the sparsity and locality properties of bike trip patterns, and propose a sparse and weighted regularization model to impose both properties in the solution. We evaluate our method using real-world data fromWashington, D.C. and New York City. Results show that our method can effectively infer the spatio-temporal bike trip patterns and outperform the baselines in both cities.
Published: 2017

35. Continuous and unconstrained vital signs monitoring with ballistocardiogram sensors in headrest position

Author: Jit Biswas, Ibrahim Sadek, Zhang Haihong, Bessam Abdulrazak, Mounir Mokhtari, Image & Pervasive Access Lab (IPAL), Institute for Infocomm Research - I²R [Singapore]-Centre National de la Recherche Scientifique (CNRS)-Agency for science, technology and research [Singapore] (A*STAR)-MATHEMATIQUES, SCIENCES ET TECHNOLOGIES DE L'INFORMATION ET DE LA COMMUNICATION (UJF)-National University of Singapore (NUS)-Université Pierre et Marie Curie - Paris 6 (UPMC), Institut Mines-Télécom [Paris] (IMT), Institute for Infocomm Research - I²R [Singapore], Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Université de Sherbrooke (UdeS), Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre et Marie Curie - Paris 6 (UPMC)-National University of Singapore (NUS)-Agency for science, technology and research [Singapore] (A*STAR)-Centre National de la Recherche Scientifique (CNRS)-Institute for Infocomm Research - I²R [Singapore], and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Discrete wavelet transform, Massage, 020205 medical informatics, medicine.diagnostic_test, Technology and services for home care, business.industry, Multiresolution analysis, 0206 medical engineering, Vital signs, 02 engineering and technology, Sitting, 020601 biomedical engineering, law.invention, Bluetooth, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, law, Fiber optic sensor, Technology and services for assisted-living and elderly, 0202 electrical engineering, electronic engineering, information engineering, medicine, Computer vision, Artificial intelligence, Telecommunications, business, Electrocardiography
Abstract: International audience; Unobtrusive and long-term monitoring of human vital signs are essential requirements for early diagnosis and prophylaxis due to many reasons, one of the most important being improving the quality of life. Currently, vital signs are continuously monitored through sensors attached to the body, such as multiple electrodes for measuring electrical activity of the heart. Such methods may be undesirable, especially for elderly, infants and other groups of people. In this paper, we introduce an improved technique for measuring heart rate from noisy ballistocardiogram signals acquired from 50 human volunteers in a sitting position using a massage chair. The signals are unobtrusively collected from a microbend fiber optic sensor embedded within the headrest of the chair, and then transmitted to a computer through a Bluetooth connection. The heart rate is computed using the multiresolution analysis of the maximal overlap discrete wavelet transform. The error between the proposed method and the reference ECG is estimated in beats per minute using the mean absolute error, where the system achieved relatively good results (7.31 ± 1.60) despite the large amount of motion artifacts produced owing to the frequent body movements and/or vibrations of the massage chair during stress relief massage. Unlike the complete ensemble empirical mode decomposition algorithm, previously employed for heart rate estimation, the suggested system is much faster. Hence, it can be used in real-time applications.
Published: 2017

36. A two-level auction for C-RAN resource allocation

Author: Tijani Chahed, Mira Morcos, Lin Chen, Jocelyne Elias, Fabio Martignon, Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Graphes, Algorithmes et Combinatoire (LRI) (GALaC - LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Laboratoire d'Informatique Paris Descartes (LIPADE - EA 2517), Université Paris Descartes - Paris 5 (UPD5), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Dynamics of Geometric Networks (DYOGENE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Laboratoire de Recherche en Informatique ( LRI ), Université Paris-Sud - Paris 11 ( UP11 ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux ( SAMOVAR ), Institut Mines-Télécom [Paris]-Télécom SudParis ( TSP ) -Centre National de la Recherche Scientifique ( CNRS ), Département Réseaux et Services de Télécommunications ( RST ), Institut Mines-Télécom [Paris]-Télécom SudParis ( TSP ), Graphes, Algorithmes et Combinatoire (LRI) ( GALaC - LRI ), Université Paris-Sud - Paris 11 ( UP11 ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -Université Paris-Sud - Paris 11 ( UP11 ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ), Méthodes et modèles pour les réseaux ( METHODES-SAMOVAR ), Institut Mines-Télécom [Paris]-Télécom SudParis ( TSP ) -Centre National de la Recherche Scientifique ( CNRS ) -Institut Mines-Télécom [Paris]-Télécom SudParis ( TSP ) -Centre National de la Recherche Scientifique ( CNRS ), Laboratoire d'Informatique Paris Descartes ( LIPADE - EA 2517 ), Université Paris Descartes - Paris 5 ( UPD5 ), Département d'informatique de l'École normale supérieure ( DI-ENS ), École normale supérieure - Paris ( ENS Paris ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Centre National de la Recherche Scientifique ( CNRS ), Institut Universitaire de France ( IUF ), Ministère de l'Éducation nationale, de l’Enseignement supérieur et de la Recherche ( M.E.N.E.S.R. ), Département Réseaux et Services de Télécommunications (TSP - RST), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Morcos, Mira, Chahed, Tijani, Lin Chen, null, Elias, Jocelyne, Martignon, Fabio, Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Centre National de la Recherche Scientifique (CNRS), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Centre National de la Recherche Scientifique (CNRS)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Paris (ENS Paris)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Paris (ENS Paris)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Département d'informatique - ENS Paris (DI-ENS), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris)
Subjects: Computer science, Distributed computing, [ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI], MVNO, Mobile computing, 050801 communication & media studies, Cloud computing, 02 engineering and technology, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, 0202 electrical engineering, electronic engineering, information engineering, Common value auction, Resource management, Resource allocation, Radio access network, business.industry, Settore ING-INF/03 - Telecomunicazioni, 05 social sciences, 020206 networking & telecommunications, Auction, Resource Allocation, C-RAN, MVNO, Auction, Bandwidth allocation, C-RAN, business, Computer network
Abstract: International audience; In this paper we propose and evaluate an auction-based resource allocation mechanism in a cloud-based radio access network (C-RAN), where the spectrum is managed by several mobile virtual network operators (MVNOs) and the physical resource is owned by the C-RAN operator. Technically, our approach consists of two coupled auctions in a hierarchical way: the lower-level auction between end users and the virtual operators and the higher-level one between MVNOs and the C-RAN operator. The proposed auction-based approach satisfies fundamental economic properties such as truthfulness. We also numerically analyze the auction results in several typical network settings, considering both homogeneous and heterogeneous resource demands
Published: 2017

37. A survey of collaborative services and security-related issues in modern wireless Ad-Hoc communications

Author: Maryline Laurent, Yosra Ben Saied, Djamal Zeghlache, Alexis Olivereau, Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Centre National de la Recherche Scientifique (CNRS), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (TSP - RST), Département Réseaux et Services Multimédia Mobiles (RS2M), Laboratoire d'Intégration des Systèmes et des Technologies (LIST), and Département Réseaux et Services de Télécommunications (RST)
Subjects: Computer Networks and Communications, Computer science, Wireless ad hoc network, Internet of Things, 02 engineering and technology, Collaborative services, Trust, Computer security, computer.software_genre, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Order (exchange), 0202 electrical engineering, electronic engineering, information engineering, Wireless, Trust management (information system), Trust management, Set (psychology), Resilience (network), Flexibility (engineering), Wireless network, business.industry, 020206 networking & telecommunications, Internal attacks, Computer Science Applications, Hardware and Architecture, 020201 artificial intelligence & image processing, business, Telecommunications, computer
Abstract: International audience; The use of collaboration has recently started to spread to a wide range of services in modern wireless Ad-Hoc networks, for which it is offering valuable advantages in terms of optimization and resilience. However, allowing collaboration among wireless devices opens the way to a new class of threats that involve internal attackers. In this work, we provide an extensive analysis of the existing collaborative networking services in wireless networks and examine the new threats that are introduced by those collaborative mechanisms. From a study of the security measures proposed in the literature to counter these attacks, we identify two categories of countermeasures, namely security-by-design mechanisms and Trust Management Systems (TMSs). A specific discussion is devoted in this paper to the latter category, which offers the advantage of being more flexible. Aiming at further improving this flexibility by making the design of TMSs adapted to the advent of the Internet of Things, we propose a set of guidelines in order for these systems to fit the new requirements of modern wireless communications.
Published: 2014

38. Lightweight collaborative key establishment scheme for the Internet of Things

Author: Yosra Ben Saied, Djamal Zeghlache, Alexis Olivereau, Maryline Laurent, Département Réseaux et Services Multimédia Mobiles (RS2M), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Laboratoire d'Intégration des Systèmes et des Technologies (LIST), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services de Télécommunications (RST), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Internet of things, Key establishment, Delegate, Computer Networks and Communications, Computer science, Cryptography, 02 engineering and technology, Computer security, computer.software_genre, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Resource (project management), Security association, 0202 electrical engineering, electronic engineering, information engineering, Key exchange, Cryptographic primitive, business.industry, 020206 networking & telecommunications, Cryptographic protocol, Wireless sensor networks, Energy efficiency, End-to-end security, 020201 artificial intelligence & image processing, business, computer, Efficient energy use
Abstract: International audience; This work addresses new security issues in the Internet of Things (IoT). The heterogeneous nature of IoT communications and imbalance in resource capabilities between IoT entities make it challenging to provide the required end-to-end secured connections. Clarifying how existing security protocols can be adapted to fulfill these new challenges still has to be improved. A direct use of existing key exchange schemes between two IoT entities may be unfeasible unless both entities be able to run the resource consuming cryptographic primitives required to bootstrap them - thus leaving aside a whole class of resource-constrained devices. In this paper, we revisit existing end-to-end security standards and key establishment schemes and discuss their limitations considering the specific scenarios of the IoT. Later, we propose novel collaborative approaches for key establishment designed to reduce the requirements of these existing security protocols. A constrained device may delegate its heavy cryptographic load to less constrained nodes in neighbourhood exploiting the spatial heterogeneity of IoT environment. We demonstrate through a performance analysis that our collaborative key establishment solution allows for a reduction in energy consumption at the constrained device by up to 80% in comparison with existing key establishment schemes.
Published: 2014

39. Performance analysis of a queue by combining stochastic bounds, real traffic traces and histograms

Author: Hind Castel-Taleb, Farah Aït-Salaht, Jean-Michel Fourneau, Nihal Pekergin, Recherche Opérationnelle (RO), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Centre National de la Recherche Scientifique (CNRS), Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Centre National de la Recherche Scientifique (CNRS), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Mathematical optimization, General Computer Science, Computational complexity theory, Computer science, Quality of service, Measurements, 020206 networking & telecommunications, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], 010201 computation theory & mathematics, Histogram, Computer Science::Networking and Internet Architecture, 0202 electrical engineering, electronic engineering, information engineering, Performance evaluation, Transient (computer programming), Queue, ComputingMilieux_MISCELLANEOUS
Abstract: International audience; We present an approach to derive performance bounds of a queue under histogram-based input traffics. The results are obtained through strong stochastic bounds on the queue length and on the output traffic. The bounds provide probability inequalities on transient behaviors and on steady-state when it exists. We consider both stationary and non-stationary traffics and provide some numerical techniques in both cases. Unlike approximate methods, these bounds can be used to check if the Quality of Service constraints are satisfied or not. Our approach provides a trade-off between the accuracy of results and the computational complexity and it is much faster than the histogram-based simulation
Published: 2016

40. Dimensioning and Profit Sharing in Hybrid LTE/DVB Systems to Offer Mobile TV Services

Author: Amal Abdel Razzac, Salah Eddine Elayoubi, Tijani Chahed, Bachar El-Hassan, Phare, Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Orange Labs [Issy les Moulineaux], France Télécom, Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Université Libanaise, and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: TheoryofComputation_MISCELLANEOUS, Computer science, 02 engineering and technology, Profit (economics), [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], symbols.namesake, Profit sharing, 0203 mechanical engineering, Digital Video Broadcasting, 0202 electrical engineering, electronic engineering, information engineering, Revenue, Electrical and Electronic Engineering, Activity-based costing, Dimensioning, business.industry, Applied Mathematics, 020206 networking & telecommunications, 020302 automobile design & engineering, Shapley value, Computer Science Applications, LTE Advanced, Nash equilibrium, symbols, Telecommunications, business, Game theory, Computer network
Abstract: International audience; Our aim in this work is to develop profit sharing strategies for coooperative 4G Long Term Evolution (LTE) and Digital Video Broadcasting - Next Generation Handheld (DVB-NGH) systems offering mobile TV service. We first study the capacity of the hybrid system for offering such a service and derive the associated cost for each network. We then focus on the sharing of profit between LTE and DVB operators as well as TV channels providers, taking into account the subscription revenues as well as the infrastructure and operation costs. We consider two cases: one in which both LTE and DVB networks are managed by a single operator and one in which the operators are separate. In both cases, we derive closed-form expressions for each player profit share using coalition game concept Shapley value. We further obtain the players optimal strategies, at the Nash equilibrium, where each player tries to maximize its own profit.
Published: 2013

41. ML: DDoS Damage Control with MPLS

Author: Hervé Debar, Gregory Blanc, Jouni Viinikka, Pierre-Edouard Fabre, 6cure, R&D, 6cure SAS, Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Centre National de la Recherche Scientifique (CNRS), project SIEM+, European Project: 608533,EC:FP7:ICT,FP7-ICT-2013-EU-Japan,NECOMA(2013), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Router, Volumetric DDoS, Network resilience, Computer science, business.industry, computer.internet_protocol, Quality of service, Amplification DDoS, Separation (aeronautics), ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Multiprotocol Label Switching, Quality of Service, 020206 networking & telecommunications, Denial-of-service attack, 02 engineering and technology, Bloom filter, DDoS mitigation, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0202 electrical engineering, electronic engineering, information engineering, Upstream (networking), business, computer, Computer network
Abstract: International audience; We present a DDoS mitigation mechanism dispatching suspicious and legitimate traffic into separate MultiProtocol Label Switching (MPLS) tunnels, well upstream from the target. The objective is to limit the impact a voluminous attack could otherwise have on the legitimate traffic through saturation of network resources. The separation of traffic is based on a signature identifying suspicious flows, carried in an MPLS label, and then used by a load-balancing mechanism in a router. The legitimite traffic is preserved at the expense of suspcious flows, whose resource allocations are throttled as needed to avoid congestion.
Published: 2016

42. Authenticated key agreement mediated by a proxy re-encryptor for the Internet of Things

Author: Nouha Oualha, Kim Thuat Nguyen, Maryline Laurent, Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Laboratoire d'Intégration des Systèmes et des Technologies (LIST), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Centre National de la Recherche Scientifique (CNRS), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (TSP - RST), and Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA))
Subjects: 021110 strategic, defence & security studies, Authenticated key agreement, business.industry, Computer science, Internet privacy, Proxy re-encryption, Internet of Things, 0211 other engineering and technologies, 020206 networking & telecommunications, 02 engineering and technology, Computer security, computer.software_genre, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0202 electrical engineering, electronic engineering, information engineering, Security, business, Proxy (statistics), computer, Heterogeneous network
Abstract: International audience; The Internet of Things (IoT) is composed of a wide range of heterogeneous network devices that communicate with their users and the surrounding devices. The secure communications between these devices are still essential even with little or no previous knowledge about each other and regardless of their resource capabilities. This particular context requires appropriate security mechanisms which should be wellsuited for the heterogeneous nature of IoT devices, without pre-sharing a secret key for each secure connection. In this work, we first propose a novel symmetric cipher proxy re-encryption scheme. Such a primitive allows a user to delegate her decryption rights to another with the help of a semi-trusted proxy, but without giving this latter any information on the transmitted messages and the user's secret keys. We then propose AKAPR, an Authenticated Key Agreement mediated by a Proxy Re-encryptor for IoT. The mechanism permits any two highly resource-constrained devices to establish a secure communication with no prior trust relationship. AKAPR is built upon our proposed proxy re-encryption scheme. It has been proved by ProVerif to provide mutual authentication for participants while preserving the secrecy of the generated session key. In addition, the scheme benefits from the lightness of our proxy re-encryption algorithm as it requires no expensive cryptographic operations such as pairing or modular exponentiation
Published: 2016

43. Novel lightweight signcryption-based key distribution mechanisms for MIKEY

Author: Nouha Oualha, Maryline Laurent, Kim Thuat Nguyen, Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Centre National de la Recherche Scientifique (CNRS), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Sara Foresti, Javier Lopez, TC 11, WG 11.2, Département Réseaux et Services de Télécommunications (RST), and Laboratoire d'Intégration des Systèmes et des Technologies (LIST)
Subjects: business.industry, Computer science, Key Distribution, Internet of Things, Key distribution, Context (language use), Cryptography, 02 engineering and technology, Lightweight signcryption, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), MIKEY, 020201 artificial intelligence & image processing, The Internet, Elliptic curve cryptography, business, Key management, Computer network, Signcryption
Abstract: Part 1: Authentication and Key Management; International audience; Multimedia Internet KEYing (MIKEY) is a standard key management protocol, used to set up common secrets between any two parties for multiple scenarios of communications. As MIKEY becomes widely deployed, it becomes worthwhile to not confine its applications to real-time or other specific applications, but also to extend the standard to other scenarios as well. For instance, MIKEY can be used to secure key establishment in the Internet of Things. In this particular context, Elliptic Curve Cryptography-based (ECC) algorithms seem to be good candidate to be employed by MIKEY, since they can support equivalent security level when compared with other recommended cryptographic algorithms like RSA, and at the same time requiring smaller key sizes and offering better performance. In this work, we propose novel lightweight ECC-based key distribution extensions for MIKEY that are built upon a previously proposed certificateless signcryption scheme. To our knowledge, these extensions are the first ECC-based MIKEY extensions that employ signcryption schemes. Our proposed extensions benefit from the lightness of the signcryption scheme, while being discharged from the burden of the public key infrastructure (PKI) thanks to its certificateless feature. To demonstrate their performance, we implemented our proposed extensions in the Openmote sensor platform and conducted a thorough performance assessment by measuring the energy consumption and execution time of each operation in the key establishment procedure. The experimental results prove that our new MIKEY extensions are perfectly suited for resource-constrained devices
Published: 2016

44. PrivCheck: privacy-preserving check-in data publishing for personalized location based services

Author: Daqing Zhang, Philippe Cudré-Mauroux, Dingqi Yang, Bingqing Qu, Department of Informatics [Fribourg] (DIUF), Laboratoire d'informatique - Université de Fribourg, Albert-Ludwigs-Universität Freiburg, Algorithmes, Composants, Modèles Et Services pour l'informatique répartie (ACMES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES), Département Réseaux et Services de Télécommunications (TSP - RST), and Université de Rennes (UR)
Subjects: Check-in, business.industry, Computer science, Internet privacy, Inference, 02 engineering and technology, Data publishing, Location based services, Computer security, computer.software_genre, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, User experience design, Publishing, Privacy, 020204 information systems, Obfuscation, Location-based service, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, business, computer
Abstract: International audience; With the widespread adoption of smartphones, we have observed an increasing popularity of Location-Based Services (LBSs) in the past decade. To improve user experience, LBSs often provide personalized recommendations to users by mining their activity (i.e., check-in) data from location-based social networks. However, releasing user check-in data makes users vulnerable to inference attacks, as private data (e.g., gender) can often be inferred from the users'check-in data. In this paper, we propose PrivCheck, a customizable and continuous privacy-preserving check-in data publishing framework providing users with continuous privacy protection against inference attacks. The key idea of PrivCheck is to obfuscate user check-in data such that the privacy leakage of user-specified private data is minimized under a given data distortion budget, which ensures the utility of the obfuscated data to empower personalized LBSs. Since users often give LBS providers access to both their historical check-in data and future check-in streams, we develop two data obfuscation methods for historical and online check-in publishing, respectively. An empirical evaluation on two real-world datasets shows that our framework can efficiently provide effective and continuous protection of user-specified private data, while still preserving the utility of the obfuscated data for personalized LBSs
Published: 2016

45. Dynamic cluster-based over-demand prediction in bike sharing systems

Author: Gang Pan, Thi-Mai-Trang Nguyen, Longbiao Chen, Xiaojuan Ma, Zhaohui Wu, Shijian Li, Daqing Zhang, Jérémie Jakubowicz, Leye Wang, Dingqi Yang, Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), College of Computer Science and Technology [Zhejiang] (Zhejiang University), Phare, Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), Algorithmes, Composants, Modèles Et Services pour l'informatique répartie (ACMES-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Peking University [Beijing], Department of Informatics [Fribourg] (DIUF), Hong Kong University of Science and Technology (HKUST), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), Département Réseaux et Services de Télécommunications (RST), and Département Réseaux et Services Multimédia Mobiles (RS2M)
Subjects: 050210 logistics & transportation, Operations research, Computer science, 05 social sciences, Mode (statistics), Context (language use), 02 engineering and technology, Construct (python library), Computer security, computer.software_genre, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Sustainable transport, 13. Climate action, 0502 economics and business, 11. Sustainability, 0202 electrical engineering, electronic engineering, information engineering, Bike sharing, 020201 artificial intelligence & image processing, Baseline (configuration management), computer, Cluster based
Abstract: International audience; Bike sharing is booming globally as a green transportation mode, but the occurrence of over-demand stations that have no bikes or docks available greatly affects user experiences. Directly predicting individual over-demand stations to carry out preventive measures is difficult, since the bike usage pattern of a station is highly dynamic and context dependent. In addition, the fact that bike usage pattern is affected not only by common contextual factors (e.g., time and weather) but also by opportunistic contextual factors (e.g., social and traffic events) poses a great challenge. To address these issues, we propose a dynamic cluster-based framework for over-demand prediction. Depending on the context, we construct a weighted correlation network to model the relationship among bike stations, and dynamically group neighboring stations with similar bike usage patterns into clusters. We then adopt Monte Carlo simulation to predict the over-demand probability of each cluster. Evaluation results using real-world data from New York City and Washington, D.C. show that our framework accurately predicts over-demand clusters and outperforms the baseline methods significantly
Published: 2016

46. Performance Evaluation of Cloud Computing Centers with General Arrivals and Service

Author: Thomas Begin, Hind Castel-Taleb, Alexandre Brandwajn, Tulin Atmaca, Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Dynamic Networks : Temporal and Structural Capture Approach (DANTE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Institut Rhône-Alpin des systèmes complexes (IXXI), École normale supérieure de Lyon (ENS de Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), University of California [Santa Cruz] (UC Santa Cruz), University of California (UC), Département Réseaux et Services de Télécommunications (RST), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Institut Rhône-Alpin des systèmes complexes (IXXI), École normale supérieure - Lyon (ENS Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), University of California [Santa Cruz] (UCSC), and University of California
Subjects: Computer science, Distributed computing, Cloud computing, 02 engineering and technology, Service-level agreement, Server, 0202 electrical engineering, electronic engineering, information engineering, response time, approximation, Service (business), 020203 distributed computing, Queueing theory, business.industry, Quality of service, 020206 networking & telecommunications, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Blocking (computing), performance evaluation, queueing model, Task (computing), general distribution, Computational Theory and Mathematics, Hardware and Architecture, blocking probability, Signal Processing, quality of service, business, Computer network
Abstract: International audience; Cloud providers need to size their systems to determine the right amount of resources to allocate as a function of customer’s needs so as to meet their SLAs (Service Level Agreement), while at the same time minimizing their costs and energy use. Queueing theory based tools are a natural choice when dealing with performance aspects of the QoS (Quality of Service) part of the SLA and forecasting resource utilization. The characteristics of a cloud center lead to a queueing system with multiple servers (nodes) in which there is potentially a very large number of servers and both the arrival and service process can exhibit high variability. We propose to use a G/G/c-like model to represent a cloud system and assess expected performance indices. Given the potentially high number of servers in a cloud system, we present an efficient, fast and easy-to-implement approximate solution. We have extensively validated our approximation against discrete-event simulation for several QoS performance metrics such as task response time and blocking probability with excellent results. We apply our approach to examples of system sizing and our examples clearly demonstrate the importance of taking into account the variability of the tasks arrivals and thus expose the risk of under- or over-provisioning if one relies on a model with Poisson assumptions.
Published: 2016

47. Performance analysis of clouds with phase-type arrivals

Author: Ait Salaht, Farah, Castel-Taleb, Hind, Université Paris Nanterre (UPN), Recherche Opérationnelle (RO), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), ANR-12-MONU-0019,MARMOTE,Outils et environnements de modélisation markovienne(2012), Département Réseaux et Services de Télécommunications (TSP - RST), AIT SALAHT, Farah, and Outils et environnements de modélisation markovienne - - MARMOTE2012 - ANR-12-MONU-0019 - MN - VALID
Subjects: cloud node, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-PF] Computer Science [cs]/Performance [cs.PF], hysteresis queue, [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, performance evaluation
Abstract: International audience; We propose to evaluate the performance of a cloud system in terms of buffer occupancy, using mathematical analysis. The client requests (or jobs) arrive by batch, and follow a phase-type process in order to represent the variability of the traffic intensity. The PM (Physical Machine) is modeled by a hysteresis queueing system with phase-type and batch arrivals. To represent the dynamic allocation of the resources, the hysteresis queue activates and deactivates the Virtual Machines (VMs) according to the threshold values of the queue length. This system is represented by a complex Markov chain which is difficult to analyze especially when the size of the state space increases and the length of batch arrival distribution is large. We propose to use stochastic bounds in order to define bounding systems less complex. We derive performance measure bounds as mean buffer length, and blocking probabilities. The relevance of the results is to offer a trade-off between computational complexity and accuracy of the results, providing very interesting solutions in network dimensioning.
Published: 2016

48. Participatory cultural mapping based on collective behavior data in location-based social networks

Author: Bingqing Qu, Dingqi Yang, Daqing Zhang, Laboratoire d'informatique - Université de Fribourg, Albert-Ludwigs-Universität Freiburg, Algorithmes, Composants, Modèles Et Services pour l'informatique répartie (ACMES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (TSP - RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), Creating and exploiting explicit links between multimedia fragments (LinkMedia), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-MEDIA ET INTERACTIONS (IRISA-D6), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Département Réseaux et Services de Télécommunications (RST), MEDIA ET INTERACTIONS (IRISA-D6), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1)
Subjects: Collective behavior, Participatory sensing, Data collection, business.industry, Computer science, 02 engineering and technology, Theoretical Computer Science, World Wide Web, Cultural analysis, Artificial Intelligence, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Survey data collection, 020201 artificial intelligence & image processing, Cluster analysis, Human resources, business, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, World map
Abstract: Culture has been recognized as a driving impetus for human development. It co-evolves with both human belief and behavior. When studying culture, Cultural Mapping is a crucial tool to visualize different aspects of culture (e.g., religions and languages) from the perspectives of indigenous and local people. Existing cultural mapping approaches usually rely on large-scale survey data with respect to human beliefs, such as moral values. However, such a data collection method not only incurs a significant cost of both human resources and time, but also fails to capture human behavior, which massively reflects cultural information. In addition, it is practically difficult to collect large-scale human behavior data. Fortunately, with the recent boom in Location-Based Social Networks (LBSNs), a considerable number of users report their activities in LBSNs in a participatory manner, which provides us with an unprecedented opportunity to study large-scale user behavioral data. In this article, we propose a participatory cultural mapping approach based on collective behavior in LBSNs. First, we collect the participatory sensed user behavioral data from LBSNs. Second, since only local users are eligible for cultural mapping, we propose a progressive “home” location identification method to filter out ineligible users. Third, by extracting three key cultural features from daily activity, mobility, and linguistic perspectives, respectively, we propose a cultural clustering method to discover cultural clusters. Finally, we visualize the cultural clusters on the world map. Based on a real-world LBSN dataset, we experimentally validate our approach by conducting both qualitative and quantitative analysis on the generated cultural maps. The results show that our approach can subtly capture cultural features and generate representative cultural maps that correspond well with traditional cultural maps based on survey data.
Published: 2016

49. Politique optimale d'activation et désactivation des serveurs dans un modèle de cloud computing

Author: Ait Salaht, Farah, Hyon, Emmanuel, Castel-Taleb, Hind, Recherche Opérationnelle (RO), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Université Paris Nanterre (UPN), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Centre National de la Recherche Scientifique (CNRS), ANR-12-MONU-0019,MARMOTE,Outils et environnements de modélisation markovienne(2012), Hyon, Emmanuel, Outils et environnements de modélisation markovienne - - MARMOTE2012 - ANR-12-MONU-0019 - MN - VALID, and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: [INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO], [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS
Abstract: National audience
Published: 2016

50. Stochastic Bounds and Histograms for Active Queues Management and Networks Analysis

Author: Jean-Michel Fourneau, Farah Aït-Salaht, Nihal Pekergin, Hind Castel-Taleb, Recherche Opérationnelle (RO), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Méthodes et modèles pour les réseaux (METHODES-SAMOVAR), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Département Réseaux et Services de Télécommunications (RST), Centre National de la Recherche Scientifique (CNRS), Données et algorithmes pour une ville intelligente et durable - DAVID (DAVID), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Centre National de la Recherche Scientifique (CNRS), and Département Réseaux et Services de Télécommunications (TSP - RST)
Subjects: Histograms, Mathematical optimization, Queue management system, Computer science, Numerical analysis, Stochastic bounds, 020206 networking & telecommunications, Monotonic function, 02 engineering and technology, Active queue management, Queue management, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], Histogram, Performance evaluation, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Queue, Merge (version control)
Abstract: International audience; We present an extension of a methodology based on monotonicity of various networking elements and measurements performed on real networks. Assuming the stationarity of flows, we obtain histograms (distributions) for the arrivals. Unfortunately, these distributions have a large number of values and the numerical analysis is extremely time-consuming. Using the stochastic bounds and the monotonicity of the networking elements, we show how we can obtain, in a very efficient manner, guarantees on performance measures. Here, we present two extensions: the merge element which combine several flows into one, and some Active Queue Management (AQM) mechanisms. This extension allows to study networks with a feed-forward topology
Published: 2016

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

88 results on '"Département Réseaux et Services de Télécommunications (TSP - RST)"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources