Network bandwidth calculation

Question

Computer networks

Good time of the day. It was necessary to solve the problem of constructing an optimal computer network in terms of the throughput of each connection between nodes, while the network topology was predetermined. What literature can be read on this issue?

Answer 1

Your description falls under the question of building communication environments in clusters, respectively, you can read everything related to networks in HPC.

Answer 2

Do you have a graph and need to find something in it? See books on graph algorithms.

Answer 3

Graph theory, traveling salesman problem and other discrete mathematics.

Answer 4

Somehow, the question is somehow strangely posed " to solve the problem of constructing an optimal computer network in terms of the throughput of each connection between nodes, while the network topology is predetermined ". No problem needs to be solved if the topology is known in advance, the maximum throughput between any two points is also known in advance. This bandwidth of the path between two points in the network is equal to the bandwidth of the lowest speed segment of the path between these two points.. It is important to simply be able to find this “bottleneck” in the network using the topology and calculate its bandwidth, and this is quite simple to do - you need to know the performance characteristics of this segment and its load. In real life, it may be more important to simply measure throughput. For this, iperf (a cross-platform utility) is best suited.