Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Max-min_fairness> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- Max-min_fairness 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 packet-switched 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.".
- Max-min_fairness wikiPageExternalLink minmax-fairsh.html.
- Max-min_fairness wikiPageID "6593914".
- Max-min_fairness wikiPageRevisionID "560504487".
- Max-min_fairness hasPhotoCollection Max-min_fairness.
- Max-min_fairness subject Category:Routing_algorithms.
- Max-min_fairness subject Category:Scheduling_algorithms.
- Max-min_fairness type Abstraction100002137.
- Max-min_fairness type Act100030358.
- Max-min_fairness type Activity100407535.
- Max-min_fairness type Algorithm105847438.
- Max-min_fairness type Event100029378.
- Max-min_fairness type Procedure101023820.
- Max-min_fairness type PsychologicalFeature100023100.
- Max-min_fairness type RoutingAlgorithms.
- Max-min_fairness type Rule105846932.
- Max-min_fairness type SchedulingAlgorithms.
- Max-min_fairness type YagoPermanentlyLocatedEntity.
- Max-min_fairness 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. In best-effort statistical multiplexing, a first-come first-served (FCFS) scheduling policy is often used.".
- Max-min_fairness label "Max-min fairness".
- Max-min_fairness sameAs m.0gd0hl.
- Max-min_fairness sameAs Q17097315.
- Max-min_fairness sameAs Q17097315.
- Max-min_fairness sameAs Max-min_fairness.
- Max-min_fairness wasDerivedFrom Max-min_fairness?oldid=560504487.
- Max-min_fairness isPrimaryTopicOf Max-min_fairness.