Amazing technological breakthrough possible @S-Logix

Office Address

  • 2nd Floor, #7a, High School Road, Secretariat Colony Ambattur, Chennai-600053 (Landmark: SRM School) Tamil Nadu, India
  • +91- 81240 01111

Social List

A combinatorial double auction resource allocation model in cloud computing - 2014

A combinatorial double auction resource allocation model in cloud computing

Research Area:  Cloud Computing


Users and providers have different requirements and objectives in an investment market. Users will pay the lowest price possible with certain guaranteed levels of service at a minimum and providers would follow the strategy of achieving the highest return on their investment. Designing an optimal market-based resource allocation that considers the benefits for both the users and providers is a fundamental criterion of resource management in distributed systems, especially in cloud computing services. Most of the current market-based resource allocation models are biased in favor of the provider over the buyer in an unregulated trading environment. In this study, the problem was addressed by proposing a new market model called the Combinatorial Double Auction Resource Allocation (CDARA), which is applicable in cloud computing environments. The CDARA was prototyped and simulated using CloudSim, a Java-based simulator for simulating cloud computing environments, to evaluate its efficiency from an economic perspective. The results proved that the combinatorial double auction-based resource allocation model is an appropriate market-based model for cloud computing because it allows double-sided competition and bidding on an unrestricted number of items, which causes it to be economically efficient. Furthermore, the proposed model is incentive-compatible, which motivates the participants to reveal their true valuation during bidding.


Author(s) Name:  Parnia Samimi,Youness Teimouri and Muriati Mukhtar

Journal name:  Information Sciences

Conferrence name:  

Publisher name:  ELSEVIER

DOI:  10.1016/j.ins.2014.02.008

Volume Information:  Volume 357, 20 August 2016, Pages 201-216