SYSTEM AND METHOD FOR CHOOSING LOWEST LATENCY PATH

• US 20150046558A1
• Filed: 08/27/2013
• Published: 02/12/2015
• Est. Priority Date: 03/15/2013
• Status: Abandoned Application

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: PADGETT, Steven
• Application Number:
  US14/011,233
• Publication Number:
  US 20150046558A1
• Time in Patent Office: Days
• US Class Current: 709/217
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04L 45/24 Multipath
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/70 Routing based on monitoring results

Abstract

A mechanism for reducing network latency by choosing the lowest latency network path, or a lower latency network path, from server to client. Instead of using a static, pre-built system for determining latency, the lowest latency path may be dynamically determined for each client connection at the time of connection establishment. Further, latency information may be periodically determined over time and averaged or otherwise utilized to account for changing network conditions.

Claims

1. A computing-device implemented method for determining lowest network path latency, comprising:

receiving at a server a request for content from a client device over an existing TCP connection;

transmitting to the client device over a plurality of network paths near-identical packets, the near-identical packets having identical TCP sequences and modified packet contents that include an instruction or attribute identifying an arrival network path upon which the near-identical packet was received;

receiving at the server from the client device an identification of one of the plurality of network paths as being a first network path which delivered one of the near-identical packets to the client device; and

transmitting the requested contents over a selected one of the plurality of the network paths based at least in part on the identification.

2. The method of claim 1, further comprising:

storing latency information based on the identification.

3. The method of claim 1 wherein the requested contents are transmitted over the selected one of the plurality of network paths based on stored latency information and the identification.

4. The method of claim 1 wherein each of the near-identical packets have a different path instruction or attribute.

5. The method of claim 1, further comprising:

transmitting the non-identical packets to the client device using a packet duplicator.

6. The method of claim 1, further comprising:

transmitting the requested contents over a non-lowest latency network path in the plurality of network paths based on a detection of packet loss on an identified lowest latency path in the plurality of network paths.

7. The method of claim 1, further comprising:

periodically identifying one of the plurality of network paths as a lowest latency network path as a result of the transmission of the near-identical packets;

storing information related to the identifying for each transmission; and

transmitting the requested contents based on a determination of the identified lowest latency network path during a pre-determined time period using the stored information.

8. The method of claim 1 wherein the transmission of the requested content over the selected one of the plurality of network paths is switched to a different one of the plurality of network paths before the completion of the transmission of the requested content based on a subsequent receipt by the server of a second identification identifying the different one of the plurality of network paths as the first path to receive a near-identical packet following a second transmission of near-identical packets to the client device.

12. The medium of claim 1 wherein each of the near-identical packets have a different path instruction or attribute.

9. A non-transitory medium holding computing-device executable instructions for determining lowest path latency;

the instructions when executed causing at least one computing device to;

receive at a server a request for content from a client device over an existing TCP connection;

transmit to the client device over a plurality of network paths near-identical packets, the near-identical packets having identical TCP sequences and modified packet contents that include an instruction or attribute identifying an arrival network path upon which the near-identical packet was received;

receive at the server from the client device an identification of one of the plurality of network paths as being a first network path which delivered one of the near-identical packets to the client device; and

transmit the requested contents over a selected one of the plurality of the network paths based at least in part on the identification.

10. The medium of claim 9 wherein the instructions when executed further cause the at least one computing device to:

store latency information based on the identification.

11. The medium of claim 9 wherein the requested contents are transmitted over the selected one of the plurality of network paths based on stored latency information and the identification.

13. The medium of claim 9 wherein the instructions when executed further cause the at least one computing device to:

transmit the non-identical packets to the client device using a packet duplicator.

14. The medium of claim 9 wherein the instructions when executed further cause the at least one computing device to:

transmit the requested contents over a non-lowest latency network path in the plurality of network paths based on a detection of packet loss on an identified lowest latency path in the plurality of network paths.

15. The medium of claim 9 wherein the instructions when executed further cause the at least one computing device to:

periodically identify one of the plurality of network paths as a lowest latency network path as a result of the transmission of the near-identical packets;

store information related to the identifying for each transmission; and

transmit the requested contents based on a determination of the identified lowest latency network path during a pre-determined time period using the stored information.

16. The medium of claim 9 wherein the transmission of the requested content over the selected one of the plurality of network paths is switched to a different one of the plurality of network paths before the completion of the transmission of the requested content based on a subsequent receipt by the server of a second identification identifying the different one of the plurality of network paths as the first path to receive a near-identical packet following a second transmission of near-identical packets to the client device.

17. A computing-device implemented system for determining lowest path latency, comprising:

a server, the server receiving a request for content from a client device over an existing TCP connection; and

a packet duplicator, the packet duplicator generating and transmitting to the client device over a plurality of network paths near-identical packets, the near-identical packets having identical TCP sequences and modified packet contents that include an instruction or attribute identifying an arrival network path upon which the near-identical packet was received, the client device transmitting to the server an identification of one of the plurality of network paths as being a first network path which delivered one of the near-identical packets to the client device upon receipt of a first of the near-identical packets,

wherein the server transmits the requested contents over a selected one of the plurality of the network paths based at least in part on the identification.

18. The system of claim 17 wherein the packet duplicator is located remotely from the server.

19. The system of claim 17 wherein the packet duplicator is located on a computing device hosting the server.

20. The system of claim 17 wherein the packet duplicator is located approximately equidistant as the server, based on network topology, from egress points to the plurality of network paths.