The flow deviation method: An approach to store‐and‐forward communication network design
- 1 January 1973
- Vol. 3 (2) , 97-133
- https://doi.org/10.1002/net.3230030202
Abstract
Two problems relevant to the design of a store‐and‐forward communication network (the message routing problem and the channel capacity assignment problem) are formulated and are recognized to be essentially non‐linear, unconstrained multicommodity (m.c.) flow problems. A “Flow Deviation” (FD) method for the solution of these non‐linear, unconstrained m.c. flow problems is described which is quite similar to the gradient method for functions of continuous variables; here the concept of gradient is replaced by the concept of “shortest route” flow. As in the gradient method, the application of successive flow deviations leads to local minima. Finally, two interesting applications of the FD method to the design of the ARPA Computer Network are discussed.This publication has 20 references indexed in Scilit:
- Minimum cost routing for static network modelsNetworks, 1971
- Routing in computer networksNetworks, 1971
- Optimal design of centralized computer networksNetworks, 1971
- The Design of Minimum-Cost Survivable NetworksIEEE Transactions on Circuit Theory, 1969
- Traffic assignment problem for a general networkJournal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, 1969
- Multiple computer networks and intercomputer communicationPublished by Association for Computing Machinery (ACM) ,1967
- Minimum-Cost Multicommodity Network FlowsOperations Research, 1966
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- A Suggested Computation for Maximal Multi-Commodity Network FlowsManagement Science, 1958
- ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH.Proceedings of the Institution of Civil Engineers, 1952