Self-Organizing Network Control with a TD Learning Algorithm

被引:0
作者
Zhang, Zhicong [1 ]
Li, Shuai [1 ]
Yan, Xiaohui [1 ]
Zhang, Liangwei [1 ]
机构
[1] Dongguan Univ Technol, Dept Ind Engn, Dongguan 523808, Guangdong, Peoples R China
来源
2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM) | 2017年
关键词
Queueing networks; Markov Decision; Process; Control; Reinforcement Learning;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We study a network control problem characterized with self-organizing network structure and self-organizing job routing. We decompose the self-organizing network control problem into a series of Semi Markov Decision Processes and construct a control decision model for them based on the coupled Reinforcement Learning framework. To minimize the mean weighted flow time of the jobs through the network, we propose a Reinforcement Learning algorithm 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.
引用
收藏
页码:2159 / 2163
页数:5
相关论文
共 6 条
[1]  
Al Hanbali A, 2008, LECT NOTES COMPUT SC, V5055, P189, DOI 10.1007/978-3-540-68982-9_14
[2]  
Chaturvedi A.R., 2005, Proceedings of the Interservice/Industry Training, Simulation, and Education Conference (I/ITSEC), Paper 2123, P1
[3]  
Fu W., 2008, P 17 INT C COMP COMM, P1
[4]   Methods for removing links in a network to minimize the spread of infections [J].
Nandi, Apurba K. ;
Medal, Hugh R. .
COMPUTERS & OPERATIONS RESEARCH, 2016, 69 :10-24
[5]   REUSE: A combined routing and link scheduling mechanism for wireless mesh networks [J].
Pereira Augusto, Carlos Henrique ;
Carvalho, Celso Barbosa ;
Rocha da Silva, Marcel William ;
de Rezende, Jose Ferreira .
COMPUTER COMMUNICATIONS, 2011, 34 (18) :2207-2216
[6]  
Pinheiro B., 2011, P 20 INT C COMP COMM, P1