CN117715094A - Method, network and network node for realizing high-availability aircraft data network by using single network - Google Patents
Method, network and network node for realizing high-availability aircraft data network by using single network Download PDFInfo
- Publication number
- CN117715094A CN117715094A CN202311726263.6A CN202311726263A CN117715094A CN 117715094 A CN117715094 A CN 117715094A CN 202311726263 A CN202311726263 A CN 202311726263A CN 117715094 A CN117715094 A CN 117715094A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- network
- nodes
- downstream
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000011144 upstream manufacturing Methods 0.000 claims abstract description 21
- 238000012545 processing Methods 0.000 claims abstract description 15
- 230000005540 biological transmission Effects 0.000 abstract description 39
- 238000004590 computer program Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 7
- 230000008569 process Effects 0.000 description 6
- 230000003068 static effect Effects 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 235000008694 Humulus lupulus Nutrition 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000012552 review Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/04—Arrangements for maintaining operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/10—Connection setup
- H04W76/11—Allocation or use of connection identifiers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/06—Airborne or Satellite Networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Embodiments of the present disclosure relate to data transmission with high data availability. A method includes receiving, at a node of a network, a first copy of a message from an upstream node in the network. The method further includes searching at the node for an identity associated with the message that has been received. The method further includes processing forwarding of the first copy of the message to at least one downstream node based on the search.
Description
The present invention is a divisional application of the invention patent application with the application number 201810770878.1, the application date 2018, 7, 13 and the name of "data transmission with high availability".
Technical Field
Embodiments of the present disclosure relate generally to data transmission networks and, more particularly, to methods, networks, and network nodes for implementing high availability aircraft data networks.
Background
In network communications, particularly those security-related networks, it is desirable to ensure high availability of data transmission channels. To face data loss that may occur during transmission, the source node typically sends two or more copies of a particular message over two or more redundant and independent data transmission networks. Such a redundant data transmission network may ensure high availability of message transmission functions. Examples of safety-related networks include aircraft data networks in aeronautical engineering, such as avionics full duplex switched Ethernet (AFDX). An aircraft data transmission network is deployed on board an aircraft for supporting data exchange between various systems onboard the aircraft. For aircraft safety reasons, the data transmission network of an aircraft needs to have high availability.
It is currently by providing two separate data transmission networks that ensure high availability of data transmission functions of the aircraft, which increases the equipment, wiring, weight, power consumption and cost required on board the aircraft.
Disclosure of Invention
Embodiments of the present disclosure provide a scheme for providing high data availability in a data transmission network.
In a first aspect, example embodiments of the present disclosure provide a method. The method includes receiving, at a node of a network, a first copy of a message from an upstream node in the network. The method further includes searching at the node for an identity associated with the message that has been received. The method further includes processing forwarding of the first copy of the message to at least one downstream node based on the search.
In a second aspect, example embodiments of the present disclosure provide a network node. The network node includes a transceiver for receiving a first copy of a message from an upstream node in the network. The network node further comprises a controller configured to search at the node for an identification associated with the message that has been received, and to process forwarding of the first copy of the message to at least one downstream node based on the search.
In a third aspect, example embodiments of the present disclosure provide a network. The network comprises a set of nodes including at least a first network node according to the second aspect and a second network node according to the second aspect. The network further includes a source node connected to at least two nodes of the set of nodes and configured to simultaneously provide a first copy and a second copy of the message to the two nodes, respectively. The network further includes a destination node connected to at least two nodes of the set of nodes.
According to example embodiments of the present disclosure, equipment overhead and line weight on a spacecraft may be advantageously saved as compared to the prior art. Other advantages of the example embodiments of the present disclosure will become more apparent from the following description.
Drawings
The above and other objects, features and advantages of the exemplary embodiments of the present disclosure will become more apparent by describing the exemplary embodiments of the present disclosure in more detail with reference to the attached drawings. Several example embodiments of the present disclosure will be illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings, in which:
FIG. 1 illustrates a block diagram of a conventional implementation of high availability data transmission over multiple independent redundant networks;
fig. 2 illustrates a block diagram of implementing high availability data transmission over a single network in accordance with an embodiment of the present disclosure;
fig. 3A to 3C are schematic diagrams illustrating examples of propagation paths in the network of fig. 2 according to embodiments of the present disclosure;
fig. 4 is a block diagram of the network node of fig. 2, according to an embodiment of the present disclosure; and
fig. 5 is a flowchart of a method for providing data transmission according to an embodiment of the present disclosure.
Like or corresponding reference numerals indicate like or corresponding parts throughout the several views of the drawings.
Detailed Description
The principles of the present disclosure will be described below with reference to several example embodiments shown in the drawings. It should be understood that these embodiments are merely described to enable those skilled in the art to better understand and to practice the exemplary embodiments of the present disclosure and are not intended to limit the scope of the present disclosure in any way.
The term "comprising" and variations thereof as used herein means open ended, i.e., "including but not limited to. The term "or" means "and/or" unless specifically stated otherwise. The term "based on" means "based at least in part on". The terms "one example embodiment" and "one embodiment" mean "at least one example embodiment. The term "another embodiment" means "at least one additional embodiment". The terms "first," "second," and the like, may refer to different or the same object.
In conventional safety-relevant networks, high availability data transmission is achieved through multiple independent redundant networks, taking the existing aircraft data network avionics full duplex switched ethernet as an example. Fig. 1 shows a conventional data transmission network 100 having two independent redundant subnetworks for providing two independent transmission paths for messages. As shown, two independent subnetworks 110 and 120 are deployed between source node 102 and destination node 104. Each of the subnetworks 110 and 120 may include a plurality of nodes. For example, as shown in fig. 1, sub-network 110 includes four nodes 112, 114, 116, and 118 connected to each other, and sub-network 120 also includes four nodes 122, 124, 126, and 128 connected to each other.
The source node 102 wants to send a message to the destination node 104. For availability reasons, source node 102 generates two copies of the message, e.g., message copy #1 and message copy #2. Each of these two copies may be transmitted to destination node 104 through sub-networks 110 and 120 alone. Nodes in each of the subnetworks 110 and 120 may be configured with static routing tables for messages of a particular type. The routing table on the node may include node-to-node routing rules that specify to which node the message is to be forwarded. Thus, according to the configured static routing table, node 112 in subnetwork 110 forwards message copy #1 to next node 116, and then node 116 forwards to destination node 104; node 122 in subnetwork 120 forwards message copy #2 to next node 126, and node 126 forwards to destination node 104
As shown, message copy #1 may reach destination node 104 through nodes 112 and 116 on path 132 of subnetwork 110. Message copy #2 may reach destination node 104 through nodes 122 and 126 on path 134 of sub-network 120. This redundancy of message propagation may ensure that: at least one copy of the message may be transmitted to the destination node 104 even if some of the nodes or links on one of the paths 132 and 134 fail.
Redundant network deployment, however, results in more equipment and wiring requirements, which thus increases cost and space occupation.
To at least partially address the above-mentioned problems, as well as other potential problems, embodiments of the present disclosure propose a data transmission network that achieves a particular availability without requiring redundant network deployment. In general, a node in the network is not configured with a static routing table, but rather broadcasts a received message to one or more nodes connected thereto, excluding upstream nodes that send the message to that node. To avoid flooding of traffic within the network, a node determines whether another copy of the message has been received and broadcast before broadcasting the current message, the node performing a broadcast operation only if it is determined that the node does not have any copies of the message received and broadcast; if the node has received and broadcast other copies of the message, the received message is directly discarded. Thus, the node will not repeatedly forward multiple copies of the message. The network comprises a plurality of such nodes. By means of conditional broadcast mechanisms in the network nodes, a single network is able to transmit multiple copies of a message to a destination node over different independent paths, thus achieving a high availability of data transmission functionality.
Fig. 2 illustrates a data transmission network 200 according to an embodiment of the present disclosure. As shown, network 200 includes a plurality of network nodes (four nodes in this example) 210-1, 210-2, 210-3, and 210-4 (collectively or individually referred to as node 210). The nodes 210 and the connections between them constitute a data transmission network and are responsible for data transmission between the source node 202 and the destination node 204. In an embodiment, one node 210 may be connected to two or more other nodes 210. The connection between two nodes 210 may be a bi-directional connection as shown, or in some other examples may be a unidirectional connection.
To ensure high availability of data transfer functions to be in network 200, source node 202 provides two or more copies of a message simultaneously, each of which may be forwarded to destination node 204 via a separate transmission path comprised of one or more nodes 210. As used herein, independent transmission path (or independent path) means: none of the nodes 210 on that path are shared with other paths. That is, there is no node 210 in common within two independent transmission paths. Under such constraints on independent paths, source node 202 connects to at least two nodes 210 to provide a copy of one message to each of the connected nodes 210. The destination node 204 is also connected to at least two nodes 210 in order to receive copies of the message from the different connected nodes 210.
The number of nodes 210 to which the source node 202 or destination node 204 is connected depends on the level of redundancy required for the message to be transmitted (the number of copies to be provided by the source node 202). In the example of FIG. 2, source node 202 is connected to node 210-1 and node 210-2 and provides message copy #1 to connected node 210-1 and message copy #2 to connected node 210-2. Two copies of the message may be forwarded by nodes 210-1 and 210-2, respectively, to other nodes 210 and ultimately to destination node 204. Depending on the deployment and connection of node 210, source node 202, and destination node 204 in network 200, there may be multiple paths for propagating one message.
Table 1, given below, lists some of the possible paths from source node 202 to destination node 204 based on the deployment and connection of fig. 2. For example, a possible path 1 indicates that one copy of a message may be passed from source node 202 to node 210-1, forwarded by node 210-1 to node 210-3, and then forwarded by node 210-3 to destination node 204. It should be appreciated that there are some other possible paths in the network 200. Some of these paths are independent of each other (such as path 1 and path 4), but some paths may not be independent of each other (such as path 1 and path 2).
Table 1 list of possible paths in network 200
In the following description, for purposes of illustration, for a node in a path (including source node 202) that sends a message to other nodes, then that node is an upstream node of the other nodes, hereinafter referred to as the upstream node; all nodes that accept the message, including the destination node 204, are downstream nodes of the node, hereinafter referred to as downstream nodes. For example, in Path 1 of Table 1, source node 202 is an upstream node of node 210-1, node 210-1 is an upstream node of node 210-3, and node 210-3 is an upstream node of destination node 204; destination node 204 is a downstream node of node 210-3, node 210-3 is a downstream node of node 210-1, and node 210-1 is a downstream node of source node 202.
According to embodiments of the present disclosure, a node 210 dynamically broadcasts a received message to one or more other nodes 210 or destination nodes 204 connected thereto. With such dynamic broadcasting, message copy #1 and message copy #2 may be sent to destination node 204 via multiple independent paths among all possible paths in network 200. The dynamic broadcast mechanism of node 210 will be described in detail below by way of example.
Assume that node 210-1 and node 210-2 receive message copy #1 and message copy #2, respectively, from its upstream node (source node 202). Nodes 210-1 and 210-2 may broadcast copies of the received messages to their associated nodes (210-1 to 210-2, 210-1 to 210-3, 210-1 to 210-4;210-2 to 210-1, 210-2 to 210-3, 210-2 to 210-4), respectively. Such broadcasting is performed under certain conditions because if node 210 broadcasts messages it receives directly to all nodes connected to it, then traffic flooding will occur in network 200. In an embodiment of the present disclosure, the first condition is that node 210 can forward a message to an attached downstream node, but cannot forward to an upstream node that sent the message to that node.
Another condition is that node 210 needs to check whether the received message has been previously received and if so, discard it directly in order to avoid repeated forwarding of the same message to downstream nodes. More specifically, node 210-1 receiving message copy #1 may search for an identification associated with the message. The identification may include an indicator for indicating the message. Such an indicator may be carried in or identified from a copy of the message (different copies of the same message are identical in identity) and the identity of the received message is stored by node 210. In this particular example, node 210-1 did not find the identity associated with the message, meaning that any other copy of the message has not been received by node 210-1. In this case, node 210-1 records the identity of the message currently received and forwards the message copy #1 to downstream nodes 210-2, 210-3 and 210-4.
At node 210-2, it is assumed that message copy #2 from source node 202 arrives earlier than message copy #1 from upstream node 210-1. Node 210-2 determines that any other copy of the message has not been received by node 210-2 by searching for the identity associated with the message, and then processes received message copy #2 in a similar manner to node 210-1 (node 210-2 records the identity of the message currently received and forwards the message copy #2 to downstream nodes 210-1, 210-3, and 210-4).
After forwarding message copy #2, node 210-2 receives message copy #1 broadcast by node 210-1. Node 210-2 searches for and finds the identity associated with the message. Thus, node 210-2 determines that the message has been previously received. In this case, node 210-2 may discard message copy #1. Node 210-1 also performs a similar process for message copy #2 received from node 210-1. Nodes 210-3 and 210-4 may also process received message copy #1 and message copy #2 in a similar manner to nodes 210-1 and 210-2, and finally the destination node may receive the message from nodes 210-3 and 210-4, respectively.
Destination node 204 may receive one message copy #1 and one message copy #2, or may receive two message copies #1, or two message copies #2. If more than one copy of the message is received, destination node 204 may perform redundancy management on the received copies, discarding one of the copies.
As will be appreciated from the above example embodiments, node 210 processes forwarding of received messages by: only the first received message is broadcast and any copies of the same message received after it are discarded. The time at which the message copy arrives at node 210 depends on respective factors such as the workload of node 210, the processing power of node 210, the transmission rate of the node connection, the faults that node 210 or node connection may encounter, and so on. The time-of-arrival based broadcast rules not only ensure that different copies of a message are broadcast over different independent paths, but also enable transmission using relatively fast ones of all possible paths in the network 200.
In some embodiments of the present disclosure, some additional rules may be applied when node 210 determines how to forward a copy of a message. In one embodiment, if node 210 is connected to two or more downstream nodes, node 210 may forward a message copy (message copy #1 or message copy # 2) to one or more downstream nodes that are closer to destination node 204 from a transmission perspective.
Taking node 210-2 as an example, if the node receives message copy #2 and decides to forward the copy, node 210-2 may forward message copy #2 to one or more downstream nodes having a relatively short distance based on the distance of each of the connected downstream nodes 210-1, 210-3, 210-4 to destination node 204 in order to reduce the transmission time of the message, enabling the message to reach destination node 204 faster.
In one example, the distance may be represented by the number of hops from nodes 210-1, 210-3, and 210-4 to the destination node. For example, there are two hops from node 210-1 to destination node 204, and one hop from nodes 210-3 and 210-4 to the destination node. In some other examples, the distance may also be expressed in some other way, such as taking into account the transmission rate of the connection between nodes 210 and destination node 204.
Because node 210-1 is farther from destination node 204 than nodes 210-3 and 210-4 are from destination node 204, node 210-2 may not forward message copy #2 to node 210-1. In some embodiments, node 210-2 may forward message copy #2 to one or both of downstream nodes 210-3 and 210-4. In some other examples, node 210-1 may send message copy #1 to only one or two of downstream nodes 210-3 and 210-4, depending on the distance from downstream nodes 210-2, 210-3, and 210-4 to destination node 204.
According to embodiments of the present disclosure, multiple copies of a message can be forwarded through different, independent transmission paths within a single network, as mentioned above, which may reduce overhead of network construction (as compared to redundant networks) and still obtain high availability of data transmission functionality. By applying different forwarding rules on the nodes, different copies of the message can be quickly transmitted to the destination node. Fig. 3A shows an example of different propagation paths in the network 200. As shown, there are two independent paths 222 and 224 in network 200 for propagating message copy #1 and message copy #2, respectively, under normal conditions with no failure or overload on node 210. In this case, destination node 204 receives two copies of the message.
Furthermore, the dynamic forwarding mechanism of node 210 may exhibit high fault tolerance because node 210 is always able to automatically forward messages over fast and available paths. Thus, upon failure of one or more nodes 210 and/or failure of one or more connections between nodes 210 and source node 202 or between nodes 210 and destination node 204, one or more copies of the message can still be automatically forwarded through the non-failed node and the non-failed connection.
Fig. 3B and 3C illustrate examples of propagation paths in some cases where certain nodes or connection failures occur in the network 200. As shown in fig. 3B, when nodes 210-1 and 210-4 fail, network node 200 is still able to forward one copy of the message (message copy # 1) from source node 202 to destination node 204 over path 222. In the example of FIG. 3C, in the severe case of failure of the connections of source node 202 to node 210-2, node 210-2 and node 210-3, node 210-1 and node 210-4, and node 210-4 to destination node 204, one copy of the message can still be transmitted over path 226.
In embodiments of the present disclosure, transmitting different copies of a message in a single network does not introduce extra large transmission delays in each case. For example, two more intermediate nodes 210 are in the relatively long path 226 of FIG. 3C, but only a very small additional delay is introduced by one more intermediate node 210, as compared to the shorter paths 222 and 224 of FIG. 3A. This introduced delay does not cause a significant increase in the normal end-to-end delay (delay from source node 202 to destination node 204). For example, assuming nodes 210 each have 24 ports and are connected to each other via a 1Gbps rate link, path 226 may add an additional 0.3ms delay, while the normal end-to-end delay is about 100ms. Furthermore, because the maximum number of nodes 210 in the network 200 for transmission is fixed, the boundary deterministic nature of the network 200 can be maintained.
In embodiments of the present disclosure, due to the dynamic forwarding characteristics of node 210, no routing tables need to be configured on node 210. Thus, a switching network made up of nodes 210 connected to each other can be easily deployed between any source node and destination node for data transmission without requiring a specific configuration. It is generally only necessary to configure a connection between a source node and two or more nodes 210 and to configure a connection between a destination node and two or more nodes 210.
In the above description, node 210 automatically and dynamically forwards received messages over two or more independent paths. In some other embodiments, to provide duplicate copies of a message in a single network 200, node 210 may be configured with a static routing table that specifies two or more independent paths for a particular type of message. In this way, the component overhead of the network 200 may still be reduced.
It should be appreciated that although network 200 is shown as including four nodes 210, in some other embodiments network 200 may include more or fewer nodes 210. In some examples, only two nodes 210 are possible as long as the connections of node 210, source node 202, and destination node 204 are capable of providing two or more independent paths for data transmission. In the embodiments discussed above, all nodes 210 deployed in the network 200 have a dynamic broadcast (forwarding) mechanism. In some other embodiments, some nodes 210 may be configured with static routing tables that ensure that different copies of a message are forwarded over different independent paths.
Further, it is to be understood that although only one source node 202 is shown connected to node 210, two or more source nodes 202 may be connected to different nodes 210 and provide different messages, depending on the actual implementation. Copies of the message may also be forwarded to two or more destination nodes 204, and thus these destination nodes 204 are also connected to node 210 accordingly. Source node 202 or destination node 204 is the source or destination of the particular message in the illustrated example. In some other examples, node 204 may desire to transmit a message to node 202 over a switching network comprised of node 210. In this case, node 204 may be considered the source node of the message and node 202 may be considered the destination node of the message.
Based on the forwarding function, node 210 may also be referred to as a switch. Node 210 may be deployed in any security-related network. In some embodiments, node 210 may be used in an aircraft data network, such as avionics full duplex switched Ethernet (AFDX). In an aircraft data network embodiment, source node 202 and destination node 204 may comprise any devices on an aircraft that require data exchange. For example, source node 202 and/or destination node 204 may include actuators, input/output gateways, various types of sensors, and so forth.
Fig. 4 shows a block diagram of node 210 according to an embodiment of the present disclosure. As shown, node 210 includes a transceiver 212 and a controller 214. Transceiver 212 receives and transmits messages. The controller 214 is configured to process a message received from an upstream node, determine whether to forward the message to one or more downstream nodes, and if it is decided to forward the message, control the transceiver 212 to perform forwarding. In some embodiments, node 210 may also include a plurality of input/output ports (not shown) for connecting with input/output ports of other nodes to receive and/or forward messages.
Fig. 5 illustrates a flow chart of a method 500 for providing data transmission according to an embodiment of the present disclosure. Method 500 may be implemented by node 210. As shown, at block 510, a message is received at node 210 from an upstream node in the network. In some embodiments, the upstream node may include a source node that provides a first copy of the message and a second copy of the message (message copy #1 and message copy #2 of fig. 2). At block 520, an identification associated with the received message is searched at node 210. At block 530, different processing occurs at node 210 according to the search results of 520.
In some embodiments, processing the received message based on the search results may include: the method includes not finding an identity associated with the received message at the node, storing the identity associated with the received message at the node, and forwarding the received message to all or a portion of the downstream nodes.
In some embodiments, processing the received message based on the search results may include: the identity associated with the received message is found at the node, the message is discarded directly at the node, and the received message is not forwarded to any downstream node.
In some embodiments, processing the received message based on the search results may include: no identification associated with the received message is found on the node, a first distance from the first downstream node to the message destination node and a second distance from the second downstream node to the destination node; if the first distance is shorter than the second distance, forwarding the message only to the first downstream node; if the first distance is longer than the second distance, the message is forwarded only to the second downstream node.
It should be appreciated that the components of node 210 may be hardware modules or software cell modules. For example, in some embodiments, a node may be implemented in part or in whole as software and/or hardware, such as a computer program product embodied in a computer readable medium. Alternatively or additionally, a node may be implemented in part or in whole on hardware, such as an Integrated Circuit (IC), an Application Specific Integrated Circuit (ASIC), a system on a chip (SOC), a Field Programmable Gate Array (FPGA), or the like. The scope of the present disclosure is not limited in this respect.
In general, the various example embodiments of the disclosure may be implemented in hardware or special purpose circuits, software, logic or any combination thereof. Some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or other computing device. While aspects of the example embodiments disclosed herein are illustrated or described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that the blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination of the foregoing.
Moreover, blocks of the flowchart may be considered as method steps, and/or operations generated by operation of computer program code, and/or as a plurality of coupled logic circuit elements performing the relevant functions. For example, embodiments disclosed herein include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program containing program code configured to implement the methods described above.
Within the context of this disclosure, a machine-readable medium may be any tangible medium that can contain, or store a program for or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination thereof. More detailed examples of a machine-readable storage medium would include an electrical connection with one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
Computer program code for carrying out the methods disclosed herein may be written in one or more programming languages. These computer program code may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the computer or other programmable data processing apparatus, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the computer, partly on the computer, as a stand-alone software package, partly on the computer and partly on a remote computer or entirely on the remote computer or server. Program code may be distributed throughout specially programmed devices, which may be generally referred to herein as "modules". The software component portions of these modules may be written in any particular computer language and may be part of a monolithically integrated code base, or may be developed as a plurality of discrete code portions, such as typically developed in an object-oriented computer language. Furthermore, the modules may be distributed across multiple computer platforms, servers, terminals, mobile devices, etc. A given module may even be implemented such that the described functions are performed by a single processor and/or computer hardware platform.
In addition, although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In some cases, multitasking and parallel processing may be beneficial. Likewise, although the foregoing discussion contains certain specific implementation details, this should not be construed as limiting the scope of the subject matter or claims disclosed herein, but rather as describing features that may be directed to particular embodiments. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
Various modifications, changes to the foregoing example embodiments disclosed herein will become apparent to those skilled in the relevant art upon review of the foregoing description, along with the accompanying figures. Any and all modifications will still fall within the scope of the example embodiments described herein, without limitation. Furthermore, other embodiments set forth herein will be apparent to those of skill in the art to which the foregoing description and drawings pertains from consideration of the specification and drawings.
It is to be understood that the embodiments of the disclosure are not to be limited to the specific embodiments disclosed and that modifications and other embodiments are intended to be within the scope of the appended claims. Although specific terms are employed herein, they are used in a generic and descriptive sense only and not for purposes of limitation.
Claims (11)
1. A method of implementing a high availability aircraft data network with a single network, comprising:
receiving, at a node of the network, a message sent from an upstream node;
searching at the node for an identity associated with the message; and processing the message based on the search results;
wherein processing the message based on the search results comprises:
in response to determining that the identity associated with the message is not found on the node, storing the identity associated with the message at the node and forwarding the message to all downstream nodes, wherein the downstream nodes are all other nodes of all other nodes connected to the node except the upstream node that sent the message.
2. The method of claim 1, wherein processing the message based on the search results comprises:
in response to finding an identity associated with the message at the node, discarding the message at the node without forwarding the message to any downstream node.
3. The method of claim 1, wherein the identity associated with the message is extracted directly from the message and the identity extracted from a different copy of the message is the same, the node storing the identity associated with the message only the first time the message is received.
4. The method of claim 1, wherein the downstream nodes comprise at least a first downstream node and a second downstream node, and the method of processing the message comprises:
responsive to determining that the identity associated with the message is not found on the node, determining a first distance from the first downstream node to a destination node of the message and a second distance from the second downstream node to the destination node;
forwarding the message to the first downstream node in response to determining that the first distance is shorter than the second distance; and
the message is forwarded to the second downstream node in response to determining that the first distance is longer than the second distance.
5. The method of claim 1, wherein the upstream node comprises a source node that provides a first copy of the message and a second copy of the message.
6. A network node, comprising:
a transceiver for receiving a message from an upstream node in the network; and
a controller configured to:
searching, at the node, for an identity associated with the received message;
processing the message based on the search results; and
in response to determining that the identity associated with the message is not found on the node, causing the transceiver to forward the message to all downstream nodes, wherein the downstream nodes are all other nodes of all other nodes connected to the node except the upstream node that sent the message.
7. The network node of claim 6, wherein the controller is configured to discard the message and not forward the message to the downstream node in response to finding the identity associated with the message at the node.
8. The network node of claim 7, wherein the identity associated with the message is extracted from the message and the identity extracted from a different copy of the message is the same, the node storing the identity associated with the message only when the message is first received.
9. The network node of claim 7, wherein the downstream nodes comprise at least a first downstream node and a second downstream node, and the controller is configured to:
responsive to determining that the identity associated with the message is not found on the node, determining a first distance from the first downstream node to a destination node of the message and a second distance from the second downstream node to the destination node;
responsive to determining that the first distance is shorter than the second distance, causing the transceiver to forward the message to the first downstream node; and
in response to determining that the first distance is longer than the second distance, causing the transceiver to forward the message to the second downstream node.
10. The network node of claim 7, wherein the upstream node comprises a source node that provides a first copy of the message and a second copy of the message.
11. A network, comprising:
a set of nodes comprising at least a first network node and a second network node, the first network node and the second network node being network nodes according to any of claims 6 to 10;
a source node connected to at least two nodes of the set of nodes and configured to simultaneously provide a first copy and a second copy of a message to the two nodes, respectively; and
a destination node is connected to at least two nodes of the set of nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311726263.6A CN117715094A (en) | 2018-07-13 | 2018-07-13 | Method, network and network node for realizing high-availability aircraft data network by using single network |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311726263.6A CN117715094A (en) | 2018-07-13 | 2018-07-13 | Method, network and network node for realizing high-availability aircraft data network by using single network |
| CN201810770878.1A CN110719186A (en) | 2018-07-13 | 2018-07-13 | Data transmission with high availability |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810770878.1A Division CN110719186A (en) | 2018-07-13 | 2018-07-13 | Data transmission with high availability |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117715094A true CN117715094A (en) | 2024-03-15 |
Family
ID=69208553
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810770878.1A Pending CN110719186A (en) | 2018-07-13 | 2018-07-13 | Data transmission with high availability |
| CN202311726263.6A Pending CN117715094A (en) | 2018-07-13 | 2018-07-13 | Method, network and network node for realizing high-availability aircraft data network by using single network |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810770878.1A Pending CN110719186A (en) | 2018-07-13 | 2018-07-13 | Data transmission with high availability |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN110719186A (en) |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040059615A1 (en) * | 2002-09-19 | 2004-03-25 | Byrer Loralie A. | System and method for planning and executing an engineering change |
| CN101184037B (en) * | 2007-10-31 | 2010-06-02 | 北京航空航天大学 | Probability effective broadcast coefficient based flooding method |
| US8817596B2 (en) * | 2009-01-09 | 2014-08-26 | Futurewei Technologies, Inc. | Protecting ingress and egress of a label switched path |
| CN101729230A (en) * | 2009-11-30 | 2010-06-09 | 中国人民解放军国防科学技术大学 | Multiplexing route method for delay tolerant network |
| CN102215542A (en) * | 2011-06-07 | 2011-10-12 | 西安理工大学 | Communication method of ultraviolet light wireless sensor network |
-
2018
- 2018-07-13 CN CN201810770878.1A patent/CN110719186A/en active Pending
- 2018-07-13 CN CN202311726263.6A patent/CN117715094A/en active Pending
Also Published As
| Publication number | Publication date |
|---|---|
| CN110719186A (en) | 2020-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6282669B1 (en) | Ethernet communication redundancy method | |
| CN101189837B (en) | Packet ring network system, packet transfer method, and node | |
| CN106899430B (en) | Traffic forwarding processing method and device | |
| CN102106121A (en) | Ring coupling nodes for high availability networks | |
| US8780701B2 (en) | Communication apparatus and packet distribution method | |
| CN112751697B (en) | Network topology discovery method and node equipment | |
| CN108123901B (en) | Message transmission method and device | |
| US4855993A (en) | Method and apparatus for detecting a fault in a ring network data transmission system | |
| US8737412B2 (en) | Network relay system and method of automatically setting a network relay system | |
| EP2966819B1 (en) | Method and apparatus for forwarding traffic of switching system | |
| US8620639B2 (en) | Simulation or test system, and associated method | |
| EP2355419B1 (en) | Switching device of dual-port ethernet system | |
| CN117715094A (en) | Method, network and network node for realizing high-availability aircraft data network by using single network | |
| CN117118497A (en) | Controller and gateway joint deployment method suitable for satellite-ground integrated network | |
| CN110661703A (en) | Method and device for realizing fast rerouting | |
| WO2022105325A1 (en) | Rerouting method, communication apparatus and storage medium | |
| US20170317923A1 (en) | Method for quick reconfiguration of routing in the event of a fault in a port of a switch | |
| US9118546B2 (en) | Data forwarding method and router | |
| EP2871805B1 (en) | Data network, aircraft or spacecraft, and method | |
| JP2002538717A (en) | Information distribution equipment and network failure management process | |
| US20040081190A1 (en) | Router redundancy system and method | |
| CN111565140A (en) | Distributed aeronautical communication middleware capable of simultaneously supporting CAN bus and Ethernet | |
| JP3261141B2 (en) | Detour route setting method | |
| JP5776978B2 (en) | Network relay system and network relay system automatic setting method | |
| CN111917637B (en) | Data message sending method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |