Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849314
R. Bruschi, F. Davoli, M. Mongelli
The paper investigates the balance between Quality of Service (QoS) and power consumption for a traffic queue. Automatic adaptation to the power of the packet processing engine is sought through a heuristics and an optimal control strategy. The study allows to track the behavior of the system over time, thus avoiding the optimization of the steady state behavior of the system, which is hardly applicable over small time horizons and with high-variable traffics. The algorithms are validated over a very large set of traffic scenarios, buffer size and delay constraints.
{"title":"Equivalent bandwidth adaptation with energy preservation under delay constraints","authors":"R. Bruschi, F. Davoli, M. Mongelli","doi":"10.1109/INFCOMW.2014.6849314","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849314","url":null,"abstract":"The paper investigates the balance between Quality of Service (QoS) and power consumption for a traffic queue. Automatic adaptation to the power of the packet processing engine is sought through a heuristics and an optimal control strategy. The study allows to track the behavior of the system over time, thus avoiding the optimization of the steady state behavior of the system, which is hardly applicable over small time horizons and with high-variable traffics. The algorithms are validated over a very large set of traffic scenarios, buffer size and delay constraints.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"41 1","pages":"688-693"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85876877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Multi-File dissemination through wireless communication has attracted considerable attentions in recent years, especially when Device-to-Device (D2D) communication is developed to support peer-to-peer file transmission. To decrease the total delay, the authors in proposed a cluster-based D2D network in which files are transmitted from the BS to several cluster-heads, and then shared inside each cluster through D2D communication. Distributed caching is another option to enhance the transmission rate by precaching files to users, with which mobile users with the same interest can share files directly through D2D communication. However, most of the current studies on D2D-based file sharing schemes typically assume that all users are separated in non-overlapping communities that each user can only select one sort of files, and ignore the social relations among mobile users. When considering heterogeneous but overlapping interests of users, how to utilize social ties for multi-file sharing with minimum delay is still a challenging problem. To this end, we propose a graph based social aware algorithm in which cellular links and D2D links are established according to social ties and social contributions of users for efficient multi-file dissemination.
{"title":"Social-aware multi-file dissemination in Device-to-Device overlay networks","authors":"Zijie Zheng, Tianyu Wang, Lingyang Song, Zhu Han, Jianjun Wu","doi":"10.1109/INFCOMW.2014.6849234","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849234","url":null,"abstract":"Multi-File dissemination through wireless communication has attracted considerable attentions in recent years, especially when Device-to-Device (D2D) communication is developed to support peer-to-peer file transmission. To decrease the total delay, the authors in proposed a cluster-based D2D network in which files are transmitted from the BS to several cluster-heads, and then shared inside each cluster through D2D communication. Distributed caching is another option to enhance the transmission rate by precaching files to users, with which mobile users with the same interest can share files directly through D2D communication. However, most of the current studies on D2D-based file sharing schemes typically assume that all users are separated in non-overlapping communities that each user can only select one sort of files, and ignore the social relations among mobile users. When considering heterogeneous but overlapping interests of users, how to utilize social ties for multi-file sharing with minimum delay is still a challenging problem. To this end, we propose a graph based social aware algorithm in which cellular links and D2D links are established according to social ties and social contributions of users for efficient multi-file dissemination.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"219-220"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79891479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849296
Yue Jin, Z. Pang
This paper studies a monopoly telecom operator's decision on the adoption of shared data plans. A shared data plan allows sharing data quota among multiple devices or users, while conventional single device data plans only allow the use of a single device. We devise analytical models and compare a simple shared data plan (also called bundling pricing) to single device data plans (also called partitioned pricing). When consumer valuations (utilities) of different devices are independent, we find a threshold on the unit usage cost below which the shared data plan yields more profits than single device data plans. The optimal price for the shared data plan is less than the sum of the single device data plans. If consumers' valuations for different devices have different distributions, this disparity reduces the relative value of the shared data plan against the single device data plans. We also show that shared data plans increases the social welfare and consumer surplus when it yields a higher profit. We further extend the analysis to complementary valuations on different devices: a consumer's valuation for using both devices may be higher than the sum of his utilities on the devices when only one device is used. We identify a threshold on the unit usage cost below which the shared data plan yields more profits. The price of the shared data plan is larger than the sum of the single device data plans for very strong complementariness, while it's always less with independent valuations. We also show numerically that a strong complementariness shrinks the range of the unit usage cost where the shared data plan has a higher profit.
{"title":"Smart data pricing: To share or not to share?","authors":"Yue Jin, Z. Pang","doi":"10.1109/INFCOMW.2014.6849296","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849296","url":null,"abstract":"This paper studies a monopoly telecom operator's decision on the adoption of shared data plans. A shared data plan allows sharing data quota among multiple devices or users, while conventional single device data plans only allow the use of a single device. We devise analytical models and compare a simple shared data plan (also called bundling pricing) to single device data plans (also called partitioned pricing). When consumer valuations (utilities) of different devices are independent, we find a threshold on the unit usage cost below which the shared data plan yields more profits than single device data plans. The optimal price for the shared data plan is less than the sum of the single device data plans. If consumers' valuations for different devices have different distributions, this disparity reduces the relative value of the shared data plan against the single device data plans. We also show that shared data plans increases the social welfare and consumer surplus when it yields a higher profit. We further extend the analysis to complementary valuations on different devices: a consumer's valuation for using both devices may be higher than the sum of his utilities on the devices when only one device is used. We identify a threshold on the unit usage cost below which the shared data plan yields more profits. The price of the shared data plan is larger than the sum of the single device data plans for very strong complementariness, while it's always less with independent valuations. We also show numerically that a strong complementariness shrinks the range of the unit usage cost where the shared data plan has a higher profit.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"2 1","pages":"583-588"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82100975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849273
B. Mathieu, Patrick Truong
Online Social Networking (OSN) applications attracted millions of people in few years and are considered as the success story of current Internet applications. However, how they work is unclear for both end-users and researchers, since the developers keep the system architecture secret and use encryption mechanisms. In this paper, we present the main outcomes of our analysis of one of the most well known OSNs, Twitter, focusing on the networking behaviour, the involved entities, their location, etc. Detecting that the current network behaviour of those applications is not in line with current end-users behaviours, where locality is important, we propose to adapt the OSNs to a Content-Centric Networking (CCN) approach, which could improve the delivery and reduce the network load and server load. Indeed, CCN is a new networking paradigm focusing on interest based requests of content itself independently on location and so has features very close to OSNs. This paper then introduces our proposal for a CCN-based architecture for OSN applications, with a naming and routing proposal. We also present the demonstrator we have implemented as proof-of-concept and the testbed we set up for functional testing purposes.
在线社交网络(Online Social Networking, OSN)应用在短短几年内就吸引了数以百万计的用户，被认为是当前互联网应用的成功案例。然而，最终用户和研究人员都不清楚它们是如何工作的，因为开发人员对系统架构保密，并使用加密机制。在本文中，我们介绍了我们对最著名的osn之一Twitter的分析的主要结果，重点关注网络行为，所涉及的实体，它们的位置等。检测到这些应用程序的当前网络行为与当前的最终用户行为不一致，其中局部性很重要，我们建议将osn调整为内容中心网络(CCN)方法，这可以改善交付并减少网络负载和服务器负载。事实上，CCN是一种新的网络范例，专注于基于兴趣的内容请求本身，独立于位置，因此具有非常接近osn的功能。然后，本文介绍了基于ccn的OSN应用架构的建议，以及命名和路由建议。我们还展示了我们作为概念验证实现的演示器，以及我们为功能测试目的设置的测试平台。
{"title":"A CCN-based Social Network application optimising network proximity","authors":"B. Mathieu, Patrick Truong","doi":"10.1109/INFCOMW.2014.6849273","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849273","url":null,"abstract":"Online Social Networking (OSN) applications attracted millions of people in few years and are considered as the success story of current Internet applications. However, how they work is unclear for both end-users and researchers, since the developers keep the system architecture secret and use encryption mechanisms. In this paper, we present the main outcomes of our analysis of one of the most well known OSNs, Twitter, focusing on the networking behaviour, the involved entities, their location, etc. Detecting that the current network behaviour of those applications is not in line with current end-users behaviours, where locality is important, we propose to adapt the OSNs to a Content-Centric Networking (CCN) approach, which could improve the delivery and reduce the network load and server load. Indeed, CCN is a new networking paradigm focusing on interest based requests of content itself independently on location and so has features very close to OSNs. This paper then introduces our proposal for a CCN-based architecture for OSN applications, with a naming and routing proposal. We also present the demonstrator we have implemented as proof-of-concept and the testbed we set up for functional testing purposes.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"19 1","pages":"446-451"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82270131","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849322
C. Lima, M. Bennis, M. Latva-aho
Mobility management in small cell networks is of utmost importance, and is currently under study in 3GPP Release-12. In this article, we model and analyze the outbound handover failure probability in small cell networks, in which a given user crosses its serving cell coverage border before his time-to-trigger elapses, without connecting to his target base station. Using tools from stochastic geometry, a closed-form expression of the handover link failure probability is characterized, as a function of shadowed channel fading, hysteresis margin, time-to-trigger, users' velocity and traveled distances. Numerical results show the effectiveness of the proposed analytical model and provide key insights into the problem of mobility management.
{"title":"Modeling and analysis of handover failure probability in small cell networks","authors":"C. Lima, M. Bennis, M. Latva-aho","doi":"10.1109/INFCOMW.2014.6849322","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849322","url":null,"abstract":"Mobility management in small cell networks is of utmost importance, and is currently under study in 3GPP Release-12. In this article, we model and analyze the outbound handover failure probability in small cell networks, in which a given user crosses its serving cell coverage border before his time-to-trigger elapses, without connecting to his target base station. Using tools from stochastic geometry, a closed-form expression of the handover link failure probability is characterized, as a function of shadowed channel fading, hysteresis margin, time-to-trigger, users' velocity and traveled distances. Numerical results show the effectiveness of the proposed analytical model and provide key insights into the problem of mobility management.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"11 1","pages":"736-741"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87659717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849242
P. Spachos, Angelos K. Marnerides, D. Hatzinakos
Wireless Multimedia Sensor Networks (WMSNs) are considered as one of the most prominent infrastructures for human-centric multimedia applications due to the wide availability of low-cost hardware such as microphones and CMOS cameras. By virtue of the energy limitations on sensor nodes alongside the explicit highly demanding bandwidth requirements of real-time multimedia applications, these particular networks foster a set of non-trivial challenges that need to be confronted. In this paper we define a level of relevance in regards with the content of a multimedia packet and we further introduce a dynamic routing protocol that optimizes the overall network performance in terms of energy efficiency and packet delay. We present the design, implementation and applicability of our Content Relevance Opportunistic Routing (CROR) protocol under experimental results that show an increase in network lifetime of up to 20% compared with traditional routing.
{"title":"Content Relevance Opportunistic Routing for Wireless Multimedia Sensor Networks","authors":"P. Spachos, Angelos K. Marnerides, D. Hatzinakos","doi":"10.1109/INFCOMW.2014.6849242","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849242","url":null,"abstract":"Wireless Multimedia Sensor Networks (WMSNs) are considered as one of the most prominent infrastructures for human-centric multimedia applications due to the wide availability of low-cost hardware such as microphones and CMOS cameras. By virtue of the energy limitations on sensor nodes alongside the explicit highly demanding bandwidth requirements of real-time multimedia applications, these particular networks foster a set of non-trivial challenges that need to be confronted. In this paper we define a level of relevance in regards with the content of a multimedia packet and we further introduce a dynamic routing protocol that optimizes the overall network performance in terms of energy efficiency and packet delay. We present the design, implementation and applicability of our Content Relevance Opportunistic Routing (CROR) protocol under experimental results that show an increase in network lifetime of up to 20% compared with traditional routing.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"34 1","pages":"263-268"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80700603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849321
J. Costa, Guowang Miao
As a key enabler of Internet of things, cellular network based Machine-to-Machine (M2M) communications have been growing rapidly in recent years, being used in a wide range of services such as security, metering, health, remote control, tracking, and so on. A critical issue in M2M communications is the energy efficiency as typically the machine devices are powered by batteries of low capacity and thus, it is the key to optimize their consumption. To achieve higher energy efficiency, this paper proposes the adoption of contexts through a generic context-aware framework for M2M communications. With this framework, machine devices dynamically adapt their settings depending on a series of characteristics such as data reporting mode, QoS features, and network conditions to achieve higher energy efficiency and extend the operating lifetime of M2M networks. Simulation results are provided for four commonly used M2M applications. The results demonstrate considerable energy savings and operating lifetime extension on the network when the proposed context-aware framework is used. Thus, it is shown that contexts play an important role on the energy efficiency of M2M systems.
{"title":"Context-aware Machine-to-Machine communications","authors":"J. Costa, Guowang Miao","doi":"10.1109/INFCOMW.2014.6849321","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849321","url":null,"abstract":"As a key enabler of Internet of things, cellular network based Machine-to-Machine (M2M) communications have been growing rapidly in recent years, being used in a wide range of services such as security, metering, health, remote control, tracking, and so on. A critical issue in M2M communications is the energy efficiency as typically the machine devices are powered by batteries of low capacity and thus, it is the key to optimize their consumption. To achieve higher energy efficiency, this paper proposes the adoption of contexts through a generic context-aware framework for M2M communications. With this framework, machine devices dynamically adapt their settings depending on a series of characteristics such as data reporting mode, QoS features, and network conditions to achieve higher energy efficiency and extend the operating lifetime of M2M networks. Simulation results are provided for four commonly used M2M applications. The results demonstrate considerable energy savings and operating lifetime extension on the network when the proposed context-aware framework is used. Thus, it is shown that contexts play an important role on the energy efficiency of M2M systems.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"59 1","pages":"730-735"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89354822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849257
M. Jia, Jiannong Cao, Lei Yang
Mobile applications are becoming increasingly computation-intensive, while the computing capacity of mobile devices is limited. A powerful way to reduce completion time of an application is to offload tasks to the cloud for execution. However, online offloading an application with general taskgraph is a difficult task. In this paper we present an online task offloading algorithm that minimizes the completion time of the application on the mobile device. We take cloud service time into account when making an offloading decision and we consider general taskgraphs for offloading. In our algorithm, for sequential tasks (i.e., line topology taskgraphs) we find the optimal offloading of tasks to the cloud. For concurrent tasks (i.e., general topology taskgraphs) we use a load-balancing heuristic to offload tasks to the cloud, such that the parallelism between the mobile and the cloud is maximized. Simulation results show that our algorithm has a performance of at least 85% of the optimal solution, and is significantly better than other existing algorithms.
{"title":"Heuristic offloading of concurrent tasks for computation-intensive applications in mobile cloud computing","authors":"M. Jia, Jiannong Cao, Lei Yang","doi":"10.1109/INFCOMW.2014.6849257","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849257","url":null,"abstract":"Mobile applications are becoming increasingly computation-intensive, while the computing capacity of mobile devices is limited. A powerful way to reduce completion time of an application is to offload tasks to the cloud for execution. However, online offloading an application with general taskgraph is a difficult task. In this paper we present an online task offloading algorithm that minimizes the completion time of the application on the mobile device. We take cloud service time into account when making an offloading decision and we consider general taskgraphs for offloading. In our algorithm, for sequential tasks (i.e., line topology taskgraphs) we find the optimal offloading of tasks to the cloud. For concurrent tasks (i.e., general topology taskgraphs) we use a load-balancing heuristic to offload tasks to the cloud, such that the parallelism between the mobile and the cloud is maximized. Simulation results show that our algorithm has a performance of at least 85% of the optimal solution, and is significantly better than other existing algorithms.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"352-357"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89461504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849309
A. Beussink, K. Akkaya, I. Senturk, Mohamed Mahmoud
While the newly envisioned Smart(er) Grid (SG) will result in a more efficient and reliable power grid, its use of fine-grained meter data has widely raised concerns of consumer privacy. In this paper, we propose to implement a data obfuscation approach to preserve consumer privacy and assess its feasibility on large-scale Advanced Metering Infrastructure (AMI) network built upon the new IEEE 802.11s wireless mesh standard. We first propose a secure obfuscation value distribution approach on this 802.11s-based wireless mesh network. Using obfuscation values provided via this approach, the meter readings are obfuscated to protect consumer privacy from eavesdroppers and the utility companies while preserving the utility companies' ability to use the data for state estimation. We assessed the impact of using this privacy approach on the data throughput and delay. Simulation results have shown that the impact of our approach on the network performance is acceptable.
{"title":"Preserving consumer privacy on IEEE 802.11s-based smart grid AMI networks using data obfuscation","authors":"A. Beussink, K. Akkaya, I. Senturk, Mohamed Mahmoud","doi":"10.1109/INFCOMW.2014.6849309","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849309","url":null,"abstract":"While the newly envisioned Smart(er) Grid (SG) will result in a more efficient and reliable power grid, its use of fine-grained meter data has widely raised concerns of consumer privacy. In this paper, we propose to implement a data obfuscation approach to preserve consumer privacy and assess its feasibility on large-scale Advanced Metering Infrastructure (AMI) network built upon the new IEEE 802.11s wireless mesh standard. We first propose a secure obfuscation value distribution approach on this 802.11s-based wireless mesh network. Using obfuscation values provided via this approach, the meter readings are obfuscated to protect consumer privacy from eavesdroppers and the utility companies while preserving the utility companies' ability to use the data for state estimation. We assessed the impact of using this privacy approach on the data throughput and delay. Simulation results have shown that the impact of our approach on the network performance is acceptable.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"217 1","pages":"658-663"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76569868","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-08DOI: 10.1109/INFCOMW.2014.6849167
A. Almeida, Everton Cavalcante, T. Batista, N. Cacho, Frederico Lopes
This paper presents a dynamic adaptation process for multi-cloud applications that is composed of two phases. The first one is a modeling phase, which borrows the ability for representing commonalities and variabilities from the software product lines (SPL) paradigm. In this phase, a customized model feature specifies the configuration of cloud services to be used by an application (commonalities) and the different possible providers for each service (variabilities). The second phase is an implementation phase, which relies on the Mape-K autonomic loop to define the steps of an adaptation strategy and a centralized knowledge management provides the proper inputs for each step. Finally, in order to make easier the task of developing the adaptation process itself, the current implementation of the adaptation strategy relies on the FraSCAti component framework, which allows performing wiring and unwiring operations between components.
{"title":"A component-based adaptation approach for multi-cloud applications","authors":"A. Almeida, Everton Cavalcante, T. Batista, N. Cacho, Frederico Lopes","doi":"10.1109/INFCOMW.2014.6849167","DOIUrl":"https://doi.org/10.1109/INFCOMW.2014.6849167","url":null,"abstract":"This paper presents a dynamic adaptation process for multi-cloud applications that is composed of two phases. The first one is a modeling phase, which borrows the ability for representing commonalities and variabilities from the software product lines (SPL) paradigm. In this phase, a customized model feature specifies the configuration of cloud services to be used by an application (commonalities) and the different possible providers for each service (variabilities). The second phase is an implementation phase, which relies on the Mape-K autonomic loop to define the steps of an adaptation strategy and a centralized knowledge management provides the proper inputs for each step. Finally, in order to make easier the task of developing the adaptation process itself, the current implementation of the adaptation strategy relies on the FraSCAti component framework, which allows performing wiring and unwiring operations between components.","PeriodicalId":6468,"journal":{"name":"2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"8 1","pages":"49-54"},"PeriodicalIF":0.0,"publicationDate":"2014-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75049645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：