Class-based queueing: Difference between revisions

Revision as of 15:02, 10 November 2023

Latest revision as of 02:42, 12 January 2025

(4 intermediate revisions by 3 users not shown)

Line 1:

[[ fa : صف بندی بر اساس کلاس]]

{{Short description|Scheduling algorithm for network data flows}}

{{More citations needed|date=March 2024}}

'''Class-based queuing''' ('''CBQ''') is a [[queuing discipline]] for the [[network scheduler]] that allows traffic to share [[Bandwidth (computing)|bandwidth]] equally, after being grouped by classes. The classes can be based upon a variety of parameters, such as priority, interface, or originating program.

Line 10 ⟶ 12:

Because it operates at the [[Internet Protocol|IP]] network layer, CBQ provides the same benefits across any [[Data link layer|Layer 2]] technology and is equally effective with any IP protocol, such as [[Transmission Control Protocol]] (TCP) and [[User Datagram Protocol]] (UDP). It also operates with any client or server TCP/IP stack variation, since it takes advantage of standard TCP/IP flow control mechanisms to control end-to-end traffic.

An implementation is available under the [[GNU General Public License]] for the [[Linux kernel]].<ref>{{cite web |url=https://git.kernel.org/cgit/linux/kernel/git/stable/linux-stable.git/tree/net/sched/sch_cbq.c |archive-url=https://archive.today/20130907180916/https://git.kernel.org/cgit/linux/kernel/git/stable/linux-stable.git/tree/net/sched/sch_cbq.c |url-status=dead |archive-date=September 7, 2013 |title=CBQ Linux kernel network scheduler module |publisher=[[kernel.org]] |accessdate=2013-09-07 }}{{Dead link|date=October 2023 |bot=InternetArchiveBot |fix-attempted=yes }}</ref>

==References==

Line 16 ⟶ 18:

{{DEFAULTSORT:Class-Based Queuing}}

[[Category:Computer networkingnetworks engineering]]

[[Category:Network scheduling algorithms]]