Abstract

Balancing strategies for control flows and resources are studied in computational experiments on a mathematical model of a multiuser network. An algorithmic scheme for sequentially solving a chain of lexicographically ordered problems of finding nondiscriminating the maximin distributions of flows is proposed. A procedure for step-by-step equalizing the splitting of internodal flows along all the existing shortest paths is developed. At each iteration, a part of the available resource is distributed equally among all pairs of correspondent nodes for which there is a possibility of flow transmission. The results obtained in the course of the experiments make it possible to trace the dynamics of changes in the capacity of the edges, up to reaching the maximum network load. Bottlenecks in various networks are analyzed and compared with a monotonic increase in the flows. Special diagrams are given.

中文翻译：

---

多用户网络中的资源分配和平衡流量

摘要

在多用户网络数学模型的计算实验中研究了控制流和资源的平衡策略。提出了一种算法方案，用于顺序解决一系列按字典顺序排列的问题，以找到无差别的流的最大最小分布。开发了一种沿着所有现有最短路径逐步均衡节间流分裂的程序。在每次迭代中，一部分可用资源被平均分配到所有有可能进行流传输的对端节点之间。实验过程中获得的结果使得追踪边缘容量变化的动态成为可能，直至达到最大网络负载。分析了各种网络中的瓶颈，并将其与流量的单调增长进行比较。给出了特殊的图表。