Metraipolis › archive › dc_5f21fcae2de6

Bottleneck (network) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Bottleneck_(network)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-23T15:23:27.202Z
SHA-256 of the archived text
de2e2ab923c74f06052995d5f164a7ad9956f07f5cf72a6b0243455076633cf2
Stable URL of this page
https://metraipolis.com/documento/dc_5f21fcae2de6

How to cite

Bottleneck (network) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Bottleneck_(network) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5f21fcae2de6 (Metraipolis archive dc_5f21fcae2de6, sha256 de2e2ab923c74f06052995d5f164a7ad9956f07f5cf72a6b0243455076633cf2)
BibTeX
@misc{dc5f21fcae2de6,
  title = {Bottleneck (network) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Bottleneck_(network)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5f21fcae2de6; sha256 de2e2ab923c74f06052995d5f164a7ad9956f07f5cf72a6b0243455076633cf2},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Bottleneck_(network). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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. Note that this definition is substantially different from a common meaning of a bottleneck. Also note, that this definition does not forbid a single link to be a bottleneck for 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. This concept is critical in understanding network efficiency and fairness, as it ensures that no single flow can monopolize network resources to the detriment of others. Bottleneck links are significant in network design and management because they determine the maximum throughput of a network. Identifying and managing bottlenecks is crucial for maintaining optimal performance in networked systems. Strategies to mitigate the impact of bottleneck links include increasing the capacity of the bottleneck link, optimizing traffic management, and using load-balancing techniques to distribute data flows across multiple paths.

Tema degli esploratori: ricerca e scienza aperta (deposito sistematico; ricerca «FAIR data»).
Fonte: Wikipedia in inglese, voce «Bottleneck (network)» — https://en.wikipedia.org/wiki/Bottleneck_(network)
Wikidata Q18208199 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q18208199
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Bottleneck_(network)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1230586441, consultata il 2026-10-23T15:10:09.049Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 2cf3f766bf88e3451bd4dcb130091b051f8556b35171c747a01c41060eb685a0