Optimal Routing in a Packet-Switched Computer Network
- 1 October 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-23 (10), 1062-1069
- https://doi.org/10.1109/t-c.1974.223806
Abstract
The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.Keywords
This publication has 11 references indexed in Scilit:
- The Traffic Assignment Problem for Multiclass-User Transportation NetworksTransportation Science, 1972
- On the Optimization of Message-Switching NetworksIEEE Transactions on Communications, 1972
- Minimum cost routing for static network modelsNetworks, 1971
- Routing in computer networksNetworks, 1971
- Computer network development to achieve resource sharingPublished by Association for Computing Machinery (ACM) ,1970
- The interface message processor for the ARPA computer networkPublished by Association for Computing Machinery (ACM) ,1970
- Topological considerations in the design of the ARPA computer networkPublished by Association for Computing Machinery (ACM) ,1970
- HOST-HOST communication protocol in the ARPA networkPublished by Association for Computing Machinery (ACM) ,1970
- Analytic and simulation methods in computer network designPublished by Association for Computing Machinery (ACM) ,1970
- Traffic assignment problem for a general networkJournal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, 1969