Quality and Profit Assured Trusted Cloud Federation Formation: Game Theory Based Approach
TL;DR: The main objective of this work is to find the most suitable and stable federation of trusted CSPs that will maximize the satisfaction level of each individual CSP on the basis of QoS and profit.
Abstract: With more awareness and growth in the cloud market, demands for computational resources have increased in order to provide services to the cloud users. Sometimes it is difficult for an individual cloud service provider (CSP) to meet the level of promised quality of service (QoS) and to fulfill all types of resource requests dynamically. Cloud federation has become a consolidated paradigm in which group of cooperative CSPs share their unused resources with peers to gain some economic benefit. Hence, the cloud federation overcomes the limitation of each CSP for maintaining QoS during sudden spikes in resource demand. However, the presence of untrusted CSPs degrades the QoS of the services delivered through federation. Trusted CSPs are highly reputed in the federation as they can extend their resources and services to maintain the level of committed QoS by the member CSPs of the federation. Therefore, to guarantee delivery of committed QoS, it will be necessary to form a federation with trusted CSPs only. In this paper, we present a broker based cloud federation architecture. The cloud federation formation is modeled as a hedonic coalitional game . The main objective of this work is to find the most suitable and stable federation of trusted CSPs that will maximize the satisfaction level of each individual CSP on the basis of QoS and profit. The proposed coalitional game inspired cloud federation formation (CGCFF) algorithm has been extensively compared with selected existing techniques. Simulation results show that the set of federation formed by CGCFF is Nash-stable and performs better than these techniques in terms of satisfaction, quality and profit.
Citations
More filters
TL;DR: This paper looks at statistical multiplexing and server consolidation as such a strength and examines the use of the coefficient of variation and other related statistical metrics as objective functions which can be used in deciding on the request distribution mechanism.
27 citations
TL;DR: A novel blockchain-based decentralized federation model that embodies quality verification for cloud providers who lease computing resources from each other and introduces oracle as a verifier agent to monitor the quality of the service and report to the smart contract agents deployed on the blockchain.
Abstract: This paper introduces a novel blockchain-based decentralized federation model that embodies quality verification for cloud providers who lease computing resources from each other. The blockchain structure removes the barriers of a traditional centralized federation and offers a fully distributed and transparent administration by enforcing the involved agents to maintain consensus on the data. For a blockchain-based federation, it is vital to avoid blind-trust on the claimed SLA guarantees and monitor the quality of service which is highly desirable considering the multi-tenancy characteristic of cloud services. Due to the fact that the blockchain network is unable to access the outside world, it cannot handle, by its own, providers misbehavior in terms of SLA violations. Thus, we introduce oracle as a verifier agent to monitor the quality of the service and report to the smart contract agents deployed on the blockchain. Oracle is a trusted third-party agent who can communicate with the outside world of the blockchain network. The interaction between cloud service providers (either providing a service or requesting it from another provider) and the oracle through smart contracts comprises a system of autonomous and utility maximizer agents. Cloud requesters seek to receive high quality services with constant monitoring at cheap prices or even with no charge, while cloud providers aim to have a balanced work-load with less preserved capacity, and the oracle tends to charge higher for their monitoring services. Therefore, to model this conflicting situation, we formulate a dynamic Stackelberg differential game to optimize the cost of using the oracle and maximize the profit of the agents with the role of provider agent as a leader, and the requester and verifier agents as followers. Our designed Stackelberg differential game can seize the dynamicity of users’ demand and resource provisioning in a competitive cloud market. We implemented our proposed decentralized model using the Solidity language in the remix IDE on the Ethereum network. We further evaluated the optimal controls and agents’ profit with real-world data simulated for three concrete cloud providers. The results revealed that the requester agent initiates most of the quality verification requests at the beginning to the middle time of the contract. Thus, the provider agent could reserve less computing resources considering the fact that it could share the workload among other customers’ computing resources during the peak-time. Moreover, imposing a higher penalty on the provider agent increased the capacity and decreased the number of requests for quality verification at the equilibrium. The evaluation also disclosed that the impact of timing in the dynamic pricing strategy of the verifier agent is very minimal, and the provisioning capacity of the provider is strongly correlated with the monitoring price.
16 citations
Cites background from "Quality and Profit Assured Trusted ..."
...ing the managed data, and the creation and management overhead of these federations [1], [2], [3], [4]....
[...]
TL;DR: A heuristic-based algorithm for cloud federation formation following the integer linear program is proposed and it is shown that this proposed mechanism yields optimized solution to the general problem of profit/QoS trade-off.
Abstract: The emergence of cloud computing has led to an astronomical growth in the computing services provided by vendors over the cloud interface. This has led to the paradigm of cloud federations where a group of CSPs collaborate to form a federation for seamless provisioning of resource requests. In this paper, cloud federation formation framework is modeled as a multi-objective optimization problem with the trade-off between profit and QoS. Federation formation algorithms try to maximize the federation profit while maintaining a balance between the QoS and the profit of the members of the federation. We have applied Linear Scalarization as well as $$\varepsilon $$
-constraint method to find the pareto-optimal solution to this multi-objective optimization problem. A heuristic-based algorithm for cloud federation formation following the integer linear program is proposed. We perform extensive experiments to investigate the performance of our proposed mechanism and show that our proposed mechanism yields optimized solution to the general problem of profit/QoS trade-off.
15 citations
TL;DR: A physical resource unit which has specific computational features and can be shared between cloud providers is introduced in this paper and shows that the Cournot model outperforms others in terms of overall benefit and responsiveness.
14 citations
References
More filters
31 Dec 2008
TL;DR: The concept of Cloud Computing is discussed to achieve a complete definition of what a Cloud is, using the main characteristics typically associated with this paradigm in the literature.
Abstract: This paper discusses the concept of Cloud Computing to achieve a complete definition of what a Cloud is, using the main characteristics typically associated with this paradigm in the literature. More than 20 definitions have been studied allowing for the extraction of a consensus definition as well as a minimum definition containing the essential characteristics. This paper pays much attention to the Grid paradigm, as it is often confused with Cloud technologies. We also describe the relationships and distinctions between the Grid and Cloud approaches.
2,518 citations
TL;DR: The novelty of the approach is that it does not use a model selection criterion to choose one among a set of preestimated candidate models; instead, it seamlessly integrate estimation and model selection in a single algorithm.
Abstract: This paper proposes an unsupervised algorithm for learning a finite mixture model from multivariate data. The adjective "unsupervised" is justified by two properties of the algorithm: 1) it is capable of selecting the number of components and 2) unlike the standard expectation-maximization (EM) algorithm, it does not require careful initialization. The proposed method also avoids another drawback of EM for mixture fitting: the possibility of convergence toward a singular estimate at the boundary of the parameter space. The novelty of our approach is that we do not use a model selection criterion to choose one among a set of preestimated candidate models; instead, we seamlessly integrate estimation and model selection in a single algorithm. Our technique can be applied to any type of parametric mixture model for which it is possible to write an EM algorithm; in this paper, we illustrate it with experiments involving Gaussian mixtures. These experiments testify for the good performance of our approach.
2,182 citations
"Quality and Profit Assured Trusted ..." refers methods in this paper
...We have used the expectation-maximization (EM) algorithm for themaximum likelihood estimation of the vector of unknown parameters (like al, bl and vl) of the Beta mixture model [25],[26]....
[...]
...For detail explanation of Beta mixture model, refer to [25],[26]....
[...]
01 Jan 2011
2,037 citations
"Quality and Profit Assured Trusted ..." refers background in this paper
...CLOUD computing has earned an overwhelming popularity as a paradigm to deliver services and resources through virtualization and on demand provisioning techniques [1]....
[...]
TL;DR: The Reservoir project is motivated by the vision of implementing an architecture that would enable providers of cloud infrastructure to dynamically partner with each other to create a seemingly infinite pool of IT resources while fully preserving their individual autonomy in making technological and business management decisions.
Abstract: The emerging cloud-computing paradigm is rapidly gaining momentum as an alternative to traditional IT (information technology). However, contemporary cloud-computing offerings are primarily targeted for Web 2.0-style applications. Only recently have they begun to address the requirements of enterprise solutions, such as support for infrastructure service-level agreements. To address the challenges and deficiencies in the current state of the art, we propose a modular, extensible cloud architecture with intrinsic support for business service management and the federation of clouds. The goal is to facilitate an open, service-based online economy in which resources and services are transparently provisioned and managed across clouds on an ondemand basis at competitive costs with high-quality service. The Reservoir project is motivated by the vision of implementing an architecture that would enable providers of cloud infrastructure to dynamically partner with each other to create a seemingly infinite pool of IT resources while fully preserving their individual autonomy in making technological and business management decisions. To this end, Reservoir could leverage and extend the advantages of virtualization and embed autonomous management in the infrastructure. At the same time, the Reservoir approach aims to achieve a very ambitious goal: creating a foundation for next-generation enterprise-grade cloud computing.
832 citations
TL;DR: This work considers the partitioning of a society into coalitions in purely hedonic settings, and shows that if coalitions can be ordered according to some characteristic over which players have single-peaked preferences, then there exists an individually stable coalition partition.
792 citations
"Quality and Profit Assured Trusted ..." refers background or methods in this paper
...The stability of the final partition f formed by the convergence of stabilizeðÞ method of CGCFF algorithm, can be analyzed by using the stability concept of hedonic game [27]....
[...]
...from [27], this formed partition f is also individually stable....
[...]
...Further, from [27], it can be shown that every Nash-stable coalition partition is also an individually stable....
[...]
...However, before discussing the preference function, let us define initially the concept of coalition partition and thereafter preference relation [27]....
[...]
...A hedonic game is a particular type of NTU game in which players have preference over which coalition they belong to and utility of any player in a coalition solely depends on the identity of the players in their coalition, but not on how other players are partitioned [27]....
[...]