KR102271947B1 - Method for automatic route configuration in Dual-path network - Google Patents

Abstract

A method for automatically setting the shortest path between the nodes of the source and destination by using header information of the dual path Ethernet frame is provided. An automatic path setting method according to an embodiment of the present invention comprises: a first step of configuring a path table while transmitting and receiving messages between a first node and a second node constituting a dual path network; and a second step of configuring, by the third node constituting the dual path network, its own path table using messages transmitted and received between the first node and the second node. Accordingly, it is possible to transfer data quickly without consuming a separate process for identifying the shortest path and delay time accordingly, and it is possible to reduce the bandwidth consumed for performing the Auto-Configuration Mechanism. In addition, there is no inconvenience of having to perform the Auto-Configuration Mechanism again in the event of a failure, so that recovery from the failure can be performed more quickly.

Description

{Method for automatic route configuration in Dual-path network}

The present invention relates to a communication method suitable for a dual path, and more particularly, it uses the header information of an Ethernet frame of a network that has a dual path and arrives at a destination via a neighbor node to determine the shortest path between the source and destination. How to set it automatically.

In industrial fields that require high reliability, such as aircraft, railways and smart factories, the required performance of data buses to control numerous electronic systems has increased.

In particular, protocols such as High-availability Seamless Redundancy (HSR) or AeroRing based on Ethernet technology with excellent reliability and convenience have been developed.

However, since the nodes in the ring transmit data in both directions for Seamless Redundancy, HSR has a disadvantage in that it cannot provide the shortest path for data transmitted only in one direction due to its low importance.

In addition, AeroRing transmits high-priority data in both directions according to the importance of data or Quality of Service (QoS), but data with low importance is not transmitted in both directions, but only in one direction. Before sending data, it goes through a special process.

In a process called Auto-Configuration Mechanism, the gateway sends a control message with its own address to the ring, and each node that receives this message adds and forwards its own address. address information is included, and the shortest path can be identified by sending it back to all nodes in the ring and sharing the ring information.

That is, since AeroRing must always perform this Auto-Configuration Mechanism process in order to know the shortest path, there is an inconvenience that a delay time for this occurs.

Therefore, it is required to find a way to quickly transfer data by identifying the shortest path without a separate process, and without consuming a delay time for identifying the shortest path.

The present invention has been devised to solve the above problems, and an object of the present invention is to automatically set the shortest path between the node of the source and destination using header information of an Ethernet frame of a network having a dual path, An object of the present invention is to provide an automatic path setting method in a dual path network that can transmit data quickly without consuming a separate process for identifying the shortest path and delay time accordingly.

According to an embodiment of the present invention for achieving the above object, an automatic path setting method includes: a first step of configuring a path table while transmitting and receiving messages between a first node and a second node constituting a dual path network; and a second step of configuring, by the third node constituting the dual path network, its own path table using messages transmitted and received between the first node and the second node.

In addition, the third node may record the shortest path between itself and the first node and the second node in its own path table.

In addition, each node can search its own route table before sending a message, and use the shortest route found when sending a message.

And in the first step, the first node can transmit the message in both directions.

In addition, in the first step, the second node responds to the first node through a specific direction port through which a message was first received among the bidirectional ports, and a path using the specific direction port is set as the shortest path between the first node and the second node. You can write to your own route table.

And in the first step, the first node searches its own route table before sending the message, and if there is no shortest route between the searched first node and the second node, the message can be transmitted in both directions.

Also, in the first step, the second node searches for the shortest path between the first node and the second node when a message is received through a specific direction port among the bidirectional ports, and if there is no shortest path to be searched, the message arrives A port can be written to its own route table as the shortest route.

And in the first step, when the second node receives a message through a specific direction port among the bidirectional ports, the duplicate message arriving through the opposite direction port may be skipped.

In addition, in the second step, the third node may record the path of the message passing through it in its own path table.

In addition, in each route table, information on whether a transmission message and a response message are received through a bidirectional port as well as a destination and a forwarding direction corresponding to the path of the message are recorded together, so that the third node is connected to the first node and the second node. If only one of the nodes receives the transmission message and the other node does not receive the response message, it is possible not to configure its own route table using the message.

