TVDA: Truthful Volume Discount Auction Design for Cloud Resource Allocation

被引:1
|
作者
Zhang, Yonglong [1 ,2 ]
Li, Bin [2 ,3 ]
Huang, Zhiqiu [1 ]
Wang, Jin [2 ]
Zhu, Junwu [2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Sch Comp Sci & Technol, Nanjing, Jiangsu, Peoples R China
[2] Yangzhou Univ, Coll Informat Engn, Yangzhou, Jiangsu, Peoples R China
[3] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing, Jiangsu, Peoples R China
来源
JOURNAL OF INTERNET TECHNOLOGY | 2015年 / 16卷 / 06期
基金
中国国家自然科学基金;
关键词
Auction; Mechanism design; Cloud computing; Virtual machines; COMBINATORIAL AUCTIONS; MECHANISM;
D O I
10.6138/JIT.2015.16.6.20150302
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Market mechanism constitutes an efficient scheme for the allocation of cloud-based computing resources with the view of virtual machines. The volume discount model is a new kind of dynamic pricing economic model on the Internet, which makes the users can form a group through Internet to get the volume discount, i.e., the more units that are bought together, the lower the price of the resource being provided becomes. In this paper, we consider the virtual machine allocation problem in clouds with group buying pricing scheme and propose TVDA, a Truthful Volume Discount Auction to allocate cloud virtual machine instances by taking advantage of the volume discount. TVDA possesses good properties such as truthfulness, individual rationality, ex-post budget balance, system efficiency, and computational tractability. Numerical results are presented to demonstrate the effectiveness of the proposed scheme.
引用
收藏
页码:1023 / 1031
页数:9
相关论文
共 50 条
  • [1] A truthful dynamic combinatorial double auction model for cloud resource allocation
    Li, Qihui
    Jia, Xiaohua
    Huang, Chuanhe
    [J]. JOURNAL OF CLOUD COMPUTING-ADVANCES SYSTEMS AND APPLICATIONS, 2023, 12 (01):
  • [2] A truthful dynamic combinatorial double auction model for cloud resource allocation
    Qihui Li
    Xiaohua Jia
    Chuanhe Huang
    [J]. Journal of Cloud Computing, 12
  • [3] A Truthful Online Auction Mechanism for Deadline-Aware Cloud Resource Allocation
    Zhang, Tianrong
    Xin, Yufeng
    [J]. NOMS 2018 - 2018 IEEE/IFIP NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, 2018,
  • [4] Truthful Multi Requirements Auction Mechanism for Virtual Resource Allocation of Cloud Computing
    Zhang Jixian
    Xie Ning
    Li Weidong
    Yue Kun
    Zhang Xuejie
    [J]. JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2018, 40 (01) : 25 - 34
  • [5] Lowest revenue limit-based truthful auction mechanism for cloud resource allocation
    Zhang, Jixian
    Sun, Hao
    Li, Weidong
    [J]. JOURNAL OF SUPERCOMPUTING, 2024, 80 (08): : 10637 - 10666
  • [6] Lowest revenue limit-based truthful auction mechanism for cloud resource allocation
    Jixian Zhang
    Hao Sun
    Weidong Li
    [J]. The Journal of Supercomputing, 2024, 80 : 10637 - 10666
  • [7] A truthful and budget-balanced double auction model for resource allocation in cloud computing
    Alahdadi, Arezou
    Safaei, Ali Asghar
    Ebadi, Mohammad Javad
    [J]. SOFT COMPUTING, 2023, 27 (23) : 18263 - 18284
  • [8] A truthful and budget-balanced double auction model for resource allocation in cloud computing
    Arezou Alahdadi
    Ali Asghar Safaei
    Mohammad Javad Ebadi
    [J]. Soft Computing, 2023, 27 : 18263 - 18284
  • [9] Truthful Auction for Resource Allocation in Cooperative Cognitive Radio Networks
    Wang, Xinglong
    Huang, Liusheng
    Xu, Hongli
    Huang, He
    [J]. 24TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS ICCCN 2015, 2015,
  • [10] A Truthful Auction Mechanism for Resource Allocation in Mobile Edge Computing
    Wu, Bilian
    Chen, Xin
    Chen, Ying
    Lu, Yangguang
    [J]. 2021 IEEE 22ND INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS (WOWMOM 2021), 2021, : 21 - 30