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.
D.G. Cantor, M. Gerla, "Optimal Routing in a Packet-Switched Computer Network", IEEE Transactions on Computers, vol.23, no. 10, pp. 1062-1069, October 1974, doi:10.1109/T-C.1974.223806