Accession Number : ADA095385

Title :   Distributed Routing

Descriptive Note : Doctoral thesis

Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS

Personal Author(s) : O'Leary, Art

PDF Url : ADA095385

Report Date : Jan 1981

Pagination or Media Count : 91

Abstract : In distributed routing each node receives some information about the network from its adjacent nodes and uses the information to determine the manner in which it forwards its traffic. This thesis gives three examples of distributed routing in a data communication network. A routing algorithm is then given where a generalized distributed routing procedure proposes a flow change and a central node determines the optimal scale of the proposed change. Small flows on long and unwanted paths are set to zero regardless of the scaling. The thesis shows that the iterative use of this algorithm converges to the optimal network cost, e.g. it minimizes the mean delay.

Descriptors :   *COMPUTER COMMUNICATIONS, *QUEUEING THEORY, *ROUTING, ALGORITHMS, COMMUNICATIONS NETWORKS, DECISION MAKING, DELAY, ITERATIONS, NETWORK FLOWS, NODES, OPTIMIZATION, QUICK REACTION, REACTION TIME, THESES

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE