JPH0372743A - Duplicate ring initializing method - Google Patents

Abstract

PURPOSE:To establish the synchronization state to make the most of a ring system by using unique key information assigned to each node so as to generate a loop, thereby initializing the duplicate ring. CONSTITUTION:Plural master node candidates 4-6 request a loopback to an adjacent node to form a partial loop and the partial loop is being sequentially expanded similarly after the confirmation of the forming. When collision takes place, the partial loop is absorbed or combined based on the relation of quantity of the key information decided uniquely depending on a random number or the like or the unique key information assigned to the nodes 4-6 and finally a maximum loop is formed by a sole node such as a master node 4 to initialize the duplicate ring. Thus, even when a fault such as a broken line takes place, the synchronization state to make the most of the ring system is established.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention provides a dual ring initialization method, that is, in a dual ring system, when a plurality of master node candidates are arranged to improve reliability, Using a distributed method in which the plural mask candidate nodes receive an initialization start instruction or independently recognize the initialization start, a master node is uniquely determined from among the master node candidates, and the master node becomes the central node. The present invention relates to a method for initializing the dual ring system.

[Conventional technology]

Conventionally, in an initialization method for a dual ring system, initial settings are performed for each ring. In other words, Fig. 8 (
As shown in a), master node candidate a initialized the A ring and also initialized the B ring independently of the A ring.

Regarding the double ring system, ANSI/
IEEE STd, 802.5-1985.
a ring utilizingtoken pass
sing as 1. he access method
d or Draft Std, 802.6. a
dual bus utilizing dlst-
Ributed queuing as the a
The description of the access method can be referred to.

[Problems to be Solved by the Invention] In the conventional double ring system initialization method as described above, when the double ring system is cut at point p as shown in FIG. 8(b), , the double ring system is not initialized.

The present invention has been made in view of the above circumstances, and its purpose is to solve the above-mentioned problems in the conventional technology, and to maximize the synchronization state of the ring system in any state in a dual ring system. The object of the present invention is to provide a dual ring initialization method that allows the establishment of a dual ring initialization method.

[Means to solve the problem]

The above-mentioned object of the present invention is to create a partial loop by requesting a loop return from an adjacent node by a master node candidate at the time of initializing a dual ring system in which two unidirectional transmission rings are combined in opposite directions. After confirming the creation, the next stage adjacent node is taken into the partial loop, and the partial loop is expanded in the same way.Also, multiple master node candidates perform the above procedure in parallel, and collisions occur. When a partial loop occurs, the partial loop is absorbed and merged based on the unique key information assigned to each node or the size relationship of the key information independently determined by random numbers, etc., and finally the partial loop is processed by the only master node. This is achieved by a double ring initialization method characterized by expanding the double ring, creating the largest loop that goes around the double ring and returning to the own node, and initializing the double ring.

[Effect]

As described above, in the dual ring initialization method according to the present invention, in order to improve reliability, when a plurality of master node candidates are arranged, (1) each node is assigned a unique In addition to having key information uniquely determined for each node using key information or random numbers, etc., it is configured to have the following functions in response to various states, so in the end, only one master node can perform partial loops. It becomes possible to expand and initialize the double ring.

(2) When receiving an initialization slot in which loop return instruction information is set, the key information set in the initialization slot is compared in size with the key information assigned to its own node, and the mask candidate node As a result of the size comparison, if the key information held by the own node is larger than the key information transferred in the initialization slot above, the key information of the own node is set without returning the initialization slot indicating the response to the previous node. The initialization slot is transferred to the next stage, and as a result of the above size comparison, if the key information held by the own node is smaller than the key information transferred in the initialization slot, the initialization slot indicating the response is transferred to the previous stage node. Return function (3) When the master node candidate receives the initialization slot in which the first loop expansion instruction information is set,
Function to transfer the initialization slot in which the key information and loopback instruction information set in the initialization slot are set to the next stage node (4) The initialization in which the loop expansion instruction information is set for the second and subsequent times for the above master node candidate Function to transfer the initialization slot with the key information and loop expansion instruction information set in the initialization slot to the next node when receiving the initialization slot. (5) The own key that has gone around the double ring The master node candidate that receives the initialization slot in which the information and return instruction information are set has a function of returning the initialization slot to the previous node after recognizing that its own node has won the master node in the dual ring system. (6) When an initialization slot in which the key information and loop expansion instruction information of the own node are set is received from the previous node, the initialization procedure is terminated to indicate the end of the initialization procedure to other nodes. (7) A function to terminate the initialization procedure by receiving an initialization slot indicating the end of the initialization procedure in which the own key information is set, and The initialization procedure ends when an initialization slot indicating the end of the initialization procedure with information set is not received for a certain period of time or an initialization slot indicating the end of the initialization procedure with key information of another node set. (8) When a node other than the master node receives an initialization slot indicating the end of the initialization procedure, it recognizes the end of the initialization procedure. (9) Key information larger than its own key information and return After receiving an initialization slot in which instruction information is set, a mask candidate node that returns a slot indicating a response to a previous node receives an initialization slot in which loop expansion instruction information is set from a previous node, The stage number mask candidate node migrates to a slave node that does not have the right to become a master node, cancels the self-initialization slot 7 if it is running, and releases the double ring in a loop state at the node ( 10) A function for the master candidate node to start the initialization procedure when it receives an initialization slot from the previous node before starting the initialization procedure. (11) A mask candidate that has transferred the initialization slot in which the loop expansion instruction information is set. A function in which a node transfers its own key information or other key information larger than its own key information and an initialization slot in which return instruction information is set from a previous node, and starts the initialization procedure in the previous direction (12) The above-mentioned previous stage direction When a mask candidate node that is in a state where the initialization procedure was started remains in that state for a certain period of time,
A function of determining that the own node has won over the master node and transferring the initialization slot indicating the end of the initial setting procedure to the previous and next stages of the ring [Example] Hereinafter, an example of the present invention will be described with reference to the drawings. This will be explained in detail based on the following.

