---
title: Fair queuing
slug: fair-queuing
qid: 
snapshot: enwiki-001306050346
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1306050346
tags: [23603337, 26220375, 64338919, 7692542]
---

# Fair queuing

> [!note] Provenance
> Snapshot `enwiki-001306050346` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1306050346> · Licensed CC BY-SA 4.0

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.

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.
