98 FPATTA, GERLA AND KLEINROCK … Fig. 1 Example of routing of the (i,j) commodity. The multi commodity (m.c.) flow problem consists of finding the routes for all such commodities, which minimize (or maxi¬ mize) a well-defined performance function (e.g., cost or delay), such that a set of constraints (e.g. , channel capacity con¬…
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.
