US 12,192,828 B1
Ordering multiple commands issued by multiple computing devices in a network, when chronological ordering is not possible
Jonathan Andrew Crockett Moore, Portland, OR (US)
Assigned to SpiderOak, Inc., Lenexa, KS (US)
Filed by SPIDEROAK, INC., Lenexa, KS (US)
Filed on Jan. 29, 2024, as Appl. No. 18/426,327.
Application 18/426,327 is a continuation of application No. 18/355,981, filed on Jul. 20, 2023, granted, now 11,902,832.
Int. Cl. H04W 28/086 (2023.01); H04W 28/08 (2023.01)
CPC H04W 28/0862 (2023.05) [H04W 28/0925 (2020.05)] 20 Claims
OG exemplary drawing
 
1. A non-transitory, computer-readable storage medium comprising instructions that,
when executed by at least one processor of a system, cause the system to:
obtain a first directed acyclic graph including multiple nodes and multiple edges connecting the multiple nodes,
wherein a node in the first directed acyclic graph represents a command issued by a computing device among multiple computing devices,
wherein a process to create a linear order of the multiple nodes associated with the first directed acyclic graph produces a matching linear order when executed on the first directed acyclic graph by two different computing devices among the multiple computing devices,
wherein an addition of the node to the multiple nodes associated with the first directed acyclic graph changes the linear order of the multiple nodes associated with the first directed acyclic graph;
obtain an indication to stop changing the linear order of the multiple nodes associated with the first directed acyclic graph; and
upon obtaining the indication to stop changing the linear order of the multiple nodes associated with the first directed acyclic graph, add a finalize command to the first directed acyclic graph to obtain a second directed acyclic graph,
wherein upon adding the finalize command to the first directed acyclic graph, the addition of the node to the second directed acyclic graph does not change the linear order of the multiple nodes associated with the first directed acyclic graph.