TY - GEN
T1 - Online Resource Allocation in Edge Computing Using Distributed Bidding Approaches
AU - Rublein, Caroline
AU - Mehmeti, Fidan
AU - Towers, Mark
AU - Stein, Sebastian
AU - Porta, Thomas F.La
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - Edge computing has become a very popular service that enables mobile devices to run complex tasks with the help of network-based computing resources. However, edge clouds are often resource-constrained, which makes resource allocation a challenging issue. We focus on a distributed resource allocation method in which servers operate independently and do not communicate with each other, but interact with clients (tasks) to make allocation decisions. This provides robustness and does not require service providers to share information about their configurations or workloads. We propose a two-round bidding approach of assigning tasks to edge cloud servers, while taking into account various processing requirements and server constraints. We consider cases in which all jobs have equal utility, cases where jobs have different utilities but users do not disclose these utilities to servers, and cases where users disclose the utility of their jobs to servers. We evaluate the performance using extensive realistic simulations. Results show that our approach is very close to an optimal assignment, with discrepancy not exceeding 5%.
AB - Edge computing has become a very popular service that enables mobile devices to run complex tasks with the help of network-based computing resources. However, edge clouds are often resource-constrained, which makes resource allocation a challenging issue. We focus on a distributed resource allocation method in which servers operate independently and do not communicate with each other, but interact with clients (tasks) to make allocation decisions. This provides robustness and does not require service providers to share information about their configurations or workloads. We propose a two-round bidding approach of assigning tasks to edge cloud servers, while taking into account various processing requirements and server constraints. We consider cases in which all jobs have equal utility, cases where jobs have different utilities but users do not disclose these utilities to servers, and cases where users disclose the utility of their jobs to servers. We evaluate the performance using extensive realistic simulations. Results show that our approach is very close to an optimal assignment, with discrepancy not exceeding 5%.
UR - https://www.scopus.com/pages/publications/85123909691
UR - https://www.scopus.com/inward/citedby.url?scp=85123909691&partnerID=8YFLogxK
U2 - 10.1109/MASS52906.2021.00038
DO - 10.1109/MASS52906.2021.00038
M3 - Conference contribution
AN - SCOPUS:85123909691
T3 - Proceedings - 2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems, MASS 2021
SP - 225
EP - 233
BT - Proceedings - 2021 IEEE 18th International Conference on Mobile Ad Hoc and Smart Systems, MASS 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th IEEE International Conference on Mobile Ad Hoc and Smart Systems, MASS 2021
Y2 - 4 October 2021 through 7 October 2021
ER -