H04L47/527

Queue management method and apparatus

A queue management method and apparatus are disclosed. The queue management method includes: storing a first packet to a first buffer cell included in a first macrocell, where the first macrocell is enqueued to a first entity queue, the first macrocell includes N consecutive buffer cells, and the first buffer cell belongs to the N buffer cells; correcting, based on a packet length of the first packet, an average packet length in the first macrocell that is obtained before the first packet is stored, to obtain a current average packet length in the first macrocell; and generating, based on the first macrocell and the first entity queue, queue information corresponding to the first macrocell of the first macrocell in the first entity queue, a head pointer in the first macrocell, a tail pointer in the first macrocell, and the current average packet length in the first macrocell.

SYSTEMS AND METHODS FOR QUEUE CONTROL BASED ON CLIENT-SPECIFIC PROTOCOLS
20210058337 · 2021-02-25 ·

The present disclosure generally relates to controlling access to resources by selectively processing requests stored in a task queue to prioritize certain requests over others, thereby preventing automated scripts from accessing the resources. More specifically, the present disclosure relates to a normalization and prioritization system for controlling access to resources by queuing resource requests based on a client-defined normalization process that uses one or more data sources.

Logical router comprising disaggregated network elements

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

Multi-pipe bandwidth control in hosted systems
10965613 · 2021-03-30 · ·

Techniques are described that allow each host in a multi-host system to throttle its bandwidth between multiple data nodes without the need to coordinate with the other hosts. Specifically, techniques are described in which a limit is applied to the amount of sent-but-not-acknowledged data a given host may have. If the host has reached the limit, the host must wait for acknowledgements before sending more data. In one embodiment, the limit is enforced using a token-based bandwidth control. Embodiments are described in which the limit on sent-but-not-acknowledged data varies dynamically based on system conditions. Specifically, each host may monitor its aggregate latency, and increase the limit when latency is low (indicating low-congestion conditions), and decrease the limit when latency is high (indicating high-congestion conditions).

METHOD FOR PROVIDING QOS DIFFERENTIATION IN A MULTI-TENANT NETWORK AND NETWORKING DEVICE EMPLOYING METHOD
20210067604 · 2021-03-04 ·

A method for providing a differentiation in terms of quality of service (QoS) for multiple tenants in a network, by a networking device receives a data packet from a transmitting tenant, and the networking device identifies the tenant and a priority class of the received packet. The networking device then determines one or more color markers to apply to the received packet according to the sending tenant and the priority to be associated with the packet. The networking device then transmits or does not transmit the packet onwards depending on one or more color markers applied to the packet.

BANDWIDTH ADJUSTMENT METHOD AND APPARATUS, ELECTRONIC DEVICE, AND COMPUTER-READABLE STORAGE MEDIUM

Embodiments of the present application provide a method and apparatus for bandwidth adjustment, an electronic device and a computer-readable storage medium. The method comprise obtaining an overload node; determining whether an overload bandwidth of the overload node is greater than a total available bandwidth amount of all target nodes for the overload node; if not, determining the overload node as a to-be-adjusted node and determining a to-be-adjusted bandwidth amount of the to-be-adjusted node based on the overloaded bandwidth of the overload node; decreasing a total carrying bandwidth amount of the to-be-adjusted node by the to-be-adjusted bandwidth amount corresponding to the to-be-adjusted node, and increasing a total target carrying bandwidth amount of the to-be-adjusted node by the to-be-adjusted bandwidth amount corresponding to the to-be-adjusted node. By applying the method provided by the embodiments of the present application, the bandwidth can be adjusted more accurately.

Logical Router Comprising Disaggregated Network Elements

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

Logical router comprising disaggregated network elements

A logical router includes disaggregated network elements that function as a single router and that are not coupled to a common backplane. The logical router includes spine elements and leaf elements implementing a network fabric with front panel ports being defined by leaf elements. Control plane elements program the spine units and leaf to function a logical router. The control plane may define operating system interfaces mapped to front panel ports of the leaf elements and referenced by tags associated with packets traversing the logical router. Redundancy and checkpoints may be implemented for a route database implemented by the control plane elements. The logical router may include a standalone fabric and may implement label tables that are used to label packets according to egress port and path through the fabric.

ALLOCATING BANDWIDTH BETWEEN BANDWIDTH ZONES ACCORDING TO USER LOAD
20210006501 · 2021-01-07 ·

A bandwidth management system includes a plurality of queues respectively corresponding to a plurality of zones. An enqueuing module receives network traffic from one or more incoming network interfaces, determines a belonging zone to which the network traffic belongs, and enqueues the network traffic on a queue corresponding to the belonging zone. A dequeuing module selectively dequeues data from the queues and passes the data to one or more outgoing network interfaces. When dequeuing data from the queues the dequeuing module dequeues an amount of data from a selected queue, and the amount of data dequeued from the selected queue is determined according to user load of a zone to which the selected queue corresponds.

Selective token clash checking for a data write

A first request may be received to write a first set of data to a first storage device of a first storage node. The first storage device may be capable of transferring or receiving data directly to or from a second storage device without transferring the data to or from a host device mapped to the first storage node. It may be determined that a first token clash check does not need to occur for the first request. The first token clash check may include determining whether the first request is requesting to write to one or more addresses that are associated with one or more tokens owned by one or more transactions. The one or more tokens may be a proxy for a set of data within one or more particular address ranges of the first storage device.