A truthful dynamic combinatorial double auction model for cloud resource allocation
Abstract Dynamic auction-based resource allocation models require little global price information, are decentralized and suitable for the distributed systems like cloud computing. For the cloud computing market, we proposed a Truthful Dynamic Combinatorial Double Auction (TDCDA) model to improve the...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2023-07-01
|
| Series: | Journal of Cloud Computing: Advances, Systems and Applications |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13677-023-00479-7 |
| _version_ | 1827894867934576640 |
|---|---|
| author | Qihui Li Xiaohua Jia Chuanhe Huang |
| author_facet | Qihui Li Xiaohua Jia Chuanhe Huang |
| author_sort | Qihui Li |
| collection | DOAJ |
| description | Abstract Dynamic auction-based resource allocation models require little global price information, are decentralized and suitable for the distributed systems like cloud computing. For the cloud computing market, we proposed a Truthful Dynamic Combinatorial Double Auction (TDCDA) model to improve the social welfare and resource utilization. In our model, multiple cloud service providers and cloud users bid for various resources in a dynamic environment. We adopted a payment scheme to ensure truthfulness for all participants, which motivates bidders to reveal their true preferences. Since the combinatorial auction allocation with goal of economic efficiency is NP-hard, we developed a greedy mechanism to achieve the approximately efficient solution. Considering both parties’ interests and the resource scarcity, this model also ensures fairness and balances resource allocation. The proposed model is proven to be approximately efficient, incentive compatible, individually rational and budget-balanced. Simulation results show that the model not only achieves economic efficiency, but also improves resource allocation and meets resource needs for more cloud users. |
| first_indexed | 2024-03-12T22:13:33Z |
| format | Article |
| id | doaj.art-196456ed92e440d4a0ddbf83933ae21f |
| institution | Directory Open Access Journal |
| issn | 2192-113X |
| language | English |
| last_indexed | 2024-03-12T22:13:33Z |
| publishDate | 2023-07-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | Journal of Cloud Computing: Advances, Systems and Applications |
| spelling | doaj.art-196456ed92e440d4a0ddbf83933ae21f2023-07-23T11:26:46ZengSpringerOpenJournal of Cloud Computing: Advances, Systems and Applications2192-113X2023-07-0112111510.1186/s13677-023-00479-7A truthful dynamic combinatorial double auction model for cloud resource allocationQihui Li0Xiaohua Jia1Chuanhe Huang2Department of Computer Science, Huanggang Normal UniversitySchool of Computer Science, Wuhan UniversitySchool of Computer Science, Wuhan UniversityAbstract Dynamic auction-based resource allocation models require little global price information, are decentralized and suitable for the distributed systems like cloud computing. For the cloud computing market, we proposed a Truthful Dynamic Combinatorial Double Auction (TDCDA) model to improve the social welfare and resource utilization. In our model, multiple cloud service providers and cloud users bid for various resources in a dynamic environment. We adopted a payment scheme to ensure truthfulness for all participants, which motivates bidders to reveal their true preferences. Since the combinatorial auction allocation with goal of economic efficiency is NP-hard, we developed a greedy mechanism to achieve the approximately efficient solution. Considering both parties’ interests and the resource scarcity, this model also ensures fairness and balances resource allocation. The proposed model is proven to be approximately efficient, incentive compatible, individually rational and budget-balanced. Simulation results show that the model not only achieves economic efficiency, but also improves resource allocation and meets resource needs for more cloud users.https://doi.org/10.1186/s13677-023-00479-7Cloud computingCombinatorial double auctionBid densityTruthfulnessEconomic efficiencyResource allocation |
| spellingShingle | Qihui Li Xiaohua Jia Chuanhe Huang A truthful dynamic combinatorial double auction model for cloud resource allocation Journal of Cloud Computing: Advances, Systems and Applications Cloud computing Combinatorial double auction Bid density Truthfulness Economic efficiency Resource allocation |
| title | A truthful dynamic combinatorial double auction model for cloud resource allocation |
| title_full | A truthful dynamic combinatorial double auction model for cloud resource allocation |
| title_fullStr | A truthful dynamic combinatorial double auction model for cloud resource allocation |
| title_full_unstemmed | A truthful dynamic combinatorial double auction model for cloud resource allocation |
| title_short | A truthful dynamic combinatorial double auction model for cloud resource allocation |
| title_sort | truthful dynamic combinatorial double auction model for cloud resource allocation |
| topic | Cloud computing Combinatorial double auction Bid density Truthfulness Economic efficiency Resource allocation |
| url | https://doi.org/10.1186/s13677-023-00479-7 |
| work_keys_str_mv | AT qihuili atruthfuldynamiccombinatorialdoubleauctionmodelforcloudresourceallocation AT xiaohuajia atruthfuldynamiccombinatorialdoubleauctionmodelforcloudresourceallocation AT chuanhehuang atruthfuldynamiccombinatorialdoubleauctionmodelforcloudresourceallocation AT qihuili truthfuldynamiccombinatorialdoubleauctionmodelforcloudresourceallocation AT xiaohuajia truthfuldynamiccombinatorialdoubleauctionmodelforcloudresourceallocation AT chuanhehuang truthfuldynamiccombinatorialdoubleauctionmodelforcloudresourceallocation |