Search

Your search keyword '"Département Réseaux et Services de Télécommunications (TSP - RST)"' showing total 40 results
Start Over Author "Département Réseaux et Services de Télécommunications (TSP - RST)" Topic 02 engineering and technology
40 results on '"Département Réseaux et Services de Télécommunications (TSP - RST)"'

1. 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

2. 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 Université (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

3. 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

4. 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 Université (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

5. 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

6. 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

7. 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

8. 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

9. 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

10. 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

11. 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

12. 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

13. 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

14. 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

15. 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

16. 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

17. 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

18. 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

19. 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

20. 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

21. 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

22. 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

23. 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

24. 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

25. 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

26. A framework for information dissemination in social networks using Hawkes processes

Author

Tijani Chahed, Eitan Altman, J.C. Louzada Pinto, 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), Laboratory of Information, Network and Communication Sciences (LINCS), Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA), Models for the performance analysis and the control of networks (MAESTRO), 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), Département Réseaux et Services de Télécommunications (TSP - RST), and Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT)

Subjects
Topic model, social networks, Computer Networks and Communications, Computer science, Information Dissemination, 02 engineering and technology, Machine learning, computer.software_genre, Bayes' theorem, symbols.namesake, topic models, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Argument, 0202 electrical engineering, electronic engineering, information engineering, Information diffusion, Social network, business.industry, Dimensionality reduction, nonnegative tensor factorization, Community structure, 020206 networking & telecommunications, Hardware and Architecture, Modeling and Simulation, symbols, 020201 artificial intelligence & image processing, Artificial intelligence, business, computer, Hawkes processes, Software, Gibbs sampling
Abstract

International audience; We define in this paper a general Hawkes-based framework to model information diffusion in social networks. The proposed framework takes into consideration the hidden interactions between users as well as the interactions between contents and social networks, and can also accommodate dynamic social networks and various temporal effects of the diffusion, which provides a complete analysis of the hidden influences in social networks. This framework can be combined with topic modeling, for which modified collapsed Gibbs sampling and variational Bayes techniques are derived. We provide an estimation algorithm based on nonnegative tensor factorization techniques, which together with a dimensionality reduction argument are able to discover , in addition, the latent community structure of the social network. At last, we provide numerical examples from real-life networks: a Game of Thrones and a MemeTracker datasets.

Published
2016

27. Survey on secure communication protocols 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
Computer Networks and Communications, Computer science, Internet of Things, Key distribution, 02 engineering and technology, Computer security, computer.software_genre, Internet security, Key management, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Security association, Secure communication, 0202 electrical engineering, electronic engineering, information engineering, Cryptographic primitive, business.industry, 020206 networking & telecommunications, Cryptographic protocol, Wireless sensor networks, Key distribution in wireless sensor networks, Security service, Hardware and Architecture, Security, 020201 artificial intelligence & image processing, business, Wireless sensor network, computer, Software, Computer network
Abstract

International audience; The Internet of Things or "IoT" defines a highly interconnected network of heterogeneous devices where all kinds of communications seem to be possible, even unauthorized ones. As a result, the security requirement for such network becomes critical whilst common standard Internet security protocols are recognized as unusable in this type of networks, particularly due to some classes of IoT devices with constrained resources. The document discusses the applicability and limitations of existing IP-based Internet security protocols and other security protocols used in wireless sensor networks, which are potentially suitable in the context of IoT. The analysis of these protocols is discussed based on a taxonomy focusing on the key distribution mechanism

Published
2015

28. Trend detection in social networks using Hawkes processes

Author

Tijani Chahed, Julio Cesar Louzada Pinto, Eitan Altman, 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), Models for the performance analysis and the control of networks (MAESTRO), 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), European Project: 317672,ICT,FP7-ICT-2011-8,CONGAS(2012), and Département Réseaux et Services de Télécommunications (RST)

Subjects
Stochastic control, Theoretical computer science, Social network, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], business.industry, Stochastic process, Computer science, Process (computing), 02 engineering and technology, Broadcasting, computer.software_genre, Point process, Electronic mail, 020204 information systems, Broadcast communication network, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Data mining, business, computer
Abstract

