bottleneck link

6 examples (0.02 sec)
  • All the sources that are stopped have a bottleneck link.
  • Also note, that this definition does not forbid a single bottleneck link to be shared between multiple flows.
  • 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.
  • Lastly, when the algorithm terminates, all sources have been stopped at some time and thus have a bottleneck link.
  • A bottleneck link for a data flow i is a link that is fully utilized (is saturated) and of all the flows sharing this link, the data flow i achieves overall maximum data rate.
  • 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.