Ignacio Castiñeiras, Danuta Sorina Chisca, D. Mehta, B. O’Sullivan
The power consumption of a data centre (DC) can be attributed to the power consumed by running the servers and the power consumed for cooling them. The challenge is to optimally balance IT and cooling power requirements, which demands the minimisation of a non-linear energy utilisation function. In this paper we propose a problem decomposition-based approach to tackle a non-linear energy utilisation function and successfully apply it to minimising the energy consumption of a DC.
{"title":"Trichotomic Search for Thermal-Aware Data Centre Workload Optimisation","authors":"Ignacio Castiñeiras, Danuta Sorina Chisca, D. Mehta, B. O’Sullivan","doi":"10.1109/UCC.2015.94","DOIUrl":"https://doi.org/10.1109/UCC.2015.94","url":null,"abstract":"The power consumption of a data centre (DC) can be attributed to the power consumed by running the servers and the power consumed for cooling them. The challenge is to optimally balance IT and cooling power requirements, which demands the minimisation of a non-linear energy utilisation function. In this paper we propose a problem decomposition-based approach to tackle a non-linear energy utilisation function and successfully apply it to minimising the energy consumption of a DC.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124114862","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}
Moustafa AbdelBaky, J. Montes, M. Parashar, Merve Unuvar, M. Steinder
Emerging lightweight cloud technologies, such as Docker containers, are gaining wide traction in IT due to the fact that they allow users to deploy applications in any environment faster and more efficiently than using virtual machines. However, current Docker-based container deployment solutions are aimed at managing containers in a single-site, which limits their capabilities. As more users look to adopt Docker containers in dynamic, heterogenous environments, the ability to deploy and effectively manage containers across multiple clouds and data centers becomes of utmost importance. In this paper, we propose a prototype framework, called C-Ports, that enables the deployment and management of Docker containers across multiple hybrid clouds and traditional clusters while taking into consideration user and resource provider objectives and constraints. The framework leverages a constraint-programming model for resource selection and uses CometCloud to allocate/deallocate resources as well as to deploy containers on top of these resources. Our prototype has been effectively used to deploy and manage containers in a dynamic federation composed of five clouds and two clusters.
{"title":"Docker Containers across Multiple Clouds and Data Centers","authors":"Moustafa AbdelBaky, J. Montes, M. Parashar, Merve Unuvar, M. Steinder","doi":"10.1109/UCC.2015.58","DOIUrl":"https://doi.org/10.1109/UCC.2015.58","url":null,"abstract":"Emerging lightweight cloud technologies, such as Docker containers, are gaining wide traction in IT due to the fact that they allow users to deploy applications in any environment faster and more efficiently than using virtual machines. However, current Docker-based container deployment solutions are aimed at managing containers in a single-site, which limits their capabilities. As more users look to adopt Docker containers in dynamic, heterogenous environments, the ability to deploy and effectively manage containers across multiple clouds and data centers becomes of utmost importance. In this paper, we propose a prototype framework, called C-Ports, that enables the deployment and management of Docker containers across multiple hybrid clouds and traditional clusters while taking into consideration user and resource provider objectives and constraints. The framework leverages a constraint-programming model for resource selection and uses CometCloud to allocate/deallocate resources as well as to deploy containers on top of these resources. Our prototype has been effectively used to deploy and manage containers in a dynamic federation composed of five clouds and two clusters.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131156374","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}
Yonal Kirsal, Y. K. Ever, L. Mostarda, O. Gemikonakli
In recent years, cloud computing becomes a new computing model emerged from the rapid development of the internet. Users can reach their resources with high flexibility using the cloud computing systems all over the world. However, such systems are prone to failures. In order to obtain realistic quality of service (QoS) measurements, failure and recovery behaviours of the system should be considered. System's failures and repairs are associated with availability context in QoS measurements. In this paper, performance issues are considered with the availability of the system. Markov Reward Model (MRM) method is used to get QoS measurements. The mean queue length (MQL) results are calculated using the MRM. The results explicitly show that failures and repairs affect the system performance significantly.
{"title":"Analytical Modelling and Performability Analysis for Cloud Computing Using Queuing System","authors":"Yonal Kirsal, Y. K. Ever, L. Mostarda, O. Gemikonakli","doi":"10.1109/UCC.2015.115","DOIUrl":"https://doi.org/10.1109/UCC.2015.115","url":null,"abstract":"In recent years, cloud computing becomes a new computing model emerged from the rapid development of the internet. Users can reach their resources with high flexibility using the cloud computing systems all over the world. However, such systems are prone to failures. In order to obtain realistic quality of service (QoS) measurements, failure and recovery behaviours of the system should be considered. System's failures and repairs are associated with availability context in QoS measurements. In this paper, performance issues are considered with the availability of the system. Markov Reward Model (MRM) method is used to get QoS measurements. The mean queue length (MQL) results are calculated using the MRM. The results explicitly show that failures and repairs affect the system performance significantly.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132959797","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}
Every day, numerous VMs are migrated inside a datacenter to balance the load, save energy or prepare production servers for maintenance. Despite VM placement problems are carefully studied, the underlying migration scheduler rely on vague adhoc models. This leads to unnecessarily long and energy-intensive migrations. We present mVM, a new and extensible migration scheduler. mVM takes into account the VM memory workload and the network topology to estimate precisely the migration duration and take wiser scheduling decisions. mVM is implemented as a plugin of BtrPlace and can be customized with additional scheduling constraints to finely control the migrations. Experiments on a real testbed show mVM outperforms schedulers that cap the migration parallelism by a constant to reduce the completion time. Besides an optimal capping, mVM reduces the migration duration by 20.4% on average and the completion time by 28.1%. In a maintenance operation involving 96 VMs to migrate between 72 servers, mVM saves 21.5% Joules against BtrPlace. Finally, its current library of 6 constraints allows administrators to address temporal and energy concerns, for example to adapt the schedule and fit a power budget.
{"title":"Scheduling Live-Migrations for Fast, Adaptable and Energy-Efficient Relocation Operations","authors":"Vincent Kherbache, E. Madelaine, Fabien Hermenier","doi":"10.1109/UCC.2015.37","DOIUrl":"https://doi.org/10.1109/UCC.2015.37","url":null,"abstract":"Every day, numerous VMs are migrated inside a datacenter to balance the load, save energy or prepare production servers for maintenance. Despite VM placement problems are carefully studied, the underlying migration scheduler rely on vague adhoc models. This leads to unnecessarily long and energy-intensive migrations. We present mVM, a new and extensible migration scheduler. mVM takes into account the VM memory workload and the network topology to estimate precisely the migration duration and take wiser scheduling decisions. mVM is implemented as a plugin of BtrPlace and can be customized with additional scheduling constraints to finely control the migrations. Experiments on a real testbed show mVM outperforms schedulers that cap the migration parallelism by a constant to reduce the completion time. Besides an optimal capping, mVM reduces the migration duration by 20.4% on average and the completion time by 28.1%. In a maintenance operation involving 96 VMs to migrate between 72 servers, mVM saves 21.5% Joules against BtrPlace. Finally, its current library of 6 constraints allows administrators to address temporal and energy concerns, for example to adapt the schedule and fit a power budget.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127878005","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}
Giannis Verginadis, G. Mentzas, Simeon Veloudis, I. Paraskakis
With the pervasion of cloud computing new security risks are created. A promising approach to alleviating these risks is to provide a security-by-design framework that will assist cloud application developers in defining appropriate context-driven access control policies. This paper surveys different approaches to context-driven access control, as well as different modelling formalisms for representing access control policies. The aim of this survey is to assess the appropriateness of existing approaches for the construction of a generic security-by-design framework, in particular one which is exposed as a PaaS offering.
{"title":"A Survey on Context Security Policies in the Cloud","authors":"Giannis Verginadis, G. Mentzas, Simeon Veloudis, I. Paraskakis","doi":"10.1109/UCC.2015.103","DOIUrl":"https://doi.org/10.1109/UCC.2015.103","url":null,"abstract":"With the pervasion of cloud computing new security risks are created. A promising approach to alleviating these risks is to provide a security-by-design framework that will assist cloud application developers in defining appropriate context-driven access control policies. This paper surveys different approaches to context-driven access control, as well as different modelling formalisms for representing access control policies. The aim of this survey is to assess the appropriateness of existing approaches for the construction of a generic security-by-design framework, in particular one which is exposed as a PaaS offering.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129351484","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}
Aline Bousquet, Jérémy Briffaut, E. Caron, E. M. Domínguez, Javier Franco, Arnaud Lefray, Ó. López, Saioa Ros, Jonathan Rouzaud-Cornabas, C. Toinard, Mikel Uriarte
Before deploying their infrastructure (resources, data, communications, ) on a Cloud computing platform, companies want to be sure that it will be properly secured. At deployment time, the company provides a security policy describing its security requirements through a set of properties. Once its infrastructure deployed, the company want to be assured that this policy is applied and enforced. But describing and enforcing security properties and getting strong evidences of it is a complex task. To address this issue, in [1], we have proposed a language that can be used to express both security and assurance properties on distributed resources. Then, we have shown how these global properties can be cut into a set of properties to be enforced locally. In this paper, we show how these local properties can be used to automatically configure security mechanisms. Our language is context-based which allows it to be easily adapted to any resource naming systems e.g., Linux and Android (with SELinux) or PostgreSQL. Moreover, by abstracting low-level functionalities (e.g., deny write to a file) through capabilities, our language remains independent from the security mechanisms. These capabilities can then be combined into security and assurance properties in order to provide high-level functionalities, such as confidentiality or integrity. Furthermore, we propose a global architecture that receives these properties and automatically configures the security and assurance mechanisms accordingly. Finally, we express the security and assurance policies of an industrial environment for a commercialized product and show how its security is enforced.
{"title":"Enforcing Security and Assurance Properties in Cloud Environment","authors":"Aline Bousquet, Jérémy Briffaut, E. Caron, E. M. Domínguez, Javier Franco, Arnaud Lefray, Ó. López, Saioa Ros, Jonathan Rouzaud-Cornabas, C. Toinard, Mikel Uriarte","doi":"10.1109/UCC.2015.45","DOIUrl":"https://doi.org/10.1109/UCC.2015.45","url":null,"abstract":"Before deploying their infrastructure (resources, data, communications, ) on a Cloud computing platform, companies want to be sure that it will be properly secured. At deployment time, the company provides a security policy describing its security requirements through a set of properties. Once its infrastructure deployed, the company want to be assured that this policy is applied and enforced. But describing and enforcing security properties and getting strong evidences of it is a complex task. To address this issue, in [1], we have proposed a language that can be used to express both security and assurance properties on distributed resources. Then, we have shown how these global properties can be cut into a set of properties to be enforced locally. In this paper, we show how these local properties can be used to automatically configure security mechanisms. Our language is context-based which allows it to be easily adapted to any resource naming systems e.g., Linux and Android (with SELinux) or PostgreSQL. Moreover, by abstracting low-level functionalities (e.g., deny write to a file) through capabilities, our language remains independent from the security mechanisms. These capabilities can then be combined into security and assurance properties in order to provide high-level functionalities, such as confidentiality or integrity. Furthermore, we propose a global architecture that receives these properties and automatically configures the security and assurance mechanisms accordingly. Finally, we express the security and assurance policies of an industrial environment for a commercialized product and show how its security is enforced.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116085604","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}
Policies play an important role in network configuration and therefore in offering secure and high performance services especially over multi-tenant Cloud Data Center (DC) environments. At the same time, elastic resource provisioning through virtualization often disregards policy requirements, assuming that the policy implementation is handled by the underlying network infrastructure. This can result in policy violations, performance degradation and security vulnerabilities. In this paper, we define PLAN, a PoLicy-Aware and Network-aware VM management scheme to jointly consider DC communication cost reduction through Virtual Machine (VM) migration while meeting network policy requirements. We show that the problem is NP-hard and derive an efficient approximate algorithm to reduce communication cost while adhering to policy constraints. Through extensive evaluation, we show that PLAN can reduce topology-wide communication cost by 38% over diverse aggregate traffic and configuration policies.
{"title":"PLAN: A Policy-Aware VM Management Scheme for Cloud Data Centres","authors":"Lin Cui, Fung Po Tso, D. Pezaros, Weijia Jia","doi":"10.1109/UCC.2015.30","DOIUrl":"https://doi.org/10.1109/UCC.2015.30","url":null,"abstract":"Policies play an important role in network configuration and therefore in offering secure and high performance services especially over multi-tenant Cloud Data Center (DC) environments. At the same time, elastic resource provisioning through virtualization often disregards policy requirements, assuming that the policy implementation is handled by the underlying network infrastructure. This can result in policy violations, performance degradation and security vulnerabilities. In this paper, we define PLAN, a PoLicy-Aware and Network-aware VM management scheme to jointly consider DC communication cost reduction through Virtual Machine (VM) migration while meeting network policy requirements. We show that the problem is NP-hard and derive an efficient approximate algorithm to reduce communication cost while adhering to policy constraints. Through extensive evaluation, we show that PLAN can reduce topology-wide communication cost by 38% over diverse aggregate traffic and configuration policies.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117036643","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}
This paper presents for the first time a formulation of the Virtual Machine Placement as a Many-Objective problem (MaVMP), considering the simultaneous optimization of the following five objective functions for dynamic environments: (1) power consumption, (2) inter-VM network traffic, (3) economical revenue, (4) number of VM migrations and (5) network traffic overhead for VM migrations. To solve the formulated MaVMP problem, a novel Memetic Algorithm is proposed. As a potentially large number of feasible solutions at any time is one of the challenges of MaVMP, five selection strategies are evaluated in order to automatically select one solution at each time. The proposed algorithm with the considered selection strategies were evaluated in two different scenarios.
{"title":"Many-objective virtual machine placement for dynamic environments","authors":"Diego Ihara, Fabio Lopez Pires, B. Barán","doi":"10.1109/UCC.2015.22","DOIUrl":"https://doi.org/10.1109/UCC.2015.22","url":null,"abstract":"This paper presents for the first time a formulation of the Virtual Machine Placement as a Many-Objective problem (MaVMP), considering the simultaneous optimization of the following five objective functions for dynamic environments: (1) power consumption, (2) inter-VM network traffic, (3) economical revenue, (4) number of VM migrations and (5) network traffic overhead for VM migrations. To solve the formulated MaVMP problem, a novel Memetic Algorithm is proposed. As a potentially large number of feasible solutions at any time is one of the challenges of MaVMP, five selection strategies are evaluated in order to automatically select one solution at each time. The proposed algorithm with the considered selection strategies were evaluated in two different scenarios.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114923489","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}
C. Kamhoua, Anbang Ruan, Andrew P. Martin, K. Kwiat
Trusting a cloud infrastructure is a hard problem, which urgently needs effective solutions. There are increasing demands for switching to the cloud in the sectors of financial, healthcare, or government etc., where data security protections are among the highest priorities. But most of them are left unsatisfied, due to the current cloud infrastructures' lack of provable trustworthiness. Trusted Computing (TC) technologies implement effective mechanisms for attesting to the genuine behaviors of a software platform. Integrating TC with cloud infrastructure shows a promising method for verifying the cloud's behaviors, which may in turn facilitate provable trustworthiness. However, the side effect of TC also brings concerns: exhibiting genuine behaviors might attract targeted attacks. Consequently, current Trusted Cloud proposals only integrate limited TC capabilities, which hampers the effective and practical trust establishment. In this paper, we aim to justify the benefits of a fully Open-Implementation cloud infrastructure, which means that the cloud's implementation and configuration details can be inspected by both the legitimate and malicious cloud users. We applied game theoretic analysis to discover the new dynamics formed between the Cloud Service Provider (CSP) and cloud users, when the Open-Implementation strategy is introduced. We conclude that, even though Open-Implementation cloud may facilitate attacks, vulnerabilities or misconfiguration are easier to discover, which in turn reduces the total security threats. Also, cyber threat monitoring and sharing are made easier in an Open-Implementation cloud. More importantly, the cloud's provable trustworthiness will attract more legitimate users, which increases CSP's revenue and helps lowering the price. This eventually creates a virtuous cycle, which will benefit both the CSP and legitimate users.
{"title":"On the Feasibility of an Open-Implementation Cloud Infrastructure: A Game Theoretic Analysis","authors":"C. Kamhoua, Anbang Ruan, Andrew P. Martin, K. Kwiat","doi":"10.1109/UCC.2015.38","DOIUrl":"https://doi.org/10.1109/UCC.2015.38","url":null,"abstract":"Trusting a cloud infrastructure is a hard problem, which urgently needs effective solutions. There are increasing demands for switching to the cloud in the sectors of financial, healthcare, or government etc., where data security protections are among the highest priorities. But most of them are left unsatisfied, due to the current cloud infrastructures' lack of provable trustworthiness. Trusted Computing (TC) technologies implement effective mechanisms for attesting to the genuine behaviors of a software platform. Integrating TC with cloud infrastructure shows a promising method for verifying the cloud's behaviors, which may in turn facilitate provable trustworthiness. However, the side effect of TC also brings concerns: exhibiting genuine behaviors might attract targeted attacks. Consequently, current Trusted Cloud proposals only integrate limited TC capabilities, which hampers the effective and practical trust establishment. In this paper, we aim to justify the benefits of a fully Open-Implementation cloud infrastructure, which means that the cloud's implementation and configuration details can be inspected by both the legitimate and malicious cloud users. We applied game theoretic analysis to discover the new dynamics formed between the Cloud Service Provider (CSP) and cloud users, when the Open-Implementation strategy is introduced. We conclude that, even though Open-Implementation cloud may facilitate attacks, vulnerabilities or misconfiguration are easier to discover, which in turn reduces the total security threats. Also, cyber threat monitoring and sharing are made easier in an Open-Implementation cloud. More importantly, the cloud's provable trustworthiness will attract more legitimate users, which increases CSP's revenue and helps lowering the price. This eventually creates a virtuous cycle, which will benefit both the CSP and legitimate users.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127314655","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}
Although there is an extensive amount of research covering in the area of Cloud computing, the field of bioinspired cloud computing is underinvestigated when compared to the general research area. This study tries to find answers on how a biomorphic model can be implemented in the cloud in order to achieve adaptive cloud behaviour. The process of cellular differentiation where cells transform from one type to another, is chosen to be the foundation model for a developed technical model. We define analogies to the cloud where stem cells are blank servers and web servers are cells with a specific function. With a combination of configuration management, version control and cloud deployment systems, an imitation of this biological process is applied in the cloud. The use of automated cloud scaling as a case of adaptive behaviour is the main goal of the research. One approach has been developed for mapping the biological model to the cloud which consists of a prototype where the signal detection and node activation is being triggered by using the concept of random generated timers. The obtained performance results were varying, depending on the general timer distribution, providing new ideas for future improvements and different algorithm proposals.
{"title":"A Biomorphic Model for Automated Cloud Adaptation","authors":"G. Stoykov, A. Yazidi","doi":"10.1109/UCC.2015.34","DOIUrl":"https://doi.org/10.1109/UCC.2015.34","url":null,"abstract":"Although there is an extensive amount of research covering in the area of Cloud computing, the field of bioinspired cloud computing is underinvestigated when compared to the general research area. This study tries to find answers on how a biomorphic model can be implemented in the cloud in order to achieve adaptive cloud behaviour. The process of cellular differentiation where cells transform from one type to another, is chosen to be the foundation model for a developed technical model. We define analogies to the cloud where stem cells are blank servers and web servers are cells with a specific function. With a combination of configuration management, version control and cloud deployment systems, an imitation of this biological process is applied in the cloud. The use of automated cloud scaling as a case of adaptive behaviour is the main goal of the research. One approach has been developed for mapping the biological model to the cloud which consists of a prototype where the signal detection and node activation is being triggered by using the concept of random generated timers. The obtained performance results were varying, depending on the general timer distribution, providing new ideas for future improvements and different algorithm proposals.","PeriodicalId":381279,"journal":{"name":"2015 IEEE/ACM 8th International Conference on Utility and Cloud Computing (UCC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124915654","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
扫码关注我们
求助内容：
应助结果提醒方式：