scholarly journals The complexity of optimal queueing network control

Author(s):  
C.H. Papadimitriou ◽  
J.N. Tsitsiklis
2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Zhicong Zhang ◽  
Shuai Li ◽  
Xiaohui Yan

We study an online multisource multisink queueing network control problem characterized with self-organizing network structure and self-organizing job routing. We decompose the self-organizing queueing network control problem into a series of interrelated Markov Decision Processes and construct a control decision model for them based on the coupled reinforcement learning (RL) architecture. To maximize the mean time averaged weighted throughput of the jobs through the network, we propose a reinforcement learning algorithm with time averaged reward to deal with the control decision model and obtain a control policy integrating the jobs routing selection strategy and the jobs sequencing strategy. Computational experiments verify the learning ability and the effectiveness of the proposed reinforcement learning algorithm applied in the investigated self-organizing network control problem.


Sign in / Sign up

Export Citation Format

Share Document