Rouvoy, Romain
Overview
| Works: | 28 works in 51 publications in 3 languages and 618 library holdings |
|---|---|
| Genres: | Conference papers and proceedings Academic theses |
| Roles: | Editor, Author, htt, Thesis advisor, Other, Opponent |
| Classifications: | QA76.9.D5, 005.276 |
Publication Timeline
.
Most widely held works by
Romain Rouvoy
Distributed applications and interoperable systems 11th IFIP WG 6.1 international conference ; proceedings by
Pascal Felber(
)
17 editions published in 2011 in English and German and held by 516 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 11th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems, DAIS 2011, held in Reykjavik, Iceland, in June 2011 as one of the DisCoTec 2011 events. The 18 revised full papers and 6 short papers presented were carefully reviewed and selected from 55 submissions. The papers presented at DAIS 2011 address key challenges of modern distributed services and applications, including pervasiveness and peer-to-peer environments, and tackle issues related to adaptation, interoperability, availability and performance, as well as dependability and security
17 editions published in 2011 in English and German and held by 516 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 11th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems, DAIS 2011, held in Reykjavik, Iceland, in June 2011 as one of the DisCoTec 2011 events. The 18 revised full papers and 6 short papers presented were carefully reviewed and selected from 55 submissions. The papers presented at DAIS 2011 address key challenges of modern distributed services and applications, including pervasiveness and peer-to-peer environments, and tackle issues related to adaptation, interoperability, availability and performance, as well as dependability and security
Adaptive and Reflective Middleware on Proceedings of the International Workshop by
Romain Rouvoy(
)
2 editions published in 2011 in English and held by 47 WorldCat member libraries worldwide
2 editions published in 2011 in English and held by 47 WorldCat member libraries worldwide
ARM 2011 : proceedings of the International Workshop on Adaptive and Reflective Middleware : co-located with ACM/IFIP/USENIX
International Middleware Conference Dec ember 12th, 2011 Lisbon, Portugal by
International Workshop on Adaptive and Reflective Middleware(
)
3 editions published in 2011 in English and held by 24 WorldCat member libraries worldwide
3 editions published in 2011 in English and held by 24 WorldCat member libraries worldwide
Détection et analyse de l'impact des défauts de code dans les applications mobiles by
Geoffrey Hecht(
)
3 editions published between 2016 and 2017 in French and held by 2 WorldCat member libraries worldwide
Mobile applications are becoming complex software systems that must be developed quickly and evolve continuously to fit new user requirements and execution contexts. However, addressing these constraints may result in poor low-level design choices, known as code smells. The presence of code smells within software systems may incidentally degrade their quality and performance, and hinder their maintenance and evolution. Thus, it is important to know this smells but also to detect and correct them. While code smells are well-known in object-oriented applications, their study in mobile applications is still in their infancy. Moreover there is a lack of tools to detect and correct them. That is why we present a classification of 17 code smells that may appear in Android applications, as well as a tool to detect and correct code smells on Android. We apply and validate our approach on large amounts of applications (over 3000) in two studies evaluating the presence and evolution of the number of code smells in popular applications. In addition, we also present two approaches to assess the impact of the correction of code smells on performance and energy consumption. These approaches have allowed us to observe that the correction of code smells is beneficial in most cases
3 editions published between 2016 and 2017 in French and held by 2 WorldCat member libraries worldwide
Mobile applications are becoming complex software systems that must be developed quickly and evolve continuously to fit new user requirements and execution contexts. However, addressing these constraints may result in poor low-level design choices, known as code smells. The presence of code smells within software systems may incidentally degrade their quality and performance, and hinder their maintenance and evolution. Thus, it is important to know this smells but also to detect and correct them. While code smells are well-known in object-oriented applications, their study in mobile applications is still in their infancy. Moreover there is a lack of tools to detect and correct them. That is why we present a classification of 17 code smells that may appear in Android applications, as well as a tool to detect and correct code smells on Android. We apply and validate our approach on large amounts of applications (over 3000) in two studies evaluating the presence and evolution of the number of code smells in popular applications. In addition, we also present two approaches to assess the impact of the correction of code smells on performance and energy consumption. These approaches have allowed us to observe that the correction of code smells is beneficial in most cases
Une démarche à granularité extrêmement fine pour la construction de canevas intergiciels hautement adaptables : applications
aux services de transactions by
Romain Rouvoy(
Book
)
2 editions published in 2006 in French and held by 2 WorldCat member libraries worldwide
Cette thèse adresse la problématique de la construction des intergiciels hautement adaptables. Ces intergiciels se caractérisent par une grande diversité des fonctionnalités fournies. Dans le domaine du transactionnel, cette diversité concerne non seulement les modèles de transactions, les protocoles de contrôle de concurrence et de reprise après défaillance, mais aussi les normes et les standards d'intégration. Notre proposition consiste à définir un canevas intergiciel capitalisant la diversité du domaine transactionnel, et permettant de construire des services de transactions hautement adaptables. Ce type de services requiert la mise en place d'une démarche de construction à granularité extrêmement fine afin de pouvoir adapter les nombreuses caractéristiques de l'intergiciel. Nous proposons donc de compléter l'approche issue des exogiciels avec quatre nouveaux éléments. Ainsi, nous définissons le modèle de programmation FracIet à base d'annotations pour favoriser la programmation des abstractions fonctionnelles de l'intergiciel. Nous proposons ensuite un langage de description et de vérification de motif d'architecture pour fiabiliser la modélisation des abstractions architecturales. Ces deux premiers éléments servent à la conception d'un canevas intergiciel à base de composants utilisant les motifs de conception comme structure architecturale extensible. Enfin, nous décrivons les configurations possibles en utilisant différents modèles de haut niveau dédiés aux caractéristiques de l'intergiciel. Nous illustrons ces concepts en présentant GoTM, un caneva intergiciel à composants pour la construction de services de transactions hautement adaptables. Notre approche est validée au travers de trois expériences originales. Tout d'abord, nous proposons de faciliter l'intégration des services de transactions dans les plates-formes intergicielles par la définition de politiques de démarcation transactionnelle indépendantes de la plate-forme et du type de service intégré. Ensuite, nous définissons un service de transactions composant plusieurs personnalités simultanément pour faciliter l'interopérabilité transactionnelle d'applications hétérogènes. Enfin, nous sommes en mesure de sélectionner différents protocoles de validation à deux phases pour optimiser le temps d'exécution des transactions face aux changements des condition d'exécution de l'application
2 editions published in 2006 in French and held by 2 WorldCat member libraries worldwide
Cette thèse adresse la problématique de la construction des intergiciels hautement adaptables. Ces intergiciels se caractérisent par une grande diversité des fonctionnalités fournies. Dans le domaine du transactionnel, cette diversité concerne non seulement les modèles de transactions, les protocoles de contrôle de concurrence et de reprise après défaillance, mais aussi les normes et les standards d'intégration. Notre proposition consiste à définir un canevas intergiciel capitalisant la diversité du domaine transactionnel, et permettant de construire des services de transactions hautement adaptables. Ce type de services requiert la mise en place d'une démarche de construction à granularité extrêmement fine afin de pouvoir adapter les nombreuses caractéristiques de l'intergiciel. Nous proposons donc de compléter l'approche issue des exogiciels avec quatre nouveaux éléments. Ainsi, nous définissons le modèle de programmation FracIet à base d'annotations pour favoriser la programmation des abstractions fonctionnelles de l'intergiciel. Nous proposons ensuite un langage de description et de vérification de motif d'architecture pour fiabiliser la modélisation des abstractions architecturales. Ces deux premiers éléments servent à la conception d'un canevas intergiciel à base de composants utilisant les motifs de conception comme structure architecturale extensible. Enfin, nous décrivons les configurations possibles en utilisant différents modèles de haut niveau dédiés aux caractéristiques de l'intergiciel. Nous illustrons ces concepts en présentant GoTM, un caneva intergiciel à composants pour la construction de services de transactions hautement adaptables. Notre approche est validée au travers de trois expériences originales. Tout d'abord, nous proposons de faciliter l'intégration des services de transactions dans les plates-formes intergicielles par la définition de politiques de démarcation transactionnelle indépendantes de la plate-forme et du type de service intégré. Ensuite, nous définissons un service de transactions composant plusieurs personnalités simultanément pour faciliter l'interopérabilité transactionnelle d'applications hétérogènes. Enfin, nous sommes en mesure de sélectionner différents protocoles de validation à deux phases pour optimiser le temps d'exécution des transactions face aux changements des condition d'exécution de l'application
Context as a resource : a service-oriented approach for context-awareness by
Daniel Francisco Romero Acero(
Book
)
2 editions published in 2011 in English and held by 2 WorldCat member libraries worldwide
The advent of smarthpones and the availability of services in ubiquitous environments enable the design and development of applications that are able to adapt seamlessly to the current environment state. Nevertheless, such adaptations require the integration of information regarding heterogeneity in terms of devices, execution platforms, and communication protocols as well the mobility of applications so that the different responsibilities of the adaptation can be distributed. In order to face these issues, and considering the limitations of existing solutions, we provide two major contributions in this dissertation: (1) SPACES, a middleware approach to integrate context information and (2) Ubiquitous Feedback Control Loops (Ubiquitous FCLs), as an approach to adapt context-aware applications. We validate our proposal with three case studies: (1) a Caching or Off-Loading situation, where the application behavior is modified at runtime, (2) TRACK.ME, a platform for supporting tracking-based scientific experimentations and (3) DIGIHOME, a smarthome platform. These scenarios demonstrate the suitability of our approach when different kinds of devices, protocols and implementation technologies are involved in the adaptation process
2 editions published in 2011 in English and held by 2 WorldCat member libraries worldwide
The advent of smarthpones and the availability of services in ubiquitous environments enable the design and development of applications that are able to adapt seamlessly to the current environment state. Nevertheless, such adaptations require the integration of information regarding heterogeneity in terms of devices, execution platforms, and communication protocols as well the mobility of applications so that the different responsibilities of the adaptation can be distributed. In order to face these issues, and considering the limitations of existing solutions, we provide two major contributions in this dissertation: (1) SPACES, a middleware approach to integrate context information and (2) Ubiquitous Feedback Control Loops (Ubiquitous FCLs), as an approach to adapt context-aware applications. We validate our proposal with three case studies: (1) a Caching or Off-Loading situation, where the application behavior is modified at runtime, (2) TRACK.ME, a platform for supporting tracking-based scientific experimentations and (3) DIGIHOME, a smarthome platform. These scenarios demonstrate the suitability of our approach when different kinds of devices, protocols and implementation technologies are involved in the adaptation process
Divide and Conquer - Organizing Component-based Adaptation by
Ulrich Scholz(
)
1 edition published in 2008 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2008 in English and held by 2 WorldCat member libraries worldwide
Vers des protocoles de tolérance aux fautes byzantines efficaces et robustes by
Lucas Perronne(
)
1 edition published in 2016 in French and held by 2 WorldCat member libraries worldwide
Over the last decade, Cloud computing instigated an important switch of paradigm in numerous information systems. This new paradigm is mainly illustrated by the re-location of the whole IT infrastructures out of companies' warehouses. The use of local servers has thus being replaced by remote ones, rented from dedicated providers such as Google, Amazon, Microsoft.In order to ensure the sustainability of this economic model, it appears necessary to provide several guarantees to users, related to the security, availability, or even reliability of the proposed resources. Such quality of service (QoS) factors allow providers and users to reach an agreement on the expected level of dependability. Practically, the proposed servers must episodically cope with arbitrary faults (also called byzantine faults), such as incorrect/corrupted messages, servers crashes, or even network failures. Nevertheless, the Cloud computing environment encouraged the emergence of technologies such as virtualization or state machine replication. These technologies allow cloud providers to efficiently face the occurrences of faults through the implementation of fault tolerance protocols.Byzantine Fault Tolerance (BFT) is a research area involving state machine replication concepts, and aiming at ensuring continuity and reliability of hosted services in presence of any kind of arbitrary behaviors. In order to handle such threat, numerous protocols were proposed. These protocols must be efficient in order to counterbalance the extra cost of replication, and robust in order to lower the impact of byzantine behaviors on the system performance. We first noticed that tackling both these concerns at the same time is difficult: current protocols are either designed to be efficient at the expense of their robustness, or robust at the expense of their efficiency. We tackle this specific problem in this thesis, our goal being to provide the required tools to design both efficient and robust BFT protocols.Our focus is mainly dedicated to two types of denial-of-service attacks involving requests management. The first one is caused by the partial corruption of a request transmitted by a client. The second one is caused by the intentional drop of a request upon receipt. In order to face efficiently both these byzantine behaviors, several mechanisms were integrated in robust BFT protocols. In practice, these mecanisms involve high overheads, and thus lead to the significant performance drop of robust protocols compared to efficien ones. This assessment allows us to introduce our first contribution: the definition of several generic design principles, applicable to numerous existing BFT protocols, and aiming at reducing these overheads while maintaining the same level of robustness.The second contribution introduces ER-PBFT, a new protocol implementing these design principles on PBFT, the reference in terms of byzantine fault tolerance. We demonstrate the efficiency of our new robustness policy, both in fault-free scenarios and in presence of byzantine behaviors.The third contribution highlights ER-COP, a new BFT protocol dedicated to both efficiency and robustness, implementing our design principles on COP, the BFT protocol providing for now the best performances in a fault-free environment. We evaluate the additional cost introduced by our robustness policy, and we demonstrate ER-COP's ability to handle byzantine behaviors
1 edition published in 2016 in French and held by 2 WorldCat member libraries worldwide
Over the last decade, Cloud computing instigated an important switch of paradigm in numerous information systems. This new paradigm is mainly illustrated by the re-location of the whole IT infrastructures out of companies' warehouses. The use of local servers has thus being replaced by remote ones, rented from dedicated providers such as Google, Amazon, Microsoft.In order to ensure the sustainability of this economic model, it appears necessary to provide several guarantees to users, related to the security, availability, or even reliability of the proposed resources. Such quality of service (QoS) factors allow providers and users to reach an agreement on the expected level of dependability. Practically, the proposed servers must episodically cope with arbitrary faults (also called byzantine faults), such as incorrect/corrupted messages, servers crashes, or even network failures. Nevertheless, the Cloud computing environment encouraged the emergence of technologies such as virtualization or state machine replication. These technologies allow cloud providers to efficiently face the occurrences of faults through the implementation of fault tolerance protocols.Byzantine Fault Tolerance (BFT) is a research area involving state machine replication concepts, and aiming at ensuring continuity and reliability of hosted services in presence of any kind of arbitrary behaviors. In order to handle such threat, numerous protocols were proposed. These protocols must be efficient in order to counterbalance the extra cost of replication, and robust in order to lower the impact of byzantine behaviors on the system performance. We first noticed that tackling both these concerns at the same time is difficult: current protocols are either designed to be efficient at the expense of their robustness, or robust at the expense of their efficiency. We tackle this specific problem in this thesis, our goal being to provide the required tools to design both efficient and robust BFT protocols.Our focus is mainly dedicated to two types of denial-of-service attacks involving requests management. The first one is caused by the partial corruption of a request transmitted by a client. The second one is caused by the intentional drop of a request upon receipt. In order to face efficiently both these byzantine behaviors, several mechanisms were integrated in robust BFT protocols. In practice, these mecanisms involve high overheads, and thus lead to the significant performance drop of robust protocols compared to efficien ones. This assessment allows us to introduce our first contribution: the definition of several generic design principles, applicable to numerous existing BFT protocols, and aiming at reducing these overheads while maintaining the same level of robustness.The second contribution introduces ER-PBFT, a new protocol implementing these design principles on PBFT, the reference in terms of byzantine fault tolerance. We demonstrate the efficiency of our new robustness policy, both in fault-free scenarios and in presence of byzantine behaviors.The third contribution highlights ER-COP, a new BFT protocol dedicated to both efficiency and robustness, implementing our design principles on COP, the BFT protocol providing for now the best performances in a fault-free environment. We evaluate the additional cost introduced by our robustness policy, and we demonstrate ER-COP's ability to handle byzantine behaviors
Enhancing Planning-Based Adaptation Middleware with Support for Dependability: a Case Study by
Romain Rouvoy(
)
1 edition published in 2008 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2008 in English and held by 2 WorldCat member libraries worldwide
Monitoring energy hotspots in software Energy profiling of software code by
Adel Noureddine(
)
1 edition published in 2014 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2014 in English and held by 2 WorldCat member libraries worldwide
Traçage versus sécurité : explorer les deux facettes des empreintes de navigateurs by
Antoine Vastel(
)
1 edition published in 2019 in English and held by 1 WorldCat member library worldwide
Nowadays, a wide range of devices can browse the web, ranging from smartphones, desktop computers, to connected TVs. To increase their browsing experience, users also customize settings in their browser, such as displaying the bookmark bar or their preferred languages. Customization and the diversity of devices are at the root of browser fingerprinting. Indeed, to manage this diversity, websites can access attributes about the device using JavaScript APIs, without asking for user consent. The combination of such attributes is called a browser fingerprint and has been shown to be highly unique, making of fingerprinting a suitable tracking technique. Its stateless nature makes it also suitable for enhancing authentication or detecting bots. In this thesis, I report three contributions to the browser fingerprinting field:1. I collect 122K fingerprints from 2,346 browsers and study their stability over more than 2 years. I show that, despite frequent changes in the fingerprints, a significant fraction of browsers can be tracked over a long period of time;2. I design a test suite to evaluate fingerprinting countermeasures. I apply our test suite to 7 countermeasures, some of them claiming to generate consistent fingerprints, and show that all of them can be identified, which can make their users more identifiable;3. I explore the use of browser fingerprinting for crawler detection. I measure its use in the wild, as well as the main detection techniques. Since fingerprints are collected on the client-side, I also evaluate its resilience against an adversarial crawler developer that tries to modify its crawler fingerprints to bypass security checks
1 edition published in 2019 in English and held by 1 WorldCat member library worldwide
Nowadays, a wide range of devices can browse the web, ranging from smartphones, desktop computers, to connected TVs. To increase their browsing experience, users also customize settings in their browser, such as displaying the bookmark bar or their preferred languages. Customization and the diversity of devices are at the root of browser fingerprinting. Indeed, to manage this diversity, websites can access attributes about the device using JavaScript APIs, without asking for user consent. The combination of such attributes is called a browser fingerprint and has been shown to be highly unique, making of fingerprinting a suitable tracking technique. Its stateless nature makes it also suitable for enhancing authentication or detecting bots. In this thesis, I report three contributions to the browser fingerprinting field:1. I collect 122K fingerprints from 2,346 browsers and study their stability over more than 2 years. I show that, despite frequent changes in the fingerprints, a significant fraction of browsers can be tracked over a long period of time;2. I design a test suite to evaluate fingerprinting countermeasures. I apply our test suite to 7 countermeasures, some of them claiming to generate consistent fingerprints, and show that all of them can be identified, which can make their users more identifiable;3. I explore the use of browser fingerprinting for crawler detection. I measure its use in the wild, as well as the main detection techniques. Since fingerprints are collected on the client-side, I also evaluate its resilience against an adversarial crawler developer that tries to modify its crawler fingerprints to bypass security checks
Leveraging browser fingerprinting to strengthen web authentication by Antonin Durey(
)
1 edition published in 2022 in English and held by 1 WorldCat member library worldwide
Security on the Web is a major concern for any user, and authentication solutions, such as multi-factor authentication, negatively impact the user experience and add cost andcomplexity that may prevent them from being more accepted by users and more largelydeployed. Browser fingerprinting is a stateless and permission-less technique thatcollects information about the user's device, OS, browser and configuration to form anidentifier. While it has mainly been studied from a tracking perspective, its propertiesmake it interesting for security, and more specifically, for Web authentication.In this thesis, I provide 3 main contributions:• I manually browse 1, 485 pages on 446 websites and measure fingerprint collectionon sensitive pages of websites, such as sign-up and sign-in pages. I evaluate theresilience of these websites against 2 types of attack, stolen credentials and cookiehijacking, and show that fingerprinting, despite its potential, is barely used toprotect against these attacks.• I collect fingerprints in a controlled environment to precisely measure the attributesthat offer interesting uniqueness and stability properties. I use this knowledgeto design and implement a fingerprints linking algorithm for Web authenticationand evaluate it on a dataset of 952, 828 fingerprints collected from 64, 235 browserinstances, and show the algorithm is reliable and relevant to link fingerprints.• I design and implement an authentication scheme that strengthens web authen-tication by using browser fingerprinting. I evaluate the scheme on a centralizedauthentication server with 82 users. I demonstrate that browser fingerprintingstrengthens Web authentication while having a minimal impact on the user experience.With these contributions, I argue that browser fingerprinting improves web authenti-cation and conclude this manuscript by providing short-term and long-term perspectivesto improve this work
1 edition published in 2022 in English and held by 1 WorldCat member library worldwide
Security on the Web is a major concern for any user, and authentication solutions, such as multi-factor authentication, negatively impact the user experience and add cost andcomplexity that may prevent them from being more accepted by users and more largelydeployed. Browser fingerprinting is a stateless and permission-less technique thatcollects information about the user's device, OS, browser and configuration to form anidentifier. While it has mainly been studied from a tracking perspective, its propertiesmake it interesting for security, and more specifically, for Web authentication.In this thesis, I provide 3 main contributions:• I manually browse 1, 485 pages on 446 websites and measure fingerprint collectionon sensitive pages of websites, such as sign-up and sign-in pages. I evaluate theresilience of these websites against 2 types of attack, stolen credentials and cookiehijacking, and show that fingerprinting, despite its potential, is barely used toprotect against these attacks.• I collect fingerprints in a controlled environment to precisely measure the attributesthat offer interesting uniqueness and stability properties. I use this knowledgeto design and implement a fingerprints linking algorithm for Web authenticationand evaluate it on a dataset of 952, 828 fingerprints collected from 64, 235 browserinstances, and show the algorithm is reliable and relevant to link fingerprints.• I design and implement an authentication scheme that strengthens web authen-tication by using browser fingerprinting. I evaluate the scheme on a centralizedauthentication server with 82 users. I demonstrate that browser fingerprintingstrengthens Web authentication while having a minimal impact on the user experience.With these contributions, I argue that browser fingerprinting improves web authenti-cation and conclude this manuscript by providing short-term and long-term perspectivesto improve this work
Towards a better understanding of the energy consumption of software systems by
Adel Noureddine(
)
1 edition published in 2014 in English and held by 1 WorldCat member library worldwide
With the rise of the usage of computers and mobile devices, and the higher price of electricity, energy management of software has become a necessity for sustainable software, devices and IT services. Energy consumption in IT is rising through the rise of web and distributed services, cloud computing, or mobile devices. However, these approaches do not use proper energy information for their adaptations rendering themselves limited and not energy-aware. They do not provide an energy feedback of software, and limited information is available on how and where energy is spend in software code. To address these shortcomings, we present, in this thesis, energy models, approaches and tools in order to accurately estimate the energy consumption of software at the application level, at the code level, and for inferring energy evolution models based on the method's own input parameters. We also propose Jalen and Jalen Unit, energy frameworks for estimating how much energy each portion of code consumes, and for inferring energy evolution models based on empirical benchmarking of software methods. By using software estimations and energy models, we are able to provide accurate energy information without the need of power meters or hardware energy investment. The energy information we provide also gives energy management approaches direct and accurate energy measurements for their adaptations and optimizations. Provided energy information also draws a model of energy consumption evolution of software based on the values of their input parameters. This gives developers knowledge on energy efficiency in software leading to choose some code over others based on their energy performance
1 edition published in 2014 in English and held by 1 WorldCat member library worldwide
With the rise of the usage of computers and mobile devices, and the higher price of electricity, energy management of software has become a necessity for sustainable software, devices and IT services. Energy consumption in IT is rising through the rise of web and distributed services, cloud computing, or mobile devices. However, these approaches do not use proper energy information for their adaptations rendering themselves limited and not energy-aware. They do not provide an energy feedback of software, and limited information is available on how and where energy is spend in software code. To address these shortcomings, we present, in this thesis, energy models, approaches and tools in order to accurately estimate the energy consumption of software at the application level, at the code level, and for inferring energy evolution models based on the method's own input parameters. We also propose Jalen and Jalen Unit, energy frameworks for estimating how much energy each portion of code consumes, and for inferring energy evolution models based on empirical benchmarking of software methods. By using software estimations and energy models, we are able to provide accurate energy information without the need of power meters or hardware energy investment. The energy information we provide also gives energy management approaches direct and accurate energy measurements for their adaptations and optimizations. Provided energy information also draws a model of energy consumption evolution of software based on the values of their input parameters. This gives developers knowledge on energy efficiency in software leading to choose some code over others based on their energy performance
Understanding mobile-specific code smells by
Sarra Habchi(
)
1 edition published in 2019 in English and held by 1 WorldCat member library worldwide
Object-Oriented code smells are well-known concepts in software engineering. They refer to bad design and development practices commonly observed in software systems. With the emergence of mobile apps, new classes of code smells have been identified to refer to bad development practices that are specific to mobile platforms. These mobile-specific code smells differ from object-oriented ones by focusing on performance issues reported in the documentation or developer guidelines. Since their identification, many research works approached mobile-specific code smells to propose detection tools and study them. Nonetheless, most of these studies only focused on measuring the performance impact of such code smells and did not provide any insights about their motives and potential solutions. In particular, we lack knowledge about (i) the rationales behind the accrual of mobile code smells, (ii) the developers' perception of mobile code smells, and (iii) the generalizability of code smells across different mobile platforms. These lacks hinder the understanding of mobile code smells and consequently prevent the design of adequate solutions for them. Therefore, we conduct in this thesis a series of empirical studies with the aim of understanding mobile code smells. First, we study the expansion of code smells in different mobile platforms. Then, we conduct a large-scale study to analyze the change history of mobile apps and discern the factors that favor the introduction and survival of code smells. To consolidate these studies, we also perform a user study to investigate developers' perception of code smells and the adequacy of static analyzers as a solution for coping with them. Finally, we perform a qualitative study to question the established foundation about the definition and detection of mobile code smells. The results of these studies revealed important research findings. Notably, we showed that pragmatism, prioritization, and individual attitudes are not relevant factors for the accrual of mobile code smells. The problem is rather caused by ignorance and oversight, which are prevalent among mobile developers. Furthermore, we highlighted several flaws in the code smell definitions that are currently adopted by the research community. These results allowed us to elaborate some recommendations for researchers and tool makers willing to design detection and refactoring tools for mobile code smells. On top of that, our results opened perspectives for research works about the identification of mobile code smells and development practices in general
1 edition published in 2019 in English and held by 1 WorldCat member library worldwide
Object-Oriented code smells are well-known concepts in software engineering. They refer to bad design and development practices commonly observed in software systems. With the emergence of mobile apps, new classes of code smells have been identified to refer to bad development practices that are specific to mobile platforms. These mobile-specific code smells differ from object-oriented ones by focusing on performance issues reported in the documentation or developer guidelines. Since their identification, many research works approached mobile-specific code smells to propose detection tools and study them. Nonetheless, most of these studies only focused on measuring the performance impact of such code smells and did not provide any insights about their motives and potential solutions. In particular, we lack knowledge about (i) the rationales behind the accrual of mobile code smells, (ii) the developers' perception of mobile code smells, and (iii) the generalizability of code smells across different mobile platforms. These lacks hinder the understanding of mobile code smells and consequently prevent the design of adequate solutions for them. Therefore, we conduct in this thesis a series of empirical studies with the aim of understanding mobile code smells. First, we study the expansion of code smells in different mobile platforms. Then, we conduct a large-scale study to analyze the change history of mobile apps and discern the factors that favor the introduction and survival of code smells. To consolidate these studies, we also perform a user study to investigate developers' perception of code smells and the adequacy of static analyzers as a solution for coping with them. Finally, we perform a qualitative study to question the established foundation about the definition and detection of mobile code smells. The results of these studies revealed important research findings. Notably, we showed that pragmatism, prioritization, and individual attitudes are not relevant factors for the accrual of mobile code smells. The problem is rather caused by ignorance and oversight, which are prevalent among mobile developers. Furthermore, we highlighted several flaws in the code smell definitions that are currently adopted by the research community. These results allowed us to elaborate some recommendations for researchers and tool makers willing to design detection and refactoring tools for mobile code smells. On top of that, our results opened perspectives for research works about the identification of mobile code smells and development practices in general
Resource allocation in a Cloud partially powered by renewable energy sources by
Yunbo Li(
)
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
Most of the energy-efficient Cloud frameworks proposed in literature do not consider electricity availability and renewable energy in their models. Integrating renewable energy into data centers significantly reduces the traditional energy consumption and carbon footprint of these energy-hungry infrastructures. As renewable energy is intermittent and fluctuates with time-varying, it is usually under-utilized. We address the problem of improving the utilization of renewable energy for a single data center and investigate two approaches: opportunistic scheduling and energy storage. Our results demonstrate that both approaches are able to reduce the brown energy consumption under different configurations. We extend this work to the context of Edge Clouds and Internet of Things on the use case of data stream analysis. We show how to make Edge Clouds greener with on-site renewable energy production combined with energy storage and performance degradation of the users' applications
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
Most of the energy-efficient Cloud frameworks proposed in literature do not consider electricity availability and renewable energy in their models. Integrating renewable energy into data centers significantly reduces the traditional energy consumption and carbon footprint of these energy-hungry infrastructures. As renewable energy is intermittent and fluctuates with time-varying, it is usually under-utilized. We address the problem of improving the utilization of renewable energy for a single data center and investigate two approaches: opportunistic scheduling and energy storage. Our results demonstrate that both approaches are able to reduce the brown energy consumption under different configurations. We extend this work to the context of Edge Clouds and Internet of Things on the use case of data stream analysis. We show how to make Edge Clouds greener with on-site renewable energy production combined with energy storage and performance degradation of the users' applications
APISENSE® : une plate-forme répartie pour la conception, le déploiement et l'exécution de campagnes de collecte de données
sur des terminaux intelligents by
Nicolas Haderer(
)
1 edition published in 2014 in French and held by 1 WorldCat member library worldwide
Mobile crowdsensing is a new form of data collection that takes advantage of millions smart devices already deployed throughout the world to collect massively environmental or behavioral data from a population. Recently, this type of data collection has attracted interest from a large number of industrials and academic players in many areas, such as the study of urban mobility, environmental monitoring, health or the study of sociocultural attitudes. However, mobile crowdsensing is in its early stages of development, and many challenges remain to be addressed to take full advantage of its potential. These challenges include privacy, limited energy resources of devices, development of reward and recruitment models to select appropriates mobile users and dealing with heterogeneity of mobile platforms available. In this thesis, we aim to reconsider the architectural design of current mobile crowdsensing systems to provide a simple and effective way to design, deploy and manage data collection campaigns.The main contributions of this thesis are organize around APISENSE, the resulting platform of this research. APISENSE has been used to carry out a data collection campaign deployed over hundred of users in a sociological study and evaluated through experiments demonstrating the validity, effectiveness and scalability of our solution
1 edition published in 2014 in French and held by 1 WorldCat member library worldwide
Mobile crowdsensing is a new form of data collection that takes advantage of millions smart devices already deployed throughout the world to collect massively environmental or behavioral data from a population. Recently, this type of data collection has attracted interest from a large number of industrials and academic players in many areas, such as the study of urban mobility, environmental monitoring, health or the study of sociocultural attitudes. However, mobile crowdsensing is in its early stages of development, and many challenges remain to be addressed to take full advantage of its potential. These challenges include privacy, limited energy resources of devices, development of reward and recruitment models to select appropriates mobile users and dealing with heterogeneity of mobile platforms available. In this thesis, we aim to reconsider the architectural design of current mobile crowdsensing systems to provide a simple and effective way to design, deploy and manage data collection campaigns.The main contributions of this thesis are organize around APISENSE, the resulting platform of this research. APISENSE has been used to carry out a data collection campaign deployed over hundred of users in a sociological study and evaluated through experiments demonstrating the validity, effectiveness and scalability of our solution
Towards privacy-sensitive mobile crowdsourcing by
Lakhdar Meftah(
)
1 edition published in 2019 in English and held by 1 WorldCat member library worldwide
With the widespread adoption of mobile phones, devices are used to track the user's activity and to collect insightful reports from the environment (e.g., air quality, network quality). Most of these collected data are systematically tagged with the user location which may inevitably lead to user privacy leaks by discarding sensitive information a posteriori based on their potential points of interest.This thesis introduces an anonymous data collection library for mobile apps, a software library that improves the user's privacy without compromising the overall quality of the crowdsourced dataset. In particular, we propose a decentralized approach, named FOUGERE, to convey data samples from user devices using peer-to-peer (P2P) communications to third-party servers, thus introducing an a priori data anonymization process that is resilient to location-based attacks.To validate our approach, we propose a testing framework to test this P2P communication library, named PEERFLEET. Beyond the identification of P2P-related errors, PEERFLEET also helps to tune the discovery protocol settings to optimize the deployment of P2P apps.We validate FOUGERE using 500 emulated devices that replay a mobility dataset and use FOUGERE to collect location data. We evaluate the overhead, the privacy and the utility of FOUGERE. We show that FOUGERE defeats the state-of-the-art location-based privacy attacks with little impact on the quality of the collected data
1 edition published in 2019 in English and held by 1 WorldCat member library worldwide
With the widespread adoption of mobile phones, devices are used to track the user's activity and to collect insightful reports from the environment (e.g., air quality, network quality). Most of these collected data are systematically tagged with the user location which may inevitably lead to user privacy leaks by discarding sensitive information a posteriori based on their potential points of interest.This thesis introduces an anonymous data collection library for mobile apps, a software library that improves the user's privacy without compromising the overall quality of the crowdsourced dataset. In particular, we propose a decentralized approach, named FOUGERE, to convey data samples from user devices using peer-to-peer (P2P) communications to third-party servers, thus introducing an a priori data anonymization process that is resilient to location-based attacks.To validate our approach, we propose a testing framework to test this P2P communication library, named PEERFLEET. Beyond the identification of P2P-related errors, PEERFLEET also helps to tune the discovery protocol settings to optimize the deployment of P2P apps.We validate FOUGERE using 500 emulated devices that replay a mobility dataset and use FOUGERE to collect location data. We evaluate the overhead, the privacy and the utility of FOUGERE. We show that FOUGERE defeats the state-of-the-art location-based privacy attacks with little impact on the quality of the collected data
Self-optimization of infrastructure and platform resources in cloud computing by
Bo Zhang(
)
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
L'élasticité est pensée comme une solution importante pour gérer des problèmes de performance dans les systèmes répartis. Toutefois, la plupart des recherches d'élasticité ne concernent que l'approvisionnement de ressources de manière automatique, mais ignorent toujours l'utilisation des ressources provisionnées. Cela pourrait conduire à des fuites de ressources, ce qui entraîne des dépenses inutiles. Pour éviter des problèmes, mes recherches se concentrent donc sur la maximisation de l'utilisation des ressources par l'auto-gestion des ressources. Dans cette thèse, en raison de divers problèmes de l'utilisation des ressources dans les différentes couches, je propose deux approches de gestion de ressources correspondant à l'infrastructure et la plate-forme, respectivement. Pour surmonter la limitation des infrastructures, je propose CloudGC comme service de middleware qui vise à libérer les ressources occupées par machines virtuelles qui tournent au ralenti. Dans la couche de plate-forme, une approche d'auto-équilibrage est introduite pour ajuster la configuration de Hadoop lors de l'exécution, ce qui optimise dynamiquement les performances de système. Enfin, cette thèse aussi concerne le déploiement rapide de Hadoop. Un nouvel outil, appelé "hadoop-benchmark", applique docker pour accélérer l'installation de Hadoop et fournir un ensemble d'images de docker qui contiennent plusieurs Hadoop benchmarks bien connus. Les évaluations montrent que ces approches et cet outil peuvent parvenir à l'auto-gestion des ressources dans différentes couches, puis de faciliter l'élasticité de l'infrastructure et de la plate-forme dans le Cloud computing
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
L'élasticité est pensée comme une solution importante pour gérer des problèmes de performance dans les systèmes répartis. Toutefois, la plupart des recherches d'élasticité ne concernent que l'approvisionnement de ressources de manière automatique, mais ignorent toujours l'utilisation des ressources provisionnées. Cela pourrait conduire à des fuites de ressources, ce qui entraîne des dépenses inutiles. Pour éviter des problèmes, mes recherches se concentrent donc sur la maximisation de l'utilisation des ressources par l'auto-gestion des ressources. Dans cette thèse, en raison de divers problèmes de l'utilisation des ressources dans les différentes couches, je propose deux approches de gestion de ressources correspondant à l'infrastructure et la plate-forme, respectivement. Pour surmonter la limitation des infrastructures, je propose CloudGC comme service de middleware qui vise à libérer les ressources occupées par machines virtuelles qui tournent au ralenti. Dans la couche de plate-forme, une approche d'auto-équilibrage est introduite pour ajuster la configuration de Hadoop lors de l'exécution, ce qui optimise dynamiquement les performances de système. Enfin, cette thèse aussi concerne le déploiement rapide de Hadoop. Un nouvel outil, appelé "hadoop-benchmark", applique docker pour accélérer l'installation de Hadoop et fournir un ensemble d'images de docker qui contiennent plusieurs Hadoop benchmarks bien connus. Les évaluations montrent que ces approches et cet outil peuvent parvenir à l'auto-gestion des ressources dans différentes couches, puis de faciliter l'élasticité de l'infrastructure et de la plate-forme dans le Cloud computing
A Language-Based Approach for Web Service Composition by
Elyas Ben hadj yahia(
)
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
In light of the recent advances in the field of web engineering, along with the decrease of cost of cloud computing, service-oriented architectures rapidly became the leading solution in providing valuable services to clients. Following this trend, the composition of third-party services has become a successful paradigm for the development of robust and rich distributed applications, as well as automating business processes. With the availability of hundreds of thousands of web services and APIs, such integrations become cumbersome and tedious when performed manually. Furthermore, different clients may require different integration requirements and policies, which further complexifies the task. Moreover, providing such a solution that is both robust and scalable is a non-trivial task. Therefore, it becomes crucial to investigate how to efficiently coordinate the interactions between existing web services. As such, this thesis aims at investigating the underlying challenges in web service composition in the context of modern web development practices. We present an architectural framework to support the specification of web service compositions using a language-based approach, and show how we support their execution in a scalable manner using MEDLEY, a lightweight, event-driven platform
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
In light of the recent advances in the field of web engineering, along with the decrease of cost of cloud computing, service-oriented architectures rapidly became the leading solution in providing valuable services to clients. Following this trend, the composition of third-party services has become a successful paradigm for the development of robust and rich distributed applications, as well as automating business processes. With the availability of hundreds of thousands of web services and APIs, such integrations become cumbersome and tedious when performed manually. Furthermore, different clients may require different integration requirements and policies, which further complexifies the task. Moreover, providing such a solution that is both robust and scalable is a non-trivial task. Therefore, it becomes crucial to investigate how to efficiently coordinate the interactions between existing web services. As such, this thesis aims at investigating the underlying challenges in web service composition in the context of modern web development practices. We present an architectural framework to support the specification of web service compositions using a language-based approach, and show how we support their execution in a scalable manner using MEDLEY, a lightweight, event-driven platform
Towards improving the quality of mobile app by leveraging crowdsourced feedback by
Maria Gomez Lacruz(
)
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
La popularité des smartphones engendre un nombre croissant d'applications mobiles qui sont publiées dans des magasins officiels d'applications. En fait, des études antérieures ont démontré que les utilisateurs d'applications sont intolérants à des problèmes de qualité (e.g., des arrêts inopinés). Les utilisateurs qui rencontrent des problèmes désinstallent fréquemment les applications et se dirigent vers des applications concurrentes. Par conséquent, détecter et prévenir rapidement des problèmes dans les applications est crucial pour rester compétitif sur le marché. Même si les développeurs testent les applications avant le déploiement, de nombreux bugs peuvent encore apparaitre dans la nature. Le grand défi qui demeure est que l'environnement reste hors du contrôle des développeurs d'applications. Plus précisément, l'écosystème mobile est confronté à une rapide évolution des plate-formes mobile, une forte fragmentation des équipements, et une grande diversité des contextes d'exécution. Cette thèse présente donc une nouvelle génération de magasins d'applications mobiles qui exploite des données collectées sur les applications, les appareils et les utilisateurs afin d'augmenter la qualité globale des applications mobiles publiées en ligne. Cette nouvelle génération de magasins d'applications peut exploiter l'intelligence collective pour obtenir des feedbacks pratiques à partir de les données retournées par les utilisateurs. Ces feedbacks concrets aident les développeurs d'applications à traiter les erreurs et les menaces potentielles qui affectent leurs applications avant la publication ou même lorsque les applications sont dans les mains des utilisateurs finaux
1 edition published in 2016 in English and held by 1 WorldCat member library worldwide
La popularité des smartphones engendre un nombre croissant d'applications mobiles qui sont publiées dans des magasins officiels d'applications. En fait, des études antérieures ont démontré que les utilisateurs d'applications sont intolérants à des problèmes de qualité (e.g., des arrêts inopinés). Les utilisateurs qui rencontrent des problèmes désinstallent fréquemment les applications et se dirigent vers des applications concurrentes. Par conséquent, détecter et prévenir rapidement des problèmes dans les applications est crucial pour rester compétitif sur le marché. Même si les développeurs testent les applications avant le déploiement, de nombreux bugs peuvent encore apparaitre dans la nature. Le grand défi qui demeure est que l'environnement reste hors du contrôle des développeurs d'applications. Plus précisément, l'écosystème mobile est confronté à une rapide évolution des plate-formes mobile, une forte fragmentation des équipements, et une grande diversité des contextes d'exécution. Cette thèse présente donc une nouvelle génération de magasins d'applications mobiles qui exploite des données collectées sur les applications, les appareils et les utilisateurs afin d'augmenter la qualité globale des applications mobiles publiées en ligne. Cette nouvelle génération de magasins d'applications peut exploiter l'intelligence collective pour obtenir des feedbacks pratiques à partir de les données retournées par les utilisateurs. Ces feedbacks concrets aident les développeurs d'applications à traiter les erreurs et les menaces potentielles qui affectent leurs applications avant la publication ou même lorsque les applications sont dans les mains des utilisateurs finaux
more
fewer
Audience Level
| 0 |
 |
1 | ||
| General | Special | |||
Related Identities
- Felber, Pascal Author Editor
- ACM Digital Library
- Association for Computing Machinery
- DAIS (Conference)
- International Federation for Information Processing Working Group Architecture and Protocols for Computer Networks
- Cerqueira, Renato
- École doctorale Sciences pour l'Ingénieur (Lille) Other Degree grantor
- Université Lille 1 - Sciences et technologies (Villeneuve-d'Ascq / 1970-2017) Degree grantor
- Seinturier, Lionel Thesis advisor
- Centre de recherche en informatique, signal et automatique de Lille Other
Associated Subjects
