A decentralized algorithm for optimal routing in data-communication networks

The goal coordination technique of optimization theory for large-scale systems is used to develop a decentralized algorithm for optimal routing in data-communication networks. The algorithm is in two parts of which the first solves the optimal flow assignment problem and the second provides the corresponding optimal routing. All calculations are distributed among the nodes and require information only from adjacent nodes. The results are illustrated via an example and problems for future research are indicated.