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.

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).

Network packets are pre-processed and stored in network queues based on time sensitivity and other factors. More specifically, a specific application associated with a specific session of the network packets locally at the access point is determined. An ATR is adjusted based on a priority of the application with respect to time sensitivity. Other factors include throughput capability of a wireless device.

The present disclosure provides a regulating scheduler of a relaying node provided at an output port of the relaying node, wherein the scheduler performs scheduling by generating a virtual packet in a queue in which traffic is stored, to allow the queue to be continuously served more than actually incoming traffic and prevent burst from increasing due to an arbitrary queue being served all at once, and the served virtual packet is not outputted to the output port, so that the scheduler has non-working-conserving characteristics.

A network switch capable of supporting cut-though switching and interface channelization with enhanced system performance. The network switch includes a plurality of ingress tiles, each tile including a virtual output queue (VOQ) scheduler operable to submit schedule requests to a fabric scheduler. Data is requested in unit of quantum which may aggregate multiple packets, which reduces schedule latency. Each request is associated with a start-of-quantum (SoR) state or a middle-of-quantum (MoR) state to support cut-through. The fabric scheduler performs a multi-stage scheduling process to progressively narrow the selection of requests, including stages of arbitration in virtual output port level, virtual output port group level, tile level, egress port level and port group level. Each tile receives the grants for its requests and accordingly sends request data to a switch fabric for transmission to the destination egress ports.

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.

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.

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.

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.

System and methods of ingress packet metering include receiving a plurality of flows combined to form an envelope with a specific bandwidth, wherein the envelope is defined such that unused bandwidth from higher rank flows is usable by lower rank flows; admitting packets from the plurality of flows based on committed tokens and excess tokens; determining unused tokens in a time interval; and distributing the unused tokens based on configured weights of the plurality of flows within the envelope. The unused tokens can be provided from a lower rank flow to a higher rank flow. The unused tokens can be determined utilizing Two Rate Three Color Marker (trTCM) metering. The receiving can be at a User-Network Interface (UNI), a Network-Network Interface (NNI), or an External NNI (ENNI) port in a node.