Abstract:
Within the framework of a multicommodity network model, nondiscriminatory distribution of the tantamount flows of various types transmitted between all pairs of nodes simultaneously is analyzed. When setting and solving optimization problems, the resource required by a certain source–receiver pair is treated as the sum of the capacity values of all edges located on all routes of this source–receiver flow. The sum of the corresponding edge flows is interpreted as the total load on the network occurring during a transmission of this internode flow. A nuclear-chain of lexicographically ordered problems of searching for routes with equal loads for source–receiver pairs is solved in computational experiments. At each iteration, a vector of peak values of jointly permissible internode flows is used for assessment of the system's functionality. The method allows for a finite number of steps to find the final nondiscriminating maximin distribution of resources providing the peak load of all network edges.