FIG. 3 is a diagram showing an example of the configuration of a double ring system. As shown in FIG. 3, a dual ring system consists of a plurality of nodes and a medium that connects them. After the initialization procedure, the slave node consists of the master node that survived from among the mask candidate nodes, and the master node and general nodes that did not survive the master node. configured.

FIG. 4 is a diagram showing the format of the initialization slot. In the figure, a is control information indicating an initialization slot, b is key information uniquely identified in this dual ring system, C is information indicating a return instruction, d is information indicating a response,
e indicates information indicating a loop expansion instruction, and f indicates information indicating the end of the initialization procedure. Note that an initialization slot in which information a is set includes an initialization slot indicating a return instruction in which information C is set, an initialization slot indicating a response in which only information d is set, and an initialization slot in which information e is set. There is an initialization slot that indicates a loop expansion instruction in which an information f is set, and an initialization slot that indicates the end of an initialization procedure in which an information f is set.

Note that FIG. 5 is a diagram showing the states of each node, and the states of each node include a loop state and a loop release state.

The operation of this embodiment configured as described above will be explained below.
This will be explained using FIG. 1, FIG. 2, FIG. 6, and FIG. 7.

First, the operation when there is no failure such as disconnection in the double ring will be explained. FIG. 1 shows the operation sequence of this embodiment in this case. FIG. 2 shows the initialization state when the initialization procedure is completed according to the sequence shown in FIG.

In FIG. 1, the key information of each node is 8. Node 2 is 7. Node 3 is 6, and the arrow indicates the initialization slot, and the symbols attached thereto are used for the following meanings.

α: Initialization slot that indicates a return instruction β: Initialization slot that indicates a response γ: Initialization slot that indicates a loop expansion instruction δ: Initialization slot that indicates the end of the initialization procedure The symbols on the right shoulder are explained below. This is the item number.

(a) First, the node 3 starts the initialization procedure using the initialization procedure start command, and transfers to the node 1 the initialization slot in which the own key information and return instruction information are set.

(b) Also, in node 2, similarly to node 3,
The initialization procedure is started by the initialization procedure start command, and the initialization slot in which the own key information and return instruction information are set is transferred to the node 3. However, the initial setting procedure start commands for node 2 and node 3 are independent from each other.

(C) Node 1 that received the initialization slot in (a) above
Based on this, the initial configuration procedure will be started.

(d) Node 1, which started the initialization procedure in (c), does not send a response slot back to node 3 because its own key information is larger than the key information of node 3 set in the initialization slot. 2, the initialization slot in which the own key information and return instruction information are set is transferred.

(e) Node 3 that received the initialization slot of (b) above
returns a response slot to node 2 because its own key information is smaller than the key information set in the initialization slot.

(f) Node 2 that received the initialization slot in (d) above
returns a response slot to node 1 because its own key information is smaller than the key information set in the initialization slot.

(g) Since there is no response to the above (a), node 3 retries at 0 initialization slot transmission timing,
The initialization slot in which the own key information and return instruction information are set is transferred again to the node 1.

(h) Node 2, which has received the response slot according to (e) above, transmits the response slot to node 3 at the 0 initialization slot transmission timing.
Transfer the initialization slot in which the loop expansion instruction information is set.

