In one aspect of the present invention, a transfer apparatus includes a reception unit configured to receive a packet from a source which distributes data according to a transmission control protocol (TCP); a storage unit configured to store data included in the received packet in a buffer based on a TCP sequence number of the received packet; a TCP transfer unit configured to transfer the received packet to a first sink which requests distribution according to the TCP; and a UDP transfer unit configured to read the data from the buffer and transfer the read data to a second sink which requests distribution according to a user datagram protocol (UDP).

A computing system uses a memory for storing data, one or more clients for generating network traffic and a communication fabric with network switches. The network switches include centralized storage structures, rather than separate input and output storage structures. The network switches store particular metadata corresponding to received packets in a single, centralized collapsing queue where the age of the packets corresponds to a queue entry position. The payload data of the packets are stored in a separate memory, so the relatively large amount of data is not shifted during the lifetime of the packet in the network switch. The network switches select sparse queue entries in the collapsible queue, deallocate the selected queue entries, and shift remaining allocated queue entries toward a first end of the queue with a delay proportional to the radix of the network switches.

Packets are differentiated based on their traffic class. A traffic class is allocated bandwidth for transmission. One or more core or thread can be allocated to process packets of a traffic class for transmission based on allocated bandwidth for that traffic class. If multiple traffic classes are allocated bandwidth, and a traffic class underutilizes allocated bandwidth or a traffic class is allocated insufficient bandwidth, then allocated bandwidth can be adjusted for a future transmission time slot. For example, a higher priority traffic class with excess bandwidth can share the excess bandwidth with a next highest priority traffic class for use to allocate packets for transmission for the same time slot. In the same or another example, bandwidth allocated to a traffic class depends on an extent of insufficient allocation or underutilization of allocated bandwidth such that a traffic class with insufficient allocated bandwidth in one or more prior time slot can be provided more bandwidth in a current time slot and a traffic class with underutilization of allocated bandwidth can be provided with less allocated bandwidth for a current time slot.

According to an example aspect of the disclosed embodiments, there is provided passive routing in a mesh network. One or more media frames from source nodes to target nodes in the mesh network are received. Routing information from a received media frame is derived, said routing information including a source node identifier, a target node identifier, a last node identifier and a frame identifier. The derived routing information is stored into a route ring buffer. A reverse route for the received media frame is determined. The received media frame is prevented from being forwarded in the mesh network, when the route ring buffer includes routing information corresponding to the reverse route.

A network device for a communications network includes a port configured to transmit data to the network at a maximum transmit data rate. The device also includes a transmit buffer configured to buffer data units that are ready for transmission to the network, and a packet buffer configured to buffer data units before the data units are ready for transmission. The packet buffer is configured to output data units at a maximum packet buffer transmission rate faster than the maximum transmit data rate. The device includes a rate controller configured to control a transmission rate of data from the packet buffer to the transmit buffer so that averaged over a period, the transmission rate from the packet buffer to the transmit buffer is at most equal to the maximum transmit data rate, while allowing the transmission rate, at one or more time intervals, to exceed the maximum transmit data rate.

System and method embodiments are disclosed for scalable open radio access network (O-RAN) fronthaul traffic processing for distributed unit and radio unit. The system may be placed in an O-DU or an O-RU as a scalable O-RAN fronthaul traffic processing unit. O-RAN fronthaul traffic processing may be implemented in unified architecture with hardware-software (HW-SW) interaction in the form of Rx/Tx input descriptors and Rx/Tx output status descriptors. In the transmit direction, fronthaul packets are created with eCPRI header from a symbol memory where RB allocations are stored. In the receive path, from an ingress queues of Ethernet, resource block allocations are created and stored in the symbol memory. The discloses HW-SW interaction mechanism may be agnostic to cores of different architectures, support both RU and DU modes, and provides multiple transport encapsulation formats with scalability to meet various fronthaul traffic processing requirements.

In a network system, an application receiving packets can consume one or more packets in two or more stages, where the second and the later stages can selectively consume some but not all of the packets consumed by the preceding stage. Packets are transferred between two consecutive stages, called producer and consumer, via a fixed-size storage. Both the producer and the consumer can access the storage without locking it and, to facilitate selective consumption of the packets by the consumer, the consumer can transition between awake and sleep modes, where the packets are consumed in the awake mode only. The producer may also switch between awake and sleep modes. Lockless access is made possible by controlling the operation of the storage by the producer and the consumer both according to the mode of the consumer, which is communicated via a shared memory location.

The disclosure is directed to a system and method of managing memory resources in a communication channel. According to various embodiments, incoming memory slices associated with a plurality of data sectors are de-interleaved and transferred sequentially through a buffer to a decoder for further processing. To prevent buffer overflow or degraded decoder performance, the memory availability of the buffer is monitored, and transfers are suspended when the memory availability of the buffer is below a threshold buffer availability.

A packet communication apparatus is configured to relay packets transmitted and received between information processing apparatuses. The packet communication apparatus includes: a network interface connectable to a network; a CPU to be a destination of at least one of a plurality of packets to be received through the network interface; a first buffer configured to hold the packets destined to the CPU in order to output the packets to the CPU; a second buffer having a plurality of planes and configured to hold copies of the packets destined to the CPU held in the first buffer in one of the plurality of planes; and a reception history controller configured to store a copy of a packet to a specified plane of the second buffer or to save copies of packets held in the second buffer to another storage area based on usage of the first buffer.

According to an example aspect of the disclosed embodiments, there is provided passive routing in a mesh network. One or more media frames from source nodes to target nodes in the mesh network are received. Routing information from a received media frame is derived, said routing information including a source node identifier, a target node identifier, a last node identifier and a frame identifier. The derived routing information is stored into a route ring buffer. A reverse route for the received media frame is determined. The received media frame is prevented from being forwarded in the mesh network, when the route ring buffer includes routing information corresponding to the reverse route.