DocumentCode
1113701
Title
Optimal Routing in a Packet-Switched Computer Network
Author
Cantor, David G. ; Gerla, Mario
Author_Institution
Department of Mathematics, University of California
Issue
10
fYear
1974
Firstpage
1062
Lastpage
1069
Abstract
The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.
Keywords
Computer networks, decomposition method, mathematical programming, minimum cost flow, multicommodity flow, packet switching, routing.; Application software; Channel capacity; Computer networks; Costs; Delay; Intelligent networks; Mathematical programming; Packet switching; Routing; Throughput; Computer networks, decomposition method, mathematical programming, minimum cost flow, multicommodity flow, packet switching, routing.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.223806
Filename
1672399
Link To Document