Fair Mechanisms for Combinatorial Reverse Auction-Based Cloud Market

Kumar, Dinesh; Baranwal, Gaurav; Raza, Zahid; Vidyarthi, Deo Prakash

doi:10.1007/978-981-13-1747-7_26

Cited by 8 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So far, a significant body of research has been conducted about resource allocation in cloud environments. Before reading this section, interested readers are advised to refer to References 15,16 for a comprehensive review. Generally, previous research activities can be analyzed from different viewpoints.…”

Section: Related Workmentioning

confidence: 99%

A bartering double auction resource allocation model in cloud environments

Koochaksaraei

Haghighat

Rezvani

2022

Concurrency and Computation

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

A bartering double auction resource allocation model in cloud environments

Koochaksaraei

Haghighat

Rezvani

2022

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…But the bidder drop problem was not considered in this model. A fair mechanism for combinatorial reverse auction-based cloud market has been proposed by [20]. Priority was assigned to each cloud provider on their bidding information and auction result.…”

Section: Combinatorial Base Auctionmentioning

confidence: 99%

“…In our proposed work we can calculate the bid difference of those users that has higher bid densities but less average prices, by using the Eq. (20).…”

Section: Scenario 1 (Allocation and Winner Of Auction)mentioning

confidence: 99%

Negotiation Based Combinatorial Double Auction Mechanism in Cloud Computing

Ullah¹,

Umer²,

Zaree³

et al. 2021

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Cloud computing is a demanding business platform for services related to the field of IT. The goal of cloud customers is to access resources at a sustainable price, while the goal of cloud suppliers is to maximize their services utilization. Previously, the customers would bid for every single resource type, which was a limitation of cloud resources allocation. To solve these issues, researchers have focused on a combinatorial auction in which the resources are offered by the providers in bundles so that the user bids for their required bundle. Still, in this allocation mechanism, some drawbacks need to be tackled, such as due to the lower average bid price the users are dropped from the auction process. To solve this problem, we proposed a "Negotiation based Combinatorial Double Auction Mechanism for Resource Allocation (N-CDARA) in cloud computing". The proposed method negotiates with dropped users. Lower average bid price users are asked by our proposed mechanism to increase their bids, as by the quoted bids they will be dropped by the auctioneer. Most of the users that are close to winning accept the proposal and increase their bid prices. The proposed mechanism is implemented in a CloudSim simulation toolkit. Results are compared with the latest model and performance study shows that in our proposed scheme more users win and get their requested services and the utilization of offered services is increased up to 18.4% than the existing schemes.

show abstract

“…In Ref. [33], two fair mechanisms were proposed with deliberations on the importance of fairness. Extending the work of Ref.…”

Section: Related Workmentioning

confidence: 99%

Fair Resource Allocation Policies in Reverse Auction-Based Cloud Market

2021

Self Cite

View full text Add to dashboard Cite

The increasing number of Internet of Things (IoT) applications and their dependence on cloud computing for computational services has resulted in the cloud market's growth. This growth has attracted many business organizations to offer cloud services, leading to significant competition amongst the cloud service providers. Reverse auction has been widely used to model such competition when there are many cloud service providers. A study on fair resource allocation mechanisms is performed in this work, and a family of such mechanisms is proposed. This work considers a reverse auction-based cloud market where users submit their combinatorial bids. This work emphasizes the importance of fairness in cloud resource allocation and its implementation in a cloud market. The proposed priority-based fair resource allocation mechanisms remove the bidder drop problem in a cloud market where a few major cloud providers dominate and control the whole market. Performance of the proposed fair resource allocation mechanisms is studied based on various metrics such as the number of winning auction rounds, providers' revenue, users' procurement cost, etc., in a simulated environment. It is observed that the naïve and not well-established providers in the market also win when fair mechanisms based on priority methods are implemented. They also get a chance to win the auction and can offer the resources successfully to the customer.

show abstract

Fair Mechanisms for Combinatorial Reverse Auction-Based Cloud Market

Cited by 8 publications

References 13 publications

A bartering double auction resource allocation model in cloud environments

A bartering double auction resource allocation model in cloud environments

Negotiation Based Combinatorial Double Auction Mechanism in Cloud Computing

Fair Resource Allocation Policies in Reverse Auction-Based Cloud Market

Contact Info

Product

Resources

About