- ^ f.d. >0, f is feasible and can be used to start i=l 1 1 the FD algorithm. Otherwise f® is rejected. The initial random choice of the lengths guarantees a cer¬ tain randomness in the starting feasible flow, thus providing a method for finding several local minima. After a convenient number of… … Fig. 3 A 21-node ARPA topology. 9. APPLICATIONS As an application of the FD method, Problems A and B are solved for the ARPA Computer Network. The ARPA Computer Network is a S/F communication network connecting several computer *Another procedure was proposed by Yaged [18).
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.
