| 54 |
Title |
TI |
[DE] NETZWERKERKENNUNGSVERFAHREN
[EN] NETWORK DISCOVERY METHOD
[FR] PROCÉDÉ DE DÉCOUVERTE DE RÉSEAU |
| 71/73 |
Applicant/owner |
PA |
AIRBUS OPERATIONS GMBH, DE
|
| 72 |
Inventor |
IN |
KLIEM DANIEL ALEXANDER, DE
;
URBAN PASCAL, DE
|
| 22/96 |
Application date |
AD |
Sep 26, 2022 |
| 21 |
Application number |
AN |
22197876 |
|
Country of application |
AC |
EP |
|
Publication date |
PUB |
Mar 27, 2024 |
33
31
32 |
Priority data |
PRC
PRN
PRD |
|
| 51 |
IPC main class |
ICM |
H04L 45/02
(2022.01)
|
| 51 |
IPC secondary class |
ICS |
H04L 12/42
(2006.01)
|
|
IPC additional class |
ICA |
|
|
IPC index class |
ICI |
|
|
Cooperative patent classification |
CPC |
H04L 12/40
H04L 12/403
H04L 12/42
H04L 12/44
H04L 2012/4028
H04L 41/12
H04L 45/02
H04L 61/255
|
|
MCD main class |
MCM |
H04L 45/02
(2022.01)
|
|
MCD secondary class |
MCS |
H04L 12/42
(2006.01)
|
|
MCD additional class |
MCA |
|
| 57 |
Abstract |
AB |
[EN] A network discovery method (M), particularly for use in data networks (100) on board of an aircraft (A), comprises the steps of: sending (M1), by a master node (1) in a logical root hierarchy level (H0) of a data network (100), a discovery message including a forwarding counter to at least one first slave node (2; 6) in the first logical hierarchy level (H1) of the data network (100) via at least one child port (1Ca; 1Cb); increasing (M2), by the at least one first neighbouring slave node (2; 6) in the first logical hierarchy level (H1) of the data network (100), the forwarding counter of the received discovery message; forwarding (M3) the discovery message with the increased forwarding counter to at least one second slave node (3; 5) in the first logical hierarchy level (H1) of the data network (100); receiving (M4), by the at least one first slave node (2; 6) and the at least one second slave node (3; 5), context information from the master node (1) regarding the identity of the master node (1) and the at least one child port (1Ca; 1Cb) via which the discovery message had been sent by the master node (1); determining (M5), by the at least one first slave node (2; 6) and the at least one second slave node (3; 5), its own functional designation on the basis of the forwarding counter and the received context information from the master node (1) by comparison with a mapping table (MT); and updating (M6) the mapping table (MT) by matching the recorded functional designation in the mapping table (MT) with the identity of the at least one first slave node (2; 6) and the at least one second slave node (3; 5). |
| 56 |
Cited documents identified in the search |
CT |
EP000002012547A1
US020060171329A1
WO002007092931A2
|
| 56 |
Cited documents indicated by the applicant |
CT |
US020100165883A1
|
| 56 |
Cited non-patent literature identified in the search |
CTNP |
|
| 56 |
Cited non-patent literature indicated by the applicant |
CTNP |
|
|
Citing documents |
|
Determine documents
|
|
Sequence listings |
|
|
|
Search file IPC |
ICP |
H04L 12/42
H04L 12/44
|
