A Secure and Fair Double Auction Framework for Cloud Virtual Machines

Cheng, Ke; Tong, Wei; Zheng, Lele; Fu, Jiaxuan; Mu, Xutong; Shen, Yulong

doi:10.1109/access.2021.3089492

Cited by 7 publications

(3 citation statements)

References 46 publications

(90 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The limitation of this work is that a user may get a less efficient service provider during allocation (alteration in providers' wealth rank), but it is required to maintain competition in the market, to reduce bidder drop problem and to overcome cloud market stagnation. Future work is intended to be more focused on designing fair mechanisms using some different approaches such as blockchain [66], feedback based fairness [34,67], etc. A generalized architectural framework for reverse auction-based market would definitely be helpful for the researchers and the academicians to design fair mechanisms in a more complex fog/edge environment [35].…”

Section: Discussionmentioning

confidence: 99%

Fair Resource Allocation Policies in Reverse Auction-Based Cloud Market

2021

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

Section: Discussionmentioning

confidence: 99%

Fair Resource Allocation Policies in Reverse Auction-Based Cloud Market

2021

View full text Add to dashboard Cite

show abstract

“…They aimed to maximize the overall profit of users and CSPs based on metrics such as truthfulness, fairness, economic efficiency, and allocation efficiency. Cheng et al 19 proposed a double auction framework focusing on trade fairness and bid privacy. They used intelligent contracts to motivate auctioneers to obey auction protocols.…”

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

“…For bidding privacy, many auction markets have been designed for different applications, such as spectrum [20][21][22], mobile crowd sensing [23], cloud computing [24], and electrical vehicle charging markets [25]. Some privacy-preserving auction schemes have been proposed for data trading [5,26].…”

Section: Auction For Data Sharing In Iotmentioning

confidence: 99%

Effective Consensus-Based Distributed Auction Scheme for Secure Data Sharing in Internet of Things

2022

View full text Add to dashboard Cite

In a traditional electronic auction, the centralized auctioneer and decentralized bidders are in an asymmetric structure, where the auctioneer has more ability to decide the auction result. This asymmetric auction structure is not fair to the participants and not suitable for data auctions in the Internet of Things (IoT). The blockchain-based auction system, with participant equality and fairness, is typically symmetrical and particularly suitable for IoT data sharing. However, when applied to IoT data sharing in reality, it faces privacy and efficiency problems. In this context, how to guarantee privacy and break the inherent performance bottleneck of blockchain is still a major challenge. In this paper, a consensus-based distributed auction scheme is proposed for data sharing, which enforces privacy preservation and collusion resistance. A reverse auction-based decentralized data trading model is introduced to solve the trust problem without a centralized auctioneer, where bidders reach consensus on the auction result. Specifically, we devise a differentially private auction mechanism to incentivize data owners to participate in data sharing. An effective hybrid consensus algorithm is constructed among bidders to reach consensus on the auction result with improved security and efficiency. Theoretical analysis shows that the proposed scheme ensures the properties of privacy preservation, incentive compatibility and collusion resistance. Experimental results reveal that the proposed mechanism guarantees the data sharing efficiency and has certain scalability.

show abstract

A Secure and Fair Double Auction Framework for Cloud Virtual Machines

Cited by 7 publications

References 46 publications

Fair Resource Allocation Policies in Reverse Auction-Based Cloud Market

Fair Resource Allocation Policies in Reverse Auction-Based Cloud Market

A bartering double auction resource allocation model in cloud environments

Effective Consensus-Based Distributed Auction Scheme for Secure Data Sharing in Internet of Things

Contact Info

Product

Resources

About