Integrating deep reinforcement learning with pointer networks for service request scheduling in edge computing

With the increasing popularity of edge computing, service providers are more likely to deploy services at the edge of the network to reduce the latency of service requests. However, the resources offered by edge servers are extremely limited compared to those in the cloud. Therefore, a challenging i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Knowledge-based systems Ročník 258; s. 109983
Hlavní autoři: Zhao, Yuqi, Li, Bing, Wang, Jian, Jiang, Delun, Li, Duantengchuan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 22.12.2022
Témata:
Deep reinforcement learning
Edge computing
Pointer networks
Scheduling algorithm
Deep reinforcement learning
Pointer networks
Scheduling algorithm
Edge computing
ISSN:0950-7051, 1872-7409
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With the increasing popularity of edge computing, service providers are more likely to deploy services at the edge of the network to reduce the latency of service requests. However, the resources offered by edge servers are extremely limited compared to those in the cloud. Therefore, a challenging issue in edge computing is how to sufficiently utilize service resources at the edge to satisfy as many service requests as possible. Existing service request scheduling methods mainly use a single optimization objective, e.g., resource utilization or running time. In this paper, the issue of service request scheduling with multiple requests is modeled as a sequential problem, where multiple optimization objectives, including resource utilization, running time, and waiting time, are involved. A reinforcement learning model with pointer networks is proposed to construct scheduling policies. Experiments conducted on three representative real-world datasets show that our proposed approach outperforms several state-of-the-art methods on the three metrics.
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2022.109983