Joint Planning of Task Placement and Routing for In-Network Computing Paradigm
摘要
In the era of the Internet of Everything, the traditional computing paradigm gradually fails to satisfy the tasks with high quality of service requirements, and in-network computing gradually enters the field of vision, providing a solution idea for the case of insufficient computing network resources. In-network computing involves scheduling computational tasks on the host computer to be executed on network nodes, utilizing network devices such as switches. It simultaneously performs online processing of data during transmission to reduce communication delay, lower energy consumption, and improve overall computational efficiency. This paper studies the joint planning method for the deployment and routing of in-network computing tasks, incorporating knowledge from both in-network computing and reinforcement learning. We also examine existing task deployment and routing methods. We design a joint planning model for the deployment and routing of in-network computing tasks and propose a joint planning algorithm (MDL-TR) based on a message passing neural network and deep reinforcement learning to achieve optimal task scheduling. Finally, the effectiveness of the proposed model is verified through simulation experiments.