US 12,316,486 B1
Parallel distributed network management
David Hindawi, Berkeley, CA (US); Orion Hindawi, Piedmont, CA (US); Lisa Lippincott, Berkeley, CA (US); and Peter Lincroft, Albany, CA (US)
Assigned to Tanium Inc., Emeryville, CA (US)
Filed by Tanium Inc., Kirkland, WA (US)
Filed on Feb. 18, 2022, as Appl. No. 17/675,998.
Application 17/675,998 is a continuation of application No. 16/917,800, filed on Jun. 30, 2020, granted, now 11,258,654.
Application 16/917,800 is a continuation of application No. 15/668,665, filed on Aug. 3, 2017, granted, now 10,708,116, issued on Jul. 7, 2020.
Application 15/668,665 is a continuation of application No. 14/530,601, filed on Oct. 31, 2014, granted, now 9,729,429, issued on Aug. 8, 2017.
Application 14/530,601 is a continuation of application No. 13/107,625, filed on May 13, 2011, granted, now 8,903,973, issued on Dec. 2, 2014.
Application 13/107,625 is a continuation in part of application No. 13/084,923, filed on Apr. 12, 2011, granted, now 8,904,039, issued on Dec. 2, 2014.
Application 13/084,923 is a continuation in part of application No. 12/412,623, filed on Mar. 27, 2009, granted, now 8,086,729, issued on Dec. 27, 2011.
Claims priority of provisional application 61/323,733, filed on Apr. 13, 2010.
Claims priority of provisional application 61/113,060, filed on Nov. 10, 2008.
Int. Cl. H04L 41/04 (2022.01); H04L 41/0853 (2022.01); H04L 41/12 (2022.01); H04L 43/06 (2022.01); H04L 43/065 (2022.01); H04L 43/10 (2022.01); H04L 45/16 (2022.01); H04L 45/44 (2022.01)
CPC H04L 41/04 (2013.01) [H04L 41/0853 (2013.01); H04L 41/12 (2013.01); H04L 43/06 (2013.01); H04L 43/065 (2013.01); H04L 43/10 (2013.01); H04L 45/16 (2013.01); H04L 45/44 (2013.01)] 22 Claims
OG exemplary drawing
 
1. A method, comprising:
at a first machine of a non-static collection of machines, wherein the non-static collection of machines is self-organized into a linear communication orbit, and a server has sent a data unit to a subset of machines in the linear communication orbit:
receiving a plurality of shards of the data unit from an upstream neighbor of the first machine in the linear communication orbit;
sending the plurality of shards of the data unit to a downstream neighbor of the first machine in the linear communication orbit; and
selecting and maintaining a subset of the plurality of shards of the data unit in a local cache of the first machine according to a data caching method, wherein the first machine selects the subset of the plurality of shards it maintains independently of whether the subset of the plurality of shards are maintained locally by the upstream neighbor and the downstream neighbor of the first machine in the linear communication orbit.