An information network security policy learning algorithm based on Sarsa with optimistic initial values. (17th June 2019)

• Record Type: Journal Article
• Authors: Wang, Fang; Feng, Renjun; Chen, Haiyan; Wu, Wen; Zhu, Fei
• Is Part Of: International journal of computational science and engineering. Volume 19:Number 2(2019)
• Page Start: 189
• Page End: 196
• Publication Date: 2019-06-17
• Subjects: information network -- optimistic initial values -- Sarsa -- network defence -- risk control; Computer science -- Mathematics -- Periodicals; Computer simulation -- Mathematical aspects -- Periodicals; Computational intelligence -- Periodicals; 004.015105
• Languages: English
• ISSNs: 1742-7185

Abstract

With the widespread applications of artificial intelligence and automation, more and more devices are monitored by computer systems. In many cases, multiple management control information systems compose a comprehensive information system network. As the scale of the network is getting larger and larger and the topology of the network is getting more and more sophisticated, it is impossible for a fixed mode network system control policy, which was designed for small and simple network that often lacked ability to deal with dynamic environment, to handle security policy task. Hereby a network security policy online learning algorithm based on Sarsa with the optimistic initial values is proposed. The algorithm consists of two parts, one acting as the defence agent and the other acting as the attacking agent. The defence agent learns and improves the system protection policy by fighting against simulating attacking from attacking agent. Defence agent takes advantage of Sarsa method to improve its defence policy, which utilises historical experience to improve the defence policy in an online mode. The use of optimistic initial values speeds up the training time.