An Adaptive Routing Algorithm: Enhanced Confidence-Based Q Routing Algorithm in Network Traffic
Yap, Soon Teck and Othman, Mohamed (2004) An Adaptive Routing Algorithm: Enhanced Confidence-Based Q Routing Algorithm in Network Traffic. Malaysian Journal of Computer Science, 17 (2). pp. 21-29. ISSN 0127-9084
Full text not available from this repository.
Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=306
Universiti Putra Malaysia
Confidence-based Q (CQ) Routing Algorithm is an adaptive network routing algorithm. CQ Routing Algorithm evaluates how confidence value (C value) can be used to improve the quality of exploration in Q Routing Algorithm for adaptive packet routing in communication networks. However, the C value incompletely evaluates how closely the Q value represents the current condition of the network in a given length of time, which is measured in term of estimated delivery time for a packet to arrive at its destination. In this paper, an Enhanced Confidence-based Q (ECQ) Routing Algorithm is proposed. The Variable of Decay Constant and Update All Q value approaches are introduced for updating the C values of non-selected Q values. Using these C values would make those non-selected Q values more competitive in order to achieve updated and more reliable values. The quality of exploration in CQ Routing Algorithm would be improved. The performance of ECQ and CQ Routing Algorithms are compared to prove this improvement. ECQ and CQ Routing Algorithms are tested on an irregular 6 x 6 nodes network grid.
|Keywords:||Adaptive routing algorithm, Confidence-based Q Routing, Confidence value|
Repository Staff Only: item control page