"Optimal routing strategies in a class of networks"

For networks with given topology and fixed one-way link capacities the problem of the dynamic minimization of the average message delay over priority disciplines and routing procedures at each node is studied. It is assumed that a controller is available at each node and that a strategy is to be found for traffic direction on the basis of varying information patterns, such as the sizes of the queues in the different incoming and outgoing links, with or without the Poisson and exponential statistics assumptions.