3 research outputs found
Stepwise Assertional Design of Distance-Vector Routing Algorithms
There are many kinds of distance-vector algorithms for adaptive
routing in wide-area computer networks, ranging from the classical
Distributed Bellman-Ford to several recent algorithms that have
better performance.
However, these algorithms have very complicated behaviors and their
analyses in the literature has been incomplete (and operational).
In this paper, we present a stepwise assertional design of a recently
proposed distance-vector algorithm.
Our design starts with the Distributed Bellman-Ford and goes through
two intermediate algorithms. The properties established for each
algorithm hold for the succeeding algorithms. The algorithms analyzed
here are representative of various internetwork routing protocols.
(Also cross-referenced as UMIACS-TR-92-39.1
Reinforcement learning for routing in communication networks
Thesis (MSc)--Stellenbosch University, 2003.ENGLISH ABSTRACT: Routing policies for packet-switched communication networks must be able to adapt
to changing traffic patterns and topologies. We study the feasibility of implementing
an adaptive routing policy using the Q-Learning algorithm which learns sequences of
actions from delayed rewards. The Q-Routing algorithm adapts a network's routing
policy based on local information alone and converges toward an optimal solution. We
demonstrate that Q-Routing is a viable alternative to other adaptive routing methods
such as Bellman-Ford. We also study variations of Q-Routing designed to better explore
possible routes and to take into consideration limited buffer size and optimize multiple
objectives.AFRIKAANSE OPSOMMING:Die roetering in kommunikasienetwerke moet kan aanpas by veranderings in netwerktopologie
en verkeersverspreidings. Ons bestudeer die bruikbaarheid van 'n aanpasbare
roeteringsalgoritme gebaseer op die "Q-Learning"-algoritme wat dit moontlik maak om
'n reeks besluite te kan neem gebaseer op vertraagde vergoedings. Die roeteringsalgoritme
gebruik slegs nabygelee inligting om roeteringsbesluite te maak en konvergeer na
'n optimale oplossing. Ons demonstreer dat die roeteringsalgoritme 'n goeie alternatief
vir aanpasbare roetering is, aangesien dit in baie opsigte beter vaar as die Bellman-Ford
algoritme. Ons bestudeer ook variasies van die roeteringsalgoritme wat beter paaie kan
ontdek, minder geheue gebruik by netwerkelemente, en wat meer as een doelfunksie
kan optimeer
Stepwise Assertional Design of Distance-Vector Routing Algorithms
There are many kinds of distance-vector algorithms for adaptive routing in wide-area computer networks, ranging from the classical Distributed Bellman-Ford to several recent algorithms that have better performance. However, these algorithms have very complicated behaviors and their analyses in the literature has been incomplete (and operational). In this paper, we present a stepwise assertional design of a recently proposed distance-vector algorithm. Our design starts with the Distributed Bellman-Ford and goes through two intermediate algorithms. The properties established for each algorithm hold for the succeeding algorithms. The algorithms analyzed here are representative of various internetwork routing protocols