A Systematic Literature Review of Hybrid Adaptive Scheduling Algorithmsfor Dynamic Fog ComputingEnvironments
2025 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE credits
Student thesis
Abstract [en]
This thesis presents a systematic review of the literature on scheduling algorithmsin fog computing, focusing on Hybrid Adaptive Scheduling Algorithms. The challengesof scalability, energy efficiency, flexibility, and latency have been addressedin this study by evaluating the efficacy of HASA against classical approaches likeRule-Based and AI-Driven Algorithms within resource-constrained dynamic environmentssuch as healthcare monitoring, smart cities, and industrial applications.Through a comparative analysis, HASAs demonstrate superior performance by balancingadaptability, energy optimization, and task distribution. Their lightweightAI models, together with a decentralized architecture and predictive mechanisms,can enable ultra-low latency with efficient resource management, hence becominghighly suitable for delay-sensitive applications. This work also investigates a fewother strategies, such as hierarchical scheduling architectures and adaptive learningmechanisms, which would enhance the robustness and applicability of HASAs to awide range of fog computing scenarios. The results provide a foundational frameworkfor improving scheduling methodologies in fog computing and point toward futureenhancements for scalable and efficient fog computing systems.
Place, publisher, year, edition, pages
2025. , p. 58
Keywords [en]
Fog Computing, Hybrid Adaptive Scheduling, Scalability, Energy Efficiency, Latency Optimization, Predictive Analytics, Task Offloading, Edge Computing, Real-Time Applications.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:bth-27592OAI: oai:DiVA.org:bth-27592DiVA, id: diva2:1943853
Subject / course
DV2572 Master's Thesis in Computer Science
Educational program
DVATK Master“s Programme in Telecommunication Systems, 120 hp
Supervisors
Examiners
2025-04-012025-03-112025-04-01Bibliographically approved