On the capacity assignment problem in packet-switching computer networks
The capacity assignment problem in a packet-switching communication network is examined with a new look and under general assumptions about the form of the network cost function and a general class of delay measures, which includes as special cases all the previously proposed delay criteria. Four optimal functions: the optimal delay (cost) versus the maximum permissible cost (delay), and the optimal capacities versus the maximum permissible cost or delay, are defined. Several propositions describing the relations between these functions are given and their form is found if a separability property holds. An interesting application of these results to the flow and capacity assignment problem is also presented. The relations between different versions of the capacity assignment problem (CAP) are given together with sufficient conditions for the uniqueness of the solution. Finally, algorithms for the solution of the CAP are proposed. Emphasis is given to the analysis of an algorithm appropriate for minimax delay criteria. Numerical results and comparisons with other delay measures are also included.
scientific article; zbMATH DE number 4035127