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.
| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:label
| - Class-based queueing (en)
- Class Based Queueing (pl)
- 基於分類的隊列 (zh)
|
| rdfs:comment
| - Class Based Queueing, CBQ – algorytm kolejkowania pakietów oparty na klasach kolejek. Umożliwia wydzielanie pasma dla komputerów w sieci lokalnej, tak aby każda ustalona klasa pakietów miała zagwarantowaną szerokość pasma. (pl)
- 基于分类的队列 （英語：Class-based queueing）是一种用于的队列技术。它允许流量在被按类分组后均衡分享带宽。分类可以基于不同的参数，比如优先级，接口或者发起通讯的应用程序（端口） 。 CBQ 是一种由位于的开发的算法。它可以作为传统基于路由的队列技术的替代品。现在CBQ是一种开放技术，属于公有领域。CBQ经常被公司部署于他们的WAN边界。 CBQ将用户流量分入不同的，由类组成的层级。这些类基于IP地址，协议和应用程序类型的不同组合进行划分。一个公司的会计部门，举例来说，可能不需要与工程部门相同的互联网访问权限。因为每个公司的组织结构均不同，并且有着不同的政策和商业需求，因此流量管理技术在分类流量的时候需要提供足够的灵活性和力度控制。 CBQ 允许网络管理者划分流量到多层级的树形结构中。举例来说，有一些公司可能先识别每个部门的总体需求，然后定义在这个部门中每一个或一组应用程序的需求。为了性能和架构需要，传统的基于路由的队列定义被限制在较少数量的分类中，且只能进行一维分类。 由于CBQ运作在网络层，它可以在任何数据链路层技术上提供和IP协议，如TCP和UDP相同的效果。它也可以不受客户端或服务器端TCP/IP协议栈实现的不同的影响，因为它基于标准的TCP/IP流控制机制进行端到端流量控制。 CBQ的一个典型实现是在GPL协议下发布的Linux内核 (zh)
- 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. (en)
|
| dcterms:subject
| |
| Wikipage page ID
| |
| Wikipage revision ID
| |
| Link from a Wikipage to another Wikipage
| |
| sameAs
| |
| dbp:wikiPageUsesTemplate
| |
| has abstract
| - 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. (en)
- Class Based Queueing, CBQ – algorytm kolejkowania pakietów oparty na klasach kolejek. Umożliwia wydzielanie pasma dla komputerów w sieci lokalnej, tak aby każda ustalona klasa pakietów miała zagwarantowaną szerokość pasma. (pl)
- 基于分类的队列 （英語：Class-based queueing）是一种用于的队列技术。它允许流量在被按类分组后均衡分享带宽。分类可以基于不同的参数，比如优先级，接口或者发起通讯的应用程序（端口） 。 CBQ 是一种由位于的开发的算法。它可以作为传统基于路由的队列技术的替代品。现在CBQ是一种开放技术，属于公有领域。CBQ经常被公司部署于他们的WAN边界。 CBQ将用户流量分入不同的，由类组成的层级。这些类基于IP地址，协议和应用程序类型的不同组合进行划分。一个公司的会计部门，举例来说，可能不需要与工程部门相同的互联网访问权限。因为每个公司的组织结构均不同，并且有着不同的政策和商业需求，因此流量管理技术在分类流量的时候需要提供足够的灵活性和力度控制。 CBQ 允许网络管理者划分流量到多层级的树形结构中。举例来说，有一些公司可能先识别每个部门的总体需求，然后定义在这个部门中每一个或一组应用程序的需求。为了性能和架构需要，传统的基于路由的队列定义被限制在较少数量的分类中，且只能进行一维分类。 由于CBQ运作在网络层，它可以在任何数据链路层技术上提供和IP协议，如TCP和UDP相同的效果。它也可以不受客户端或服务器端TCP/IP协议栈实现的不同的影响，因为它基于标准的TCP/IP流控制机制进行端到端流量控制。 CBQ的一个典型实现是在GPL协议下发布的Linux内核 (zh)
|
| gold:hypernym
| |
| prov:wasDerivedFrom
| |
| page length (characters) of wiki page
| |
| foaf:isPrimaryTopicOf
| |
| is Link from a Wikipage to another Wikipage
of | |
| is Wikipage redirect
of | |
| is foaf:primaryTopic
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)