US 12,231,311 B2
Parallel computational framework and application server for determining path connectivity
Leo M. Chan, Edmonton (CA)
Assigned to WWW.TRUSTSCIENCE.COM INC., Edmonton (CA)
Filed by www.TrustScience.com Inc., Edmonton (CA)
Filed on Apr. 29, 2024, as Appl. No. 18/649,423.
Application 18/649,423 is a continuation of application No. 18/310,590, filed on May 2, 2023, granted, now 12,003,393.
Application 18/310,590 is a continuation of application No. 16/995,293, filed on Aug. 17, 2020, granted, now 11,665,072, issued on May 30, 2023.
Application 16/995,293 is a continuation of application No. 16/410,272, filed on May 13, 2019, granted, now 10,812,354, issued on Oct. 20, 2020.
Application 16/410,272 is a continuation of application No. 16/195,946, filed on Nov. 20, 2018, granted, now 10,348,586, issued on Jul. 9, 2019.
Application 16/195,946 is a continuation of application No. 15/953,011, filed on Apr. 13, 2018, granted, now 10,187,277, issued on Jan. 22, 2019.
Application 15/953,011 is a continuation of application No. 15/623,103, filed on Jun. 14, 2017, abandoned.
Application 15/623,103 is a continuation of application No. 15/224,063, filed on Jul. 29, 2016, abandoned.
Application 15/224,063 is a continuation of application No. 13/503,352, granted, now 9,443,004, issued on Sep. 13, 2016, previously published as PCT/CA2010/001658, filed on Oct. 22, 2010.
Claims priority of provisional application 61/254,313, filed on Oct. 23, 2009.
Prior Publication US 2024/0275702 A1, Aug. 15, 2024
Int. Cl. H04L 43/065 (2022.01); G06F 16/332 (2019.01); G06N 7/01 (2023.01); H04L 41/14 (2022.01); H04L 43/045 (2022.01); H04L 43/0805 (2022.01); H04L 43/16 (2022.01); H04L 67/50 (2022.01)
CPC H04L 43/065 (2013.01) [G06F 16/3322 (2019.01); G06N 7/01 (2023.01); H04L 41/14 (2013.01); H04L 43/045 (2013.01); H04L 43/0805 (2013.01); H04L 43/16 (2013.01); H04L 67/535 (2022.05)] 20 Claims
OG exemplary drawing
 
1. A system for determining the network connectivity between a first node and a second node connected to the first node by at least one path, comprising:
a storage device configured to:
store a first list of outgoing paths from the first node,
store a second list of incoming paths to the second node,
store a third list of grouped paths between the first node and the second node,
wherein each path in the first list and each path in the second list comprises one or more links between nodes and each path with more than one link comprises at least one intermediate node; and
processing circuitry configured to:
prior to storing the third list, determine each of the grouped paths for the third list by accessing data from the first list and the second list and grouping together sets of one or more paths having the same last intermediate node that is adjacent to the second node;
determine a relative user weight for each of the one or more links between nodes;
determine an overall weight of each of the grouped paths; and
determine a network connectivity indication based, at least in part, on the grouped paths.