(i) Node 3 that received the initialization slot in (h) above
Since the own key information is smaller than the received key information, the initialization slot in which the key information (key information of node 2) and return instruction information set in the initialization slot is synchronized with the initialization slot. to node l, and becomes a slave node without the right to become a master node.

(j) Node 1, which has received the response slot in (f) above, transfers the initialization slot in which own key information and loop expansion instruction information are set to node 2 at the 0 initialization slot transmission timing.

(k) Node 2, which received the initialization slot in which the loop expansion instruction information in (j) above was set, transitions to a slave node that does not have the right to become a master node because its own key information is smaller than the received key information. Then, the initialization slot in which the key information and return instruction information of node l is set is transferred to node 3.

(Q) Node 3 that received the initialization slot of (k) above
returns a response slot to node 2 because its own key information is smaller than the key information set for the initialization lot.

(m) Node 1, which received the initialization slots in (g) and (i) above, returns the response slot to node 3 because the key information set in the initialization slot is smaller than its own key information. do not.

(n) Node 1 transfers the initialization slot in which own key information and loop expansion instruction information are set to node 2 at the 0 initialization slot transmission timing.

(0) When node 2, which has received the (flood) response slot, receives the initialization slot (n) from node 1, it transfers the initialization slot to node 3 and releases the loop.

(p) Node 3 that received the initialization slot in (o) above.
Since the own key information is smaller than the received key information, in synchronization with the initialization slot, the initialization slot in which the key information (key information of node l) and return instruction information set in the initialization slot is set. is transferred to node l.

(q) Node 1 that received the initialization slot of (p) above
Since the own key information is set in the initialization slot, the node returns the response slot to the node 3.

(r) When node 3, which has received the response slot in (q) above, receives from node 2 the initialization slot in which the key information and loop expansion instruction information of node l are set, the node 3 transfers the initialization slot to node l. Transfer and break the loop.

(S) Node 1 recognizes that it has won over the master node in the dual ring by receiving the initialization slot in which the own key information of (p) is set from the previous stage, In addition to canceling the loop, information indicating the end of the initialization procedure was set for all nodes connected to this duplex ring at the 0 initialization slot transmission timing to indicate the end of the initialization procedure. Transfer the initialization slot to both nodes.

(1) Node 2 that received the initialization slot of (S) above
and node 3 recognizes the end of the initialization procedure and further
The initialization slot is transferred to the next stage node 3 and node 2, respectively.

(u) Node 3 that received the initialization slot in (1) above
and node 2 recognizes the end of the initialization procedure and further
The initialization slot is transferred to the next node 1.

Node 1 transfers an initialization slot in which information indicating the end of the initialization procedure is set to nodes 2 and 3 at the 0 initialization slot transmission timing. The node 1 that has received the initialization slot (u) recognizes the end of the initialization procedure.

According to the above-described operation, the ring can be initialized when there is no failure such as disconnection in the duplex ring.

Next, the operation when a failure (disconnection) occurs between nodes 5 and 6 in the above-mentioned dual ring system will be explained using FIGS. 6 and 7.

FIG. 6 shows the operation sequence of this embodiment. FIG. 7 shows the initialization state when the initialization procedure is completed according to the sequence of FIG. 6. Note that in FIG. 6, each symbol is used to have the same meaning as in FIG. 1.

(A) First, the node 6 starts the initialization procedure by using the initialization procedure start command, and transfers to the node 4 the initialization slot in which its own key information and return instruction information are set.

(b) Also, at node 5, similarly to node 6,
The initialization procedure is started by the initialization procedure start command, and the initialization slot in which the own key information and return instruction information are set is transferred to the node 6. However, the initial setting procedure start commands for nodes 5 and 6 are independent from each other.

(1) Node 4 that received the initialization slot in (a) above
starts the initialization procedure based on this.

(1) Node 4, which started the initialization procedure in (1), does not return the response slot to node 6 because its own key information is larger than the key information of node 6 set in the initialization slot. 5, the initialization slot in which the own key information and return instruction information are set is transferred.

(e) Node 5 that received the initialization slot in (1) above
returns a response slot to node 4 because its own key information is smaller than the key information set in the initialization slot.

(I) Since there is no response to the above (a), node 6 retries at the 0 initialization slot transmission timing.
The initialization slot in which the own key information and return instruction information are set is transferred again to the node 4.

(K) Since there is no response to the above (B), node 5 retries at the 0 initialization slot transmission timing.
The initialization slot in which the own key information and return instruction information are set is transferred again to the node 6.

(ri) The node 4 that has received the response slot in (e) transfers the initialization slot in which its own key information and loop expansion instruction information are set to the node 5 at the 0 initialization slot transmission timing.

