A truthful online auction mechanism for deadline-aware cloud resource allocation

Tianrong Zhang, Yufeng Xin
{"title":"A truthful online auction mechanism for deadline-aware cloud resource allocation","authors":"Tianrong Zhang, Yufeng Xin","doi":"10.1109/NOMS.2018.8406240","DOIUrl":null,"url":null,"abstract":"Auction-based resource allocation and pricing mechanisms have attracted substantial research interests to enhance the utility gain and fairness of cloud platforms. A fundamental problem in cloud resource auction design that has not been fully addressed is how to ensure the timely execution of applications while allocation decisions have to be made online. Adding to the complexity of designing a truthful and efficient mechanism is that application requests are normally heterogeneous in resource demand and execution requirement. In this paper, we present a novel online combinatorial auction mechanism for deadline- aware multi-resource allocation for cloud platforms, which achieves both strategy-proofness and approximate efficiency on social welfare.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":"215 1","pages":"1-9"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOMS.2018.8406240","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Auction-based resource allocation and pricing mechanisms have attracted substantial research interests to enhance the utility gain and fairness of cloud platforms. A fundamental problem in cloud resource auction design that has not been fully addressed is how to ensure the timely execution of applications while allocation decisions have to be made online. Adding to the complexity of designing a truthful and efficient mechanism is that application requests are normally heterogeneous in resource demand and execution requirement. In this paper, we present a novel online combinatorial auction mechanism for deadline- aware multi-resource allocation for cloud platforms, which achieves both strategy-proofness and approximate efficiency on social welfare.
基于截止日期感知的云资源分配的真实在线拍卖机制
基于拍卖的资源分配和定价机制吸引了大量研究兴趣,以提高云平台的效用收益和公平性。云资源拍卖设计中尚未完全解决的一个基本问题是,当必须在线做出分配决策时,如何确保应用程序的及时执行。由于应用程序请求在资源需求和执行需求方面通常是异构的,因此增加了设计真实有效机制的复杂性。在本文中,我们提出了一种新的基于截止日期感知的云平台多资源分配的在线组合拍卖机制,该机制既实现了策略验证性,又实现了近似的社会福利效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信