Minimum hop flow assignment and routing in computer-communication networks
James S. Meditch, Francis D Gorecki · 1980
The problem of minimum hop flow assignment and routing in computer-communication networks subject to an average message delay constraint or to a set of end-to-end average message delay constraints is formulated, and a simple algorithm for solution of the problem is developed. The algorithm is illustrated via an example, and directions for future research are indicated.