Optimal Routing in a Packet-Switched Computer Network

  title={Optimal Routing in a Packet-Switched Computer Network},
  author={David G. Cantor and Mario Gerla},
  journal={IEEE Transactions on Computers},
The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem. 
Highly Cited
This paper has 136 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 82 extracted citations

136 Citations

Citations per Year
Semantic Scholar estimates that this publication has 136 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-8 of 8 references

Computational considerations and routing problems for large computer communications networks , " presented at the Nat

  • W. Chou, H. Frank
  • 1972

, Jr . , " Minimum cost routing for static network models

  • S. Crocker S. Carr, V. Cerf
  • 1970

, " Adaptive routing techniques for message switching computer - communication networks

  • G. L. Fultz
  • Integer Programming and Network Flows
  • 1969

Dafernos , " The traffic assignment problem for multi - class - user transportation networks

  • B. Yaged
  • 1969

The traffic assignment problem for a general network

  • F. T. Sparrow
  • 1964

, Jr . , " On the optimization of message - switching networks

  • H. R. Rudin
  • Communication Nets : Stochastic Message Flow and…

Wolfe , " On the convergence of gradient methods under constraint

  • S. M. Ornstein, W. R. Crowther
  • IBM J . Res . Develop

Similar Papers

Loading similar papers…