JPS6221346A - Automatic recognition system of adjacent node address - Google Patents

Abstract

PURPOSE:To recognize automatically an adjacent node address by sending an address request frame using its own node as a sender only when its own node is in the slave loopback state while an address recognition flag of a received address request frame is set. CONSTITUTION:When the address recognition flag is set, an address request frame processing section 151 commands it to a repeater means 120 that a received frame is relayed to the next node as it is and informs the on-signal to the 2nd address request frame transmission command means 170. When the address recognition flag is reset, the address request frame processing section 151 commands it to the repeater means 120 that the address request frame whose address recognition flag is set to the next node and commands it to a transmission means 130 that an address information frame is sent to the sender node. Thus, the new adjacent node and address are recognized and stored automatically.

Description

[Detailed description of the invention] 〔table of contents〕 The present invention will be explained in the following order.

A. Overview B. Field of industrial application C8. Conventional technology (Figs. 2, 3, and 6) D3. Problems to be solved by the invention E8. Means for solving the problems (Fig. 1) F8 action (
Figures 1 to 3) Fl, in case of a single communication system (Figures 1 and 2) Ft
, When a node joins two ring communication systems to form a single ring communication system (FIGS. 1 and 3) G. Example (FIGS. 4 and 5) G1. Explanation of configuration (Figures 4 and 5) C7. Explanation of operation H0 Effect A [Summary] A ring communication system equipped with a master loopback mechanism and a slave loopback mechanism is connected to those systems due to the departure or addition of a node, etc. In the automatic recognition method for adjacent node addresses when there is a change in the configuration of the adjacent node, when the address recognition flag of the received address request frame is on, the own node is sent only when the own node is in the slave loopback state. By transmitting the original address request frame, it is possible to automatically recognize adjacent node addresses when a plurality of ring communication systems become a single ring communication system due to the addition of nodes.

B [Industrial Application Field] The present invention relates to an automatic recognition method for adjacent node addresses when the configuration of a ring communication system changes. When a single ring communication system or multiple ring communication systems having a master loopback mechanism and a slave loopback mechanism change the configuration of those systems due to the departure or addition of a node, etc.
This invention relates to an automatic recognition method for adjacent node addresses.

C [Prior Art] As a form of local area network (LAN) that has been attracting attention in the field of distributed processing in recent years, a ring communication method in which a plurality of processing devices called nodes are connected in a ring is known. ing.

FIG. 6 shows the configuration of a conventional ring communication system. In FIG. 6, node A.

B and C are connected in a ring shape by a main ring and a sub ring in the opposite transfer direction. Each node includes a processing unit,
It is equipped with a ring control section, a mask loop bank mechanism (ML), and a slave loopback mechanism (SL).

The ML releases the loopback when the signal level (or reception clock extraction, the same applies hereinafter) input from the receiving side of the main ring, that is, the upstream side, becomes normal, and starts supplying signal output to the sub ring. However, when the signal level of the main ring becomes abnormal, loopback is performed and the signal output to the sub-ring is stopped.

The SL releases loopback when the signal level of the sub-ring becomes normal, starts supplying signal output to the main ring, and performs loop banking when the signal level of the sub-ring becomes abnormal. At the same time, processing is performed to stop signal output to the main ring.

Note that the ML and SL in each node A, B, and C are distinguished by adding suffixes a, b, and c.

In this configuration, if a main ring disconnection occurs between node B and node C, node C detects an abnormality in the signal level of the main ring at MLc, performs loopback as shown by the arrow, and outputs to the sub ring. , that is, performs master loopback.

On the other hand, when Node B detects an abnormality in the signal level of the sub-ring by SLb, it performs loopback as indicated by the arrow and stops output to the main ring, that is, slave loopback.

In ring communication systems with such a loopback mechanism, the system configuration may change due to loopback, so each node must always recognize the addresses of adjacent nodes, and in the event of a failure, it is necessary to isolate the failure location. It's easy.

One way to recognize adjacent node addresses is to
A method is known in which a node transmits an address request frame by performing slave loopback or canceling slave loopback. This method will be explained with reference to FIG.

FIG. 2 illustrates a method for automatically recognizing the address of an adjacent node when node B performs loopback or is powered off due to a failure.