(vi) Node 4 that received the above initialization slot
does not return a response slot to node 6 because the key information set in the initialization slot is smaller than its own key information.

(e) Node 5, which received the initialization slot in which the loop expansion instruction information in (i) above was set, migrates to a slave node that does not have the right to become a master node, and transfers the key information and return instruction information of node 4. Transfer the set initialization slot to No. 9 Ichidoro.

(S) Node 6 where the above (force) state continued for a certain period of time or more
stops the transfer of the initialization slot, and transfers the initialization slot in which the own key information and return instruction information are set to the node 5 in the opposite direction to the direction in which the initialization slot was transferred using (force).

(c) Node 4 that has been in the above (ri) state for a certain period of time or more
stops the transfer of the initialization slot, and transfers the initialization slot in which the own key information and return instruction information are set to the node 6 in the opposite direction to the direction in which the initialization slot was transferred in (ri).

(S) Node 6 that received the initialization slot in (C) above
returns a response slot to node 4 because its own key information is smaller than the key information set in the initialization slot.

(C) Node 6 transfers the initialization slot in which its own key information and return instruction information are set to node 5 at the 0 initialization slot transmission timing.0 (S) Node 4 receives the response slot in (S) above. transfers the initialization slot in which the own key information and loop expansion instruction information are set to the node 6 at the 0 initialization slot transmission timing.

(ri) Node 6, which received the response slot for the initialization slot in which the loop expansion instruction information set in (e) above, transitions to a slave node that does not have the right to become a master node, and transfers the key information of node 4 and return instructions. The initialization slot in which the information is set is transferred to node 5.

(H) Node 4 transfers the initialization slot in which own key information and loop expansion instruction information are set to node 6 at the 0 initialization slot transmission timing.

(T) Node 4 that has continued in the state of (H) for a certain period of time or more,
(h) The initialization slot transfer is stopped, and the initialization slot in which the own key information and the information indicating the end of the initialization procedure are set is transferred to both nodes.

(T) Node 5 that received the initialization slot in (T) above
And node 6 recognizes the end of the initialization procedure and transfers the key information of node 4 and the initialization slot in which information indicating the end of the initialization procedure is set to node 6 and node 5, respectively.

When node 4 does not receive the initialization slot transferred in step (2) above from node 6 and node 5 for a certain period of time or more, it recognizes that the initialization procedure has ended. At this point, the above (1)
) and (e), node 5 is in a loop state, and the above (
Due to (c) and (s), the node 6 is in a loop state (see FIG. 5).

According to the above operation, even if a failure (disconnection) occurs between nodes 5 and 6 in the dual ring system described above,
The effect is that the initialization of the dual ring can be performed as in the case without the above-mentioned failure.

The above embodiment is shown as an example of the present invention,
It goes without saying that the present invention should not be limited to this.

[Effects of the Invention] As explained above in detail, according to the present invention, even if a failure such as disconnection occurs in a double ring system, the nodes on both sides of the failure point maintain a loop state, and the This has the remarkable effect of realizing a dual ring initialization method that makes it possible to establish a synchronized state of the ring system.

[Brief explanation of drawings]

FIG. 1 is a diagram showing an operation sequence of an embodiment of the present invention;
Fig. 2 is a diagram showing the initialization state of the system corresponding to Fig. 1, Fig. 3 is a diagram showing a configuration example of a dual ring system, and Fig. 4 is a diagram showing the format of the initialization slot used during the initialization procedure. 5 is a diagram showing the state of each node at the end of the initialization procedure, FIG. 6 is a diagram showing the operation sequence of an embodiment of the present invention, and FIG. 7 is a diagram showing the system corresponding to FIG. 6. FIG. 8, which is a diagram showing the initialization state, is a diagram for explaining the initialization method of the conventional dual ring system. (a) to (u), (a) to (te): Operation steps. Figure 2 Node l (Master node) Node 2 Node 3 (Slave node) (Slave node) Figure 7 Figure Node 4 (Master node) Node 5 Node 6 (Slave node) Figure (a) ( b) A link initialization 438

Claims (1)

[Claims] (1) When initializing a dual ring system that combines two unidirectional transmission rings in opposite directions, a master node candidate requests an adjacent node to loop back, creates a partial loop, and after confirming the creation. , further incorporates the next-stage adjacent node into its partial loop, and similarly expands the partial loop sequentially. Also, if multiple master node candidates perform the above procedure in parallel and a collision occurs, Based on the unique key information assigned to each node or the size relationship of the key information independently determined by random numbers, etc., partial loops are absorbed and merged, and finally the partial loop is expanded by the only master node, resulting in double A double ring initialization method characterized by initializing a double ring by creating the largest loop that goes around the ring and returns to its own node.