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

Enumerating Hamiltonian Cycles in a Planar Graph Using Combinatorial Cycle Bases

sed both for listing and enumerating Hamiltonian cycles contained in a planar graph. Planar cycle bases have a weighted induced graph whose weight values limited to 1. Hence making it was possible used in the Hamiltonian...

An Attribute Involved Public Key Cryptosystem Based on P-Sylow Subgroups and Randomization

The Asymmetric Key Cryptosystem (AKC) or Public Key Encryption (PKE) is a mechanism used to encrypt the messages by using public key and decrypt the enciphered messages by using private key. Of late, the Attribute-Base...

Developing a Mathematical Model to Estimate the Intensity of the Global Radiation

–This research aimed to create an empirical mathematical model to estimate the average monthly of total daily radiation of the global radiation in the middle of northeast Thailand. The model showed the ratio of the month...

Complexities in a Plant-Herbivore Model

A simple host-parasite type model has been considered to study the interaction of certain plants and herbivores. The two dimensional discrete time model utilizes leaf and herbivore biomass as state variables. The paramet...

Removal of Baseline Wander Noise from Electrocardiogram (ECG) using Fifth-order Spline Interpolation

Abstract–Baseline wandering can mask some important features of the Electrocardiogram (ECG) signal hence it is desirable to remove this noise for proper analysis and display of the ECG signal. This paper presents the imp...

Download PDF file
  • EP ID EP446671
  • DOI 10.4316/JACSM.201701001
  • Views 190
  • 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