About: Bottleneck (network)

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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. 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.

Property Value
dbo:abstract
  • 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. (en)
dbo:wikiPageID
  • 9502948 (xsd:integer)
dbo:wikiPageLength
  • 1331 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 627853928 (xsd:integer)
dbo:wikiPageWikiLink
dbp:date
  • September 2014 (en)
dbp:reason
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • 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. 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. (en)
rdfs:label
  • Bottleneck (network) (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License