Team theory and backpropagation for dynamic routing in communication networks
G. Frisiani, Thomas Parisini, L. Siccardi, R. Zoppoli · 2002
The dynamic routing problem in communication networks is considered. Traffic routing nodes are required to generate routing decisions on the basis of local information, and to compute or adapt their routing strategies online. The first requirement leads to regarding routing nodes as the cooperating decision makers of a team organization. The second requirement calls for a computationally distributed algorithm. This fact and the impossibility of solving, under general conditions, team functional optimization problems suggest that each routing node be assigned a set of multilayer feedforward neural networks able to generate routing decisions. The weights of such neural networks are then adjusted by means of an algorithm based on backpropagation.>