Network-Adaptive qos routing using local information

Authors:
Jeongsoo Han
Affiliations:
Department of Internet Information technique, Shingu College, Korea
Venue:
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
Year:
2006

Citing 4
Cited 0

Parallel algorithm for shortest pairs of edge-disjoint paths

Journal of Parallel and Distributed Computing
Reinforcement learning: a survey

Journal of Artificial Intelligence Research
A localized adaptive proportioning approach to QoS routing

IEEE Communications Magazine
Call admission control and routing in integrated services networks using neuro-dynamic programming

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose the localized adaptive QoS routing scheme using POMDP(partially observable Markov Decision Processes) and Exploration Bonus. In order to deal with POMDP problem, we use CEA(Certainty Equivalency Approximation) technique that involves using the mean value of random variables, since it is intractable to determine the optimal solution. And we present a new path selection using the Exploration Bonus method in order to find detour path, which is better than current path and more adaptive to network environment. Also we evaluate performances of service success rate and average hop count which varies with φ and κ performance parameters, which are defined as exploration count and intervals.