云環(huán)境下的資源分配和定價機(jī)制研究
發(fā)布時間:2017-12-27 01:05
本文關(guān)鍵詞:云環(huán)境下的資源分配和定價機(jī)制研究 出處:《揚州大學(xué)》2017年碩士論文 論文類型:學(xué)位論文
更多相關(guān)文章: 云計算 云資源分配 云資源定價 Bertrand模型
【摘要】:云計算是融合了網(wǎng)絡(luò)存儲、并行計算以及負(fù)載均衡等傳統(tǒng)技術(shù)的新產(chǎn)物,具有高可靠性、高可拓展性以及低廉的使用費用等特點,吸引了越來越多的企業(yè)加入到云計算的應(yīng)用行列中。云計算實現(xiàn)了以互聯(lián)網(wǎng)為載體,基于虛擬化技術(shù)的分布式網(wǎng)絡(luò)服務(wù),其服務(wù)形式可分為laaS(基礎(chǔ)設(shè)施即服務(wù))、PaaS(平臺即服務(wù))和SaaS(軟件即服務(wù)),其中主要研究的是laaS。云計算中的關(guān)鍵問題之一是虛擬機(jī)(VM)的分配,因此,如何對虛擬機(jī)進(jìn)行合理與高效的分配成為當(dāng)下需要研究的問題。本文主要針對云資源分配與定價機(jī)制進(jìn)行研究,主要工作有:(1)研究云計算與云資源分配現(xiàn)有的技術(shù)和理論知識,對團(tuán)購和拍賣的問題進(jìn)行了一定的分析,分析了非合作博弈的相關(guān)知識,并分析Nash均衡及Nash均衡解以及Nash均衡中Bertrand等經(jīng)典模型。(2)研究云資源環(huán)境下帶有時間時折扣屬性的云資源拍賣模型,提出一種新穎的分配和定價機(jī)制,該機(jī)制與現(xiàn)有的機(jī)制在實驗環(huán)境下進(jìn)行對比具有一定的優(yōu)勢,以此解決帶有時間折扣屬性的云資源團(tuán)購拍賣問題。(3)研究云資源的定價策略問題,基于Bertrand模型結(jié)合團(tuán)購策略提出一套云資源的定價策略?紤]了雙寡頭的云提供商的情況,首先研究兩個云提供商均未采用團(tuán)購策情況,建立模型并求得一組最優(yōu)的Nash均衡解,然后繼續(xù)討論一個云提供商均采用團(tuán)購策略時,雙方的定價策略并最終獲得Nash均衡解。
[Abstract]:Cloud computing is a new product integrating traditional technologies such as network storage, parallel computing and load balancing. It has the characteristics of high reliability, high scalability and low cost of use, attracting more and more enterprises to join the ranks of cloud computing applications. Cloud computing has realized the distributed network service based on virtualization technology based on Internet. Its service form can be divided into laaS (infrastructure, namely service), PaaS (platform as a service) and SaaS (software as a service), among which laaS is the main research. One of the key problems in cloud computing is the allocation of virtual machines (VM). Therefore, how to allocate the virtual machines reasonably and efficiently has become a problem that needs to be studied. This paper focuses on the cloud resource allocation and pricing mechanism, the main work is: (1) research of cloud computing and cloud resource allocation of existing technology and theoretical knowledge, analyses the problems of group purchase and auction, analyzes the related knowledge of non cooperative game theory, and analyze the Nash equilibrium and Nash equilibrium and Bertrand Nash equilibrium in the classical model. (2) the study of cloud resource environment with time when the cloud resource attribute auction discount model, this paper proposes a novel allocation and pricing mechanism, the mechanism and the existing mechanism comparison has certain advantages in the experimental environment, in order to solve the problem with the cloud resource group purchase auction time discount attribute. (3) the pricing strategy of cloud resources is studied, and a set of pricing strategies for cloud resources is proposed based on the Bertrand model combined with the group buying strategy. Consider a duopoly cloud provider, the first of two cloud providers were not using strategy Nash equilibrium group purchase, the establishment of model and obtain a set of optimal solutions, and then continue to discuss a cloud provider with group purchase strategy, the pricing strategy and eventually won the Nash equilibrium.
【學(xué)位授予單位】:揚州大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2017
【分類號】:TP393.09
【相似文獻(xiàn)】
相關(guān)期刊論文 前10條
1 聞小帆;沈秀梅;錢艷平;;基于定價優(yōu)化的網(wǎng)絡(luò)資源分配機(jī)制研究[J];科技情報開發(fā)與經(jīng)濟(jì);2009年16期
2 曲曉飛,王眾嫭;一種新的多人資源分配理論——多目標(biāo)資源分配的協(xié)商對策[J];大連理工大學(xué)學(xué)報;1989年04期
3 王慧;楊晨;張平;;移動廣播融合網(wǎng)絡(luò)中的資源分配和定價模型[J];北京郵電大學(xué)學(xué)報;2008年04期
4 張林;胡若;;基于排隊機(jī)制下多代理的資源分配沖突處理[J];計算機(jī)工程;2008年15期
5 甘志輝;董淼;汪偉;朱瑞波;;多載波TD-HSDPA信道的資源分配[J];移動通信;2008年Z1期
6 王U,
本文編號:1339584
本文鏈接:http://sikaile.net/shoufeilunwen/xixikjs/1339584.html
最近更新
教材專著