.png){kind=icon}
返回
A Dynamic Combinatorial Double Auction Model for Cloud Resource Allocation
.png){kind=icon}
PRE
AI
DOI：10.1109/TCC.2022.3231249.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For the cloud market, we proposed a Dynamic Combinatorial Double Auction (DCDA) model to improve the social welfare and resource utilization. In the model, cloud-agents represent cloud service providers, and user-agents represent cloud users. They bid for various combinations of resources in a dynamic environment. To overcome the computational complexity of combinatorial auctions, we employed a greedy approximation method to solve the winner determination problem together with a truthful payment scheme. The proposed model is proven to be approximately efficient, incentive compatible, individually rational, and budget-balanced. Considering both parties' interests and the relative scarcity of cloud resources, this model also ensures fairness and balances resource allocation.
Keyword:
Cloud computing
combinatorial double auction
truthful mechanism
greedy heuristics
winner determination problem
resource allocation
期刊
I
IF:
5
论文数:
1.8K
被引数:
4.3K
机构
引用论文
.png){kind=icon}
查看更多内容