In addition, in the second step, when a response message passes through itself, the third node may record whether the response message has passed by matching the path of the message.

In the second step, the third node may delete the message path from its own path table when the message path is not recorded as traversed by the matching response message within a certain period of time after the message path is recorded.

In addition, the message may be a message set to be transmitted unidirectionally along the shortest path when the priority is low and the shortest path is set.

On the other hand, according to another embodiment of the present invention, the automatic path setting system, provided in the third node disposed between the first node and the second node constituting the dual path network, the communication unit for transmitting and receiving a message; and a processor that is provided in the third node and configures its own route table by using the transmitted and received messages.

In addition, according to another embodiment of the present invention, a computer-readable recording medium having a program recorded therein may include: a first step of configuring a route table while transmitting and receiving messages between a first node and a second node constituting a dual-path network; and a second step in which the third node constituting the dual path network configures its own path table using messages transmitted and received between the first node and the second node.

And, according to another embodiment of the present invention, the automatic path setting method includes: searching, by a node constituting a dual path network, its own path table before transmitting a received message to another node; and if the shortest path is not found in the own path table, after the message is transmitted through the bidirectional port, recording the path using the specific direction port from which the response message is received as the shortest path in the own path table. .

In addition, according to another embodiment of the present invention, the automatic path setting system is provided in a node constituting a dual path network, the bidirectional port is provided, the communication unit for transmitting and receiving a message; and before sending the received message to another node, it searches its own route table, and if the shortest route is not found in its own route table, after the message is sent, a route using a specific direction port through which the response message is received and a processor that records the shortest path in its own path table.

As described above, according to the embodiments of the present invention, data can be transferred quickly without consuming a separate process for identifying the shortest path and a corresponding delay time, and the Auto-Configuration Mechanism is consumed. bandwidth can be reduced.

In addition, according to the embodiments of the present invention, there is no inconvenience of performing the Auto-Configuration Mechanism again in the event of a failure, so that the repair of the failure can be performed more quickly.

1 is a flowchart provided to explain an automatic route setting method according to an embodiment of the present invention;
2 to 4 are views provided for explanation of the process of constructing the shortest route table;
5 to 6 are diagrams provided for explanation of the process of configuring the shortest path table of the third node;
7 to 8 are diagrams provided to explain the process of verifying and deleting the shortest path table of the third node;
9 is a view provided for the description of an automatic route setting system according to an embodiment of the present invention, and
10 is a flowchart provided to explain an automatic route setting method according to another embodiment of the present invention.

Hereinafter, the present invention will be described in more detail with reference to the drawings.

1 is a flowchart provided to explain an automatic path setting method according to an embodiment of the present invention, and FIGS. 2 to 4 are views provided to explain a process of constructing a shortest path table.

As described above, each node constituting the dual path network transmits data with low priority or importance unidirectionally. Therefore, it is necessary to set the shortest path for rapid data transfer.

The automatic path setting method according to an embodiment of the present invention automatically sets the shortest path between the nodes of the sender and the destination using header information of the Ethernet frame of the dual path, a separate process for identifying the shortest path, and Data can be transferred quickly without consuming delay time.

To this end, the first node 10-1 and the second node 10-2 constituting the dual-path network configure a route table while transmitting and receiving messages Msg, and configure the dual-path network, but include the first A third node 10-3 provided between the node 10-1 and the second node 10-2 transmits and receives a message transmitted and received between the first node 10-1 and the second node 10-2. By using it, it is possible to configure its own route table Ta3.

Each node may record the shortest path between itself and another node constituting the dual path in its own path table.

In this case, the third node 10-3 may record the route of the message passing through it in its route table, and automatically set the shortest route even if it is not the source or destination of the message. That is, the third node 10-3 records the path of the message passing through it in its own path table Ta3, and records itself and the first node 10-1 and the first node 10-1 in its own path table Ta3. / Alternatively, the shortest path between itself and the second node 10 - 2 may be recorded.

In addition, each node constituting the dual path network may search its own path table before transmitting a message, and use the searched shortest path when transmitting the message.

