In: Computer Science
what is the concept of bottleneck link?
In a communication network, sometimes a max-min fairness of the network is desired, usually opposed to the basic first-come first-served policy. With max-min fairness, data flow between any two nodes is maximized, but only at the cost of more or equally expensive data flows. To put it another way, in case of network congestion any data flow is only impacted by smaller or equal flows.
In such context, a bottleneck link for a given data flow is a link that is fully utilized (is saturated) and of all the flows sharing this link, the given data flow achieves maximum data rate network-wide.
A data rate allocation is max-min fair if and only if a data flow between any two nodes has at least one bottleneck link.
Example of a bottleneck link. change of the link state and the new capacity of the link. We investigate the performance and stability of the diffusion type flow control model through observations of the total throughput of the network. Although the diffusion-type flow control mechanism described in the previous sections achieves both desirable performance and stability, those results are obtained from simulations using the simple, symmetric, and homogeneous network model. The network models used in have just one bottleneck link and the lengths of all links are the same. In this section, we investigate the effectiveness of the diffusion-type flow control mechanism through simulation using two different types of network model, which are more complicated than the model used in. The first set of models include two bottleneck links and the second set of models include links which differ in length (in other words, different propagation delays).
Hope this may help you.
Thank you ??