A Double Auction Mechanism for Resource Allocation on Grid Computing Systems

2004 ◽  
pp. 269-276 ◽  
Author(s):  
Chuliang Weng ◽  
Xinda Lu ◽  
Guangtao Xue ◽  
Qianni Deng ◽  
Minglu Li
Keyword(s):  
Resource Allocation ◽  
Grid Computing ◽  
Double Auction ◽  
Computing Systems ◽  
Auction Mechanism

scholarly journals A cloud priority-based dynamic online double auction mechanism (PB-DODAM)

2020 ◽  
Vol 9 (1) ◽  
Author(s):  
S. M. Reza Dibaj ◽  
Ali Miri ◽  
SeyedAkbar Mostafavi
Keyword(s):  
Resource Allocation ◽  
Service Providers ◽  
Supply And Demand ◽  
Cloud Service ◽  
Time Constraints ◽  
Double Auction ◽  
Auction Mechanism ◽  
Double Auctions ◽  
Auction Models ◽  
Scheduling Mechanisms

AbstractDouble auctions are considered to be effective price-scheduling mechanisms to resolve cloud resource allocation and service pricing problems. Most of the classical double auction models use price-based mechanisms in which determination of the winner is based on the prices offered by the agents in the market. In cloud ecosystems, the services offered by cloud service providers are inherently time-constrained and if they are not sold, the allocated resources for the unsold services are wasted. Furthermore, cloud service users have time constraints to complete their tasks, otherwise, they would not need to request these services. These features, perishability and time-criticality, have not received much attention in most classical double auction models. In this paper, we propose a cloud priority-based dynamic online double auction mechanism (PB-DODAM), which is aligned with the dynamic nature of cloud supply and demand and the agents’ time constraints. In PB-DODAM, a heuristic algorithm which prioritizes the agents’ asks and bids based on their overall condition and time constraints for resource allocation and price-scheduling mechanisms is proposed. The proposed mechanism drastically increases resource allocation and traders’ profits in both low-risk and high-risk market conditions by raising the matching rate. Moreover, the proposed mechanism calculates the precise defer time to wait for any urgent or high-priority request without sacrificing the achieved performance in resource allocation and traders’ profits. Based on experimental results in different scenarios, the proposed mechanism outperforms the classical price-based online double auctions in terms of resource allocation efficiency and traders’ profits while fulfilling the double auction’s truthfulness pillar.

A Double Auction Mechanism for Resource Allocation in Coded Vehicular Edge Computing

2021 ◽  
pp. 1-1
Author(s):  
Jer Shyuan ◽  
w Lim ◽  
Zehui Xiong ◽  
Tao Dusit Niyato ◽  
Cyril Leung ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Edge Computing ◽  
Double Auction ◽  
Auction Mechanism

Reinforcement-Learning- and Belief-Learning-Based Double Auction Mechanism for Edge Computing Resource Allocation

2020 ◽  
Vol 7 (7) ◽  
pp. 5976-5985 ◽  
Author(s):  
Quanyi Li ◽  
Haipeng Yao ◽  
Tianle Mai ◽  
Chunxiao Jiang ◽  
Yan Zhang
Keyword(s):  
Resource Allocation ◽  
Reinforcement Learning ◽  
Edge Computing ◽  
Double Auction ◽  
Auction Mechanism ◽  
Computing Resource ◽  
Belief Learning

Double Auction Mechanism for Resource Allocation in Satellite MEC

2021 ◽  
pp. 1-1
Author(s):  
Zhen Li ◽  
Chunxiao Jiang ◽  
Linling Kuang
Keyword(s):  
Resource Allocation ◽  
Double Auction ◽  
Auction Mechanism
Sign in / Sign up

Export Citation Format

Share Document