Bisection bandwidth

Under bisection (engl. Bisection ) refers to the division of a given network in two approximately equal parts, the number of cuts to be minimal due to the connection lines. The bisection bandwidth (Engl. Bisection bandwidth ) is the sum of the data rates (commonly known as bandwidth ) of the cut trunks. It represents a measure of the communication through the system. The larger the bisection bandwidth, the lower the probability of blockages in the network for general communication.

example

A network with nodes and connecting lines with a uniform data transmission rate of bits / s is given. ${\displaystyle k}$ ${\displaystyle b}$

• With a ring topology , two cuts are sufficient to divide the network so that the bisection bandwidth is. ${\displaystyle 2b}$
• If every node of the network is connected to every other (which corresponds to the topology of a complete graph ), there are lines between all nodes. That is the aggregated bandwidth . Only the lines between the halves can be counted for the bisection bandwidth - so it is between the halves. ${\displaystyle {\tfrac {k(k-1)}{2}}}$ ${\displaystyle k}$ ${\displaystyle {\tfrac {k(k-1)}{2}}\cdot b}$ ${\displaystyle {\tfrac {k^{2}}{4}}\cdot b}$