In Figure 2, when the power of node B is turned off, no signal or carrier is output from the secondary ring to node A, and no signal or carrier is output from the main ring to node C. . Therefore, as explained in FIG. 6, slave loopback is performed by SLa of node A, and master loopback is performed by MLc of node C.

Node A, which has performed the slave loopback, sends an address request frame with the source node A's address and the address recognition flag set to off. This address request frame is transmitted to node C via loopback on the sub-ring.

When node C receives this address request frame via MLc, it checks the state of its address recognition flag, and if the flag is off, it turns on the flag bit and passes it to the next node D.

Since the address recognition flag was off, node C
knows that the received address request frame was sent from an upstream adjacent node, and can also know that the upstream adjacent node is node A from the source address in the address request frame. .

On the other hand, node D receives the address request frame from node C, but since the address recognition flag is already on, it simply passes it on to the next node, that is, node A.

After receiving the address request frame, node C transmits an address notification frame to node A, which is the source of the address request frame. By receiving this address notification frame, node A can recognize that the downstream adjacent node address has become node C.

In this way, when the configuration of the network system changes due to one node among a plurality of nodes connected to one ring leaving the ring, the address of the adjacent node can be known. Conversely, even if the configuration of the network system changes due to a node joining the ring, the addresses of adjacent nodes can be recognized in the same way.

D [Problems to be solved by the invention] In the conventional automatic address recognition method for adjacent nodes, when a plurality of nodes are connected to a single ring, when one node leaves or joins, If the configuration of the network system changes, the addresses of adjacent nodes can be known.

However, in this conventional method, when nodes A and D and nodes B and C form two independent network systems as shown in FIG. 3(A),
), if node X joins and the whole becomes a single network system, then node A,
X and B can know the addresses of mutually adjacent nodes, but nodes C and D do not change the signal or carrier status of their respective main and sub rings even if node X joins. , there was a problem in that it was not possible to know that an adjacent node had changed, and therefore it was not possible to recognize the address of the adjacent node.

The present invention can also be applied when a change occurs in the system configuration due to a node leaving or joining a ring communication system consisting of a single network system. An object of the present invention is to provide an automatic adjacent node address recognition method that makes it possible to recognize adjacent node addresses even when the system configuration is changed due to the formation of a ring communication system.

E [Means for Solving the Problems] The means taken by the present invention to solve the above-mentioned problems in the conventional adjacent node recognition system will be explained with reference to FIG.

In FIG. 1, 100 is a ring control section, and the ring control sections of each node have the same configuration.

In the ring control unit 100, a receiving unit 110 receives a signal input via an ML (not shown), analyzes the received frame, and sends/receives the signal to the relay unit.

120 is a relay means that performs relay processing of the received signal. 130 is a transmitting means that transmits the signal input from the relay means 120, the signal created by the processing device of the node, and also transmits an address request frame and an address notification frame, which will be described next.

140 is a first address request frame transmission command means;
When a master loopback and a slave loop bank are formed or canceled due to a node leaving or joining, etc., an address request frame is commanded to be transmitted at the time of forming or canceling a slave loopback. The address request frame has the source address and the address recognition flag set off.

150 is a received frame relay command means that detects the state of the address recognition flag of the received address request frame, and if it is on, instructs the received address request frame to be relayed as is to the next node; , and notifies the second address request frame transmission command means of the on signal.

160 is an address notification frame transmission command means that detects the state of the address recognition flag of the received address request frame, and if it is off, sends the address request frame with the address recognition flag set to on to the next node. It instructs the transmitting means 130 to relay the frame, and also instructs the transmitting means 130 to store the source address in the address request frame as an upstream adjacent node address and to transmit an address notification frame to the source node.

In the address notification frame, the address of the own node is sent as the source address.

170 is a second address request frame transmission command means;
When the address recognition flag of the received address request frame is on, the node instructs to transmit the address request frame only when the node is in the slave loop bank state.

Reference numeral 180 denotes a downstream adjacent node address storage means, and the first or second address request frame transmission command means 140 or 1
When an address request frame is transmitted based on the command 70, when an address notification frame addressed to the own node is received, the address of the source in this address notification frame is stored as a downstream adjacent node address.