International audience; We develop in this paper a trend detection algorithm , designed to find trendy topics being disseminated in a social network. We assume that the broadcasts of messages in the social network is governed by a self-exciting point process, namely a Hawkes process, which takes into consideration the real broadcasting times of messages and the interaction between users and topics. We formally define trendiness and derive trend indices for each topic being disseminated in the social network. These indices take into consideration the time between the detection and the message broadcasts, the distance between the real broadcast intensity and the maximum expected broadcast intensity, and the social network topology. The proposed trend detection algorithm is simple and uses stochastic control techniques in order to calculate the trend indices. It is also fast and aggregates all the information of the broadcasts into a simple one-dimensional process, thus reducing its complexity and the quantity of data necessary to the detection.

Published
2015

29. Reliable Transport in Delay-Tolerant Networks With Opportunistic Routing

Author

Manoj Panda, Arshad Ali, Eitan Altman, Tijani Chahed, Lucile Sassatelli, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNET, Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), 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), Models for the performance analysis and the control of networks (MAESTRO), 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), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), and Département Réseaux et Services de Télécommunications (RST)

Subjects
Dynamic Source Routing, Computer science, Distributed computing, Wireless Routing Protocol, fluid models, 02 engineering and technology, reliable transport, random coding, 0202 electrical engineering, electronic engineering, information engineering, Destination-Sequenced Distance Vector routing, Electrical and Electronic Engineering, Vehicular ad hoc network, Adaptive quality of service multi-hop routing, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], business.industry, Applied Mathematics, mobile ad hoc networks, 020206 networking & telecommunications, Energy consumption, Mobile ad hoc network, Ad hoc wireless distribution service, delay tolerant networks, Computer Science Applications, Optimized Link State Routing Protocol, 020201 artificial intelligence & image processing, business, Computer network
Abstract

International audience; —This article tackles the issue of reliable transport in Delay-Tolerant mobile ad hoc Networks (DTN), that are operated by some opportunistic routing algorithm. We propose a reliable transport mechanism that relies on ACKnowledgements (ACK) and coding at the source. The various versions of the problem depending on buffer management policies are formulated, and a fluid model based on mean-field approximation is derived for the designed reliable transport mechanism. This model allows to express both the mean file completion time and the energy consumption up to the delivery of the last ACK at the source. The accuracy of this model is assessed through numerical simulations, and a detailed investigation of the impact of the system parameters on the performance is conducted. We eventually present a joint optimization of the mean completion delay with or without an energy constraint, so as to identify the optimal set of parameters to use.

Published
2014

30. Authentication in Wireless Mesh Networks

Author

Maryline Laurent, Aymen Boudguiga, 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), 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), 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
Challenge-Handshake Authentication Protocol, Authentication, Engineering, Wireless mesh network, business.industry, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Mesh networking, Mesh networks, 020206 networking & telecommunications, Order One Network Protocol, 02 engineering and technology, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Authentication protocol, Lightweight Extensible Authentication Protocol, Security, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Switched mesh, business, Computer network, IEEE 802.11s
Abstract

International audience; Deployment of Wireless Mesh Networks (WMNs) is growing as they serve advantageously to enlarge wired backbones, especially in country side areas where the cost of introducing a wired network to few costumers is very expensive. WMNs can also be used as home networks to interconnect all the home devices together with no constraints for the traffic to go through a hub. WMNs are constructed as community networks. That is, a community peer to peer network is built within the WMN, and it fully supports local traffic transferring between stations of the community thanks to some multi-hop routing protocols. As mesh networks are spreading quickly, providing a reliable authentication service is becoming compulsory. Most of the current authentication solutions rely on the 802.1X standard and the Extensible Authentication Protocol (EAP) or on ID-based cryptography. They refer either to a public/private key pair or to a secret shared between the two authenticating stations. We propose to review, in this chapter, the most known authentication protocols that have been proposed for the authentication of wireless mesh network stations either in IEEE standards or in research literature

Published
2014

31. Comparison of LTE eMBMS and DVB-NGH mobile TV solutions from an energy consumption perspective

Author

Amal Abdel Razzac, Bachar El-Hassan, Tijani Chahed, Salah Eddine Elayoubi, 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), Azm Center for Research and Biotechnologies, Lebanese University [Beirut] (LU), and Département Réseaux et Services de Télécommunications (TSP - RST)

