Truthful Multi-Combinatorial Double Auction Mechanism for Cloud Resource Allocation

IF 5.3 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Cloud Computing Pub Date : 2026-04-01 Epub Date: 2026-03-03 DOI:10.1109/TCC.2026.3669486
Qihui Li;Zhonglin He;Asher Wu;Liting Yu;Xiaohua Jia
{"title":"Truthful Multi-Combinatorial Double Auction Mechanism for Cloud Resource Allocation","authors":"Qihui Li;Zhonglin He;Asher Wu;Liting Yu;Xiaohua Jia","doi":"10.1109/TCC.2026.3669486","DOIUrl":null,"url":null,"abstract":"Efficient resource allocation in cloud computing environments is crucial for ensuring platform performance and service quality. To address the heterogeneity of cloud resources and the diverse demands of cloud users, this paper proposes a truthful multi-combinatorial double auction (TMCDA) mechanism for cloud resource allocation. The mechanism introduces resource weight ratios to reflect the relative importance and proportional relationships among different resource types, thereby enabling a more precise evaluation of heterogeneous resource combinations. Meanwhile, cloud users are allowed to submit multiple substitutable combinatorial resource requests, which increases allocation flexibility and improves transaction success rates. In the payment design, a critical price calculation method similar to the second-price auction is adopted to guarantee truthfulness and economic efficiency. By integrating resource bundle matching with weighted pricing, the proposed mechanism improves resource utilization and overall social welfare. Simulation results demonstrate that, compared with Truthful Combinatorial/Multi-unit multi-item Double Auction for Cloud computing (TCMDAC) and Combinatorial Double Auction Resource Allocation (CDARA), the proposed approach achieves at least 15% and 30% improvements in social welfare, respectively, highlighting its advantages in transaction fairness, incentive compatibility, and allocation efficiency.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":"14 2","pages":"643-654"},"PeriodicalIF":5.3000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11419659/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/3/3 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Efficient resource allocation in cloud computing environments is crucial for ensuring platform performance and service quality. To address the heterogeneity of cloud resources and the diverse demands of cloud users, this paper proposes a truthful multi-combinatorial double auction (TMCDA) mechanism for cloud resource allocation. The mechanism introduces resource weight ratios to reflect the relative importance and proportional relationships among different resource types, thereby enabling a more precise evaluation of heterogeneous resource combinations. Meanwhile, cloud users are allowed to submit multiple substitutable combinatorial resource requests, which increases allocation flexibility and improves transaction success rates. In the payment design, a critical price calculation method similar to the second-price auction is adopted to guarantee truthfulness and economic efficiency. By integrating resource bundle matching with weighted pricing, the proposed mechanism improves resource utilization and overall social welfare. Simulation results demonstrate that, compared with Truthful Combinatorial/Multi-unit multi-item Double Auction for Cloud computing (TCMDAC) and Combinatorial Double Auction Resource Allocation (CDARA), the proposed approach achieves at least 15% and 30% improvements in social welfare, respectively, highlighting its advantages in transaction fairness, incentive compatibility, and allocation efficiency.
云资源分配的真实多组合双拍卖机制
云计算环境中有效的资源分配对于确保平台性能和服务质量至关重要。针对云资源的异构性和云用户的多样化需求,提出了一种真实的多组合双拍卖(TMCDA)云资源分配机制。该机制引入资源权重比率来反映不同资源类型之间的相对重要性和比例关系,从而能够更精确地评估异质性资源组合。同时,云用户可以提交多个可替代的组合资源请求,增加了分配的灵活性,提高了事务成功率。在支付设计中,为了保证真实性和经济效益,采用了类似于二次竞价的临界价格计算方法。该机制将资源束匹配与加权定价相结合,提高了资源利用率和整体社会福利水平。仿真结果表明,与真实组合/多单元多项目双拍卖云计算(TCMDAC)和组合双拍卖资源分配(CDARA)相比,该方法在社会福利方面分别提高了至少15%和30%,突出了其在交易公平性、激励兼容性和分配效率方面的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书