F [Function] The effect shown in Figure 1 is applied when one node leaves a single ring communication system, and when one node joins two independent ring communication systems to create a single ring communication system. An example will be explained in which a system is formed.

F. (For a single ring communication system) The operation of FIG. 1 in this case will be explained with reference to FIG. 2.

The departure of Node B causes a slave loopback to be performed by Node A and a master loopback to be performed by Node C, as previously explained.

At node A that performed slave loopback, the first
The address request frame transmission command means 140 instructs the transmitting means 130 to transmit an address request frame having the address of the source node A and the address recognition flag set to off.

This address request frame is transmitted to node C via loopback on the sub-ring.

The node C receives this address request frame via the MLc by the receiving means 110, analyzes the received frame, and when detecting an address request frame, sends this frame to the received frame relay command means 150 and sends an address notification frame. It is sent to command means 160.

Since the address recognition flag of the address request frame is off, the address notification frame transmission command means 160
Perform the following processing.

(2) Instructs the relay means 120 to relay the address request frame with the address recognition flag set to on to the next node (node D). This address request frame is sent to the next node D by the relay means 120 and the transmission means 130.

(2) Store the source address in the address request frame, that is, the address of node A, as the upstream adjacent node address.

(2) Instructs the transmitting means 130 to transmit an address communication frame in which the address of its own node, that is, node C, is set to node A, which is the source node, and causes it to be sent to the next node (node D).

Since the address recognition flag of the address request frame is off, the received frame relay command means 150 does not operate.

The address communication frame transmitted from node C travels on the main ring and is received by node A via node D.

The receiving means 110 of node A analyzes the received frame,
When an address notification frame is detected, it is sent to the downstream adjacent node address storage means 180.

The downstream adjacent node address storage means 180 stores information when the received address communication frame is addressed to its own node.
The source address in this address communication frame, that is, the address of node C, is stored as the downstream adjacent node address.

As described above, with the departure of node B, node A can learn that the downstream node has changed from node B to node C and its address, and can also learn that the downstream node has changed from node B to node C.
can recognize that the upstream node has changed from node B to node A and its address.

Even if node B joins again from the state shown in FIG. 2 and the adjacent nodes of nodes A and C change, nodes A and C will recognize the new adjacent node and its address in the same way. I can do it.

F2 (when a node joins two ring communication systems and becomes a single ring communication system) In this case, the first
The operation of the figure will be explained with reference to FIG.

As shown in FIG. 3(A), node X joins where nodes A and D and nodes B and C form two ring communication systems, and as shown in FIG. 3(B). When a single ring communication system is formed in , the slave-back state of node A and node X is released.

Therefore, between node A and node X, the one that acquires the transmission right first transmits the address request frame.

Now, if node A acquires the transmission right first, node A and node Then, node X can learn that node A has become an upstream neighbor node and its address.

Node The fact that X has become an upstream neighbor node and its address can be automatically recognized and stored.

Next, an operation in which nodes C and D learn about adjacent nodes will be described.

In FIGS. 3A and 3B, node D is still in the master loopback state, and node C is still in the slave loopback state.

Due to node X joining, node A or node
sends an address request frame, in any case,
At the time node C receives the address request frame, the address recognition flag in the address request frame is set to the on state.

Therefore, the received frame relay command means 150 of node C instructs the relay means 120 and the transmission means 130 to send the received address request frame as is to the next node, and also indicates that the address recognition flag is on. Second address request frame transmission command means 170
to notify.

Since the address recognition flag is on and the own node (node C) is in the slave loopback state, the second address request frame transmission command means 170 recognizes the address of the source node C and the address set to off. Commands the transmission of an address request frame with a flag. This address request frame is sent from the sending means 130 to the next node (node D).

Node D, which first received this address request frame, learns that its address recognition flag is off and that the address of the adjacent node upstream from the source address is node C, in the same manner as described above. At the same time as storing the address, the address is sent to the own node (node D) for node C.
Sends an address notification frame with the source as the source. Node C can receive this address notification frame and learn that the downstream adjacent node address has become node D. These operations are performed in the same manner as the operations described around Fl above.