Subjects
business.industry, Wireless network, Computer science, IMT Advanced, Mobile television, 020206 networking & telecommunications, 020302 automobile design & engineering, 02 engineering and technology, Energy consumption, Broadcasting, Multimedia Broadcast Multicast Service, 7. Clean energy, Digital multimedia broadcasting, LTE Advanced, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Next-generation network, Digital Video Broadcasting, 0202 electrical engineering, electronic engineering, information engineering, Multi-band device, business, Telecommunications, Computer network
Abstract

International audience; The power demand of future wireless networks is predicted to dramatically increase. This energy consumption issue, if unaddressed, will restrict the roll-out of many new services. Based on this fact, we try in this paper to study and compare the energy consumption of the most popular mobile TV delivery solutions: LTE eMBMS and DVB-NGH. We study the energy consumption in a region where Mobile TV is delivered by a standalone LTE network and a standalone DVB-NGH transmitter or by a cooperative LTE/DVB network. By cooperation we mean that the mobile TV coverage is ensured by DVB in the region surrounding a broadcasting tower and by LTE otherwise. Our work is a simulation one and can be used as an offline study that enables the operators to configure their networks towards a Green Mobile TV delivery. Results shows that the cooperation will decrease the power consumption of at least one of the cooperative operators (LTE and/or DVB) and thus it will certainly decrease the overall power consumption in the service region for a high level Green Mobile TV solution.

Published
2013

32. Reliable Transport in Delay Tolerant Networks

Author

Tijani Chahed, Arshad Ali, Manoj Panda, Lucile Sassatelli, Eitan 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), Centre National de la Recherche Scientifique (CNRS), Models for the performance analysis and the control of networks (MAESTRO), 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 d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNET, Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Woungang, Isaac and Dhurandher, Sanjay Kumar and Anpalagan, Alagan and Vasilakos, Athanasios V., Département Réseaux et Services de Télécommunications (TSP - RST), Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
Fluid limit, Computer science, Distributed computing, 020206 networking & telecommunications, 02 engineering and technology, DTNs, Reliable transport, Protocol parameter optimization, Continuous-time Markov chain, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 020210 optoelectronics & photonics, Fluid-limit, 0202 electrical engineering, electronic engineering, information engineering, Random linear coding, Coding (social sciences)
Abstract

International audience; In this paper, we provide a holistic picture of the research efforts towards the design and development of transport protocols for DTN environments. In the first part, we provide an exhaustive and insightful survey of the literature on transport protocols and proposals aimed at DTNs. In the second part, we describe a new reliable transport protocol based on coding. Our proposed protocol is targeted at terrestrial DTN environments consisting of a large number of highly mobile nodes with random mobility. The key idea behind our proposal is that the average dynamics under such a network setting can be captured by a fluid-limit model and the protocol parameters can be optimized based on the fluid-limit model. Through simplified versions of our proposal, we guide the readers in a step-by-step manner through the intricacies of obtaining deterministic fluid-limit models for networks where the dynamics can be stochastically modeled by a continuous time Markov chain with a large state space. We also provide the relevant background material so as to help the readers clearly understand the methodology and enable him/her to apply the technique to their own research problems.

Published
2013

33. Impact of LTE and DVB-NGH cooperation on QoS of Mobile TV users

Author

Amal Abdel Razzac, Tijani Chahed, Bachar El-Hassan, Salah Eddine Elayoubi, Abdel-Razzac, Amal, Laboratory of Electronic Systems, Telecommunication and Networking (LaSTRE), Lebanese University [Beirut] (LU), 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), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Centre National de la Recherche Scientifique (CNRS), Université Libanaise, and Département Réseaux et Services de Télécommunications (TSP - RST)

