A Formal Verification Model for Performance Analysis of Reinforcement Learning Algorithms Applied to Dynamic Networks

Journal Title: Journal of Applied Computer Science & Mathematics - Year 2017, Vol 11, Issue 23

Abstract

Routing data packets in a dynamic network is a difficult and important problem in computer networks. As the network is dynamic, it is subject to frequent topology changes and is subject to variable link costs due to congestion and bandwidth. Existing shortest path algorithms fail to converge to better solutions under dynamic network conditions. Reinforcement learning algorithms posses better adaptation techniques in dynamic environments. In this paper we apply model based Q-Routing technique for routing in dynamic network. To analyze the correctness of Q-Routing algorithms mathematically, we provide a proof and also implement a SPIN based verification model. We also perform simulation based analysis of Q-Routing for given metrics.

Authors and Affiliations

ALNASER As'ad Mahmoud As'ad

Keywords

Related Articles

IT&C used by Individuals and Economic Development in Romania - Application of Cointegration and Vector Error Correction Model

Since the first decade of the 21st century, information and communication technology has become both a tool for the individual and, in many cases, a way of life. Undoubtedly, the Internet has revolutionized the society i...

Data mining techniques for e-learning

Data Mining (DM), sometimes called Knowledge Discovery in Databases (KDD), is a powerful new technology with great potential to help companies focus on the most important information in the data they have collected via t...

Application Of Mathematical Methods For Condition Monitoring Of Oil And Gas Facilities

irections for numerical realization of two-dimensional models in different frames account for environmental heterogeneity of matter distribution have been presented. The schemes allow to measure concentration of substanc...

Approximate solution of high-order integro-differential equations using radial basis functions

In this paper, we present a numerical method to solve linear and nonlinear high-order Volterra integro-differential equations. This method is based on interpolating by radial basis functions, using Legendre-Gauss-Lobatto...

Evaluating Web-based Technologies: The Paradigm of User-centricity

–Web Search Engines (WeSEs) are information systems that demonstrate large scale distributed system capabilities, and are fluxing and dynamic in nature. It is necessary to continually review them. There is need for metho...

Download PDF file
  • EP ID EP446671
  • DOI 10.4316/JACSM.201701001
  • Views 202
  • Downloads 0

How To Cite

ALNASER As'ad Mahmoud As'ad (2017). A Formal Verification Model for Performance Analysis of Reinforcement Learning Algorithms Applied to Dynamic Networks. Journal of Applied Computer Science & Mathematics, 11(23), 9-13. https://europub.co.uk/articles/-A-446671