About: Max-min fairness

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Max-min fairness Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Rule105846932, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FMax-min_fairness&invfp=IFP_OFF&sas=SAME_AS_OFF

In communication networks, multiplexing and the division of scarce resources, max-min fairness is said to be achieved by an allocation if and only if the allocation is feasible and an attempt to increase the allocation of any participant necessarily results in the decrease in the allocation of some other participant with an equal or smaller allocation.

Attributes	Values
rdf:type	yago:WikicatRoutingAlgorithms yago:WikicatSchedulingAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label	Max-min fairness (en)
rdfs:comment	In communication networks, multiplexing and the division of scarce resources, max-min fairness is said to be achieved by an allocation if and only if the allocation is feasible and an attempt to increase the allocation of any participant necessarily results in the decrease in the allocation of some other participant with an equal or smaller allocation. (en)
dcterms:subject	Routing algorithms Network scheduling algorithms Fairness criteria
Wikipage page ID	6593914 (xsd:integer)
Wikipage revision ID	1079007603 (xsd:integer)
Link from a Wikipage to another Wikipage	Proportionally fair Egalitarian social choice rule Bottleneck (network) Load balancing (computing) Routing algorithms Fair queuing Fairness measure Network congestion Round-robin scheduling First-come first-served Network scheduling algorithms Fairness criteria Data flow Maximum throughput resource management Multiplexing Traffic shaping Scheduling (computing) Resource starvation Statistical multiplexing System spectral efficiency Best-effort Communication network
Link from a Wikipage to an external page	http://www.ece.rutgers.edu/~marsic/Teaching/CCN/minmax-fairsh.html
sameAs	Max-min fairness Max-min fairness Max-min fairness Max-min fairness
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Short_description dbt:Elucidate
has abstract	In communication networks, multiplexing and the division of scarce resources, max-min fairness is said to be achieved by an allocation if and only if the allocation is feasible and an attempt to increase the allocation of any participant necessarily results in the decrease in the allocation of some other participant with an equal or smaller allocation. In best-effort statistical multiplexing, a first-come first-served (FCFS) scheduling policy is often used. The advantage with max-min fairness over FCFS is that it results in traffic shaping, meaning that an ill-behaved flow, consisting of large data packets or bursts of many packets, will only punish itself and not other flows. Network congestion is consequently to some extent avoided. Fair queuing is an example of a max-min fair packet scheduling algorithm for statistical multiplexing and best-effort networks, since it gives scheduling priority to users that have achieved lowest data rate since they became active. In case of equally sized data packets, round-robin scheduling is max-min fair. (en)
prov:wasDerivedFrom	wikipedia-en:Max-min_fairness?oldid=1079007603&ns=0
page length (characters) of wiki page	6651 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Max-min_fairness
is Link from a Wikipage to another Wikipage of	Enhanced Transmission Selection Bottleneck (engineering) Bottleneck (network) Credit-based fair queuing Maximum throughput scheduling Weighted fair queueing Fair queuing Fairness measure Network congestion Round-robin scheduling Max-min fair Max-min fair scheduling TCP congestion control
is Wikipage redirect of	Max-min fair Max-min fair scheduling
is foaf:primaryTopic of	wikipedia-en:Max-min_fairness

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software