Subjects
Service (systems architecture), [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, Computer science, Quality of service, Mobile television, 020206 networking & telecommunications, 020302 automobile design & engineering, 02 engineering and technology, Mobile QoS, LTE Advanced, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Digital Video Broadcasting, Next-generation network, 0202 electrical engineering, electronic engineering, information engineering, Duration (project management), business, Telecommunications, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract

The LTE/DVB convergence to offer users a seamless Mobile TV service is at the heart of the emerging DVB-NGH standard. Most of the works addressing this issue focused solely on the impact of such convergence in terms of capacity gains brought by LTE and coverage gains brought by DVB. To the best of our knowledge, the impact of such convergence on the Mobile TV users' QoS has not been addressed yet and is the focus of our present work. We specifically evaluate the users' QoS in terms of quantifiable metrics, notably the probability of service degradation due to non availability of LTE bearers, its frequency and duration, and show how these metrics evolve with varying traffic load and in different network configurations.

Published
2013

34. Estimating File-Spread in Delay Tolerant Networks under Two-Hop Routing

Author

Eitan Altman, Tijani Chahed, Lucile Sassatelli, Arshad Ali, Dieter Fiems, Manoj Panda, 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), Centre National de la Recherche Scientifique (CNRS), Models for the performance analysis and the control of networks (MAESTRO), 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), SMACS Research Group, Universiteit Gent = Ghent University [Belgium] (UGENT), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNET, Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Robert Bestak, Lukas Kencl, Li Erran Li, Joerg Widmer, Hao Yin, TC 6, Bestak, Bestak, Kencl, Lukas, Li, Erran, Widmer, Joerg, Yin, Hao, Département Réseaux et Services de Télécommunications (TSP - RST), Universiteit Gent = Ghent University (UGENT), Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
Technology and Engineering, Computer science, delay/disruption tolerant networks, 02 engineering and technology, 01 natural sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 010104 statistics & probability, Computer Science::Networking and Internet Architecture, level-crossing, 0202 electrical engineering, electronic engineering, information engineering, estimation and tracking, [INFO]Computer Science [cs], Destination-Sequenced Distance Vector routing, 0101 mathematics, multicasting, Static routing, Multicast, business.industry, two-hop routing, Estimator, 020206 networking & telecommunications, Kalman filter, Level crossing, System dynamics, Exponential function, business, Kalman filtering, Algorithm, Computer network
Abstract

Part 6: DTN and Wireless Sensor Networks; International audience; We consider a Delay/Disruption Tolerant Network under two-hop routing. Our objective is to estimate and track the degree of spread of a message/file in the network. Indeed, having such real-time information is critical for on-line control of routing and energy expenditure. It also benefits the multi-casting application. With exponential inter-meeting times of mobile nodes: (i) for the estimation problem, we obtain exact expressions for the minimum mean-squared error (MMSE) estimator, and (ii) for the tracking problem, we first derive the diffusion approximations for the system dynamics and the measurements and then apply Kalman filtering. We also apply the solutions of the estimation and filtering problems to predict the time when a certain pre-defined fraction of nodes have received a copy of the message/file. Our analytical results are corroborated with extensive simulation results.

Published
2012

35. A new proposal for reliable unicast and multicast transport in Delay Tolerant Networks

Author

Tijani Chahed, Manoj Panda, Lucile Sassatelli, Arshad Ali, Eitan 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), Centre National de la Recherche Scientifique (CNRS), Models for the performance analysis and the control of networks (MAESTRO), 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 d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNET, Signal, Images et Systèmes (Laboratoire I3S - SIS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Département Réseaux et Services de Télécommunications (TSP - RST), Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
Computer science, Distributed computing, Reliability (computer networking), 02 engineering and technology, 01 natural sciences, law.invention, 010104 statistics & probability, Delay Tolerant Networks, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Relay, law, Header, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Network Coding, Reliable Transport, Multicast, business.industry, Network packet, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, Mobile ad hoc network, IEEE, Linear network coding, Unicast, business, Computer network
Abstract

International audience; We propose a new scheme for reliable transport, both for unicast and multicast flows, in Delay Tolerant Networks (DTNs). Reliability is ensured through the use of Global Selective ACKnowledgements (G-SACKs) which contain detailed (and potentially global) information about the receipt of packets at all the destinations. The motivation for using G-SACKs comes from the observation that one should take the maximum advantage of the contact opportunities which occur quite infrequently in DTNs. We also propose sharing of "packet header space" with G-SACK information and allow for random linear coding at the relay nodes. Our results from extensive simulations of the proposed scheme quantify the gains due to each new feature.

Published
2011

36. Seamless semantic service provisioning mechanism for ambient assisted living

Author

Mahmoud Ghorbel, Mohd Fadlee A. Rasid, Mounir Mokhtari, Borhanuddin Mohd Ali, Muzaaliff W. Musa, Faculty of Engineering, Universiti Putra Malaysia, Serdang, Selangor, Universiti Putra Malaysia, Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), 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), Alcatel Lucent Bell Labs [Paris], Alcatel-Lucent, Département Réseaux et Services de Télécommunications (TSP - RST), and 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]

