TY - JOUR
T1 - Negotiation based combinatorial double auction mechanism in cloud computing
AU - Ullah, Zakir
AU - Umer, Asif
AU - Zaree, Mahdi
AU - Ahmad, Jamil
AU - Alanazi, Faisal
AU - Ul Amin, Noor
AU - Umar, Arif Iqbal
AU - Jehangiri, Ali Imran
AU - Adnan, Muhammad
N1 - Publisher Copyright:
© 2021 Tech Science Press. All rights reserved.
PY - 2021
Y1 - 2021
N2 - 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.
AB - 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.
KW - Cloud computing
KW - Combinatorial double auction negotiation
KW - Resource utilization
KW - Users serve
UR - http://www.scopus.com/inward/record.url?scp=85110607606&partnerID=8YFLogxK
U2 - 10.32604/cmc.2021.015445
DO - 10.32604/cmc.2021.015445
M3 - Article
AN - SCOPUS:85110607606
SN - 1546-2218
VL - 69
JO - Computers, Materials and Continua
JF - Computers, Materials and Continua
IS - 2
ER -