WO2021015349A1

WO2021015349A1 - Method for automatically setting route in dual route network

Info

Publication number: WO2021015349A1
Application number: PCT/KR2019/009301
Authority: WO
Inventors: 박부식
Original assignee: 전자부품연구원
Priority date: 2019-07-25
Filing date: 2019-07-26
Publication date: 2021-01-28
Also published as: KR20210012524A; KR102271947B1

Abstract

Provided is a method for automatically setting the shortest route between nodes of a transmission location and a reception location by using header information about a dual route Ethernet frame. A method for automatically setting a route, according to an embodiment of the present invention, comprises: a first step in which first and second nodes forming a dual route network form a route table while transmitting and receiving a message; and a second step in which a third node forming the dual route network forms a route table of the third node by using the message transmitted and received between the first and second nodes. Therefore, data can be quickly delivered without a separate process for identifying the shortest route, and delay time consumption according to the separate process, and a bandwidth used for performing an auto-configuration mechanism can be reduced. In addition, when an error occurs, there is no inconvenience of the auto-configuration mechanism having to be performed again, and thus recovery for the error can be more quickly performed.

Description

Automatic routing method in dual path network

The present invention relates to a communication method suitable for a dual path, and more particularly, a shortest path between a transmission destination and a destination using header information of an Ethernet frame of a network that has a dual path and reaches a destination via a neighbor node. It's about how to set it up automatically.

In industrial areas that require high reliability, such as aircraft, railways and smart factories, the required performance of data buses for controlling 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, in HSR, since nodes in the ring transmit data in both directions for seamless redundancy, the importance of the HSR is low and there is an inconvenience in that the shortest path cannot be provided for data transmitted only in one direction.

In addition, AeroRing transmits high-priority data in both directions depending on the importance of the data or QoS (Quality of Service), but data with low importance does not send in both directions, but can be sent only in one direction, but to determine the shortest path. 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 its own address and forwards it, and the message that the gateway arrives in one round is sent to all nodes in the ring. The address information of is included, and the shortest path can be identified by transmitting it to all nodes in the ring to share 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 is generated for this.

Accordingly, there is a need to find a method that can quickly transfer data without consuming a delay time for identifying the shortest path by identifying the shortest path without a separate process.

The present invention was conceived to solve the above problems, and an object of the present invention is to automatically set the shortest paths of nodes of a source and a destination using header information of an Ethernet frame of a network having a dual path, A separate process for identifying the shortest path and an automatic path setting method in a dual path network capable of quickly transmitting data without consuming a delay time accordingly and a separate process are provided.

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

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 may search its own route table before sending a message, and use the shortest route to be searched when sending a message.

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

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

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

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

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

Also, in the second step, the third node may record a path of a message passing through it in its own route table.

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

In the second step, when the response message passes through itself, the third node may match and record whether the response message has passed through the path of the message.

In the second step, the third node may delete the message path from its own path table if the message path is recorded and the matching response message is not recorded within a predetermined time.

In addition, the message may be a message set to be transmitted in one direction 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, an automatic route setting system includes a communication unit provided in a third node disposed between a first node and a second node constituting a dual route network, and transmitting and receiving messages; It includes; a processor that is provided in the third node and configures its own route table using messages transmitted and received.

In addition, according to another embodiment of the present invention, a computer-readable recording medium containing a program includes: a first step of configuring a route table while a first node and a second node constituting a dual route network transmit and receive messages; And a second step of configuring its own route table, by using a message transmitted and received by the first node and the second node by the third node constituting the dual-path network.

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

In addition, according to another embodiment of the present invention, an automatic route setting system is provided in a node constituting a dual route network, and a communication unit is provided with a bidirectional port to transmit and receive messages; And before sending the received message to another node, search its own route table, and if the shortest route is not found in its own route table, after the message is transmitted, a route using a specific direction port to which the response message is received. It includes; a processor that records the shortest path in its own path table.

As described above, according to the embodiments of the present invention, a separate process for identifying the shortest path and a delay time accordingly are not consumed, data can be quickly transferred, and the auto-configuration mechanism is consumed. You can reduce the bandwidth.

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

1 is a flow chart provided to explain a method for automatically setting a route according to an embodiment of the present invention;

