A request allocation model for processing data in federated cloud computing

Abstract

Purpose As the storage and processing requirement of digital information is increasing on the cloud, it is very difficult for the single cloud provider (CP) to meet the resource requirement. Multiple providers form a federation for the execution of users’ requests. For the federated cloud, this paper aims to address the issue distribution of users’ request for resources and revenue among the providers by offering fair and stable distribution models for the federated cloud. Design/methodology/approach This paper uses cooperative game (CG)-theoretical models, i.e. Shapley–Shubik power index (SSPI) and Banzhaf power index (BPI) for distribution. Performance is analysed using variance and monotonicity using a case study. Findings Numerical analysis is done using two scenarios. Monotonicity is evaluated. Results show that SSPI performs better as compared to BPI in terms of fairness accuracy and the framework provide the fair distribution of revenue among providers in the federated cloud. Research limitations/implications The proposed framework works efficiently under the specific defined conditions. Social implications Paper provides the fair distribution. It assist the centralised cloud exchange in managing the users’ request in such a way every CPs, in the federated cloud will get an equal chance of serving the users’ request. The framework also provides the stable federation. Proposed work provides less rejection rate of users’ request. Finally, it assists the providers in increasing their profits in the federation. Originality/value This paper presents a CG theoretic-based framework for the distribution of resources required and revenue. The framework analysed the performance of distribution models by considering the variance and monotonicity for multiple users’ requests.