Subjects
Service (business), Computer science, Service delivery framework, business.industry, Service design, 05 social sciences, Service discovery, AAL, Provisioning, Context (language use), 02 engineering and technology, World Wide Web, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Default gateway, Service provisioning, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0501 psychology and cognitive sciences, Network selection, business, Semantic Web, Semantic, 050107 human factors
Abstract

International audience; As the current technology and usage trends in Ambient Assisted Living (AAL) evolves; more and more services were developed for helping dependent people, especially elderly and people with mild dementia to live independently. These services help them to perform Activities of Daily Living (ADL) easily, safely and in a proper manner. The relevant service is delivered to the user seamlessly through a set of devices. As the user moves around, the devices might also move into a new and sometimes unknown domain. This leads to the need for service discovery and provisioning beyond the current capabilities of Open Services Gateway Initiative (OSGi) or other service platforms. A mechanism for seamless semantic service provisioning using semantic web is further discussed in this paper. The challenge here is to produce a platform that supports not only seamless semantic service provisioning, but also to handle user and device mobility through semantic reasoning. The aim of the system is to ensure users are able to use relevant services at a specific location and time with a set of dynamic context

Published
2010

37. Mild dementia care at home : integrating activity monitoring, user interface plasticity and scenario verification

Author

Philip Yap, Jit Biswas, Mounir Mokhtari, Jin Song Dong, 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), 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), School of computing [Singapore] (NUS), National University of Singapore (NUS), Department of Geriatric Medicine [Singapore] (Alexandra Hospital), Département Réseaux et Services de Télécommunications (TSP - RST), and 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]

Subjects
Computer science, Interface (Java), Human computer interface, 02 engineering and technology, Smart environment, System deployment and replication, Activity recognition, 03 medical and health sciences, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 030502 gerontology, Human–computer interaction, Software deployment, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), 020201 artificial intelligence & image processing, User interface, Cognitive decline, 0305 other medical science, Model building, Scenario verification
Abstract

International audience; We discuss an integrated approach towards building systems for monitoring and assisting people with mild dementia in their homes. Our approach differs from existing approaches in three ways. First we improve context acquisition and understanding with the concept of micro-context that takes us beyond existing notions of location and temporal context; second, we incorporate plasticity concept into the human computer interface, in order to provide a natural interaction way and accommodative interface to the user; third we target robust and reliable systems that are easy to scale and deploy in diverse end-user settings, through the use of formal model building tools to specify and verify systems at key stages from requirements generation all the way to deployment and user statistics gathering. In order to address real-life end user requirements we are working closely with geriatric doctors and their staff, so as to get inputs as to precise challenges in caring for mild dementia patients, and how systems targeted at holistic, personalized assistance and care-giving can be built with a view towards scaled up deployment in diverse settings. The main contribution of this paper is an approach for system building that incorporates activity monitoring, user interface plasticity and scenario verification targeting people with cognitive decline in regards to a Singapore initiative called A-Star Home 2015 Phase II. We expect our work to lead to a methodology for systematic development of monitoring and assistive systems for cognitive interventions for mild dementia patients at home. Although the integrated framework is still not completely realized, the three areas mentioned above have each yielded significant results on their own, and these are mentioned in the paper

Published
2010

38. Joint uplink and downlink admission control to both streaming and elastic flows in CDMA/HSDPA systems

Author

Salah Eddine Elayoubi, Eitan Altman, Tijani Chahed, 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), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Models for the performance analysis and the control of networks (MAESTRO), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Orange Labs [Issy les Moulineaux], France Télécom, and Département Réseaux et Services de Télécommunications (TSP - RST)