2 to 4 are diagrams provided for explanation of the process of configuring the shortest route table;

5 to 6 are diagrams provided for explanation of a process of configuring a shortest route table of a third node;

7 to 8 are diagrams provided for explaining a process of verifying and deleting the shortest path table of a third node;

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

10 is a flowchart for explaining 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 a method for automatically setting a route according to an embodiment of the present invention, and FIGS. 2 to 4 are diagrams provided for explaining a process of configuring a shortest route table.

As described above, each node constituting a dual-path network transmits data of low priority or importance in one direction.If there is no information on the shortest path, even data of low priority or importance is transmitted in both directions. Therefore, it is necessary to set the shortest path for rapid data transfer.

In the automatic route setting method according to an embodiment of the present invention, a separate process for identifying the shortest path by automatically setting the shortest paths of nodes of a transmission destination and a destination using header information of a dual path Ethernet frame, and Data can be delivered quickly without consuming the corresponding delay time.

To this end, the first node 10-1 and the second node 10-2 constituting the dual-path network construct a route table while transmitting and receiving a message Msg, and construct a dual-path network, The third node 10-3 provided between the node 10-1 and the second node 10-2 transmits and receives messages transmitted and received by 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 can record the shortest path between itself and other nodes constituting the dual path in its path table.

At this time, 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 when the message is not the origin or destination. That is, the third node 10-3 records the route of the message passing through it in its own route table Ta3, and the third node 10-3 records itself, the first node 10-1 and the first node 10-1 in its own route table Ta3. / Or it is possible to record the shortest path between itself and the second node (10-2).

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

Therefore, before sending the message, the first node 10-1 searches its own route table, and if there is no shortest route between the searched first node 10-1 and the second node 10-2, , As illustrated in FIG. 2, a message can be transmitted in both directions (S110).

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

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

When the first node 10-1 transmits a message in both directions (S110), the third node 10-3 receives a 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 a path using a specific direction port from which a message was received first among the two-way ports, as the shortest path between the first node 10-1 and the second node 10-2. The route is recorded in its own route table (S140), and first, a reply to the third node 10-3 through a specific direction port from which the message is received (S150).

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

At this time, when the shortest path is searched, 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 can also receive messages 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 the data transmitted through T2, it is processed as a duplicate message and is skipped.

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

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

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

As illustrated in FIGS. 5 to 8, information on whether a transmission message and a response message are respectively received through a destination and a delivery direction corresponding to a path of a message and a bidirectional port may be recorded in each route 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 when the message is not the origin or destination.

That is, the third node 10-3 records the route of the message passing through it in its own route table, and the third node 10-3 records itself and the first node 10-1 and/or itself and the second in its route table. It is possible to record the shortest path between nodes 10-2.

Conversely, when the third node 10-3 receives a transmission message only from 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 the response message passes through itself, the third node 10-3 matches and records the fact that the response message has passed with the path of the message, As illustrated in FIG. 6, if a response message matching the route table of the third node 10-3, which is T2, is recorded as passing within a predetermined time after the route of the message is recorded, the route table is configured. , Even if it is not the origin or destination of the message, the shortest route can be automatically set.

On the contrary, assuming that the third node 10-3 is T4 as illustrated in FIG. 7, when the response message passes through itself, the fact that the response message has passed is matched to the path of the message and recorded. As illustrated in FIG. 2, if the matching response message is not recorded as passing through within a certain time, the validity of the route table can be verified by deleting the route of the message from the route 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 route 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 a communication means provided in each node constituting a dual path network and connected to other nodes to form a dual path, and two Ethernet ports are provided to receive messages, and to other nodes. You can send a message.

The processor 200 may be provided in each node constituting a dual path network, and may 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 route searched 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 transmitted, the response message is received. You can record the route that uses a specific direction port in your own route table as the shortest route.

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

