Proceedings

Confidence Based Dual Reinforcement Q-Routing: An adaptive online network routing algorithm

Download BibTeX Cite

Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Machine Learning. Pages 758-762.

Abstract

This paper describes and evaluates the Confidence-based Dual Reinforcement Q-Routing algorithm (CDRQ-Routing) for adaptive packet routing in communication networks. CDRQ-Routing is based on the Qlearning framework of Q-Routing. The main contribution of this work is the increased quantity and improved quality of exploration in CDRQ-Routing, which lead to faster adaptation and better routing policies learned as compared to Q-Routing, the state-of-the-art adaptive Bellman-Ford Routing, and the nonadaptive shortest path routing. Experiments over several network topologies have shown that at different loads, CDRQ-Routing learns superior policies significantly faster than QRouting. Moreover, CDRQ-Routing learns policies that sustain higher load levels than QRouting. Analysis shows that overhead due to exploration is insignificant as cqmpared to the improvements in CDRQ-Routing.

Shailesh Kumar, and Risto Miikkulainen. 1999. Confidence Based Dual Reinforcement Q-Routing: An adaptive online network routing algorithm. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI, 758–762. https://ijcai.org/proceedings/1999/108
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards