Skip to main content
SpringerLink
Log in

Quantitative Analysis of Flow Distributions in a Multiuser Telecommunication Network

  • SYSTEM ANALYSIS AND OPERATIONS RESEARCH
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

Strategies are considered for the distribution of flows over various transmission routes in a multicommodity network model. Estimates of feasible network loads are formed based on the vector of jointly feasible internodal flows. Two distribution strategies are studied. When implementing the first one, the transmitted internodal flows are equal to each other. The second strategy assumes the search for a nondiscriminatory distribution of flows, during the transmission of which equal value resources are achieved. The load created by a certain pair of nodes is understood as the total capacity required to provide the given type of connection. To estimate the minimum specific resources for the transmission of a flow of a certain type, all the shortest paths between the corresponding pair of nodes are constructed. To obtain an upper estimate of resources when connecting each pair of nodes, the maximum single-product flow is calculated along all the network edges. Computational experiments were carried out for networks with different structures that make it possible to carry out a comparative analysis of equalizing distribution strategies when splitting internodal flows for transmission along different routes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.

Similar content being viewed by others

REFERENCES

  1. Yu. E. Malashenko and I. A. Nazarova, “Estimates of resource distribution in the multiuser network with equal internodal loads,” Inf. Primen. 16 (1), 69–78 (2023).

    Google Scholar 

  2. Yu. E. Malashenko and I. A. Nazarova, “Analysis of the Distribution of Loads and Resources in a Multiuser Network with Equal-Share Internodal Flows,” Sist. Sredstva Inf. 32 (3), 71–80 (2022).

    Google Scholar 

  3. Yu. E. Malashenko, “Maximum internodal flows at peak load of a multiuser network,” Inf. Primen. 15 (3), 24–28 (2021).

    Google Scholar 

  4. 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).

    Article  Google Scholar 

  5. W. Ogryczak, H. Luss, M. Pioro, et al., “Fair optimization and networks: A survey,” J. Appl. Math. 3, 1–25 (2014).

    MathSciNet  Google Scholar 

  6. H. Luss, Equitable Resource Allocation: Models, Algorithms, and Applications (John Wiley and Sons, Hoboken, 2012).

    Book  Google Scholar 

  7. A. Balakrishnan, G. Li, and P. Mirchandani, “Optimal network design with end-to-end service requirements,” Oper. Res. 65 (3), 729–750 (2017).

    Article  MathSciNet  Google Scholar 

  8. B. Radunovic and J.-Y. Le Boudec, “A unified framework for max-min and min-max fairness with applications,” IEEE/ACM Trans. Networking 15 (5), 1073–1083 (2007).

    Article  Google Scholar 

  9. D. Nace, L. N. Doan, O. Klopfenstein, et al., “Max-min fairness in multicommodity flows,” Comput. Oper. Res. 35 (2), 557–573 (2008).

    Article  MathSciNet  Google Scholar 

  10. G. Baier, E. Kohler, and M. Skutella, “The k-splittable flow problem,” Algorithmica 42 (3–4), 231–248 (2005).

    Article  MathSciNet  Google Scholar 

  11. O. Kabadurmus and A. E. Smith, “Multicommodity k-splittable survivable network design problems with relays,” Telecommun. Syst. 62 (1), 123–133 (2016).

    Article  Google Scholar 

  12. 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).

    Article  Google Scholar 

  13. R. Ramaswamy, J. B. Orlin, and N. Chakravarti, “Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs,” Math. Prog. 102 (2), 355–369 (2005).

    Article  MathSciNet  Google Scholar 

  14. M. Hajjem, H. Bouziri, and E.-G. Talbi, “A metaheuristic framework for dynamic network flow problems,” in Recent Developments in Metaheuristics. Operations Research (Springer, Cham, 2018), pp. 285–304.

    Google Scholar 

  15. P. Jensen and J. Barnes, Network Flow Programming (Wiley, New York, 1980; Radio i svyaz’, Moscow, 1984).

  16. Th. H. Cormen, Ch. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms (MIT Press, Cambridge, 1990; Vil’yams, Moscow, 2005).

  17. C. Berge, The Theory of Graphs and Its Applications (Methuen, London, 1962; Inostrannaya literatura, Moscow, 1962).

Download references

Author information

Authors and Affiliations

  1. Federal Research Center “Computer Science and Control,” Russian Academy of Sciences, 119333, Moscow, Russia

    Yu. E. Malashenko & I. A. Nazarova

Authors
  1. Yu. E. Malashenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. A. Nazarova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. A. Nazarova.

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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Malashenko, Y.E., Nazarova, I.A. Quantitative Analysis of Flow Distributions in a Multiuser Telecommunication Network. J. Comput. Syst. Sci. Int. 62, 323–334 (2023). https://doi.org/10.1134/S1064230723020132

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230723020132

Search

Navigation