Class-based queueing: Difference between revisions

Revision as of 21:13, 9 October 2009

Latest revision as of 02:42, 12 January 2025

(25 intermediate revisions by 18 users not shown)

Line 1:

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

'''Class-based queueing''' (CBQ''') is a network [[router]] queueing method 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.

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

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

'''Class-based queueingqueuing''' ('''CBQ''') is a network [[routerqueuing discipline]] queueingfor methodthe [[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.

CBQ is a traffic management algorithm developed by the Network Research Group at Lawrence Berkeley National Laboratory as an alternative to traditional router-based technology. Now in the public ___domain as an open technology, CBQ is deployed by companies at the boundary of their WANs.

Line 5 ⟶ 8:

CBQ divides user traffic into a hierarchy of classes based on any combination of IP addresses, protocols and application types. A company's accounting department, for example, may not need the same Internet access privileges as the engineering department. Because every company is organized differently and has different policies and business requirements, it is vital for traffic management technology to provide flexibility and granularity in classifying traffic flows.

CBQ lets network managers classify traffic in a multilevel hierarchy. For instance, some companies may first identify the overall needs of each department or business group, and then define the requirements of each application or group of applications within each department. For performance and architectural reasons, traditional router-based queueingqueuing schemes are limited to a small number of classes and only allow one-dimensional classification.

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 }}</ref>

{{compu-network-stub}}

==References==

[[Category:Articles lacking sources (Erik9bot)]]

{{Reflist}}

[[pl{{DEFAULTSORT:Class -Based Queueing]]Queuing}}

[[Category:Computer networks engineering]]

[[Category:Network scheduling algorithms]]

{{compuCompu-network-stub}}