Issue No. 10 - October (1974 vol. 23)
D.G. Cantor , Department of Mathematics, University of California
The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.
Computer networks, decomposition method, mathematical programming, minimum cost flow, multicommodity flow, packet switching, routing.
M. Gerla and D. Cantor, "Optimal Routing in a Packet-Switched Computer Network," in IEEE Transactions on Computers, vol. 23, no. , pp. 1062-1069, 1974.