A method performed by a first node is disclosed herein. The method is for handling data traffic. The first node operates in a communications network. The first node receives an indication from a second node operating in the network. The indication indicates, for a packet forwarding control protocol (PFCP) session, at least one of: i) a first rule for packet detection; and ii) a second rule of enforcement of quality of service. The first node initiates a process of optimization, based on reinforcement learning, of a procedure to control data traffic in the network. The process of optimization is further based on the received indication. A method performed by the second node is also described. The second node receives a first indication from the first node indicating that the first node supports the process of optimization. The second node then sends the indication to the first node.

A method performed by a first node is disclosed herein. The method is for handling data traffic. The first node operates in a communications network. The first node receives an indication from a second node operating in the network. The indication indicates, for a packet forwarding control protocol (PFCP) session, at least one of: i) a first rule for packet detection; and ii) a second rule of enforcement of quality of service. The first node initiates a process of optimization, based on reinforcement learning, of a procedure to control data traffic in the network. The process of optimization is further based on the received indication. A method performed by the second node is also described. The second node receives a first indication from the first node indicating that the first node supports the process of optimization. The second node then sends the indication to the first node.

In a communication system having multiple nodes communicably connected via a ring network, at least two of the nodes each includes: a packet distributor that receives an ordinary packet and an interrupt packet from another node and distributes the received packets; and an output switching unit that outputs the ordinary packet and the interrupt packet that are not addressed to the own node such that the interrupt packet is output more preferentially than the ordinary packet. When the output switching unit receives the interrupt packet while outputting the ordinary packet, the output switching unit outputs the interrupt packet by embedding it into the ordinary packet that is being output at a position between the header and trailer of the ordinary packet. When the ordinary packet transmitted from the other node contains an interrupt packet embedded therein, the packet distributor extracts the interrupt packet and distributes the extracted interrupt packet.

Systems and methods for mapping a time-based data acquisition (DAQ) to an isochronous data transfer channel of a network. A buffer associated with the isochronous data transfer channel of the network may be configured. A clock and a local buffer may be configured. A functional unit may be configured to initiate continuous performance of the time-based DAQ, transfer data to the local buffer, initiate transfer of the data between the local buffer and the buffer at a configured start time, and repeat the transferring and initiating transfer in an iterative manner, thereby transferring data between the local buffer and the buffer. The buffer may be configured to communicate data over the isochronous data transfer channel of the network, thereby mapping the time-based DAQ to the isochronous data transfer channel of the network.

A method for data packet delay management in a communications network connecting a sender node over an eCPRI interface to a receive node. The method performed at the receiver node receiving data packets from the sender node comprises monitoring (102) a buffer level at a buffer receiving data from the sender node. When the buffer level reaches a threshold (104-Yes) the method further comprises transmitting (108) to the sender node over the eCPRI interface at least one message comprising information indicative of length of time of a Medium Access Control, MAC, flow control and transmitting (114) at least one MAC flow control frame to the sender node with a delay (110,112).

A network adapter includes a network interface, a host interface and processing circuitry. The network interface is configured to connect to a communication network. The host interface is configured to communicate with a host processor running multiple application programs. The processing circuitry includes one or more bandwidth-control policers, and is configured to receive from the communication network a packet destined to a given application program among the application programs running on the host processor, to associate a bandwidth-control policer with the packet, selected from among the bandwidth-control policers, and to apply the selected bandwidth-control policer to the packet to produce a policer result.

Systems and methods are provided for managing a data communication within a multi-level network having a plurality of switches organized as groups, with each group coupled to all other groups via global links, including: at each switch within the network, maintaining a global fault table identifying the links which lead only to faulty global paths, and when the data communication is received at a port of a switch, determine a destination for the data communication and, route the communication across the network using the global fault table to avoid selecting a port within the switch that would result in the communication arriving at a point in the network where its only path forward is across a global link that is faulty; wherein the global fault table is used for both a global minimal routing methodology and a global non-minimal routing methodology.

In various embodiments, a flexible queue application allocates messages stored in priority queues to clients. In operation, the flexible queue application receives, from a client, a request to allocate a message from a priority queue. At least a first message and a second message are stored in the priority queue, and the priority of the first message is higher than the priority of the second message. The flexible queue application determines that the first message is pending but does not satisfy an allocation constraint. The flexible queue allocation then determines that the second message is pending and satisfies the allocation constraint. The flexible queue application allocates the second message to the client. Advantageously, because the flexible queue application can adapt the priority-based ordering of priority queues based on allocation constraints, the flexible queue application can efficiently enforce resource-related constraints when allocating messages from priority queues.

In various embodiments, a flexible queue application allocates messages stored in priority queues to clients. In operation, the flexible queue application receives, from a client, a request to allocate a message from a priority queue. At least a first message and a second message are stored in the priority queue, and the priority of the first message is higher than the priority of the second message. The flexible queue application determines that the first message is pending but does not satisfy an allocation constraint. The flexible queue allocation then determines that the second message is pending and satisfies the allocation constraint. The flexible queue application allocates the second message to the client. Advantageously, because the flexible queue application can adapt the priority-based ordering of priority queues based on allocation constraints, the flexible queue application can efficiently enforce resource-related constraints when allocating messages from priority queues.

Technology for a user equipment (UE), operable to generate an enhanced buffer status report (eBSR) is disclosed. The UE can identify packets for uplink transmission. The UE can filter the packets for transmission, to identify a number of small packets pending for transmission and a number of larger packets, relative to the small packets, that are pending for transmission in the uplink transmission. The UE can encode the eBSR for transmission to a next generation node B (gNB), wherein the eBSR includes information identifying the number of small packets pending for transmission. The UE can have a memory interface configured to send to a memory the number of small packets pending for transmission.