1.
Chen, Zheyu; Leung, Kin K.; Wang, Shiqiang; Tassiulas, Leandros; Chan, Kevin; Baker, Patrick J.
Multi-policy reinforcement learning for network resource allocation with periodic behaviors Journal Article
In: Computer Networks, vol. 272, pp. 111645, 2025, ISSN: 1389-1286.
Abstract | Links | BibTeX | Tags: deep reinforcement learning, Markov Decision Process, Network resource allocation, Reinforcement learning
@article{chen_multi-policy_2025,
title = {Multi-policy reinforcement learning for network resource allocation with periodic behaviors},
author = {Zheyu Chen and Kin K. Leung and Shiqiang Wang and Leandros Tassiulas and Kevin Chan and Patrick J. Baker},
url = {https://www.sciencedirect.com/science/article/pii/S1389128625006127},
doi = {10.1016/j.comnet.2025.111645},
issn = {1389-1286},
year = {2025},
date = {2025-11-01},
urldate = {2025-10-08},
journal = {Computer Networks},
volume = {272},
pages = {111645},
abstract = {Markov Decision Processes (MDPs) serve as the mathematical foundation of Reinforcement learning (RL), where a Markov process with defined states is used to model the system and the actions to be taken affect the state transitions and the corresponding rewards. The RL and deep RL (DRL) can produce the high-performing action policy to maximize the long-term reward. Although RL/DRL have been widely applied to communication and computer systems, a key limitation is that the system under consideration often does not satisfy the required mathematical properties, thus making the MDP inexact and the derived policy flawed. Therefore, we consider the periodic Markov Decision Process (pMDP), where the evolution of the underlying process and model parameters for the pMDP demonstrate some forms of periodic characteristics (e.g., periodic job arrivals and available resources) which violate the Markov property. To obtain the optimal policies for the pMDP, a policy gradient method with a multi-policy solution framework is proposed, and a deep-learning method is developed to improve the effectiveness and stability of the proposed solution. Furthermore, a layer-sharing strategy is proposed to reduce the storage complexity by reducing the number of parameters in the neural networks. The deep-learning method is applied to achieve the near-optimal allocation of resources to arriving computational tasks in a network setting corresponding to the software-defined network (SDN). Evaluation results reveal that the proposed technique is valid and capable of outperforming a baseline method that employs a single policy by 31% on average.},
keywords = {deep reinforcement learning, Markov Decision Process, Network resource allocation, Reinforcement learning},
pubstate = {published},
tppubtype = {article}
}
Markov Decision Processes (MDPs) serve as the mathematical foundation of Reinforcement learning (RL), where a Markov process with defined states is used to model the system and the actions to be taken affect the state transitions and the corresponding rewards. The RL and deep RL (DRL) can produce the high-performing action policy to maximize the long-term reward. Although RL/DRL have been widely applied to communication and computer systems, a key limitation is that the system under consideration often does not satisfy the required mathematical properties, thus making the MDP inexact and the derived policy flawed. Therefore, we consider the periodic Markov Decision Process (pMDP), where the evolution of the underlying process and model parameters for the pMDP demonstrate some forms of periodic characteristics (e.g., periodic job arrivals and available resources) which violate the Markov property. To obtain the optimal policies for the pMDP, a policy gradient method with a multi-policy solution framework is proposed, and a deep-learning method is developed to improve the effectiveness and stability of the proposed solution. Furthermore, a layer-sharing strategy is proposed to reduce the storage complexity by reducing the number of parameters in the neural networks. The deep-learning method is applied to achieve the near-optimal allocation of resources to arriving computational tasks in a network setting corresponding to the software-defined network (SDN). Evaluation results reveal that the proposed technique is valid and capable of outperforming a baseline method that employs a single policy by 31% on average.