Systems and methods for controlling congestion of a data network are provided. An engine round-trip time (RTT) and a fabric RTT for a network flow are determined. An engine-based congestion window size for the flow is determined based on the engine RTT and a target engine RTT. A fabric-based congestion window size for the flow is determined based on the fabric RTT and a target fabric RTT. The smaller of the engine-based congestion window size and the fabric-based window size is selected for use in transmitting a future packet associated with the flow. The target engine RTT is determined based in part on the current congestion window used to transmit packets for the flow and/or the target fabric RTT is determined based on a number of hops packets associated with the flow traverse from a source to a destination associated with the flow.

Systems and methods for packet or frame replication and elimination in a Time Sensitive Networking (TSN) network or Deterministic Networking (DetNet) network are disclosed. In some embodiments, a method of operation of a node in a TSN network or DetNet network comprises determining whether to reset a sequence recovery function used for frame or packet elimination for a particular stream of packets based on either or both of an explicit indication or an implicit indication and resetting the sequence recovery function used for frame or packet elimination for the particular stream of packets upon determining to reset the sequence recovery function. In this manner, packet or frame elimination is improved by avoiding scenarios that result in discarding valid packets or frames due to an out of sync condition between the sequence generation function at the replicator and the sequence recovery function at the eliminator.

An edge server receives a first request message for transmission to the host device. The edge server determines a first congestion control algorithm based on the first request message, including characteristics of the first request message. The edge server applies the first congestion control algorithm to the transport connection for application to the transmission of the first request message. Subsequently, the edge server receives a second request message for transmission to the host device over the transport connection. Based on the second request message, including characteristics of the second request message, the edge server determines and applies a second congestion control algorithm to the transport connection for application to the transmission of the second request message, wherein the second congestion control algorithm is different from the first congestion control algorithm

An edge server receives a first request message for transmission to the host device. The edge server determines a first congestion control algorithm based on the first request message, including characteristics of the first request message. The edge server applies the first congestion control algorithm to the transport connection for application to the transmission of the first request message. Subsequently, the edge server receives a second request message for transmission to the host device over the transport connection. Based on the second request message, including characteristics of the second request message, the edge server determines and applies a second congestion control algorithm to the transport connection for application to the transmission of the second request message, wherein the second congestion control algorithm is different from the first congestion control algorithm

An apparatus for detecting a target file includes an inverse indexing database unit configured to generate at least one file chunk by performing a chunking operation on a target file, and inversely index each of the at least one file chunk as a target file code, a network packet receiving unit configured to receive a network packet, a packet chunk processing unit configured to generate at least one packet chunk by performing a chunking operation on a network packet, a chunk query unit configured to generate a packet chunk query word for each of the at least one packet chunk and provide the packet chunk query word to the inverse indexing database unit to receive the detection target file code, and a file code determining unit configured to determine a most likely detection target file code in the network packet based on the received detection target file code.

An information processing apparatus including: a memory; and a processor coupled to the memory, the processor being configured to perform processing including: executing a buffer management processing that, under flow control over communication executed by an arithmetic processing device, sequentially obtains a plurality of packets transmitted and destined for the arithmetic processing device, stores the packets in a buffer, generates one aggregated packet by aggregating the packets, and transmits the aggregated packet to the arithmetic processing device; executing an ACK management processing that decides transmission timing for ACKs to a transmission source of the packets based on a flow rate for the aggregated packet; and executing a window management processing that decides a receive window size representing a data amount to be transmitted by one flow to the arithmetic processing device based on the flow rate for the aggregated packet.

An information processing apparatus including: a memory; and a processor coupled to the memory, the processor being configured to perform processing including: executing a buffer management processing that, under flow control over communication executed by an arithmetic processing device, sequentially obtains a plurality of packets transmitted and destined for the arithmetic processing device, stores the packets in a buffer, generates one aggregated packet by aggregating the packets, and transmits the aggregated packet to the arithmetic processing device; executing an ACK management processing that decides transmission timing for ACKs to a transmission source of the packets based on a flow rate for the aggregated packet; and executing a window management processing that decides a receive window size representing a data amount to be transmitted by one flow to the arithmetic processing device based on the flow rate for the aggregated packet.

The disclosure provides a method of Channel Quality Assisted (CQA) transport by a Transmission Control Protocol (TCP) receiver in a wireless network. The method includes: monitoring quality of a wireless channel based on at least one of signal quality parameters and wireless channel events; detecting a fluctuation in the quality of the wireless channel; and sending an indication of the fluctuation in the quality of the wireless channel to a TCP transmitter configured to adjust at least one parameter of a transport layer based on the fluctuation in the quality of the wireless channel.

Methods, apparatus and software for implementing enhanced data center congestion management for non-TCP traffic. Non-congested transmit latencies are determined for transmission of packets or Ethernet frames along paths between source and destination end-end-nodes when congestion along the paths is not present or minimal. Transmit latencies are similarly measured along the same source-destination paths during ongoing operations during which traffic congestion may vary. Based on whether a difference between the transmit latency for a packet or frame and the non-congested transmit latency for the path exceeds a threshold, the path is marked as congested or not congested. A rate at which the non-TCP packets are transmitted along the path is then managed as function of a rate at which the path is marked as congested. In one implementation, non-TCP traffic is managed by mimicking a Data Center TCP technique, under which the congestion marking status of the path is substituted as an input to a DCTP algorithm in place of the normally-used ECN-Echo flag input. The congestion window output by the DCTCP algorithm is then used to manage the rate at which non-TCP packets to be forwarded via the path are transmitted from a source end-node.

Methods, apparatus and software for implementing enhanced data center congestion management for non-TCP traffic. Non-congested transmit latencies are determined for transmission of packets or Ethernet frames along paths between source and destination end-end-nodes when congestion along the paths is not present or minimal. Transmit latencies are similarly measured along the same source-destination paths during ongoing operations during which traffic congestion may vary. Based on whether a difference between the transmit latency for a packet or frame and the non-congested transmit latency for the path exceeds a threshold, the path is marked as congested or not congested. A rate at which the non-TCP packets are transmitted along the path is then managed as function of a rate at which the path is marked as congested. In one implementation, non-TCP traffic is managed by mimicking a Data Center TCP technique, under which the congestion marking status of the path is substituted as an input to a DCTP algorithm in place of the normally-used ECN-Echo flag input. The congestion window output by the DCTCP algorithm is then used to manage the rate at which non-TCP packets to be forwarded via the path are transmitted from a source end-node.