Therefore, before transmitting the message, the first node 10-1 searches its own route table, and if there is no shortest route between the first node 10-1 and the second node 10-2 to be searched, , as illustrated in FIG. 2 , it is possible to transmit a message in both directions (S110).

2 to 4 , when the first node 10-1 is T1 as the source of the message and the second node 10-2 is T3 as the destination of the message, T2 is the third node ( 10-3) can be

Here, bidirectional means clockwise (cw) and counterclockwise (ccw), and when a message has a low priority and a shortest path is set, it may be a message set to be transmitted in one direction along the shortest path.

When the first node 10-1 transmits a message in both directions (S110), the third node 10-3 receives the message through a port in a specific direction among ports provided in both directions, The route may be recorded in its own route table Ta3 (S120), and a message may be transmitted to the second node 10-2 (S130).

As illustrated in FIG. 3 , the second node 10-2 uses the shortest path between the first node 10-1 and the second node 10-2 using a specific direction port through which a message was first received among the bidirectional ports. A route may be recorded in its own route table (S140), and first, it may respond to the third node 10-3 through a specific direction port through which the message is received (S150).

For example, the second node 10-2 searches for a shortest path between the first node 10-1 and the second node 10-2 when a message is received through a specific direction port among the bidirectional ports. and, if there is no shortest path to be searched, the port to which the message arrived can be recorded in its own path table as the shortest path.

In this case, when the shortest path is searched for, the second node 10 - 2 transmits a response message (Reply) in only one direction through the searched shortest path.

In addition, when a message is received through a specific direction port among the bidirectional ports, the second node 10 - 2 may skip a duplicate message arriving through the opposite direction port.

Specifically, as illustrated in FIG. 3 , T4, T5, T6, T7, T8, T9, and T10 may also receive a message from the first node 10-1, but T4, T5, T6, T7, T8, Since data transmitted through T9 and T10 arrives at the second node 10-2 later than data transmitted through T2, it is processed as a duplicate message and skipped.

The third node 10-3 receives the response message from the second node 10-2, and responds to the message path (the path of the port in the direction in which the message was received) with the path of the port in the direction in which the response message was received. By matching the message path, the shortest path may be recorded (S160), and the received response message may be transmitted to the first node 10-1 (S170).

On the other hand, the first node 10-1 receives the response message transmitted from the second node 10-2 through the third node 10-3 as illustrated in FIG. A path using the port in the direction may be recorded as the shortest path (S180).

5 to 6 are diagrams provided to explain the process of configuring the shortest path table of the third node 10-3, and FIGS. 7 to 8 are views provided by verifying the shortest path table of the third node 10-3. It is a diagram provided for the description of the deletion process.

As illustrated in FIGS. 5 to 8 , information on whether a transmission message and a response message are received through a bidirectional port and a destination and forwarding direction corresponding to a path of a message may be recorded together in each path table.

Through this, the third node 10-3 records the route of the message passing through it in its route table, and can automatically set the shortest route even if it is not the source or destination of the message.

That is, the third node 10-3 records the path of the message passing through it in its own path table, and records itself and the first node 10-1 and/or itself and the second node in its own path table. The shortest path between the nodes 10-2 may be recorded.

Conversely, when the third node 10-3 receives a transmission message from only one of the first node 10-1 and the second node 10-2, and does not receive a response message from the other, You can not configure your own route table using messages.

For example, assuming that the third node 10-3 is T2 as illustrated in FIG. 5 , when a response message passes through itself, the third node 10-3 records the fact that the response message has passed by matching the path of the message, As illustrated in FIG. 6 , within a certain time after the path of the message is recorded, if a response message matching the path table of the third node 10-3 that is T2 is recorded as passed, the method of configuring its own path table , even if the message is not the source or destination, the shortest route can be set automatically.

Conversely, assuming that the third node 10-3 is T4 as illustrated in FIG. 7 , when a response message passes through itself, the fact that the response message has passed is matched with the path of the message and recorded, and FIG. 8 As exemplified in , if the matching response message is not recorded as traversed within a certain period of time, the path of the message may be deleted from its own path table to verify the validity of the path table.

