Skip to main content
Top
Published in: Journal of Computer and Systems Sciences International 5/2023

11-11-2023 | SYSTEM ANALYSIS AND OPERATIONS RESEARCH

Resource Distribution and Balancing Flows in a Multiuser Network

Authors: Yu. E. Malashenko, I. A. Nazarova

Published in: Journal of Computer and Systems Sciences International | Issue 5/2023

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference 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, “Analysis of the distribution of limit loads in a multiuser network,” Inf. Primen. 15 (4), 19–24 (2021).
2.
go back to reference 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 “Estimates of resource distribution in a multiuser network with equal internodal loads,” Inf. Primen. 17 (1), 21–26 (2023).
3.
go back to reference 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). 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).
4.
go back to reference 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).CrossRef 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).CrossRef
5.
go back to reference H. Luss, Equitable Resource Allocation: Models, Algorithms, and Applications (John Wiley and Sons, Hoboken, 2012).CrossRef H. Luss, Equitable Resource Allocation: Models, Algorithms, and Applications (John Wiley and Sons, Hoboken, 2012).CrossRef
6.
go back to reference A. Balakrishnan, G. Li, and P. Mirchandani, “Optimal network design with end-to-end service requirements,” Oper. Res 65 (3), 729–750 (2017).MathSciNetCrossRef A. Balakrishnan, G. Li, and P. Mirchandani, “Optimal network design with end-to-end service requirements,” Oper. Res 65 (3), 729–750 (2017).MathSciNetCrossRef
7.
go back to reference 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).CrossRef 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).CrossRef
8.
go back to reference M. Caramia and A. Sgalambro, “A fast heuristic algorithm for the maximum concurrent k-splittable flow problem,” Optim. Lett. 4 (1), 37–55 (2010).MathSciNetCrossRef M. Caramia and A. Sgalambro, “A fast heuristic algorithm for the maximum concurrent k-splittable flow problem,” Optim. Lett. 4 (1), 37–55 (2010).MathSciNetCrossRef
9.
go back to reference 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).MathSciNetCrossRef 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).MathSciNetCrossRef
10.
go back to reference O. Kabadurmus and A. E. Smith, “Multicommodity k-splittable survivable network design problems with relays,” Telecommun. Syst. 62 (1), 123–133 (2016).CrossRef O. Kabadurmus and A. E. Smith, “Multicommodity k-splittable survivable network design problems with relays,” Telecommun. Syst. 62 (1), 123–133 (2016).CrossRef
11.
go back to reference T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (MIT Press, Cambridge, Mass., 2001; Vil’yams, Moscow, 2005). T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (MIT Press, Cambridge, Mass., 2001; Vil’yams, Moscow, 2005).
Metadata
Title
Resource Distribution and Balancing Flows in a Multiuser Network
Authors
Yu. E. Malashenko
I. A. Nazarova
Publication date
11-11-2023
Publisher
Pleiades Publishing
Published in
Journal of Computer and Systems Sciences International / Issue 5/2023
Print ISSN: 1064-2307
Electronic ISSN: 1555-6530
DOI
https://doi.org/10.1134/S106423072305012X

Other articles of this Issue 5/2023

Journal of Computer and Systems Sciences International 5/2023 Go to the issue

Premium Partner