Subjects
Computer Networks and Communications, Computer science, Real-time computing, Throughput, 02 engineering and technology, Data_CODINGANDINFORMATIONTHEORY, File size, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Telecommunications link, Computer Science::Multimedia, 0202 electrical engineering, electronic engineering, information engineering, Computer Science::Networking and Internet Architecture, Computer Science::Information Theory, HSDPA/HDR, Capacity, Network packet, Wireless network, Code division multiple access, business.industry, Joint uplink and downlink, Wireline, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, 020302 automobile design & engineering, Admission control, Computer Science::Performance, Hardware and Architecture, Modeling and Simulation, business, TCP, Software, Computer network
Abstract

International audience; TCP-based data flows generate packets and ACKs in two directions, be it in the wireline or wireless networks. In the latter case, packets are typically found in the downlink whereas ACKs are in the uplink. Those two links are asymmetric in the case of CDMA-based High Data Rate (HDR)/High-Speed Downlink Packet Access (HSDPA) systems, the uplink being much slower than the downlink and thus, in some cases, restrictive in terms of the achievable throughput of the TCP flow. The aim of this work is to evaluate the performance of such a setting, in the presence of both streaming and elastic tra±c, under a dynamic scenario where users arrive to the system and leave it after completion of their service. We specifically quantify the impact of the uplink on the overall performance of TCP and study the model variations as a function of several parameters such as load, file size and radio conditions

Published
2008

39. On Design of TDD for Joint Uplink and Downlink Resource Allocation in OFDMA-Based WiMax

Author

Tijani Chahed, Salah Eddine Elayoubi, Eitan Altman, 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), Orange Labs [Issy les Moulineaux], France Télécom, Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria), Models for the performance analysis and the control of networks (MAESTRO), 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
Engineering, business.industry, Orthogonal frequency-division multiplexing, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 020206 networking & telecommunications, 020302 automobile design & engineering, Throughput, Data_CODINGANDINFORMATIONTHEORY, 02 engineering and technology, Admission control, Blocking (statistics), WiMAX, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, Time-division multiplexing, Computer Science::Multimedia, Telecommunications link, Computer Science::Networking and Internet Architecture, 0202 electrical engineering, electronic engineering, information engineering, Resource allocation, business, Computer Science::Information Theory, Computer network
Abstract

International audience; In this paper, we study the joint design of uplink and downlink resources in OFDMA-based systems. We first analyze the interactions between uplink and downlink, due essentially to the usage of Time Division Duplexing (TDD) and the TCP ACK/NACKs. This analysis is based on analytical models for interference and throughputs that we develop for both directions. We next study the capacity of the system using a Markovian analysis and matrix geometric solutions. Our performance analysis study allows us to determine the optimal proportion of resources that has to be allocated to the uplink; In addition to that, we show that an admission control policy reserving some uplink resources to TCP ACKs may improve the overall capacity of the system

Published
2008

40. Adaptive and programmable management of IP quality of service

Author

Miguel Franklin de Castro, Abdallah M'Hamed, Djamal Zeghlache, Dominique Gaïti, Laboratoire Traitement du Signal et de l'Image (LTSI), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de la Santé et de la Recherche Médicale (INSERM), Environnement de Réseaux Autonomes (ERA), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), Département Réseaux et Services de Télécommunications (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), Département Réseaux et Services Multimédia Mobiles (RS2M), Université de Rennes (UR)-Institut National de la Santé et de la Recherche Médicale (INSERM), Département Réseaux et Services de Télécommunications (TSP - RST), Département Réseaux et Services Multimédia Mobiles (TSP - RS2M), and VU VAN, Jean-Baptiste

Subjects
[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, Computer science, Quality of service, Generation, 020206 networking & telecommunications, 020207 software engineering, 02 engineering and technology, Infrastructure management, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Programmable, 0202 electrical engineering, electronic engineering, information engineering, business, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Coexistence, Computer network, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; This chapter contains sections titled: - Introduction; - Open and programmable network technology; - Active and programmable QoS management over IP; - Architecture for adaptive and programmable management; - CLAM: a new language for adaptive and programmable management; - Related studies; - Case studies; - Conclusion and perspectives; - Bibliography

Published
2008

Catalog

Books, media, physical & digital resources
See catalog results