文献类型：期刊文献

英文题名：A Novel Dynamic Pricing Approach for Preemptible Cloud Services

作者：Peng, Huijie[1];Cheng, Yan[1]

机构：[1]East China Univ Sci & Technol, Sch Business, Shanghai 200237, Peoples R China

年份：2023

卷号：11

起止页码：97807

外文期刊名：IEEE ACCESS

收录：;EI(收录号：20233814762011);WOS:【SCI-EXPANDED(收录号:WOS:001068862300001)】；

语种：英文

外文关键词：Cloud computing; Heuristic algorithms; Uncertainty; Task analysis; Dynamic programming; Service level agreements; Q-learning; Pricing; preemptible service; dynamic pricing; non-stationarity

摘要：Dynamic pricing for preemptible cloud services (DPPCS) is highly demanded to effectively utilize the excess capacity in cloud computing. However, the dynamic nature of excess capacity exhibits high non-stationarity, which is characterized by multi-temporal stochastic patterns with time-varying statistical properties. The non-stationarity results in the DPPCS problem being a Non-Stationary Markov Decision Process (NSMDP) with unknown transition probabilities. Moreover, DPPCS is constrained by a certain maximum preemption rate, further complicating the DPPCS problem as a Constrained NSMDP (CNSMDP). We transform the CNSMDP into a piecewise Lagrangian dual model, which converts the CNSMDP into an unconstrained optimization problem. To solve the above problem, we propose a novel Q-Learning approach for DPPCS. We first present estimation methods for the unknown environment parameters, including a detection method for identifying temporal pattern changes, and a diffusion approximation method for estimating the actual preemption rate. Then, we introduce a Lagrange multiplier updating method, which can strike a balance between revenue and the preemption rate in the reward function. Building upon the above methods, we develop a Constrained Non-Stationary Q-Learning (CNSQL) algorithm for DPPCS, which dynamically adjusts its learning process to adapt to the multi-temporal patterns. Through simulated experiments, we demonstrate the effectiveness of our proposed approach compared to state-of-the-art algorithms. It performs well in improving revenue generated from excess capacity while maintaining the actual preemption rate within the specified constraint.