About: Fair queuing

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

About: Fair queuing Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Whole100003553, 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%2FFair_queuing&invfp=IFP_OFF&sas=SAME_AS_OFF

Fair queuing is a family of scheduling algorithms used in some process and network schedulers. The algorithm is designed to achieve fairness when a limited resource is shared, for example to prevent flows with large packets or processes that generate small jobs from consuming more throughput or CPU time than other flows or processes. Fair queuing is implemented in some advanced network switches and routers.

Attributes	Values
rdf:type	yago:WikicatComputerNetworks yago:Artifact100021939 yago:ComputerNetwork103085333 yago:Instrumentality103575240 yago:Network103820728 yago:Object100002684 yago:PhysicalEntity100001930 yago:System104377057 yago:Whole100003553
rdfs:label	Fair-Queuing (de) Fair queuing (en)
rdfs:comment	Fair-Queuing (englisch für faires Einreihen) ist ein Netzwerk-Scheduling-Algorithmus. Das primäre Ziel beim Fair-Queuing ist die faire Behandlung der Quellen einer Übertragungskomponente, was dadurch erreicht werden kann, dass auf jeder der Übertragungskomponente jedem Datenfluss (und damit jeder Quelle der Übertragungskomponente) eine eigene Warteschlange zugeordnet wird. Die Pakete der Warteschlangen werden nach dem Round-Robin-Verfahren entnommen und versendet. Auf diese Weise wird jede Quelle der Übertragungskomponente auf den gleichen Teil der Gesamtbandbreite der Ausgangsleitung eingeschränkt. (de) Fair queuing is a family of scheduling algorithms used in some process and network schedulers. The algorithm is designed to achieve fairness when a limited resource is shared, for example to prevent flows with large packets or processes that generate small jobs from consuming more throughput or CPU time than other flows or processes. Fair queuing is implemented in some advanced network switches and routers. (en)
dcterms:subject	Network scheduling algorithms
Wikipage page ID	4024648 (xsd:integer)
Wikipage revision ID	1032464385 (xsd:integer)
Link from a Wikipage to another Wikipage	Router (computing) Scott Shenker Deficit round robin Internet Generalized processor sharing Network switch Local area network Priority queue Srinivasan Keshav Max-min fairness Active queue management Fairness measure Quality of service Round-robin scheduling Network scheduling algorithms Bufferbloat Scheduling algorithm Network scheduler Traffic shaping Weighted round robin FIFO (computing and electronics) Scheduling (computing) Weighted fair queuing Statistical multiplexer Statistical multiplexing Flow (computer networking) Buffer (computer science)
sameAs	Fair queuing Fair queuing Fair queuing Fair queuing Fair queuing
dbp:wikiPageUsesTemplate	dbt:Div_col dbt:Div_col_end dbt:Short_description
has abstract	Fair-Queuing (englisch für faires Einreihen) ist ein Netzwerk-Scheduling-Algorithmus. Das primäre Ziel beim Fair-Queuing ist die faire Behandlung der Quellen einer Übertragungskomponente, was dadurch erreicht werden kann, dass auf jeder der Übertragungskomponente jedem Datenfluss (und damit jeder Quelle der Übertragungskomponente) eine eigene Warteschlange zugeordnet wird. Die Pakete der Warteschlangen werden nach dem Round-Robin-Verfahren entnommen und versendet. Auf diese Weise wird jede Quelle der Übertragungskomponente auf den gleichen Teil der Gesamtbandbreite der Ausgangsleitung eingeschränkt. (de) Fair queuing is a family of scheduling algorithms used in some process and network schedulers. The algorithm is designed to achieve fairness when a limited resource is shared, for example to prevent flows with large packets or processes that generate small jobs from consuming more throughput or CPU time than other flows or processes. Fair queuing is implemented in some advanced network switches and routers. (en)
gold:hypernym	Family
prov:wasDerivedFrom	wikipedia-en:Fair_queuing?oldid=1032464385&ns=0
page length (characters) of wiki page	9835 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Fair_queuing
is Link from a Wikipage to another Wikipage of	Fair Queuing Fair queueing Generalized processor sharing Packet switching Max-min fairness Maximum throughput scheduling Weighted fair queueing Differentiated services Network congestion Radio resource management Round-robin scheduling Tiered Internet service Fair Queueing Fair Queuing (FQ) Fair queue Fair queuing (FQ) Fair scheduling Network throughput Network scheduler Weighted round robin Scheduling (computing)
is Wikipage redirect of	Fair Queuing Fair queueing Fair Queueing Fair Queuing (FQ) Fair queue Fair queuing (FQ) Fair scheduling
is foaf:primaryTopic of	wikipedia-en:Fair_queuing

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