Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An online auction mechanism for time-varying multidimensional resource allocation in clouds
School of Information Science and Engineering, Yunnan University, Kunming, Yunnan 650504, PR China.
School of Information Science and Engineering, Yunnan University, Kunming, Yunnan 650504, PR China.
School of Information Science and Engineering, Yunnan University, Kunming, Yunnan 650504, PR China.
School of Information Science and Engineering, Yunnan University, Kunming, Yunnan 650504, PR China.
Show others and affiliations
2020 (English)In: Future Generation Computer Systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 111, p. 27-38Article in journal (Refereed) Published
Abstract [en]

Multidimensional resource allocation is a hot topic in cloud computing, but current cloud platforms support only fixed resource allocation, that is, the user resource requirements are consistent throughout the usage period, which may cause a waste of resources and reduce the revenue of resource providers. Therefore, time-varying multidimensional resource allocation and the corresponding pricing mechanism represent a new challenge in cloud computing. We address the problem of online time-varying multidimensional resource allocation and pricing in clouds. Specifically, (1) we propose a novel integer programming model for the time-varying multidimensional resource allocation problem and (2) we design a truthful online auction mechanism for resource allocation in a competitive environment. For the resource allocation algorithm, we propose a waiting period strategy and dominant-resource-based strategy to improve the social welfare and resource utilization. Simultaneously, a payment pricing algorithm based on critical value theory is proposed. Finally, we prove that the mechanism is truthful and individual rationality. Compared with existing research, our approach is characterized by high social welfare, high resource utilization and short execution time.

Place, publisher, year, edition, pages
Elsevier, 2020. Vol. 111, p. 27-38
Keywords [en]
Cloud computing, Time-varying resource allocation, Online truthful mechanism, Dominant resources, Critical value
National Category
Computer and Information Sciences
Research subject
Pervasive Mobile Computing
Identifiers
URN: urn:nbn:se:ltu:diva-78717DOI: 10.1016/j.future.2020.04.029ISI: 000541155100003Scopus ID: 2-s2.0-85083788352OAI: oai:DiVA.org:ltu-78717DiVA, id: diva2:1427227
Note

Validerad;2020;Nivå 2;2020-04-29 (alebob)

Available from: 2020-04-29 Created: 2020-04-29 Last updated: 2025-02-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Vasilakos, Athanasios V.

Search in DiVA

By author/editor
Vasilakos, Athanasios V.
By organisation
Computer Science
In the same journal
Future Generation Computer Systems
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 142 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf