System and method for improving an aggregated throughput of simultaneous connections
US-10142262-B2 · Nov 27, 2018 · US
US10404618B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10404618-B2 |
| Application number | US-201816156784-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 10, 2018 |
| Priority date | May 31, 2016 |
| Publication date | Sep 3, 2019 |
| Grant date | Sep 3, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
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.
Opening claim text (preview).
What is claimed is: 1. A method for increasing an aggregated throughput of multiple simultaneous transport connections between computers over a computer network, the method comprising: setting, by a first computer, a first number of a first plurality of simultaneous transport connections with a second computer, the first computer being configured to receive one or more first requests for data delivery from the second computer and to deliver first requested data corresponding to the one or more first requests over the first plurality of simultaneous transport connections to the second computer; setting, by the first computer, a second number of a second plurality of simultaneous transport connections with a third computer, the first computer being configured to receive one or more second requests for data delivery from the third computer and to deliver second requested data corresponding to the one or more second requests over the second plurality of simultaneous transport connections to the third computer; detecting, by the first computer, a difference between one or more first parameters of the first plurality of simultaneous transport connections and one or more second parameters of the second plurality of simultaneous transport connections; setting, by the first computer, the first number of the first plurality of simultaneous transport connections and the second number of the second plurality of simultaneous transport connections to be different according to the difference between the one or more first parameters and the one or more second parameters. 2. The method of claim 1 , wherein setting the first number of the first plurality of simultaneous transport connections comprises increasing the first number of the first plurality of simultaneous transport connections with at least one of increase in a distance between the first computer and the second computer and a round-trip time between the first computer and the second computer; and wherein setting the second number of the second plurality of simultaneous transport connections comprises increasing the second number of the second plurality of simultaneous transport connections with at least one of increase in a distance between the first computer and the third computer and a round-trip time between the first computer and the third computer. 3. The method of claim 1 , wherein setting the first number of the first plurality of simultaneous transport connections comprises decreasing the first number of the first plurality of simultaneous transport connections with increase of a quality of a network connecting the first computer and the second computer relative to a quality of a network connecting the first computer and the third computer. 4. The method of claim 3 , wherein setting the first number of the first plurality of simultaneous transport connections comprises decreasing the first number of the first plurality of simultaneous transport connections with decrease in a rate of data losses over the first plurality of simultaneous transport connections; and wherein setting the second number of the second plurality of simultaneous transport connections comprises decreasing the second number of the second plurality of simultaneous transport connections with decrease in a rate of data losses over the second plurality of simultaneous transport connections. 5. The method of claim 3 , wherein each of the first plurality of transport connections and the second plurality of transport connections implement a transport protocol defining control windows that limit an amount of traffic that may be sent before an acknowledgement of at least some of the traffic has been received; wherein setting the first number of the first plurality of simultaneous transport connections comprises decreasing the first number of the first plurality of simultaneous transport connections with increase of a size of the control windows for the first plurality of transport connections; and wherein setting the second number of the second plurality of simultaneous transport connections comprises decreasing the second number of the second plurality of simultaneous transport connections with increase of a size of the control windows for the second plurality of transport connections. 6. The method of claim 5 , where the transport protocol is a Transport Control Protocol (TCP), and the control window is a smaller of a receiver window and a congestion window. 7. A system comprising: one or more processing devices and one or more memory devices operably coupled to the one or more processing devices, the one or more memory devices storing executable code effective to cause the one or more processing devices to: set a first number of a first plurality of simultaneous transport connections with a second computer; receive one or more first requests for data delivery from the second computer and to deliver first requested data corresponding to the one or more first requests over the first plurality of simultaneous transport connections to the second computer; set a second number of a second plurality of simultaneous transport connections with a third computer; receive one or more second requests for data delivery from the third computer; deliver second requested data corresponding to the one or more second requests over the second plurality of simultaneous transport connections to the third computer; detect a difference between one or more first parameters of the first plurality of simultaneous transport connections and one or more second parameters of the second plurality of simultaneous transport connections; set the first number of the first plurality of simultaneous transport connections and the second number of the second plurality of simultaneous transport connections to be different according to the difference between the one or more first parameters and the one or more second parameters. 8. The system of claim 7 , wherein the executable code is further effective to cause the one or more processing devices to: set the first number of the first plurality of simultaneous transport connections by increasing the first number of the first plurality of simultaneous transport connections with at least one of increase in a distance between the first computer and the second computer and a round-trip time between the first computer and the second computer; and set the second number of the second plurality of simultaneous transport connections by increasing the second number of the second plurality of simultaneous transport connections with at least one of increase in a distance between the first computer and the third computer and a round-trip time between the first computer and the third computer. 9. The system of claim 7 , wherein the executable code is further effective to cause the one or more processing devices to: set the first number of the first plurality of simultaneous transport connections by decreasing the first number of the first plurality of simultaneous transport connections with increase of a quality of a network connecting the first computer and the second computer relative to a quality of a network connecting the first computer and the third computer. 10. The system of claim 9 , wherein the executable code is further effective to cause the one or more processing devices to: set the first number of the first plurality of simultaneous transport connections by decreasing the first number of the first plurality of simultaneous transport connections with decrease in a rate of data losses over the first plurality of simultaneous transport connections; and set the second number of the second plurality of simultaneous transport connections by decreasing the second number of the second p
Details of sliding window management · CPC title
One way packet loss · CPC title
Throughput · CPC title
by acting on aggregated flows or links · CPC title
Aggregation of resource allocation or reservation requests · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.