Referring to FIG. 10, in the automatic route setting method according to the present embodiment, before the first node 10-1, which is the origin of the message, transmits the message, it searches its own route table (S1010), and the search result , If the shortest path to 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 (10-2) direction (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, , The route using the port in the specific direction from which the message was received is recorded in its route table (S1050), and the message is transmitted through the port in the opposite direction to the port in the specific direction from which the message was received (S1060), When a response message is received from the second node 10-2 through the port, the path of the port in the direction where the response message is received is matched with the response message path with the message path (the path of the port in the direction from which the message is received). The shortest path may be recorded (S1070) and the received response message may be transmitted to the first node 10-1.

Meanwhile, it goes without saying that the technical idea of the present invention can be applied to a computer-readable recording medium containing a computer program that performs functions of the apparatus and method according to the present embodiment. Further, the technical idea according to various embodiments of the present disclosure may be implemented in the form of a computer-readable code recorded on a computer-readable recording medium. The computer-readable recording medium can be any data storage device that can be read by a computer and can store data. For example, a computer-readable recording medium may be a ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical disk, hard disk drive, or the like. Also, a computer-readable code or program stored in a computer-readable recording medium may be transmitted through a network connected between computers.

In addition, although the 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 claimed in the claims. In addition, 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.

Claims

A first step of constructing a route table while the first node and the second node constituting the dual route network transmit and receive messages; And

A second step of configuring its own route table by using a message transmitted/received by the first node and the second node by the third node constituting the dual-path network.
The method according to claim 1,

The third node,

An automatic route setting method, characterized in that the shortest route between itself and the first node and the second node is recorded in the own route table.
The method according to claim 2,

Each node,

An automatic route setting method, characterized in that before sending a message, a route table of itself is searched, and the shortest route to be searched when transmitting a message is used.
The method according to claim 1,

The first step is,

The automatic route setting method, characterized in that the first node transmits a message in both directions.
The method of claim 4,

The first step is,

The second node responds to the first node through a specific direction port from which a message was received first among bidirectional ports, and records a route using the specific direction port in its own route table as the shortest route between the first node and the second node. Automatic route setting method, characterized in that.
The method of claim 5,

The first step is,

The first node, before transmitting the message, searches its own route table, and if there is no shortest route between the first node and the second node to be searched, transmits a message in both directions.
The method of claim 5,

The first step is,

When a message is received through a specific direction port among the bidirectional ports, the second node searches for the shortest path between the first node and the second node, and if there is no shortest path to be searched, the port where the message arrives is used as the shortest path. Automatic route setting method, characterized in that recording in the route table.
The method of claim 5,

The first step is,

When the second node receives a message through a specific direction port among the bidirectional ports, the automatic route setting method comprising skipping duplicate messages arriving through the opposite direction port.
The method according to claim 1,

The second step is,

An automatic route setting method, characterized in that the third node records a route of a message going through itself in its own route table.
The method of claim 9,

Each route table,

The destination and delivery direction corresponding to the path of the message and information on whether the transmission message and the response message are respectively received through the bidirectional port are recorded together, so that the third node sends the message only to either the first node or the second node. When receiving and the other does not receive a response message, the automatic route setting method, characterized in that not to configure its own route table using the message.
The method of claim 10,

The second step is,

When the response message passes through itself, the third node matches and records whether the response message has passed with the path of the message.
The method of claim 11,

The second step is,

The third node, when the route of the message is recorded and within a certain period of time, if the matching response message is not recorded as being passed, the route of the message is deleted from its route table.
The method according to claim 1,

The message is,

When the priority is low and the shortest path is set, the automatic path setting method, characterized in that the message is set to be transmitted in one direction along the shortest path.
A communication unit provided in a third node disposed between a first node and a second node constituting a dual path network, and transmitting and receiving messages;

An automatic route setting system including a; processor provided in the third node and configuring its own route table using messages transmitted and received.
A first step of constructing a route table while a first node and a second node constituting a dual route network transmit and receive messages; And

A computer program for performing an automatic route setting method including; a second step of configuring its own route table by using a message transmitted and received by the first node and the second node by the third node constituting the dual route network Recorded media that can be read by a computer.
A step of, by a node constituting a dual path network, searching its own path table before transmitting the received message to another node; And

If the shortest path is not found in the own route table, after the message is transmitted through the bidirectional port, recording a route using a specific direction port to which the response message is received is recorded as the shortest route in the own route table. How to set the route.
A communication unit provided in a node constituting a dual path network and provided with a bidirectional port to transmit and receive messages; 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 route table, after the message is sent, the route using a specific direction port to which the response message is received is self-contained. Automatic route setting system comprising a; processor for recording the shortest route in the route table of.