As described above, when one node joins two ring communication systems to form a single ring communication system, each node whose adjacent node has been changed will all join the new adjacent node and The address can be automatically recognized and stored.

Similarly, if more than two ring communication systems become a single ring communication system through the addition of multiple nodes, each node whose adjacent nodes have changed will all have new adjacent nodes and You can know the address. It goes without saying that each ring communication system may include three or more nodes.

G [Example] An example of the present invention will be described with reference to FIGS. 4 and 5.

FIG. 4 is an explanatory block diagram of the configuration of an embodiment of the present invention, and FIG. 5 is an explanatory diagram of an example of the format of transmission frames such as an address request frame and an address communication frame.

Gl (Explanation of Configuration) In FIG. 4, a ring control section 100, a receiving means 110
, relay means 120, transmission means 130, first address request frame transmission command means 140, received frame relay command means 150, address notification frame transmission command means 160
, the second address request frame transmission command means 170, and the downstream adjacent node address storage means 180.
This is as explained in the figure.

In the receiving means 110, a receiving section 111 receives the upstream signal input from the ML and adds it to the relay means 120, and also sends the received frame to the received frame analyzing section 112. The received frame analysis unit 112 analyzes whether the input received frame is an address request frame or an address notification frame, and if it is an address request frame, the received frame relay command means 150 and the address notification frame transmission command means 170 are notified. In addition, in the case of an address notification frame, it is added to the downstream neighbor node address storage means 180.

The received frame relay command means 150 is constituted by an address request frame processing section 151, and this address request frame processing section 151 also functions as a component of the address notification frame transmission command means 160. That is,
The address request frame processing unit 151 checks the state of the address recognition flag (ARi>) in the address request frame and detects whether it is on or off.

When the address recognition flag ARi is on, the address request frame processing unit 151 instructs the relay means 120 to relay the received frame as is to the next node, and also sends the on signal to the second address request frame transmission command means. to notify.

When the address recognition flag AR4 is off, the address request frame processing unit 151 instructs the relay means 120 to relay the address request frame with the address recognition flag set to on to the next node, and further sends the address request frame to the source node. It instructs the transmitting means 130 to transmit an address notification frame to , and stores the source address in the address request frame in the upstream node address storage section 161 .

The address notification frame transmission command means 160 includes an address request frame processing section 151 and an upstream node address storage section 161. As described above, the upstream node address storage unit 161 stores the source address in the address request frame as an upstream adjacent node address when the address recognition flag ARi in the address request frame is off.

In the downstream adjacent node address storage means 180, 18
1 is an address notification frame processing unit that analyzes the address notification frame input from the received frame analysis unit 112, and when it detects that the address notification frame is addressed to the own node in response to the address request frame transmitted by the own node, the address notification frame is The source address in the notification frame is sent to the downstream node address storage section 182. The downstream node address storage unit 182 stores this source address as a downstream adjacent node address.

In the first address request frame transmission command means 140, 141 is an OR circuit which sends an address request frame transmission command signal to the transmission means 130 when receiving a slave loopback notification signal or a slave loopback release notification signal from the processing device side. send.

In the second address request frame transmission command means 170, 171 is a slave loopback notification holding circuit (SL
In B), the slave loopback notification signal manually input from the processing device is held, and is reset by the slave loopback release notification signal input from the processing device. 172
is an AND circuit that outputs an address request frame transmission command signal when a slave loopback notification signal is input from the 5LB 171 and an address recognition flag ON signal is input from the address notification frame transmission command means 160, that is, the address request frame processing unit 151. It is sent to the transmitting means 130.

In the transmitting means 130, 131 is an OR circuit, 132 is an address request frame creation section, 133 is an address notification frame creation section, 134 is a transmission frame creation section, 13
5 is a transmitter.

Upon receiving an address request frame transmission command from the first or second address request frame transmission command means 140 or 170 via the OR circuit 131, the address request frame creation section 132 creates an address request frame.

Further, when receiving an address notification frame transmission command from the address notification frame transmission command means 160, that is, the address request frame processing unit 151, the address notification frame creation unit 133 creates an address notification frame.

FIG. 5 shows an example of transmission frames such as an address request frame and an address notification frame, and FS is a start flag that instructs the start of the transmission frame. F.C.
is a frame control unit, in which various control information is sent.

