IP Library › Granted Patent US 12,483,481
Granted Patent B2
US 12,483,481 · App. 18/463,944 · Granted Nov 25, 2025

Network discovery method

Inventors: Daniel Alexander Kliem (Hamburg, DE); Pascal Urban (Hamburg, DE)
Assignee: Airbus Operations GmbH
H04L41/12H04L61/255
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,483,481
App. No.
18/463,944
Granted
Nov 25, 2025
Kind
B2
Abstract

A network discovery method includes: sending, by a master node in a logical root hierarchy level of a data network, a discovery message including a forwarding counter to a first slave node in the data network first logical hierarchy level via a child port; increasing, by the first neighboring slave node, the forwarding counter; forwarding the discovery message with the increased forwarding counter to a second slave node in the first logical hierarchy level; receiving, by the first and second slave nodes, context information from the master node regarding the identities of the master node and the child port; determining, by the first and second slave nodes, its own functional designation based on the forwarding counter and the received context information by comparison with a mapping table; and updating the mapping table by matching the recorded functional designation in the mapping table with the first and slave node identities.

Claims (36)

1 . A network discovery method, the method comprising:

sending, by a master node in a logical root hierarchy level of a data network, a discovery message including a forwarding counter to at least one first slave node in a first logical hierarchy level of the data network via at least one child port;

increasing, by the at least one first slave node in the first logical hierarchy level of the data network, the forwarding counter of the received discovery message;

establishing a communication link between at least one downstream sibling node via at least one downstream sibling port and at least one upstream sibling node via at least one upstream sibling port, respective to the at least one first slave node, based on a topology of the data network;

forwarding the discovery message with the increased forwarding counter to at least one second slave node, the at least one second slave node being the at least one downstream sibling node or the at least one upstream sibling node, via the at least one downstream sibling port or the at least one upstream sibling port, in the first logical hierarchy level of the data network;

receiving, by the at least one first slave node and the at least one second slave node, context information from the master node regarding an identity of the master node and an identity of the at least one child port via which the discovery message had been sent by the master node;

determining, by each of the at least one first slave node and the at least one second slave node, its own respective functional designation based on the forwarding counter and the received context information from the master node by comparison with a mapping table; and

updating the mapping table by matching a recorded functional designation in the mapping table with an identity of the at least one first slave node and an identity of the at least one second slave node.

2 . The network discovery method according to claim 1 , further comprising:

sending, by at least one of the at least one first slave node and the at least one second slave node, the discovery message including a forwarding counter to at least one first slave node in a second logical hierarchy level of the data network via at least one child port, the second logical hierarchy level being lower in a hierarchy than the first logical hierarchy level;

increasing, by the at least one first slave node in the second logical hierarchy level of the data network, the forwarding counter of the received discovery message;

forwarding the discovery message with the increased forwarding counter to at least one second slave node in the second logical hierarchy level of the data network;

receiving, by the at least one first slave node and the at least one second slave node in the second logical hierarchy level, context information from at least one of the at least one first slave node and the at least one second slave node in the first logical hierarchy level regarding an identity of the at least one of the at least one first slave node and an identity of the at least one second slave node in the first logical hierarchy level and the identity of the at least one child port via which the discovery message had been sent;

determining, by each of the at least one first slave node and the at least one second slave node in the second logical hierarchy level, its own respective functional designation based on the forwarding counter and the received context information by comparison with a mapping table; and

updating the mapping table by matching a recorded functional designation in the mapping table with an identity of the at least one first slave node and an identity of the at least one second slave node in the second logical hierarchy level.

3 . The network discovery method according to claim 1 , wherein the context information is sent in a context message separate from the discovery message.

4 . The network discovery method according to claim 1 , wherein the context information is included in the discovery message.

5 . The network discovery method according to claim 1 , wherein the mapping table is stored in the master node.

6 . The network discovery method according to claim 1 , wherein the data network includes one or more structural elements of a star topology, a ring topology, a multi-ring topology, a daisy-chain topology and a tree topology.

7 . The network discovery method according to claim 1 , wherein steps of the network discovery method are performed repeatedly in periodic intervals or on-demand in order to update the mapping table.

8 . The network discovery method according to claim 1 , wherein an identity of the master node and the identities of the at least one first slave node and the at least one second slave node are encoded in uniquely assigned media access control, MAC, addresses.

9 . The network discovery method according to claim 1 , wherein the method is used in data networks on board of an aircraft.

10 . The network discovery method according to claim 1 , wherein the mapping table includes one or more unique identifiers based on a topology of the data network, the network discovery network method further including:

determining one 3-tuple for non-redundant topologies; and

determining two 3-tuples for non-faulty ring topologies.

11 . A data network, comprising:

a master node including master processing circuitry configured to execute instructions to;

send a discovery message including a forwarding counter via at least one child port; and

a number of slave nodes connected to the master node on at least one logical hierarchy level, each slave node including slave processing circuitry configured to execute instructions to:

increase, by at least one first slave node in a first logical hierarchy level of the data network, the forwarding counter of the discovery message received from the master node;

establish, by the at least one first slave node, a communication link between at least one downstream sibling node via at least one downstream sibling port and at least one upstream sibling node via at least one upstream sibling port, respective to the at least one first slave node, based on a topology of the data network;

forward the discovery message with the increased forwarding counter to at least one second slave node, the at least one second slave node being the at least one downstream sibling node or the at least one upstream sibling node, via the at least one downstream sibling port or the at least one upstream sibling port, in the first logical hierarchy level of the data network;

receive, by the at least one first slave node and the at least one second slave node, context information from the master node regarding an identity of the master node and an identity of the at least one child port via which the discovery message had been sent by the master node; and

determine, by each of the at least one first slave node and the at least one second slave node, its own respective functional designation based on the forwarding counter and the received context information from the master node by comparison with a mapping table;

wherein one of the master node or at least one of the number of slave nodes, via the master processing circuitry or the slave processing circuitry respectively, is configured to execute instructions to update the mapping table by matching a recorded functional designation in the mapping table with an identity of the at least one first slave node and an identity of the at least one second slave node.

12 . An aircraft comprising a data network according to claim 11 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 8, 2023
From: KLIEM, DANIEL ALEXANDER; URBAN, PASCAL
To: AIRBUS OPERATIONS GMBH
Reel/Frame 064849/0382 →
Priority Claims (1)
EP 22197876 · Sep 26, 2022 · regional
Continuity (1)
Related Publication 20240106714A1 · Mar 28, 2024
References Cited (10)
US 20050169193A1 · Black · 2005 [cited by examiner]
US 20060171329A1 · Ying · 2006 [cited by applicant]
US 20080013502A1 · Clark · 2008 [cited by examiner]
US 20100165883A1 · Holness · 2010 [cited by examiner]
US 20110116366A1 · Smith · 2011 [cited by examiner]
EP 2012547A1 · 2009 [cited by applicant]
EP 3324580B1 · 2019 [cited by examiner]
WO 2007092931A2 · 2007 [cited by applicant]
W. Htira, O. Dugeon and M. Diaz, “STAMP: Towards a Scalable Topology Announcement and Management Protocol,” 22nd International Conference on Advanced Information Networking and Applications (aina 2008), Gino-wan, Japan,… [cited by examiner]
European Search Report for corresponding European U.S. Appl. No. 22/197,876 dated Feb. 22, 2023; priority document. [cited by applicant]