9 is a diagram provided to explain an automatic route setting system according to an embodiment of the present invention.

Referring to FIG. 9 , the automatic path setting system according to an embodiment of the present invention includes a communication unit 100 , a processor 200 , and a storage unit 300 .

The communication unit 100 is provided in each node constituting a dual path network, is connected to other nodes, and is a communication means to configure a dual path, and is provided with two Ethernet ports, receives a message, and sends a message to another node. message can be sent.

The processor 200 may be provided in each node constituting the dual path network and configure a path table while transmitting and receiving messages, or may configure its own path table using a message passing through itself.

In addition, the processor 200 may search its own route table before transmitting the message, and use the shortest searched path when transmitting the message.

For another example, the processor 200 searches its own route table before sending the message to another node, and if the shortest route is not found in its own route table, after the message is sent, the response message is received A route using a specific direction port can be recorded as the shortest route in its own route table.

The storage unit 300 is a storage medium provided in each node constituting the dual path network to provide a storage space required for the processor 200 to operate. For example, the storage unit 300 may store its own path table configured by each node individually.

10 is a flowchart provided to explain an automatic route setting method according to another embodiment of the present invention.

Referring to FIG. 10, in the automatic route setting method according to the present embodiment, the first node 10-1, which is the source of the message, searches its own route table before transmitting the message (S1010), and the search result , if the shortest path with the second node 10-2 exists in the path table of the first node 10-1 (S1020-Y), the second node 10-2 or the second node according to the searched shortest path A message may be transmitted to the third node 10-3 provided in the direction (10-2) (S1030).

Conversely, as a result of the search, if there is no shortest path to the second node 10-2, which is the destination of the message (S1020-N), the message can be transmitted in both directions (S1040).

When the third node 10-3 receives a message from the first node 10-1 or another third node 10-3 provided in the direction of the first node 10-1 through a port in a specific direction, , records the path using the port in the specific direction where the message is received in its own path table (S1050), and transmits the message through the port in the opposite direction to the port in the specific direction where the message is received (S1060), in the opposite direction When a response message is received from the second node 10-2 through the port, the path of the port in the direction in which the response message was received is matched to the message path (the path of the port in the direction in which the message was received) as the response message path. The shortest path may be recorded (S1070), and the received response message may be transmitted to the first node 10-1.

Through this, the third node 10-3 records the route of the message passing through it in its route table, and can automatically set the shortest route even if it is not the source or destination of the message.

On the other hand, it goes without saying that the technical idea of the present invention can also be applied to a computer-readable recording medium containing a computer program for performing the functions of the apparatus and method according to the present embodiment. In addition, the technical ideas according to various embodiments of the present invention may be implemented in the form of computer-readable codes recorded on a computer-readable recording medium. The computer-readable recording medium may be any data storage device readable by the computer and capable of storing data. For example, the computer-readable recording medium may be a ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical disk, hard disk drive, or the like. In addition, the computer-readable code or program stored in the computer-readable recording medium may be transmitted through a network connected between computers.

In addition, although preferred embodiments of the present invention have been illustrated and described above, the present invention is not limited to the specific embodiments described above, and the technical field to which the present invention belongs without departing from the gist of the present invention as claimed in the claims Various modifications are possible by those of ordinary skill in the art, and these modifications should not be individually understood from the technical spirit or prospect of the present invention.

10 : node
100: communication department
200 : processor
300: storage

Claims (17)

