ALTQ

---

title: "ALTQ" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["network-performance", "network-scheduling-algorithms", "quality-of-service", "free-software-programmed-in-c", "operating-system-technology", "i/o-scheduling", "bsd-software", "freebsd", "netbsd", "dragonfly-bsd"] description: "Network scheduler for Berkeley Software Distribution" topic_path: "technology/algorithms" source: "https://en.wikipedia.org/wiki/ALTQ" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

::summary Network scheduler for Berkeley Software Distribution ::

|type=notice |text= The content on this page originally appeared in the FreeBSD man pages for ALTQ and ****, and from the original ALTQ webpage. ALTQ (ALTernate Queueing) is the network scheduler for Berkeley Software Distribution. ALTQ provides queueing disciplines, and other components related to quality of service (QoS), required to realize resource sharing. It is most commonly implemented on BSD-based routers. ALTQ is included in the base distribution of FreeBSD, NetBSD, and DragonFly BSD, and was integrated into the pf packet filter of OpenBSD but later replaced by a new queueing subsystem (it was deprecated with OpenBSD 5.5 release, and completely removed with 5.6 in 2014).

With ALTQ, packets can be assigned to queues for the purpose of bandwidth control. The scheduler defines the algorithm used to decide which packets get delayed, dropped or sent out immediately. There are five schedulers currently supported in the FreeBSD implementation of ALTQ:

• cbq — Class-based Queueing. Queues attached to an interface build a tree, thus each queue can have further child queues. Each queue can have a priority and a bandwidth assigned. Priority mainly controls the time packets take to get sent out, while bandwidth has primarily effects on throughput.
• CoDel — Controlled Delay. Attempts to combat bufferbloat.
• fairq — Fair Queuing. Attempts to fairly distribute bandwidth among all connections.
• hfsc — Hierarchical Fair Service Curve. Queues attached to an interface build a tree, thus each queue can have further child queues. Each queue can have a priority and a bandwidth assigned. Priority mainly controls the time packets take to get sent out, while bandwidth has primarily effects on throughput.
• PRIQ — Priority Queueing. Queues are flat attached to the interface, thus, queues cannot have further child queues. Each queue has a unique priority assigned, ranging from 0 to 15. Packets in the queue with the highest priority are processed first.

References

References

1. (2014-04-19). "ALTQ removed from -current".

::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::