A Profit Maximization Scheme in Cloud Computing With Deadline Constraints

Cloud computing has attracting more and more attention for its flexibility and economic benefits. To maintain the supply-demand relationship among different participants in cloud computing environment, the exchange of value is the inner drive. From the perspective of cloud service provider, its prim...

Full description

Bibliographic Details
Main Authors: Siyi Chen, Sining Huang, Qiang Luo, Jialing Zhou
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9121274/
id doaj-435124cf75d0410aa87cc231f65f03f0
record_format Article
spelling doaj-435124cf75d0410aa87cc231f65f03f02021-03-30T01:52:45ZengIEEEIEEE Access2169-35362020-01-01811892411893910.1109/ACCESS.2020.30037999121274A Profit Maximization Scheme in Cloud Computing With Deadline ConstraintsSiyi Chen0https://orcid.org/0000-0003-4662-5682Sining Huang1Qiang Luo2Jialing Zhou3School of Automation and Electronic Information, Xiangtan University, Xiangtan, ChinaSchool of Automation and Electronic Information, Xiangtan University, Xiangtan, ChinaSchool of Civil Engineering, Guangzhou University, 510640, ChinaSchool of Automation and Electronic Information, Xiangtan University, Xiangtan, ChinaCloud computing has attracting more and more attention for its flexibility and economic benefits. To maintain the supply-demand relationship among different participants in cloud computing environment, the exchange of value is the inner drive. From the perspective of cloud service provider, its primary concern is to earn the profit, which can be obtained by finishing the tasks published from customers. In this paper, we consider each task consists of numbers of sub-tasks in the logical order, each sub-task corresponds to a type of service requests, which can be served in unique multi-server system. On this basis, we propose a profit maximization problem in the multistage multi-server queue systems, in which customers are served at more than one stage, arranged in a series structure. Moreover, a deadline constraint is taken into consideration, which demonstrates the maximum tolerance degree that the customers can wait. Therefore, how to configure the parameters in multistage multi-server queue systems to maximize profit on the premise of reducing the waiting times of customers is a critical issue for cloud service provider. To address this problem, we first discuss the probability distribution function of the waiting time for single multi-server system and multistage multi-server queue systems respectively, and then propose a profit maximization model under the deadline constraint. Due to the complexity of this model, the analytical solution can hardly be obtained, we study a heuristic method to search for the optimal solution. At last, a series of numerical simulations are implemented to describe the performance of the proposed profit maximization scheme, the results show that not only the profit can be maximized, but also the waiting time of customers have been reduced effectively.https://ieeexplore.ieee.org/document/9121274/Cloud computingdeadlinequeueing modelmulti-server systemprofit maximizationwaiting time
collection DOAJ
language English
format Article
sources DOAJ
author Siyi Chen
Sining Huang
Qiang Luo
Jialing Zhou
spellingShingle Siyi Chen
Sining Huang
Qiang Luo
Jialing Zhou
A Profit Maximization Scheme in Cloud Computing With Deadline Constraints
IEEE Access
Cloud computing
deadline
queueing model
multi-server system
profit maximization
waiting time
author_facet Siyi Chen
Sining Huang
Qiang Luo
Jialing Zhou
author_sort Siyi Chen
title A Profit Maximization Scheme in Cloud Computing With Deadline Constraints
title_short A Profit Maximization Scheme in Cloud Computing With Deadline Constraints
title_full A Profit Maximization Scheme in Cloud Computing With Deadline Constraints
title_fullStr A Profit Maximization Scheme in Cloud Computing With Deadline Constraints
title_full_unstemmed A Profit Maximization Scheme in Cloud Computing With Deadline Constraints
title_sort profit maximization scheme in cloud computing with deadline constraints
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description Cloud computing has attracting more and more attention for its flexibility and economic benefits. To maintain the supply-demand relationship among different participants in cloud computing environment, the exchange of value is the inner drive. From the perspective of cloud service provider, its primary concern is to earn the profit, which can be obtained by finishing the tasks published from customers. In this paper, we consider each task consists of numbers of sub-tasks in the logical order, each sub-task corresponds to a type of service requests, which can be served in unique multi-server system. On this basis, we propose a profit maximization problem in the multistage multi-server queue systems, in which customers are served at more than one stage, arranged in a series structure. Moreover, a deadline constraint is taken into consideration, which demonstrates the maximum tolerance degree that the customers can wait. Therefore, how to configure the parameters in multistage multi-server queue systems to maximize profit on the premise of reducing the waiting times of customers is a critical issue for cloud service provider. To address this problem, we first discuss the probability distribution function of the waiting time for single multi-server system and multistage multi-server queue systems respectively, and then propose a profit maximization model under the deadline constraint. Due to the complexity of this model, the analytical solution can hardly be obtained, we study a heuristic method to search for the optimal solution. At last, a series of numerical simulations are implemented to describe the performance of the proposed profit maximization scheme, the results show that not only the profit can be maximized, but also the waiting time of customers have been reduced effectively.
topic Cloud computing
deadline
queueing model
multi-server system
profit maximization
waiting time
url https://ieeexplore.ieee.org/document/9121274/
work_keys_str_mv AT siyichen aprofitmaximizationschemeincloudcomputingwithdeadlineconstraints
AT sininghuang aprofitmaximizationschemeincloudcomputingwithdeadlineconstraints
AT qiangluo aprofitmaximizationschemeincloudcomputingwithdeadlineconstraints
AT jialingzhou aprofitmaximizationschemeincloudcomputingwithdeadlineconstraints
AT siyichen profitmaximizationschemeincloudcomputingwithdeadlineconstraints
AT sininghuang profitmaximizationschemeincloudcomputingwithdeadlineconstraints
AT qiangluo profitmaximizationschemeincloudcomputingwithdeadlineconstraints
AT jialingzhou profitmaximizationschemeincloudcomputingwithdeadlineconstraints
_version_ 1724186208871907328