39 120 FRATTA, GERLA AND KLEINROCK an FD iteration, then in such an arc, the flow and capacity are zero for all subsequent iterations, as the incremental cost of restoring the flow (= 3T/3fj) is infinity.* … Fig. 2 Block diagram of the FD algorithm fo:* Problem B. *This -property suggests a method for the design of the topology: we can start from a topology which is highly connected, and eliminate arcs with the FD method, until a suboptimal configura¬ tion is obtained 121]. A similar approach is used…
Kleinrock, Leonard · California univ los angeles dept of computer science · Computers · Communications networks · Data transmission systems · Mathematical models · Mathematical programming · Network flows · Networks · Satellite communications · Switching circuits
Internet Archive · Defense Technical Information Center · Public domain (US government work). Free to use for anything.
