Optimal dynamic routing in communication networks with continuous traffic
Abstract
New characterizations of optimal statedependent routing strategies are obtained for the continuous traffic network model proposed by Segall (1979) for linear cost with unity weighting at each node and for constant inputs. The concept of flow relaxation is introduced and is used to transform the optimal routing problem into an initial flow optimization problem with convex cost and linear constraints. Three algorithms are given for openloop computation of the optimal initial flow. The first is a simple iterative algorithm based on gradient descent with bending, and it is well suited for decentralized computation. The second algorithm reduces the problem to a series of maximum flow problems, and it computes the exact optimal initial flow in 0(/N/4) computations where /N/ is the number of nodes in the network. The third algorithm is based on a search for successive bottlenecks in the network.
 Publication:

IN: Conference on Decision and Control
 Pub Date:
 1982
 Bibcode:
 1982deco....1..369H
 Keywords:

 Communication Networks;
 Dynamic Models;
 Optimal Control;
 Packets (Communication);
 Algorithms;
 Feedback Control;
 Problem Solving;
 Recursive Functions;
 Communications and Radar