DA is a destination address, and the destination of the transmission frame is set therein. SA is a source address, and the address of the source of the transmitted frame is sent. Data to be transmitted is set in the data section. FC3 is a frame check bit, and a check bit for error control is set. FE is an end flag that indicates the end of the frame.

FT is a frame trailer, address recognition bit AR1
is cent.

If the transmission frame is an address request frame, it is transmitted to an undetermined downstream adjacent node, so a broadcast address is used as the destination address. In a system that includes nodes without a loopback mechanism, it is preferable to use a group address or special address that can only be received by nodes with a loopback mechanism.

The transmission frame creation unit 134 creates a transmission frame from each frame input from the address request frame creation unit 132 and the address notification frame creation unit 133, and transmits it from the transmission unit 135 to the next node.

G2 (Description of operation) The operation of each part constituting each means in the ring control section 100 shown in FIG. 4 is as described in the above explanation of the configuration. Further, the functions of each means in the ring control section 100 and the overall automatic recognition operation of adjacent node addresses are the same as those described in FIGS. 1 to 3. Since the automatic recognition operation of the adjacent node address in FIG. 3 is clear from the explanation of FIGS. 1 to 3 and the explanation of the configuration of FIG. 4, the explanation of the operation will be omitted.

Although one embodiment of the present invention has been described above, each structure of the present invention is not limited to the structure shown in the embodiment. Further, the present invention can be applied to any ring communication method using electrical signals or optical signals.

H [Effect] As explained above, according to the present invention, even if a node leaves or joins a single ring communication system, a plurality of separate ring communication systems can be combined into a single ring communication system by a node joining. Even when a ring communication system is formed, each node whose neighbor has changed can automatically recognize and memorize the new neighbor and its address.

[Brief explanation of the drawing]

Figure 1...Block explanatory diagram of the configuration of the present invention, Figure 2...
...Explanatory diagram of the present invention and the conventional automatic recognition method of adjacent node addresses in a single ring communication system. An explanatory diagram of the invention and a conventional automatic recognition method for adjacent node addresses, Fig. 4 An explanatory diagram of an embodiment of the present invention, Fig. 5...
An explanatory diagram of an example of the format of a transmission frame used in the present invention. FIG. 6: An explanatory diagram of a conventional ring communication system. In FIG. 1 and FIG. 4, 100... ring control unit, 110... receiving means, 1
20... Relay means, 130... Transmission means, 140.
...First address request frame transmission command means, 150
. . . Received frame relay I command means, 160 . . . Address notification frame transmission command means, 170 . . . Second address request frame transmission command means, 180 . . . Downstream adjacent node address storage means.

Claims (1)

[Claims] A single ring communication system or a multiple ring communication system in which a plurality of nodes are connected in a loop through a main ring and a sub-ring, and each node has a master loopback mechanism and a slave loopback mechanism. , in the automatic recognition method of adjacent node addresses when there is a change in the system configuration due to the departure or addition of a node, etc., (a) Formation or cancellation of master loopback and slave loopback due to departure or addition of a node, etc. first address request frame transmission command means (140) for commanding transmission of an address request frame having a source address and an address recognition flag set to OFF when a slave loopback is formed or released. and (b
) Detects the state of the address recognition flag of the received address request frame, and if it is on, issues a command to relay the received address request frame as is to the next node, and transmits the on signal to the second node. (c) detecting the state of the address recognition flag of the received address request frame, and if it is OFF, detecting the state of the address recognition flag of the received address request frame; It instructs to relay the address request frame with the recognition flag set to on to the next node, and also stores the source address in the address request frame as the upstream adjacent node address, and sends a message to the source node. (d) when the address recognition flag of the received address request frame is on, a second address request frame transmission command means (170) for instructing transmission of an address request frame with the own node as the transmission source only when the own node is in a slave loopback state; (e) a first or second address; When an address request frame is transmitted based on a command from the request frame transmission command means (140 or 170), when an address notification frame addressed to the own node is received, the source address in this address notification frame is transmitted to a downstream adjacent node. An automatic adjacent node address recognition system characterized in that each node is provided with downstream adjacent node address storage means (180) for storing the address as an address.