Approximation of the multiuser network feasible flows set

A method for approximate description of a convex polyhedral set of feasible flows transmitted between all network nodes simultaneously is considered. A method for constructing an internal convex approximating frame is proposed. The frame is formed based on the vectors of maximum feasible flows between pairs of source–receiver vertices. The system of support vectors is determined by the points lying on the outer edges of the baseline set. Any convex combination of base vectors sets the feasible flow distribution. The developed algorithmic schemes allow parallelization of computational procedures on heterogeneous multiprocessor complexes. The resulting aggregated description can be used for dispatching intensive input information flows that exceed the network's capability.