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

被引:0
作者
Alfahad, Saleh [1 ]
Parambath, Shameem Puthiya [1 ]
Anagnostopoulos, Christos [1 ]
Kolomvatsos, Kostas [2 ]
机构
[1] Univ Glasgow, Sch Comp Sci, Glasgow City, Scotland
[2] Univ Thessaly, Dept Informat & Telecommun, Lamia, Greece
关键词
Edge computing; Node selection; Multi-armed bandits; Non-stochastic bandits; EDGE; CLOUD; NETWORKS; SYSTEMS;
D O I
10.1007/s00607-025-01443-w
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页数:25
相关论文
共 54 条
  • [1] Chen S., Tao Y., Yu D., Li F., Gong B., Distributed learning dynamics of multi-armed bandits for edge intelligence, J Syst Archit, 114, (2021)
  • [2] Yang C.-S., Pedarsani R., Avestimehr A.S., Edge computing in the dark: leveraging contextual-combinatorial bandit and coded computing, IEEE/ACM Trans Netw, 29, 3, pp. 1022-1031, (2021)
  • [3] AlFahad S., Wang Q., Anagnostopoulos C., Kolomvatsos K., Task offloading in mobile edge computing using cost-based discounted optimal stopping, Open Comput Sci, 14, 1, (2024)
  • [4] Broch J., Maltz D.A., Johnson D.B., Hu Y.-C., Jetcheva J., A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on mobile computing and networking, pp. 85-97, (1998)
  • [5] Fei T., Tao S., Gao L., Guerin R, (2006)
  • [6] Bedi P., Sharma C., Community detection in social networks, Wiley Interdiscip Rev Data Min Knowl Discov, 6, 3, pp. 115-135, (2016)
  • [7] Delicato F., Protti F., Pirmez L., Rezende J.F., An efficient heuristic for selecting active nodes in wireless sensor networks, Comput Netw, 50, 18, pp. 3701-3720, (2006)
  • [8] Chen H., Wu H., Tzeng N.-F., Grid-based approach for working node selection in wireless sensor networks. In: 2004 IEEE international conference on communications (IEEE Cat. No. 04CH37577), vol 6. IEEE, 3673–3678, (2004)
  • [9] Nikoloska I., Zlatanov N., Data selection scheme for energy efficient supervised learning at iot nodes, IEEE Commun Lett, 25, 3, pp. 859-863, (2020)
  • [10] Zabihi Z., Eftekhari Moghadam A.M., Rezvani M.H., Reinforcement learning methods for computation offloading: a systematic review, ACM Comput Surv, 56, 1, pp. 1-41, (2023)