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.

A system and method are provided for a bandwidth manager for packetized data designed to arbitrate access between multiple, high bandwidth, ingress channels (sources) to one, lower bandwidth, egress channel (sink). The system calculates which source to grant access to the sink on a word-to-word basis and intentionally corrupts/cuts packets if a source ever loses priority while sending. Each source is associated with a ranking that is recalculated every data word. When a source buffer sends enough words to have its absolute rank value increase above that of another source buffer waiting to send, the system “cuts” the current packet by forcing the sending buffer to stop mid-packet and selects a new, lower ranked, source buffer to send. When there are multiple requesting source buffers with the same rank, the system employs a weighted priority randomized scheduler for buffer selection.

A device allocates buffer space for storing data received from another device. The other device has a credit balance corresponding to the amount of buffer space. A sending device reduces its number of credits by a cost of a packet and sends the packet. To ensure that the buffer does not overflow, the sending device spends a credit for each entry in the buffer that could be consumed by the sent data packet. When received data is added to the buffer without consuming a new entry, a response packet that returns a credit is sent to the sending device before the data is read from the buffer. Thus, the sending device is enabled to continue sending data without waiting for the buffer to be read, enabling the communication between the two devices to make more efficient use of the buffer.

Provided is a packet transfer apparatus configured to per form packet exchange processing for exchanging multiple continuous packets with low delay while maintaining fairness between communication flows of the same priority level. A packet transfer apparatus 100 includes: a packet classification unit 120; queues 130 that holds the classified packets for each classification; and a dequeue processing unit 140 that extracts packets from the queues 130. The dequeue processing unit 140 includes a scheduling unit 141 that controls the packet extraction amount extracted from the queue 130 for a specific communication flow based on information on the amount of data that is requested by the communication flow and is to be continuously transmitted in packets.

Systems, methods, and computer-readable media are disclosed for an apparatus coupled to a communication bus, where the apparatus includes a queue and a controller to manage operations of the queue. The queue includes a first space to store a first information for a first traffic type, with a first flow class, and for a first virtual channel of communication between a first communicating entity and a second communicating entity. The queue further includes a second space to store a second information for a second traffic type, with a second flow class, and for a second virtual channel of communication between a third communicating entity and a fourth communicating entity. The first traffic type is different from the second traffic type, the first flow class is different from the second flow class, or the first virtual channel is different from the second virtual channel. Other embodiments may be described and/or claimed.

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.

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.

A system and method are provided for a bandwidth manager for packetized data designed to arbitrate access between multiple, high bandwidth, ingress channels (sources) to one, lower bandwidth, egress channel (sink). The system calculates which source to grant access to the sink on a word-to-word basis and intentionally corrupts/cuts packets if a source ever loses priority while sending. Each source is associated with a ranking that is recalculated every data word. When a source buffer sends enough words to have its absolute rank value increase above that of another source buffer waiting to send, the system “cuts” the current packet by forcing the sending buffer to stop mid-packet and selects a new, lower ranked, source buffer to send. When there are multiple requesting source buffers with the same rank, the system employs a weighted priority randomized scheduler for buffer selection.

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.

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.