System and method for improving an aggregated throughput of simultaneous connections

Patent metadata

Field	Value
Publication number	US-10425356-B2
Application number	US-201816022335-A
Country	US
Kind code	B2
Filing date	Jun 28, 2018
Priority date	May 31, 2016
Publication date	Sep 24, 2019
Grant date	Sep 24, 2019

Abstract

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.

First claim

What is claimed is:

1. A method for increasing an aggregated throughput comprising:
establishing, by one of a first computer and a second computer, a plurality of simultaneous transport connections between the first computer and the second computer over a computer network;
receiving, by the first computer from the second computer, two or more groups of requests for data delivery to the second computer through the plurality of the simultaneous transport connections with the first computer such that a first group of the two or more groups of requests is constrained to be finished before a second group of the two or more groups of requests;
determining, by the first computer, that delivery of requested data corresponding to each request for data delivery of the first group of requests is finished;
setting, by the first computer, a number of the plurality of simultaneous transport connections used to deliver requested data corresponding to each request for data delivery of the second group of requests to the first computer such that a number of simultaneous transport connections used to deliver the requested data corresponding to each request for data delivery of the first group of requests is set to be different than the number of the plurality of simultaneous transport connections used to deliver the requested data corresponding to each request for data delivery of the second group of requests;
wherein:
each of the plurality of simultaneous transport connections is associated with a control window limiting the amount of traffic that is permitted to be sent before receiving an acknowledgement that at least some data included in the traffic has been delivered;
the method further comprises:
determining, by one of the first computer and the second computer, an estimated size of one or more control windows of the plurality of simultaneous transport connections; and
decreasing, by one of the first and the second computer, the number of the plurality of simultaneous network connections used for delivery of requested data corresponding to a same group of requests of the two or more groups of requests with increase of the estimated size of the one or more control windows;
wherein the control window is a smallest of a receiver window and a congestion window used by a transport protocol.

Assignees

• Anchorfree Inc

Inventors

• Lapidous Eugene
• Molchanov Maxim

Classifications

• H04L1/187 Primary

  Details of sliding window management · CPC title

• H04L43/0888

  Throughput · CPC title

• H04L47/41

  by acting on aggregated flows or links · CPC title

• H04L47/27

  Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets · CPC title

• H04L47/827 Primary

  Aggregation of resource allocation or reservation requests · CPC title