Analysis of critical damage in the communication network. III: Analysis of internode flows

DOI10.1134/S1064230721030102zbMath1483.94005OpenAlexW3195574293MaRDI QIDQ2239212

Yu. E. Malashenko, Irina A. Nazarova

Publication date: 3 November 2021

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

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

zbMATH Keywords

linear programmingcommunication networksmathematical modellingmulticommodity flowdamage assessmentminimal cutmaximal flowcritical damage

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Communication networks in operations research (90B18) Linear programming (90C05) Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Express analysis and aggregated representation of the set of reachable flows for a multicommodity network system
• The bi-objective critical node detection problem
• The critical node detection problem in networks: a survey
• Analysis of critical damage in the communication network. I: Model and computational experiment
• Analysis of critical damage in the communication network. II: Guaranteed functional performance estimates
• Analysis of cluster damages in network systems
• An approach to the analysis of possible structural damages in multicommodity network systems
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• Selected Topics in Critical Element Detection

This page was built for publication: Analysis of critical damage in the communication network. III: Analysis of internode flows