US 12,238,163 B2
Latency-based routing and load balancing in a network
Katherine E. Patterson, Mount Laurel, NJ (US); Nicholas C. Beenham, Swedesboro, NJ (US); and Joy Mathew Elamthuruthy, Sicklerville, NJ (US)
Assigned to Adeia Media Holdings LLC, San Jose, CA (US)
Filed by Adeia Media Holdings LLC, San Jose, CA (US)
Filed on Sep. 12, 2023, as Appl. No. 18/244,986.
Application 18/244,986 is a continuation of application No. 17/327,029, filed on May 21, 2021, granted, now 11,799,949.
Application 17/327,029 is a continuation of application No. 16/241,683, filed on Jan. 7, 2019, granted, now 11,050,819, issued on Jun. 29, 2021.
Application 16/241,683 is a continuation of application No. 15/466,583, filed on Mar. 22, 2017, abandoned.
Application 15/466,583 is a continuation of application No. 14/755,731, filed on Jun. 30, 2015, granted, now 9,641,605, issued on May 2, 2017.
Application 14/755,731 is a continuation of application No. 13/363,996, filed on Feb. 1, 2012, granted, now 9,106,663, issued on Aug. 11, 2015.
Prior Publication US 2023/0421633 A1, Dec. 28, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 67/101 (2022.01); H04L 43/0852 (2022.01); H04L 67/1001 (2022.01); G06F 16/27 (2019.01)
CPC H04L 67/101 (2013.01) [H04L 43/0852 (2013.01); H04L 67/1001 (2022.05); G06F 16/27 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
receiving a user request for a service on a network connected user device;
identifying, from a plurality of storage nodes associated with the service, a target storage node associated with the user request;
receiving, at a data manager associated with the network connected user device, a data structure comprising:
a first plurality of lag times corresponding to communications between a user network node associated with the network connected user device and the plurality of storage nodes; and
a second plurality of lag times, each lag time of the second plurality of lag times corresponding to a length of time for a first storage node of the plurality of storage nodes to completely replicate content from a second storage node of the plurality of storage nodes;
determining, based on the first plurality of lag times and the second plurality of lag times, a plurality of total lag times between the user network node and the target storage node via a corresponding path comprising one or more of the plurality of storage nodes;
identifying a shortest total lag time from the plurality of total lag times; and
causing, through the user network node, the target storage node to respond to the user request for the service along a path corresponding to the shortest total lag time.