A Comparison of Information Policies for Minimum Delay Routing Algorithms

The problem of routing in a computer networks is dealt with by separating the information problem and the control problem. Several classes of information policies are examined, and numerical comparisons are made of their performance, using representative values of network parameters. Routing based on the expected values of delay, rather than actual values of delay, is shown to be superior to the other algorithms considered.