eBay in the Clouds: False-Name-Proof Auctions for Cloud Resource Allocation

Qinhui Wang, Baoliu Ye, Bin Tang, Song Guo, Sanglu Lu
{"title":"eBay in the Clouds: False-Name-Proof Auctions for Cloud Resource Allocation","authors":"Qinhui Wang, Baoliu Ye, Bin Tang, Song Guo, Sanglu Lu","doi":"10.1109/ICDCS.2015.24","DOIUrl":null,"url":null,"abstract":"The paradigm of cloud computing has spontaneously prompted a wide interest in auction-based mechanisms for cloud resource allocation. To eliminate market manipulation, a number of strategy-proof (a.k.a. Truthful) cloud auction mechanisms have been recently proposed by enforcing bidders to bid their true valuations of the cloud resources. However, as discovered in this paper, they would suffer from a new cheating pattern, named false-name bids, where a bidder can gain profit by submitting bids under multiple fictitious names (e.g, Multiple e-mail addresses). Such false-name cheating is easy to make but hard to detect in cloud auctions. To tackle this issue, we propose FAITH, a new False-name-proof Auction for virtual machine instance allocation, that is proven both strategy-proof and false-name proof by our theoretical analysis. When N users compete for M different types of computing instances with multiple units, FAITH achieves a lower time complexity of O(N log N+NM) compared to exiting cloud auction designs. We further extend FAITH to support range-based requests as desired in practice for flexible auction. Through extensive simulation experiments, we show that FAITH highly improves auction efficiency, outperforming the extended mechanisms of conventional false-name-proof auctions in terms of generated revenue and social welfare by up to 220% and 140%, respectively.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 35th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2015.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The paradigm of cloud computing has spontaneously prompted a wide interest in auction-based mechanisms for cloud resource allocation. To eliminate market manipulation, a number of strategy-proof (a.k.a. Truthful) cloud auction mechanisms have been recently proposed by enforcing bidders to bid their true valuations of the cloud resources. However, as discovered in this paper, they would suffer from a new cheating pattern, named false-name bids, where a bidder can gain profit by submitting bids under multiple fictitious names (e.g, Multiple e-mail addresses). Such false-name cheating is easy to make but hard to detect in cloud auctions. To tackle this issue, we propose FAITH, a new False-name-proof Auction for virtual machine instance allocation, that is proven both strategy-proof and false-name proof by our theoretical analysis. When N users compete for M different types of computing instances with multiple units, FAITH achieves a lower time complexity of O(N log N+NM) compared to exiting cloud auction designs. We further extend FAITH to support range-based requests as desired in practice for flexible auction. Through extensive simulation experiments, we show that FAITH highly improves auction efficiency, outperforming the extended mechanisms of conventional false-name-proof auctions in terms of generated revenue and social welfare by up to 220% and 140%, respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云中的eBay:用于云资源分配的防假名拍卖
云计算的范例自发地引起了人们对基于拍卖的云资源分配机制的广泛兴趣。为了消除市场操纵,最近提出了一些策略证明(又名真实)的云拍卖机制,通过强制投标人出价他们对云资源的真实估值。然而,正如本文所发现的那样,他们将遭受一种新的作弊模式,即假名投标,其中投标人可以通过使用多个虚构名称(例如多个电子邮件地址)提交投标来获利。这种假名作弊很容易制造,但在云拍卖中很难被发现。为了解决这一问题,我们提出了一种新的用于虚拟机实例分配的防假名拍卖机制FAITH,并通过理论分析证明了它具有策略证明和防假名证明。当N个用户使用多个单元竞争M个不同类型的计算实例时,与现有的云拍卖设计相比,FAITH实现了更低的时间复杂度O(N log N+NM)。我们进一步扩展了FAITH,以支持灵活拍卖实践中所需的基于区间的请求。通过广泛的模拟实验,我们发现FAITH极大地提高了拍卖效率,在产生的收入和社会福利方面分别比传统的防假名拍卖的扩展机制高出220%和140%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FLOWPROPHET: Generic and Accurate Traffic Prediction for Data-Parallel Cluster Computing Improving the Energy Benefit for 802.3az Using Dynamic Coalescing Techniques Systematic Mining of Associated Server Herds for Malware Campaign Discovery Rain Bar: Robust Application-Driven Visual Communication Using Color Barcodes Optimizing Roadside Advertisement Dissemination in Vehicular Cyber-Physical Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1