【摘要】：針對(duì)云資源提供成本較高的問題,結(jié)合預(yù)留計(jì)劃和按需計(jì)劃,提出了一個(gè)兩階段的云資源提供算法,以降低服務(wù)提供商的運(yùn)營(yíng)成本。在預(yù)留階段,根據(jù)歷史數(shù)據(jù)估計(jì)工作負(fù)載需求的分布,將長(zhǎng)期的資源預(yù)留問題規(guī)劃為兩階段隨機(jī)規(guī)劃問題,并轉(zhuǎn)化為確定性的整數(shù)規(guī)劃問題進(jìn)行求解;在按需階段,采用基于卡爾曼濾波的工作負(fù)載預(yù)測(cè)算法預(yù)測(cè)工作負(fù)載需求,并且將按需資源提供問題規(guī)劃為整數(shù)規(guī)劃問題進(jìn)行求解。仿真結(jié)果表明,所提出的云資源提供算法節(jié)省了超過25%的運(yùn)營(yíng)成本,同時(shí)保證了較低的服務(wù)等級(jí)協(xié)議違約率。
[Abstract]:In order to reduce the operating cost of service providers, a two-stage cloud resource provision algorithm is proposed to solve the problem of high cost of cloud resource supply, combined with reservation plan and on-demand planning. In the reservation stage, the distribution of workload demand is estimated according to the historical data, and the long-term resource reservation problem is programmed into a two-stage stochastic programming problem, which is transformed into a deterministic integer programming problem to solve the problem. In the on-demand phase, the workload prediction algorithm based on Kalman filter is used to predict workload requirements, and the on-demand resource provision problem is solved as an integer programming problem. The simulation results show that the proposed cloud resource provision algorithm can save more than 25% of the operating cost and ensure a lower service level agreement default rate.
【作者單位】： 南通大學(xué)電子信息學(xué)院;
【基金】：國(guó)家自然科學(xué)基金資助項(xiàng)目(61403216) 江蘇省高校自然科學(xué)研究面上資助項(xiàng)目(15KJD520002)
【分類號(hào)】：TP301.6

【相似文獻(xiàn)】

相關(guān)期刊論文 前4條

1 張治斌;劉麗麗;;基于信譽(yù)機(jī)制的云計(jì)算資源預(yù)留算法研究[J];計(jì)算機(jī)仿真;2013年10期

2 胡志剛,呂禎恒;一種基于動(dòng)態(tài)資源預(yù)留的任務(wù)映射算法[J];計(jì)算機(jī)應(yīng)用研究;2005年07期

3 祁超;張t，

本文編號(hào)：2348734