Optimal Distributed Routing Algorithms for Datagram Communication Networks.

摘要

We consider the problem of routing in a communication network with datagram service. Relationships among four optimality conditions are presented. Two distributed algorithms are derived. The main idea underlying the construction of these algorithms is the use of a vector of step sizes. This results in an algorithm with better decent properties than those in the literature. (rrh)