IP Library › Granted Patent US 12,744,724
Granted Patent B2
US 12,744,724 · App. 18/609,010 · Granted Sep 22, 2026

Communications path finding

Inventor: Cristian Rodriguez (Ottawa, CA)
Assignee: Ford Global Technologies, LLC
H04L45/122H04L45/14
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,744,724
App. No.
18/609,010
Granted
Sep 22, 2026
Kind
B2
Abstract

A computer that includes a processor and a memory, the memory including instructions executable by the processor to identify a communications node, included in a network for a first computer network that includes network device nodes, that includes connectivity to second computer network and identify a source node included in the network device nodes. The instructions can include instructions to execute a non-recursive algorithm on a list of network paths in the first computer network that connect the source node to the communications node; identify, from the list of network paths, a preferred network path that includes a fewest number of nodes between the source node and the communications node and communicate from the source node to the second computing network via the preferred network path and the communications node.

Claims (31)

1 . A system, comprising:

a computer that includes a processor and a memory, the memory including instructions executable by the processor to:

identify a communications node, included in a network for a first computer network that includes network device nodes, that includes connectivity to an external computer network;

identify a source node included in the network device nodes;

execute a non-recursive algorithm on a list of network paths in the first computer network that connect the source node to the communications node, wherein the non-recursive algorithm includes a first stack of stack references to second stacks wherein the second stacks include references to the network device nodes;

identify, from the list of network paths, a preferred network path that includes a fewest number of nodes between the source node and the communications node; and

communicate from the source node to the external computing network via the preferred network path and the communications node.

2 . The system of claim 1 , wherein the first computer network includes a vehicle communications system that can include one or more of a controller area network and an ethernet network.

3 . The system of claim 1 , wherein the list of nodes includes the communications node and a second communications node that includes connectivity to the external computer network.

4 . The system of claim 1 , wherein the external computer network includes the Internet.

5 . The system of claim 1 , wherein the non-recursive algorithm includes a depth first search.

6 . The system of claim 1 , wherein the communications node includes a plurality of types of connectivity to the external computer network.

7 . The system of claim 6 , wherein determining the communications node that includes connectivity to the external computer network includes determining that a specified type of connectivity is available for communication.

8 . The system of claim 6 , wherein the types of connectivity to the external computer network include Wi-Fi connectivity, cellular connectivity, and wired connectivity.

9 . The system of claim 1 , wherein the first network includes acyclic graphs and cyclic graphs.

10 . The system of claim 1 , wherein the first computer network is included in a vehicle.

11 . A method, comprising:

identifying a communications node, included in a network for a first computer network that includes network device nodes, that includes connectivity to an external computer network;

identifying a source node included in the network device nodes;

executing a non-recursive algorithm on a list of network paths in the first computer network that connect the source node to the communications node, wherein the non-recursive algorithm includes a first stack of stack references to second stacks wherein the second stacks include references to the network device nodes;

identifying, from the list of network paths, a preferred network path that includes a fewest number of nodes between the source node and the communications node; and

communicating from the source node to the external computing network via the preferred network path and the communications node.

12 . The method of claim 11 , wherein the first network includes acyclic graphs and cyclic graphs.

13 . The method of claim 11 , wherein the first computer network is included in a vehicle.

14 . The method of claim 11 , wherein the first computer network includes a vehicle communications system that can include one or more of a controller area network and an ethernet network.

15 . The method of claim 11 , wherein the list of nodes includes the communications node and a second communications node that includes connectivity to the external computer network.

16 . The method of claim 11 , wherein the external computer network includes the Internet.

17 . The method of claim 11 , wherein the non-recursive algorithm includes a depth first search.

18 . The method of claim 11 , wherein the communications node includes a plurality of types of connectivity to the external computer network.

19 . The method of claim 18 , wherein determining the communications node that includes connectivity to the external computer network includes determining that a specified type of connectivity is available for communication.

20 . The method of claim 18 , wherein the types of connectivity to the external computer network include Wi-Fi connectivity, cellular connectivity, and wired connectivity.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 19, 2024
From: RODRIGUEZ, CRISTIAN
To: FORD GLOBAL TECHNOLOGIES, LLC
Reel/Frame 066817/0529 →
Continuity (1)
Related Publication 20250300926A1 · Sep 25, 2025
References Cited (13)
US 10298488B1 · Wood et al. · 2019 [cited by applicant]
US 10553224B2 · Klejsa · 2020 [cited by examiner]
US 11757768B1 · Zhou · 2023 [cited by examiner]
US 20180097725A1 · Wood et al. · 2018 [cited by applicant]
US 20200389387A1 · Magzimof · 2020 [cited by examiner]
US 20220097736A1 · Lin · 2022 [cited by examiner]
US 20220197881A1 · Dutertre · 2022 [cited by examiner]
US 20220417147A1 · Woodworth · 2022 [cited by examiner]
US 20240323660A1 · Wright · 2024 [cited by examiner]
CN 102411499A · 2012 [cited by applicant]
CN 106161633A · 2016 [cited by applicant]
Autosar, “Guidelines for the use of the C++language in critical and safety-related systems”, Autosar AP Release 18-10, Oct. 24, 2018. [cited by applicant]
Tarjan et al., “Finding Strong Components Using Depth-First Search”, arXiv:2201.07197v3 [cs.DS] Apr. 11, 2022. [cited by applicant]