This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Routing in a Packet-Switched Computer Network
October 1974 (vol. 23 no. 10)
pp. 1062-1069
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.
Index Terms:
Computer networks, decomposition method, mathematical programming, minimum cost flow, multicommodity flow, packet switching, routing.
Citation:
D.G. Cantor, M. Gerla, "Optimal Routing in a Packet-Switched Computer Network," IEEE Transactions on Computers, vol. 23, no. 10, pp. 1062-1069, Oct. 1974, doi:10.1109/T-C.1974.223806
Usage of this product signifies your acceptance of the Terms of Use.