Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network

DOI10.1134/S1064230722060132OpenAlexW4311013590MaRDI QIDQ2695089

Yu. E. Malashenko, Irina A. Nazarova

Publication date: 30 March 2023

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230722060132

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\)-splittable flow problem
• A multi-start variable neighborhood search for solving the single path multicommodity flow problem
• Recent developments in metaheuristics
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Fast approximation algorithms for multicommodity flow problems
• Analysis of equal-share and equalized flow distribution at the peak load in the multiuser network
• Fair optimization and networks: a survey
• Max-min fairness in multi-commodity flows
• Optimal Network Design with End-to-End Service Requirements
• A Lexicographic Optimization Framework to the Flow Control Problem
• Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem