Pub Date : 2014-12-01DOI: 10.1109/CloudNet.2014.6968976
C. Powell, Takashi Aizawa, M. Munetomo
This paper outlines the design of an authentication infrastructure for linking distributed heterogeneous cloud systems managed by different cloud management middleware to enable them to interoperate as an integrated inter-cloud system. This authentication infrastructure achieves single sign-on (SSO), which allows users to log in once and access the various cloud systems without being asked to log in again at each system. Further, it does so without changing the design of the existing cloud systems by using a proxy certificate repository and Shibboleth authentication technology. We also report on a prototype implementation of the system that validates the design of the authentication infrastructure.
{"title":"Design of an SSO authentication infrastructure for heterogeneous inter-cloud environments","authors":"C. Powell, Takashi Aizawa, M. Munetomo","doi":"10.1109/CloudNet.2014.6968976","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6968976","url":null,"abstract":"This paper outlines the design of an authentication infrastructure for linking distributed heterogeneous cloud systems managed by different cloud management middleware to enable them to interoperate as an integrated inter-cloud system. This authentication infrastructure achieves single sign-on (SSO), which allows users to log in once and access the various cloud systems without being asked to log in again at each system. Further, it does so without changing the design of the existing cloud systems by using a proxy certificate repository and Shibboleth authentication technology. We also report on a prototype implementation of the system that validates the design of the authentication infrastructure.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115268959","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-12-01DOI: 10.1109/CloudNet.2014.6968970
S. Kassahun, Atinkut Demessie, D. Ilie
We present a live migration solution based on Proxy Mobile IPv6 (PMIPv6), a light-weight mobility protocol standardized by IETF. PMIPv6 handles node mobility without requiring any support from the moving nodes. In addition, PMIPv6 works with IPv4, IPv6 and dual-stack nodes. Our results from a real testbed show that network connectivity is successfully maintained with little signaling overhead and with short virtual machine (VM) downtime. As far as we know, this is the first time PMIPv6 is used to enable live migration beyond the scope of a LAN.
{"title":"A PMIPv6 approach to maintain network connectivity during VM live migration over the internet","authors":"S. Kassahun, Atinkut Demessie, D. Ilie","doi":"10.1109/CloudNet.2014.6968970","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6968970","url":null,"abstract":"We present a live migration solution based on Proxy Mobile IPv6 (PMIPv6), a light-weight mobility protocol standardized by IETF. PMIPv6 handles node mobility without requiring any support from the moving nodes. In addition, PMIPv6 works with IPv4, IPv6 and dual-stack nodes. Our results from a real testbed show that network connectivity is successfully maintained with little signaling overhead and with short virtual machine (VM) downtime. As far as we know, this is the first time PMIPv6 is used to enable live migration beyond the scope of a LAN.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121007294","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-12-01DOI: 10.1109/CloudNet.2014.6968979
Paul Emmerich, Daniel Raumer, F. Wohlfart, G. Carle
Virtual switches, like Open vSwitch, have emerged as an important part of cloud networking architectures. They connect interfaces of virtual machines and establish the connection to the outer network via physical network interface cards. Today, all important cloud frameworks support Open vSwitch as the default virtual switch. However, general understanding about the performance implications of Open vSwitch in different usage scenarios is missing. In this work we provide insights into the performance properties by systematically conducting measurements in virtual switching setups. We present quantitative and qualitative performance results of Open vSwitch in scenarios involving physical and virtual network interfaces.
{"title":"Performance characteristics of virtual switching","authors":"Paul Emmerich, Daniel Raumer, F. Wohlfart, G. Carle","doi":"10.1109/CloudNet.2014.6968979","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6968979","url":null,"abstract":"Virtual switches, like Open vSwitch, have emerged as an important part of cloud networking architectures. They connect interfaces of virtual machines and establish the connection to the outer network via physical network interface cards. Today, all important cloud frameworks support Open vSwitch as the default virtual switch. However, general understanding about the performance implications of Open vSwitch in different usage scenarios is missing. In this work we provide insights into the performance properties by systematically conducting measurements in virtual switching setups. We present quantitative and qualitative performance results of Open vSwitch in scenarios involving physical and virtual network interfaces.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125736512","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-12-01DOI: 10.1109/CloudNet.2014.6968974
M. Sipos, F. Fitzek, D. Lucani, M. Pedersen
Distributed storage has attracted large interest lately from both industry and researchers as a flexible, cost-efficient, high performance, and potentially secure solution for geographically distributed data centers, edge caching or sharing storage among users. This paper studies the benefits of random linear network coding to exploit multiple commercially available cloud storage providers simultaneously with the possibility to constantly adapt to changing cloud performance in order to optimize data retrieval times. The main contribution of this paper is a new data distribution mechanisms that cleverly stores and moves data among different clouds in order to optimize performance. Furthermore, we investigate the trade-offs among storage space, reliability and data retrieval speed for our proposed scheme. By means of real-world implementation and measurements using well-known and publicly accessible cloud service providers, we can show close to 9x less network use for the adaptation compared to more conventional dense recoding approaches, while maintaining similar download time performance and the same reliability.
{"title":"Dynamic allocation and efficient distribution of data among multiple clouds using network coding","authors":"M. Sipos, F. Fitzek, D. Lucani, M. Pedersen","doi":"10.1109/CloudNet.2014.6968974","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6968974","url":null,"abstract":"Distributed storage has attracted large interest lately from both industry and researchers as a flexible, cost-efficient, high performance, and potentially secure solution for geographically distributed data centers, edge caching or sharing storage among users. This paper studies the benefits of random linear network coding to exploit multiple commercially available cloud storage providers simultaneously with the possibility to constantly adapt to changing cloud performance in order to optimize data retrieval times. The main contribution of this paper is a new data distribution mechanisms that cleverly stores and moves data among different clouds in order to optimize performance. Furthermore, we investigate the trade-offs among storage space, reliability and data retrieval speed for our proposed scheme. By means of real-world implementation and measurements using well-known and publicly accessible cloud service providers, we can show close to 9x less network use for the adaptation compared to more conventional dense recoding approaches, while maintaining similar download time performance and the same reliability.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122279887","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-12-01DOI: 10.1109/CloudNet.2014.6969020
Marius Noreikis, Pranas Butkus, J. Nurminen
People are constantly inventing new ways of reducing traffic in big cities and encouraging the use of public transport. The idea of park-and-ride facilities is to increase the usage of public transport. However, it imposes additional problems for a driver to plan her trip and does not state clear benefits of using the approach. We developed a seamless solution to guide a user to public transport transfer spots by combining Web services, vehicle data and integration with an in-car infotainment system. Our solution offers optimal parkand- ride transfer points, instantly shows the benefits of taking a transfer to means of public transport and guides the driver throughout the whole trip, in car and in the public transport. We tested the system in Helsinki Capital Area and developed a tool for analysing multi-modal transportation scenarios. By customising the system using various optimisation parameters such as CO2 emissions or trip time, we show what savings can be achieved in different scenarios.
{"title":"In-vehicle application for multimodal route planning and analysis","authors":"Marius Noreikis, Pranas Butkus, J. Nurminen","doi":"10.1109/CloudNet.2014.6969020","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6969020","url":null,"abstract":"People are constantly inventing new ways of reducing traffic in big cities and encouraging the use of public transport. The idea of park-and-ride facilities is to increase the usage of public transport. However, it imposes additional problems for a driver to plan her trip and does not state clear benefits of using the approach. We developed a seamless solution to guide a user to public transport transfer spots by combining Web services, vehicle data and integration with an in-car infotainment system. Our solution offers optimal parkand- ride transfer points, instantly shows the benefits of taking a transfer to means of public transport and guides the driver throughout the whole trip, in car and in the public transport. We tested the system in Helsinki Capital Area and developed a tool for analysing multi-modal transportation scenarios. By customising the system using various optimisation parameters such as CO2 emissions or trip time, we show what savings can be achieved in different scenarios.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121731186","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-12-01DOI: 10.1109/CloudNet.2014.6968964
Andrei Tchernykh, J. M. Cortés-Mendoza, Johnatan E. Pecero, P. Bouvry, D. Kliazovich
Cloud computing is widely being adopted by many companies because it allows to maximize the utilization of resources. However, the complexity of cloud computing systems with the existence of many cloud providers makes infeasible for the end user the optimal or near-optimal resource provisioning and utilization, especially in presence of uncertainty of very dynamic and unpredictable environment. Hence, adaptive load balancing algorithms are a fundamental part of the research in cloud computing. We formulate the problem and propose an adaptive load balancing algorithm for distributed computer environments. We also discuss the energy efficiency of our solution for the domain of VoIP computations on federated clouds.
{"title":"Adaptive energy efficient distributed VoIP load balancing in federated cloud infrastructure","authors":"Andrei Tchernykh, J. M. Cortés-Mendoza, Johnatan E. Pecero, P. Bouvry, D. Kliazovich","doi":"10.1109/CloudNet.2014.6968964","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6968964","url":null,"abstract":"Cloud computing is widely being adopted by many companies because it allows to maximize the utilization of resources. However, the complexity of cloud computing systems with the existence of many cloud providers makes infeasible for the end user the optimal or near-optimal resource provisioning and utilization, especially in presence of uncertainty of very dynamic and unpredictable environment. Hence, adaptive load balancing algorithms are a fundamental part of the research in cloud computing. We formulate the problem and propose an adaptive load balancing algorithm for distributed computer environments. We also discuss the energy efficiency of our solution for the domain of VoIP computations on federated clouds.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132108825","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-12-01DOI: 10.1109/CloudNet.2014.6968971
Jochen W. Guck, W. Kellerer
Due to the distributed nature of the network protocols, the provisioning of end-to-end Quality of Service (QoS) in IP-based networks is a complex task. We argue that Software Defined Networking (SDN) delivers a key technology to improve QoS provisioning. The core idea of SDN is the establishment of a standardized interface between the control and forwarding planes, allowing a logically centralized controller to control each forwarding element in a unified way. This unified interface provides three key features of SDN: flexibility, a centralized view and programmability. In this paper we exploit these features to create an end-to-end real-time QoS communication service based on SDN. In particular, our concept allows to flexibly allocate each flow in a network to different priority queues in each hop along its way to optimize the resource usage while being able to keep the delay and bandwidth constraints. This concept can be used, for example, to realize a more fine granular access control for real-time communication services allowing potentially more flows to be accepted than with traditional QoS reservation concepts. For our concept, we introduce a deterministic network model using network calculus to compute the optimal paths for each flow through the priority queues. We validate our concept with a simulation based performance analysis for a selected network scenario. In this setting our concept improves the average link utilization from 30% to more than 60% compared to traditional QoS reservation concepts.
{"title":"Achieving end-to-end real-time Quality of Service with Software Defined Networking","authors":"Jochen W. Guck, W. Kellerer","doi":"10.1109/CloudNet.2014.6968971","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6968971","url":null,"abstract":"Due to the distributed nature of the network protocols, the provisioning of end-to-end Quality of Service (QoS) in IP-based networks is a complex task. We argue that Software Defined Networking (SDN) delivers a key technology to improve QoS provisioning. The core idea of SDN is the establishment of a standardized interface between the control and forwarding planes, allowing a logically centralized controller to control each forwarding element in a unified way. This unified interface provides three key features of SDN: flexibility, a centralized view and programmability. In this paper we exploit these features to create an end-to-end real-time QoS communication service based on SDN. In particular, our concept allows to flexibly allocate each flow in a network to different priority queues in each hop along its way to optimize the resource usage while being able to keep the delay and bandwidth constraints. This concept can be used, for example, to realize a more fine granular access control for real-time communication services allowing potentially more flows to be accepted than with traditional QoS reservation concepts. For our concept, we introduce a deterministic network model using network calculus to compute the optimal paths for each flow through the priority queues. We validate our concept with a simulation based performance analysis for a selected network scenario. In this setting our concept improves the average link utilization from 30% to more than 60% compared to traditional QoS reservation concepts.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166170","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-12-01DOI: 10.1109/CloudNet.2014.6968975
G. Anastasi, E. Carlini, M. Coppola, Patrizio Dazzi, Marco Distefano
The Open Virtualization Format (OVF) is a software packaging standard designed to support the portability and deployment of applications in different virtualization platforms. Ease interoperability and portability among cloud providers is of paramount importance to mitigate vendor lock-in and fostering cooperation among different cloud technologies. To this end, the researcher community is spending a lot of effort in investigating cloud broker and cloud federation solutions. However, we feel that the community still misses an open-source reference tool for the management of these operations when it comes to the OVF standard. With the aim to fill this gap, we propose the OVF Toolkit, an open tool to parse, render, and split OVF files. This paper describes the principal design decisions, the implementation, and the capabilities of the toolkit, as well as its experimental evaluation.
{"title":"An OVF toolkit supporting Inter-Cloud application splitting","authors":"G. Anastasi, E. Carlini, M. Coppola, Patrizio Dazzi, Marco Distefano","doi":"10.1109/CloudNet.2014.6968975","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6968975","url":null,"abstract":"The Open Virtualization Format (OVF) is a software packaging standard designed to support the portability and deployment of applications in different virtualization platforms. Ease interoperability and portability among cloud providers is of paramount importance to mitigate vendor lock-in and fostering cooperation among different cloud technologies. To this end, the researcher community is spending a lot of effort in investigating cloud broker and cloud federation solutions. However, we feel that the community still misses an open-source reference tool for the management of these operations when it comes to the OVF standard. With the aim to fill this gap, we propose the OVF Toolkit, an open tool to parse, render, and split OVF files. This paper describes the principal design decisions, the implementation, and the capabilities of the toolkit, as well as its experimental evaluation.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125391063","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-12-01DOI: 10.1109/CloudNet.2014.6969018
Zhuoyao Wang, M. Hayat, N. Ghani, K. Shaban
A novel probabilistic multi-tenant model is developed to characterize the service performance of cloud systems. The model considers essential cloud-system characteristics including virtualization, multi-tenancy and heterogeneity of the physical servers. Given the probabilistic multi-tenant model, three virtual machine mapping algorithms are proposed. Of particular interest is the max-load-first algorithm, which firstly maps the largest VM, in terms of the workload size of a user's request it serves, to the fastest physical server in the system. Monte-Carlo simulation results show that the max-load-first algorithm outperforms the other two algorithms based on the mean of stochastic completion time of a group of arbitrary users' requests. The simulation results also provide insight on how the initial loads of servers affect the performance of the cloud system.
{"title":"A probabilistic multi-tenant model for virtual machine mapping in cloud systems","authors":"Zhuoyao Wang, M. Hayat, N. Ghani, K. Shaban","doi":"10.1109/CloudNet.2014.6969018","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6969018","url":null,"abstract":"A novel probabilistic multi-tenant model is developed to characterize the service performance of cloud systems. The model considers essential cloud-system characteristics including virtualization, multi-tenancy and heterogeneity of the physical servers. Given the probabilistic multi-tenant model, three virtual machine mapping algorithms are proposed. Of particular interest is the max-load-first algorithm, which firstly maps the largest VM, in terms of the workload size of a user's request it serves, to the fastest physical server in the system. Monte-Carlo simulation results show that the max-load-first algorithm outperforms the other two algorithms based on the mean of stochastic completion time of a group of arbitrary users' requests. The simulation results also provide insight on how the initial loads of servers affect the performance of the cloud system.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115215564","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-12-01DOI: 10.1109/CloudNet.2014.6968972
Obed Jules, A. Hafid, M. Serhani
To provide on-demand Cloud services, Cloud providers and customers are used to sign Service Level Agreement (SLA), which is an agreement on the level of service provided and its associated cost. Unfortunately, SLA is not as dynamic as the Cloud and the criteria on which a customer relies to select a provider can be of problematic nature. The provider must optimize its resources although he cannot predict the customer behavior that can make varying requests. This can have a direct impact on the availability of resources and thus may lead to SLA violations. To cope with this issue, we propose a framework that allows the customer to choose a trusted provider based on its reputation calculated using a Bayesian network and continuously updated via a Cloud directory. Moreover, we propose a smart and dynamic SLA scheme that uses a probabilistic ontology capable of detecting potential violations of contract parameters; in addition, it alerts the service provider about these violations. To evaluate our model we used data extracted from Amazon Web Service Elastic Cloud Compute and Google Compute Engine SLAs to simulate our proposal's environment. The results of our experiments show the effectiveness of probabilistic ontology for predicting SLA violation throughout some SLA parameters applied in Cloud environment.
为了提供按需云服务,云提供商和客户需要签署服务级别协议(SLA),这是关于所提供的服务级别及其相关成本的协议。不幸的是,SLA不像云那样动态,而且客户选择提供商所依赖的标准可能存在问题。提供者必须优化其资源,尽管他不能预测可能发出不同请求的客户行为。这可能会对资源的可用性产生直接影响,从而可能导致违反SLA。为了解决这个问题,我们提出了一个框架,允许客户根据使用贝叶斯网络计算并通过云目录不断更新的信誉来选择一个可信的提供商。此外,我们提出了一种智能的动态SLA方案,该方案使用能够检测潜在的合同参数违反的概率本体;此外,它还会提醒服务提供商这些违规行为。为了评估我们的模型,我们使用了从Amazon Web Service Elastic Cloud Compute和Google Compute Engine sla中提取的数据来模拟我们提议的环境。实验结果表明,概率本体可以有效地预测云环境中某些SLA参数的违反情况。
{"title":"Bayesian network, and probabilistic ontology driven trust model for SLA management of Cloud services","authors":"Obed Jules, A. Hafid, M. Serhani","doi":"10.1109/CloudNet.2014.6968972","DOIUrl":"https://doi.org/10.1109/CloudNet.2014.6968972","url":null,"abstract":"To provide on-demand Cloud services, Cloud providers and customers are used to sign Service Level Agreement (SLA), which is an agreement on the level of service provided and its associated cost. Unfortunately, SLA is not as dynamic as the Cloud and the criteria on which a customer relies to select a provider can be of problematic nature. The provider must optimize its resources although he cannot predict the customer behavior that can make varying requests. This can have a direct impact on the availability of resources and thus may lead to SLA violations. To cope with this issue, we propose a framework that allows the customer to choose a trusted provider based on its reputation calculated using a Bayesian network and continuously updated via a Cloud directory. Moreover, we propose a smart and dynamic SLA scheme that uses a probabilistic ontology capable of detecting potential violations of contract parameters; in addition, it alerts the service provider about these violations. To evaluate our model we used data extracted from Amazon Web Service Elastic Cloud Compute and Google Compute Engine SLAs to simulate our proposal's environment. The results of our experiments show the effectiveness of probabilistic ontology for predicting SLA violation throughout some SLA parameters applied in Cloud environment.","PeriodicalId":401167,"journal":{"name":"2014 IEEE 3rd International Conference on Cloud Networking (CloudNet)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693482","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}