Class-based queuing (CBQ) is a queuing discipline for the network scheduler that allows traffic to share 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.

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 queuing schemes are limited to a small number of classes and only allow one-dimensional classification.

Because it operates at the IP network layer, CBQ provides the same benefits across any 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.[1]

References

edit
  1. ^ "CBQ Linux kernel network scheduler module". kernel.org. Retrieved 2013-09-07.{{cite web}}: CS1 maint: deprecated archival service (link)


Stub icon

This computer networking article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Network scheduler

A network scheduler, also called packet scheduler, queueing discipline (qdisc) or queueing algorithm, is an arbiter on a node in a packet switching communication

Token bucket

hierarchical token bucket (HTB) is a faster replacement for the class-based queueing (CBQ) queuing discipline in Linux. It is useful for limiting each client's

Queueing theory

Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted

Low-latency queuing

Low-latency queuing (LLQ) is a network scheduling feature developed by Cisco to bring strict priority queuing (PQ) to class-based weighted fair queuing (CBWFQ)

ALTQ

ALTQ (ALTernate Queueing) is the network scheduler for Berkeley Software Distribution. ALTQ provides queueing disciplines, and other components related

Queue (abstract data type)

languages as classes. A queue may be implemented as circular buffers and linked lists, or by using both the stack pointer and the base pointer. Queues provide

Weighted random early detection

queueing discipline for a network scheduler suited for congestion avoidance. It is an extension to random early detection (RED) where a single queue may

CBQ

(reporting mark CBQ), was a Class I railroad that operated in the Midwestern United States Class based queueing, a queueing discipline for the network