Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Fratta et al. (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: