US 12,368,664 B2
System and method for the automatic routing of information in dynamic networks
Randal Allen, Orlando, FL (US); Eric Haney, Dallas, TX (US); and Mark James Volpi, Wylie, TX (US)
Assigned to INCUCOMM, INC., Addison, TX (US)
Filed by Incucomm, Inc., Addison, TX (US)
Filed on Aug. 10, 2022, as Appl. No. 17/818,965.
Application 17/818,965 is a continuation in part of application No. 17/305,803, filed on Jul. 14, 2021, abandoned.
Claims priority of provisional application 63/260,137, filed on Aug. 10, 2021.
Claims priority of provisional application 62/705,753, filed on Jul. 14, 2020.
Prior Publication US 2023/0129641 A1, Apr. 27, 2023
Int. Cl. H04L 12/66 (2006.01); H04L 45/00 (2022.01); H04W 40/20 (2009.01)
CPC H04L 45/14 (2013.01) [H04W 40/20 (2013.01)] 36 Claims
OG exemplary drawing
 
1. A method for automatically routing data packets in dynamic networks from an originating node to a destination node through a plurality of intermediate nodes, wherein ones of said plurality of intermediate nodes operable to be dynamically changed as each of said data packets is routed between said originating node and said destination node, comprising:
modeling at least a portion of a route for each of said data packets as a fluid dynamics potential flow characterized by an irrotational velocity field, wherein:
each of said data packets are an analogue of a flow particle, said originating node of said route is an analogue of a source, and said destination node of said route is an analogue of a sink; and
each of one or more of said plurality of intermediate nodes are associated with a stream function (Ψ) which adheres to a definition of irrotational and incompressible potential flow that independently represents a flow phenomenon that operable to influence said route of each of said data packets through said plurality of intermediate nodes,
dynamically calculating an optimal route of each of said data packets based on a current location at ones of said plurality of intermediate nodes and an aggregate stream function comprising a sum of each of said flow phenomena acting on each of said data packets between said current location at one of said plurality of intermediate nodes and said destination node; and
routing each of said data packets between said plurality of intermediate nodes based on said optimal route.