A kind of transmission method based on the learnable power model, which conducts periodic record for the historical change trend of the network. This method conducts weighting smooth processing on the round trip time and judges the changing trend of congestion control window. Then, it establishes model for the relationship between network power and the congestion control widow. When a new ACK is received, it immediately updates the window of power model. Finally, it forecasts the size of the congestion control window of the next time period by combining the congestion window and the network power changing trend. For the network packet loss or time-out events, the retransmission mechanism of traditional TCP is used, and when the packet loss ends, the power model process is used again. This invention reduces the influence of the network random events of the estimation error of traditional algorithm.

Systems, methods and computer-readable storage devices each provide, for a given flow entry in a flow table associated with a packet flow, a first atomic counter associated with a first color and a second atomic counter associated with a second color. The system, for a first coloring interval, marks traffic in the packet flow from a tenant to a fabric as the first color and increments the first atomic counter. At a conclusion of the first coloring interval and for a second coloring interval, the system marks the traffic in the packet flow from the tenant to the fabric as the second color and increments the second atomic counter. The system compares first packet counts associated with the first color at an ingress point with second packet counts associated with the first color at an egress point to the fabric.

Examples disclosed herein relate to receiving, by a scheduler, a request for a window during which to send a data packet through a crossbar. Transmission of the data packet is dependent upon a pool of transmission credits. The scheduler determines whether the pool of transmission credits is sufficient for transmitting the data packet, and when it is determined that the pool of transmission credits is insufficient, the scheduler determines whether to block the request or to speculatively arbitrate the window based on a value of a speculative request counter.

A kind of congestion improvement method based on the QUIC protocol adds the information of round trip delay in the congestion algorithm, self-adaptive changes the value of α to judge the situation of current network through comparison between the RTT of last time and the current RTT and then adjusts the current target window value in accordance with the current network situation, changing the congestion window based on the cubic growth curve of the cubic algorithm. This improvement method can make the QUIC protocol judge the current network situation more timely and accurately and can make the congestion window change quickly to fully utilize the bandwidth. The maximum congestion window limitation 200 exists in the QUIC protocol, which will not exceed 200 no matter how the congestion window grows. Such limitation largely reduces the throughput rate of QUIC protocol in the network environment with high bandwidth and long round trip delay.

At an application executing in conjunction with a vSwitch a determination is made that a first flow from a first VM is experiencing congestion. The first flow is selected for throttling. a second flow is also selected for throttling, the second flow using a portion of a network path used by the first flow in a data network. At the application, a total CWND adjustment is distributed between the first flow and the second flow. A first CWND value associated with the first flow is adjusted by a first portion of the total CWND window, and a second CWND value associated with the second flow is adjusted by a second portion of the total CWND window.

A method in a network node is disclosed. The method comprises sending one or more packet data convergence protocol (PDCP) packet data units (PDUs) to a second network node on an internode interface, each of the one or more PDUs having an associated PDCP sequence number and an associated internode interface specific sequence number, the internode interface specific sequence numbers assigned by the network node. The method further comprises receiving feedback from the second network node.

A kind of self-adaptive network congestion control method based on SCPS-TP, which includes the following steps: The SCPS-TP's gateway source-end receives and transmits the packets to destination end; Judge if there is new packet received in accordance with the analyzed ACK; If there is no new packet received, when the duplicate ACK counter increase to a certain value, change the window size's growth pattern to linear self-adaptive pattern; If there is new packet received, the congestion control is in the exponential growth pattern. After window is enlarged, Diff is bigger than the set threshold value and the congestion control method is changed to linear self-adaptive pattern; If congestion control is in the linear self-adaptive pattern, adjust window size in accordance with Diff; The SCPS-TP's gateway source-end sends the packets in the packet loss buffer to destination end and sends new packets in accordance with the size of congestion window.

Data migrations are not able to be identified or traced through a switched network to their originating hub, because the corresponding TCP/IP data stream goes through a plurality of optimized differential switches and the originating IP in the packet header gets replaced at each switch. The present invention provides a mechanism to introduce a lag or a jitter into the IP to label the migrated data. The labeled data are able to be traced and identified through multiple managed hubs and/or switches.

A technique for manipulating one mobile device (MD) from a plurality of MDs to maintain the transmitting rate of packets of an upload session to one Internet Protocol (IP) server from a plurality of IP servers is disclosed. The technique may utilize an upload-rate-controlling server that is communicatively coupled between the plurality of MDs and the plurality of IP servers and is configured to respond to missing one or more packets by using SACK and DSACK messages. Other embodiments may estimate the delay of the uploaded packets and adapt the value of a new-receiving window such that the delay of the uploaded packets is smaller than the value of the time threshold used by intermediate nodes for dropping packets.

A client and content provider are connected by a plurality of simultaneous transport connections. The number of the transport connections that are used to transfer data is selected based on the size of the data to be transferred and may change after transfer of data has commenced based on the amount of data left and the attributes of the transport connections. In another aspect, data to be transmitted over the transport connections is organized into frames such that each frame includes data from only one data stream. The frames are sized to be less than or equal to a control window of the transport connection over which they are transmitted. Each frame may be assigned to a transport connection in a round robin fashion or based on the size of the frame and the sizes of the control windows of the transport connections.