A bartering double auction resource allocation model in cloud environments

被引:5
|
作者
Koochaksaraei, Mohammad Hossein Ghasemian [1 ]
Haghighat, Abolfazl Toroghi [1 ]
Rezvani, Mohammad Hossein [1 ]
机构
[1] Islamic Azad Univ, Dept Comp & Informat Technol Engn, Qazvin Branch, Qazvin, Iran
来源
关键词
bartering double auction; cloud computing; mechanism design; resource allocation; virtual machine exchange; MECHANISM;
D O I
10.1002/cpe.7024
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Resource provisioning and allocation are two essential operations of cloud service providers (CSPs). Due to limited resources, it may sometimes not be cost-effective for CSPs to obtain them from the market. On the other hand, releasing some less profitable resources may violate the service level agreement (SLA). This article presents an auction-inspired model for providing/demanding resources without exchanging money among CSPs. The core idea is that CSPs do not need to pay monetary values. Instead, they exchange free resources through an auction mechanism and are encouraged to cooperate. This model, which we call bartering double auction resource allocation, helps CSPs receive the resources they need in the form of virtual machine instances with different types of functionalities. Under this mechanism, if one party violates the SLA, the other takes back its resources to avoid possible loss. The experimental results using the CloudSim simulator and the statistical analyses show that the proposed mechanism can increase CSPs' social welfare and profitability while significantly reducing SLA violations. Also, the proposed model provides four essential economic properties, that is, individual rationality, incentive compatibility, budget balancing, and economic efficiency.
引用
收藏
页数:24
相关论文
共 50 条
  • [31] A combinatorial double auction model for cloud computing based on the average price of cloud resource packages
    [J]. Zong, Xiaojie, 1600, UK Simulation Society, Clifton Lane, Nottingham, NG11 8NS, United Kingdom (17):
  • [32] Auction-based resource allocation mechanisms in the cloud environments: A review of the literature and reflection on future challenges
    Sheikholeslami, Fereshteh
    Navimipour, Nima Jafari
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2018, 30 (16):
  • [33] Double Auction Mechanism for Resource Allocation in Satellite MEC
    Li, Zhen
    Jiang, Chunxiao
    Kuang, Linling
    [J]. IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2021, 7 (04) : 1112 - 1125
  • [34] A Greedy Double Auction Mechanism for Grid Resource Allocation
    Ding, Ding
    Luo, Siwei
    Gao, Zhan
    [J]. JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING, 2010, 6253 : 35 - 50
  • [35] Double Auction Mechanisms for Resource Allocation in Autonomous Networks
    Iosifidis, George
    Koutsopoulos, Iordanis
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2010, 28 (01) : 95 - 102
  • [36] A double auction method for resource allocation on computational grids
    Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200030, China
    [J]. Jisuanji Xuebao, 2006, 6 (1004):
  • [37] Grid resource allocation based on the combinatorial double auction
    Li, Li
    Liu, Yuan-An
    Ma, Xiao-Lei
    [J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2009, 37 (01): : 165 - 169
  • [38] Machine Learning Based Resource Allocation of Cloud Computing in Auction
    Zhang, Jixian
    Xie, Ning
    Zhang, Xuejie
    Yue, Kun
    Li, Weidong
    Kumar, Deepesh
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2018, 56 (01): : 123 - 135
  • [39] A Two-Stage Auction Mechanism for Cloud Resource Allocation
    Hosseinalipour, Seyyedali
    Dai, Huaiyu
    [J]. IEEE TRANSACTIONS ON CLOUD COMPUTING, 2021, 9 (03) : 881 - 895
  • [40] A resource auction based allocation mechanism in the cloud computing environment
    Wang, Xingwei
    Sun, Jiajia
    Huang, Min
    Wu, Chuan
    Wang, Xueyi
    [J]. 2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW), 2012, : 2111 - 2115