We use cookies to improve your experience with our site.
Hu SH, Luo QY, Li GH et al. CA-DTS: A distributed and collaborative task scheduling algorithm for edge computing enabled intelligent road network. JOURNAL OFCOMPUTER SCIENCE AND TECHNOLOGY 38(5): 1113−1131 Sept. 2023. DOI: 10.1007/s11390-023-2839-0.
Citation: Hu SH, Luo QY, Li GH et al. CA-DTS: A distributed and collaborative task scheduling algorithm for edge computing enabled intelligent road network. JOURNAL OFCOMPUTER SCIENCE AND TECHNOLOGY 38(5): 1113−1131 Sept. 2023. DOI: 10.1007/s11390-023-2839-0.

CA-DTS: A Distributed and Collaborative Task Scheduling Algorithm for Edge Computing Enabled Intelligent Road Network

  • Edge computing enabled Intelligent Road Network (EC-IRN) provides powerful and convenient computing services for vehicles and roadside sensing devices. The continuous emergence of transportation applications has caused a huge burden on roadside units (RSUs) equipped with edge servers in the Intelligent Road Network (IRN). Collaborative task scheduling among RSUs is an effective way to solve this problem. However, it is challenging to achieve collaborative scheduling among different RSUs in a completely decentralized environment. In this paper, we first model the interactions involved in task scheduling among distributed RSUs as a Markov game. Given that multi-agent deep reinforcement learning (MADRL) is a promising approach for the Markov game in decision optimization, we propose a collaborative task scheduling algorithm based on MADRL for EC-IRN, named CA-DTS, aiming to minimize the long-term average delay of tasks. To reduce the training costs caused by trial-and-error, CA-DTS specially designs a reward function and utilizes the distributed deployment and collective training architecture of counterfactual multi-agent policy gradient (COMA). To improve the stability of performance in large-scale environments, CA-DTS takes advantage of the action semantics network (ASN) to facilitate cooperation among multiple RSUs. The evaluation results of both the testbed and simulation demonstrate the effectiveness of our proposed algorithm. Compared with the baselines, CA-DTS can achieve convergence about 35% faster, and obtain average task delay that is lower by approximately 9.4%, 9.8%, and 6.7%, in different scenarios with varying numbers of RSUs, service types, and task arrival rates, respectively.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return