Strategy-proof mechanism for online resource allocation in cloud and edge collaboration

Cloud computing is characterized by strong computing and storage capabilities, and edge computing has the advantages of low latency and low power consumption. Many service providers have begun to combine the advantages of cloud and edge computing to provide better quality of service, but the heterog...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computing Ročník 104; číslo 2; s. 383 - 412
Hlavní autori: Zhang, Jixian, Chi, Laixin, Xie, Ning, Yang, Xutao, Zhang, Xuejie, Li, Weidong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Vienna Springer Vienna 01.02.2022
Springer Nature B.V
Predmet:
Artificial Intelligence
Cloud computing
Collaboration
Computer Appl. in Administrative Data Processing
Computer Communication Networks
Computer Science
Edge computing
Heterogeneity
Information Systems Applications (incl.Internet)
Integer programming
Internet resources
Model matching
Power consumption
Regular Paper
Resource allocation
Resource utilization
Software Engineering
Webcasting
Cloud-edge collaboration
Cloud computing
Mechanism design
Resource allocation
91B03
Edge computing
ISSN:0010-485X, 1436-5057
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Cloud computing is characterized by strong computing and storage capabilities, and edge computing has the advantages of low latency and low power consumption. Many service providers have begun to combine the advantages of cloud and edge computing to provide better quality of service, but the heterogeneity of cloud and edge computing represents a challenge for service deployment and resource allocation. This paper proposes a framework for cloud-edge collaboration based on live video webcast services and transforms the resource allocation problem into a constrained integer programming (IP) model. Additionally, we introduce an auction mechanism to solve the problem of resource competition among the anchor users in live services. By solving the IP resource allocation problem and Vickrey–Clarke–Groves mechanism, we obtain the optimal resource allocation mechanism. Based on the dominant resource proportion and matching model, we design a resource allocation mechanism for the online environment. These mechanisms can be used for reservation and live webcast scenarios. Furthermore, we prove that the two mechanisms have individual rationality and truthfulness. Our approach is characterized by high social welfare, high resource utilization and a short execution time.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0010-485X
1436-5057
DOI:10.1007/s00607-021-00962-6