Node selection using adversarial expert-based multi-armed bandits in distributed computing

Abstract The edge computing (EC) paradigm enhances the Quality of Service of distributed computing applications by bringing computation closer to data sources, such as sensors, IoT devices, and local servers, instead of relying solely on centralized data centers (e.g., the Cloud). In EC environments, node selection refers to the problem of determining which distributed computing nodes should be selected for performing computing tasks taking into consideration the heterogeneity of factors like limited resources, network context, and node’s computational capabilities. Evidently, node selection affects the efficiency and performance of EC environments. Recent node selection strategies rely on either heuristic or optimization methods, which inherently assume static environments. However, distributed environments consist of highly heterogeneous and dynamic systems. Addressing such a dynamic nature requires node selection strategies that leverage real-time feedback information. In this paper, we propose sequential learning-based algorithms based on multi-armed bandit (MAB) systems to deal with the node selection problem. Unlike previous MAB approaches, we contribute novel MAB algorithms for node selection using deep learning expert models. To tackle the inherent uncertainty associated with nodes, we introduce ExpGradBand, a novel expert-based gradient MAB algorithm, which leverages the selection efficiency of gradient bandits with the historic contextual information. Furthermore, we evaluate and compare ExpGradBand with various MAB approaches and baselines found in the literature with and without contextual information. Our evaluation study includes comprehensive experiments that assess the performance of these methods in settings with delayed or lost contextual feedback.

Authors

Institutions

Publication Details

Journal
Computing
Published
2025-03-01
DOI
https://doi.org/10.1007/s00607-025-01443-w
Citations
1
Primary Topic
Advanced Bandit Algorithms Research
Type
article
Field-Weighted Citation Impact
2.11
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Node selection using adversarial expert-based multi-armed bandits in distributed computing

Christos Anagnostopoulos, Saleh ALFahad, Kostas Kolomvatsos, Shameem Ahamed Puthiya Parambath
1 citations
Computing
Advanced Bandit Algorithms Research
2.11
article

Node selection using adversarial expert-based multi-armed bandits in distributed computing

Christos Anagnostopoulos, Saleh ALFahad, Kostas Kolomvatsos, Shameem Ahamed Puthiya Parambath
article en
1 citations

Abstract

Abstract The edge computing (EC) paradigm enhances the Quality of Service of distributed computing applications by bringing computation closer to data sources, such as sensors, IoT devices, and local servers, instead of relying solely on centralized data centers (e.g., the Cloud). In EC environments, node selection refers to the problem of determining which distributed computing nodes should be selected for performing computing tasks taking into consideration the heterogeneity of factors like limited resources, network context, and node’s computational capabilities. Evidently, node selection affects the efficiency and performance of EC environments. Recent node selection strategies rely on either heuristic or optimization methods, which inherently assume static environments. However, distributed environments consist of highly heterogeneous and dynamic systems. Addressing such a dynamic nature requires node selection strategies that leverage real-time feedback information. In this paper, we propose sequential learning-based algorithms based on multi-armed bandit (MAB) systems to deal with the node selection problem. Unlike previous MAB approaches, we contribute novel MAB algorithms for node selection using deep learning expert models. To tackle the inherent uncertainty associated with nodes, we introduce ExpGradBand, a novel expert-based gradient MAB algorithm, which leverages the selection efficiency of gradient bandits with the historic contextual information. Furthermore, we evaluate and compare ExpGradBand with various MAB approaches and baselines found in the literature with and without contextual information. Our evaluation study includes comprehensive experiments that assess the performance of these methods in settings with delayed or lost contextual feedback.

ComputingVol. 107(3)
University of Thessaly (GR), University of Glasgow (GB)
Openalex Percentile: Top 16%
Advanced Bandit Algorithms Research
2.11
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.