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.
Similar content being viewed by others
REFERENCES
Yu. E. Malashenko and I. A. Nazarova, “Analysis of the distribution of limit loads in a multiuser network,” Inf. Primen. 15 (4), 19–24 (2021).
Yu. E. Malashenko and I. A. Nazarova “Estimates of resource distribution in a multiuser network with equal internodal loads,” Inf. Primen. 17 (1), 21–26 (2023).
Yu. E. Malashenko and I. A. Nazarova “Analysis of multiuser network load when splitting flows along the shortest routes,” Inf. Primen. 17 (3), 19–24 (2023).
K. Salimifard and S. Bigharaz, “The multicommodity network flow problem: State of the art classification, applications, and solution methods,” J. Oper. Res. Int. 22 (2), 1–47 (2020).
H. Luss, Equitable Resource Allocation: Models, Algorithms, and Applications (John Wiley and Sons, Hoboken, 2012).
A. Balakrishnan, G. Li, and P. Mirchandani, “Optimal network design with end-to-end service requirements,” Oper. Res 65 (3), 729–750 (2017).
P. Bialon, “A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees,” Telecommun. Syst. 64 (3), 525–542 (2017).
M. Caramia and A. Sgalambro, “A fast heuristic algorithm for the maximum concurrent k-splittable flow problem,” Optim. Lett. 4 (1), 37–55 (2010).
A. Melchiori and A. Sgalambro, “A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem,” Eur. J. Oper. Res. 282 (3), 846–857 (2020).
O. Kabadurmus and A. E. Smith, “Multicommodity k-splittable survivable network design problems with relays,” Telecommun. Syst. 62 (1), 123–133 (2016).
T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (MIT Press, Cambridge, Mass., 2001; Vil’yams, Moscow, 2005).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Publisher’s Note.
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Malashenko, Y.E., Nazarova, I.A. Resource Distribution and Balancing Flows in a Multiuser Network. J. Comput. Syst. Sci. Int. 62, 850–861 (2023). https://doi.org/10.1134/S106423072305012X
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S106423072305012X