a first step of configuring a route table while transmitting and receiving messages between a first node and a second node constituting a dual-path network; and
a second step of configuring, by the third node constituting the dual path network, its own path table using messages transmitted and received between the first node and the second node;
The third node is
Records the shortest path between itself and the first node and the second node in its own path table,
The first step is
The first node sends a message in both directions,
The first step is
The second node responds to the first node through the specific direction port through which the message is received first among the bidirectional ports, and records the path using the specific direction port as the shortest path between the first node and the second node in its path table, ,
The first step is
When the second node receives a message through a specific direction port among the bidirectional ports, it searches for the shortest path between the first node and the second node. If there is no shortest path to be searched, the port where the message arrived is used as the shortest path. write to the route table,
The first step is
When the second node receives a message through a specific direction port among the bidirectional ports, it skips a duplicate message arriving through the opposite direction port,
The second step is
The third node records the path of the message passing through it in its path table,
Each route table is
By recording the destination and forwarding direction corresponding to the message path, and information on whether a transmission message and a response message are received through the bidirectional port, respectively, the third node transmits the transmission message only from either one of the first node and the second node. , and if the other does not receive a response message, do not use the message to configure its own route table,
The second step is
When the third node passes through the response message, it records whether the response message has passed by matching the path of the message;
The third node verifies the validity of the route table by deleting the route of the message from its route table when the matching response message is not recorded as traversed within a certain time after the route of the message is recorded. How to set up automatic routes.
delete The method according to claim 1,
Each node is
An automatic route setting method, characterized in that before sending a message, searching its own route table, and using the shortest route found when sending a message.
delete delete The method according to claim 1,
The first step is
An automatic route setting method, characterized in that the first node searches its route table before sending the message, and if there is no shortest route between the first node and the second node to be searched, the message is transmitted in both directions.
delete delete delete delete delete delete The method according to claim 1,
message is,
If the priority is low and the shortest path is set, the message is set to be transmitted unidirectionally along the shortest path.
a communication unit provided in a third node disposed between the first node and the second node constituting the dual path network to transmit and receive messages;
A processor that is provided in the third node and configures its own route table using messages transmitted and received;
The processor is
Records the shortest path between itself and the first node and the second node in its own path table,
The first node sends a message in both directions,
The second node is
Among the bidirectional ports, the first node responds to the first node through the specific direction port from which the message is received, and records the path using the specific direction port as the shortest path between the first node and the second node in its own path table,
The second node is
When a message is received through a specific direction port among the bidirectional ports, the shortest path between the first node and the second node is searched. If there is no searched shortest path, the port where the message arrived is recorded as the shortest path in its own path table ,
The second node is
When a message is received through a port in a specific direction among bidirectional ports, the duplicate message arriving through the port in the opposite direction is skipped,
The processor is
It records the path of the message passing through it in its own path table,
Each route table is
By recording the destination and forwarding direction corresponding to the message path, and information on whether a transmission message and a response message are received through the bidirectional port, respectively, the third node transmits the transmission message only from either one of the first node and the second node. , and if the other does not receive a response message, do not use the message to configure its own route table,
The processor is
When a response message passes through itself, it records whether the response message has passed by matching the path of the message,
An automatic route setting system, characterized in that the validity of the route table is verified by deleting the route of the message from its route table when the route of the message is recorded and the matching response message is not recorded as traversed within a certain period of time.
a first step of configuring a route table while transmitting and receiving messages between a first node and a second node constituting a dual-path network; and
a second step of configuring, by the third node constituting the dual path network, its own path table using messages transmitted and received between the first node and the second node;
The third node is
Records the shortest path between itself and the first node and the second node in its own path table,
The first step is
The first node sends a message in both directions,
The first step is
The second node responds to the first node through the specific direction port through which the message is received first among the bidirectional ports, and records the path using the specific direction port as the shortest path between the first node and the second node in its path table, ,
The first step is
When the second node receives a message through a specific direction port among the bidirectional ports, it searches for the shortest path between the first node and the second node. If there is no shortest path to be searched, the port where the message arrived is used as the shortest path. write to the route table,
The first step is
When the second node receives a message through a specific direction port among the bidirectional ports, it skips a duplicate message arriving through the opposite direction port,
The second step is
The third node records the path of the message passing through it in its path table,
Each route table is
By recording the destination and forwarding direction corresponding to the message path, and information on whether a transmission message and a response message are received through the bidirectional port, respectively, the third node transmits the transmission message only from either one of the first node and the second node. , and if the other does not receive a response message, do not use the message to configure its own route table,
The second step is
When the third node passes through the response message, it records whether the response message has passed by matching the path of the message;
The third node verifies the validity of the route table by deleting the route of the message from its route table when the matching response message is not recorded as traversed within a certain time after the route of the message is recorded. A computer-readable recording medium containing a computer program that performs an automatic path setting method. delete delete

Images