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

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 bett...

Full description

Saved in:
Bibliographic Details
Published inJournal of applied computer science & mathematics Vol. 11; no. 1; pp. 13 - 16
Main Authors Shrirang Ambaji KULKARNI, Raghavendra G . RAO
Format Journal Article
LanguageEnglish
Published Stefan cel Mare University of Suceava 01.04.2017
Subjects
Dynamic Networks
Q - Routing. SPIN model checking
Reinforcement Learning
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2066-4273
2066-3129
DOI:10.4316/JACSM.201701002