Selfish Routing Game-Based Multi-Resource Allocation and Fair Scheduling of Indivisible Jobs in Edge Environments

Selfish Routing Game-Based Multi-Resource Allocation and Fair Scheduling of Indivisible Jobs in Edge Environments

Distributed and heterogeneous edge computing environments require efficient allocation and scheduling of multiple users’ applications. This paper presents a game-theoretic solution to model the competition between time-sensitive internet of things (IoT) applications with indivisible loads...

Full description

Bibliographic Details
Main Authors: Hajar Siar, Mohammad Izadi
Format: Article
Language:English
Published: IEEE 2022-01-01
Series:IEEE Access
Subjects:
Edge computing
job allocation
Nash equilibrium
selfish games
time-sharing scheduling
Online Access:https://ieeexplore.ieee.org/document/9970709/

Internet

https://ieeexplore.ieee.org/document/9970709/

Similar Items