CN108259110A - Main selection method is synchronized for keeping synchronous between multinode in bidirectional redundancy looped network - Google Patents
Main selection method is synchronized for keeping synchronous between multinode in bidirectional redundancy looped network Download PDFInfo
- Publication number
- CN108259110A CN108259110A CN201711438530.4A CN201711438530A CN108259110A CN 108259110 A CN108259110 A CN 108259110A CN 201711438530 A CN201711438530 A CN 201711438530A CN 108259110 A CN108259110 A CN 108259110A
- Authority
- CN
- China
- Prior art keywords
- node
- looped network
- master
- message
- selection method
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/08—Intermediate station arrangements, e.g. for branching, for tapping-off
- H04J3/085—Intermediate station arrangements, e.g. for branching, for tapping-off for ring networks, e.g. SDH/SONET rings, self-healing rings, meashed SDH/SONET networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0638—Clock or time synchronisation among nodes; Internode synchronisation
- H04J3/0658—Clock or time synchronisation among packet nodes
- H04J3/0661—Clock or time synchronisation among packet nodes using timestamps
- H04J3/0667—Bidirectional timestamps, e.g. NTP or PTP for compensation of clock drift and for compensation of propagation delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0685—Clock or time synchronisation in a node; Intranode synchronisation
- H04J3/0697—Synchronisation in a packet node
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
- Small-Scale Networks (AREA)
Abstract
A kind of to be used to keep the synchronous main selection method that synchronizes in bidirectional redundancy looped network between multinode, first priority conditions of this method are the node numbers that node message can be sent to, and the second priority conditions are from node number, and third priority condition is node hardware number；The node number that first priority conditions node message of the core methed for synchronizing main selection method can be sent to refers to select during link is imperfect or link changes message can be sent to the most node of node number as synchronizing master；Second priority of the core methed for synchronizing main selection method is to refer to from node number when the node for meeting the first priority conditions is not unique, is selected wherein from the most node of node number as synchronizing master；The third priority of the core methed for synchronizing main selection method is that node hardware number refers to when the node for meeting the first priority conditions and the second priority conditions is not unique, then to select the node of wherein hardware identifier number minimum as synchronizing master；The inventive method has the characteristics that synchronous effect is good, adaptable, simple in rule, reliability is high.
Description
Technical field
The present invention relates to electrical technology field more particularly to electrician's communication technologys, particularly a kind of to be used for bidirectional redundancy ring
Keep synchronization in net between multinode synchronizes main selection method, for solving to synchronize main choosing when bidirectional redundancy loop network link changes
Select problem.
Background technology
As bidirectional redundancy looped network is more and more widely used in electrical technology field, other phases based on the network architecture
Pass technology also gradually initially enters the visual field of people, and simultaneous techniques is exactly a ring of wherein most basic most critical.
It is artificial given host to form synchronous most plain mode between more node apparatus of looped network, one master and multiple slaves it is same
Step mode, but which can cause whole system to be paralysed in host fails, so availability is not high；Based on external clock or
Synchronizing for satellite in the sky is a kind of simple method of synchronization, but which due to have dependence to external device (ED) and can not be by can
Extra high device is required to be received by property, people still wish a kind of method independent of any external device (ED) so that
Holding synchronizes, and again independent of a certain particular host between forming more node apparatus of looped network.
The correspondence model of the technical problem mathematically is election algorithm problem.Election is that one kind in distributed system is normal
Calculating type, it selects a process from process sets and performs special task.For example, it breaks down in distributed system
Afterwards, it usually needs the node of reorganization activity makes them continue to execute useful task.This reorganization and configuration
In the process, a coordinator is selected to manage these operations.The detection of failure is normally based on timeout mechanism.If one into
Journey is more than the regular hour not receive the response of coordinator, it just suspects that coordinator is out of order and starts election process.Choosing
Act is all widely used in fields such as group's server, load balance, repeated data update, emergency recovery, connection group and mutual exclusions.Choosing
Lifting each process in the realization of algorithm has identical local algorithm；Algorithm is distributed, that is, the arbitrary nonvoid subset of process
It can start once to calculate；In each calculate, algorithm reaches termination configuration.In each reachable termination configuration, only one
A process is in leader's state, and other all processes are in status of fail.The last one property can weaken, and only require
One process is in leader's state.
Conventional election algorithm all assumes that network is the operating mode of normal operation or two-way simultaneous break-make, but two-way superfluous
In remaining looped network, network linking is likely to unidirectional and piecemeal, this allow for conventional algorithm realize elect when or statistics
Information is insufficient or can not notify election results to all members on looped network.And technical solution proposed by the present invention is then
Such issues that can avoid to the full extent, especially suitable for keeping synchronous work mutually between multiple nodes on bidirectional redundancy looped network
Condition.Particularly when network state is imperfect, its technical advantage and effect can be most played.
Invention content
The invention discloses a kind of for keeping the synchronous main selection method that synchronizes between multinode in bidirectional redundancy looped network, use
To solve to synchronize main select permeability when bidirectional redundancy loop network link changes.
In order to solve the above technical problems, the present invention uses following technical scheme.
It is a kind of to synchronize main selection method for keeping synchronous between multinode in bidirectional redundancy looped network, which is characterized in that institute
It states and synchronizes main selection method and include the following steps：
Step 1：The equal reception ring of each node Synchronization Status Message that all nodes are sent out on the net on bidirectional redundancy looped network
Message is selected comprising the Synchronization Status Message counting messages that the node receives in Synchronization Status Message message synchronous with the node
Host node；The initial data that the Synchronization Status Message message content is used for follow-up all step judgements, the Synchronization Status Message
Message is also referred to as original message；
Step 2：All original messages received by step 1 synchronize master, i.e., according to the selection of the first priority conditions：Statistics
The being sent to property of each node message, the most node of node number can be sent to by obtaining message, if node number can be sent to most
More nodes is unique, then the node is just selected as synchronizing master, synchronizes main selection method and is finished；It is if eligible
Node number it is not unique, then enter step 3；
Step 3：According to the second priority conditions selection synchronize master, that is, select wherein from the most node of node number as
Synchronize master；If the node from node number maximum is unique, which is to synchronize master；If maximum from node number
Node has multiple, then continues to perform step 4, master is synchronized by the selection of third priority condition；
Step 4：Master is synchronized according to the selection of third priority condition, that is, the node of wherein hardware identifier number minimum is selected to make
To synchronize master.
The present invention further comprises following preferred embodiment：
In step 2, if synchronization packets, that is, node message of certain node A can be sent to all other node in looped network,
So node number that is sent to of node A is most.
In step 3, the synchrodata of certain node B is received by M looped network node as synchronization master, then node B
Slave node number be M；If have from the node that node number is maximum M multiple, then execution subsequent step is continued to, by the
The selection of three priority conditions synchronizes master.
In step 4, hardware identifier number is the hardware initialization number for identifying each node in looped network, which exists
In looped network there is uniqueness, do not repeat；The media access control address (MAC Address) of each node can be used in hardware initialization number
Or other customized node configurations with looped network uniqueness number to realize.
Above-mentioned steps 2-4 is independently executed on each node, and execution interval recommendation is 1 second；Such as it is spaced 1 second overload
Execution interval can be appropriately extended.
The present invention compares with technology existing in background technology, has the advantage that：
1st, each node is respective complete independently election and selects master, does not need to unified election process, is suitble to asynchronous environment；
2nd, election results are issued independent of broadcasting packet, and frame losing will not cause node inconsistent to broadcasting packet once in a while；
3rd, good for incomplete network environment adaptability, performance is excellent；
4th, it is convenient to realize, reasonable design, and reliability is high.
Description of the drawings
Fig. 1 illustrates for the present invention for the synchronous main selection method flow that synchronizes of holding between multinode in bidirectional redundancy looped network
Figure；
The tetra- imperfect operating status schematic diagrames of node bidirectional redundancy looped network of Fig. 2.
Specific embodiment
The present invention is described in further details below according to attached drawing and implementation example.
As shown in Figure 1 main selection method stream is synchronized for keeping synchronous between multinode in bidirectional redundancy looped network for the present invention
Journey schematic diagram synchronizes main selection method and includes the following steps：
Step 1：The equal reception ring of each node Synchronization Status Message that all nodes are sent out on the net on bidirectional redundancy looped network
Message is selected comprising the Synchronization Status Message counting messages that the node receives in Synchronization Status Message message synchronous with the node
Host node；The initial data that the Synchronization Status Message message content is used for follow-up all step judgements；With shown in Fig. 2 two-way
For four node system of redundant looped network, if fiber link is as shown in the figure, three optical fiber are to disconnect, i.e.,：Node 1 and node 2
Between the two-way disconnection of direct channel, node 4 to 3 one direction of node disconnect.At this point, No. 1 node can receive 1,2,3, No. 4 nodes
Data；No. 2 nodes can only receive the data of No. 2,3 nodes；No. 3 nodes can only receive the data of No. 2,3 nodes；No. 4 nodes
The data of No. 1,2,3,4 nodes can be received；
Step 2：All original messages received by step 1 count the being sent to property of each node message, select message can
It is sent to the most node conduct of node number and synchronizes master；If the synchronization packets of certain node A can be sent to all other in looped network
Node, then the node number that is sent to of node A is most；Can be calculated by the reception for counting each node in looped network can
Be sent to the most node of node number be which or which；If can be sent to the most node of node number be it is unique,
So the node is just selected as synchronizing master, synchronizes main selection method and is finished；If qualified node number is not unique,
So continue to subsequent step；Continue by taking four node system of bidirectional redundancy looped network shown in Fig. 2 as an example, No. 2 nodes and No. 3 nodes
Situation it is similar, the data of 2,3 nodes can be received, one the selection result of priority condition proposed according to this patent is not unique, knot
Fruit is No. 2,3 nodes；No. 1 node is similar with No. 4 nodes, can receive the data of all 4 nodes, is proposed according to this patent excellent
First one the selection result of condition is not unique, and result is all 2, No. 3 nodes；
Step 3：It is not unique that the message counted by step 2 can be sent to the most node of node number, meets item there are multiple
The node of part, then select wherein from the most node of node number as synchronizing master；Such as the synchrodata of certain node A is by N
A looped network node receives as synchronization master, then the slave node number of node A is N；If the node of N maximums is unique
, which is to synchronize master；If the node of N maximums has multiple, then continues to perform subsequent step, by third priority
Condition selects；Continue by taking four node system of bidirectional redundancy looped network shown in Fig. 2 as an example, step 2 is by the screening of all four nodes
Range shorter is to node 2 and node 3, according to the priority condition two that this patent proposes from node 2 and the synchronous master of selection in node 3,
At this time may be there are two types of situation, a kind of situation is that node 2 and 3 slave node number are different, selects the section more than the node number
Point is host node, and selection course successfully terminates；Another situation be node 2 with 3 the identical the selection result of slave node number not only
One, the step of continuation below；Step 4：Meet the first priority conditions and the second priority conditions while statistics by step 3
Node is not unique, that is, exists simultaneously multiple nodes for meeting condition, then the node of selection wherein hardware identifier number minimum is made
To synchronize master；Hardware identifier number is the hardware initialization number for identifying each node in looped network, which has in looped network
There is uniqueness, do not repeat；The media access control address (MAC Address) of each node or other customized tools can be used in the number
There is the node configuration number of looped network uniqueness to realize；Continue by taking four node system of bidirectional redundancy looped network shown in Fig. 2 as an example, it is existing
It is assumed that using node number as hardware identifier number, according to the priority condition three that this patent proposes, select node number minimum
No. 2 nodes for host node, selection course successfully terminates；Above-mentioned steps independently execute on each node, and execution interval is recommended
Be worth is 1 second；Execution interval can be appropriately extended by being such as spaced 1 second overload；
Again by taking four node system of bidirectional redundancy looped network shown in Fig. 2 as an example, if the directive optical fiber connection of institute is normal,
Assuming that also normally connection is not turned off the optical fiber of three disconnections drawn in figure, then synchronizes main selecting party according to the present invention
Method, the first node of priority alternative condition four are satisfied by, and the second node of priority alternative condition four is also satisfied by, eventually
The node of hardware identifier number minimum is selected as synchronizing master using third priority condition；Other situations are no longer analyzed one by one.
Applicant is described in detail and describes to the embodiment of the present invention with reference to Figure of description, but this field skill
Art personnel are it should be understood that above example is only the preferred embodiments of the invention, and explanation is intended merely to help reader in detail
More fully understand spirit of the invention, and it is not intended to limit the protection scope of the present invention, on the contrary, any invention essence based on the present invention
Any improvement or modification that god is made should all be fallen within the scope and spirit of the invention.
Claims (5)
1. a kind of synchronize main selection method for keeping synchronous between multinode in bidirectional redundancy looped network, which is characterized in that described
Main selection method is synchronized to include the following steps：
Step 1：The equal reception ring of each node Synchronization Status Message message that all nodes are sent out on the net on bidirectional redundancy looped network,
The synchronous main section selected in Synchronization Status Message message comprising the Synchronization Status Message counting messages that the node receives with the node
Point；The initial data that the Synchronization Status Message message content is used for follow-up all step judgements, the Synchronization Status Message message
Also referred to as original message；
Step 2：All original messages received by step 1 synchronize master, i.e., according to the selection of the first priority conditions：Count each
The being sent to property of node message, the most node of node number can be sent to by obtaining message, if it is most to be sent to node number
Node is unique, then the node is just selected as synchronizing master, synchronizes main selection method and is finished；If qualified section
Point number is not unique, then enters step 3；
Step 3：Master is synchronized according to the selection of the second priority conditions, that is, is selected wherein from the most node of node number as synchronization
It is main；If the node from node number maximum is unique, which is to synchronize master；If from the node of node number maximum
Have multiple, then continue to perform step 4, master is synchronized by the selection of third priority condition.
Step 4：Master is synchronized according to the selection of third priority condition, that is, selects the node of wherein hardware identifier number minimum as same
Step master.
2. according to claim 1 synchronize main selection method for keeping synchronous between multinode in bidirectional redundancy looped network,
It is characterized in that：
In step 2, if synchronization packets, that is, node message of certain node A can be sent to all other node in looped network, then
The node number that is sent to of node A is most.
3. according to claim 1 synchronize main selection method for keeping synchronous between multinode in bidirectional redundancy looped network,
It is characterized in that：
In step 3, the synchrodata of certain node B is received by M looped network node as synchronization master, then node B from
Node number is M；If have from the node that node number is maximum M multiple, then it continues to perform subsequent step, it is excellent by third
First grade condition selection synchronizes master.
4. according to claim 1 synchronize main selection method for keeping synchronous between multinode in bidirectional redundancy looped network,
It is characterized in that：
In step 4, hardware identifier number is the hardware initialization number for identifying each node in looped network, and the number is in looped network
In have uniqueness, do not repeat；Hardware initialization number can be used each node media access control address (MAC Address) or its
Its customized node configuration with looped network uniqueness numbers to realize.
5. according to claim 1 synchronize main selection method for keeping synchronous between multinode in bidirectional redundancy looped network,
It is characterized in that：
Above-mentioned steps 2-4 is independently executed on each node, and execution interval recommendation is 1 second；Such as being spaced 1 second overload can fit
When extension execution interval.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711438530.4A CN108259110B (en) | 2017-12-27 | 2017-12-27 | Synchronous master selection method for keeping synchronization among multiple nodes in bidirectional redundant ring network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711438530.4A CN108259110B (en) | 2017-12-27 | 2017-12-27 | Synchronous master selection method for keeping synchronization among multiple nodes in bidirectional redundant ring network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108259110A true CN108259110A (en) | 2018-07-06 |
| CN108259110B CN108259110B (en) | 2020-02-28 |
Family
ID=62724015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711438530.4A Active CN108259110B (en) | 2017-12-27 | 2017-12-27 | Synchronous master selection method for keeping synchronization among multiple nodes in bidirectional redundant ring network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108259110B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090268609A1 (en) * | 2008-04-25 | 2009-10-29 | Calix, Inc. | Efficient management of ring networks |
| CN102014001A (en) * | 2010-12-08 | 2011-04-13 | 迈普通信技术股份有限公司 | Method and exchange equipment for realizing fast Ethernet ring |
| CN107359939A (en) * | 2016-05-09 | 2017-11-17 | 中兴通讯股份有限公司 | A kind of light adjusts the transmission method and device of top signal |
-
2017
- 2017-12-27 CN CN201711438530.4A patent/CN108259110B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090268609A1 (en) * | 2008-04-25 | 2009-10-29 | Calix, Inc. | Efficient management of ring networks |
| CN102014001A (en) * | 2010-12-08 | 2011-04-13 | 迈普通信技术股份有限公司 | Method and exchange equipment for realizing fast Ethernet ring |
| CN107359939A (en) * | 2016-05-09 | 2017-11-17 | 中兴通讯股份有限公司 | A kind of light adjusts the transmission method and device of top signal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108259110B (en) | 2020-02-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101189837B (en) | Packet ring network system, packet transfer method, and node | |
| US4745597A (en) | Reconfigurable local area network | |
| US5761439A (en) | Method and apparatus for synchronizing communications between networked computers | |
| CN102664750B (en) | Method, system and device for hot backup of multi-machine | |
| CN110034983B (en) | Home equipment linkage method and system based on publish-subscribe message processing mechanism | |
| EP2911341A1 (en) | Method and device for dynamically switching gateway of distributed resilient network interconnect | |
| EP0096419B1 (en) | Distributed variable-band switching system for speech and data | |
| CN103607293B (en) | A kind of flow rate protecting method and equipment | |
| CN101217424B (en) | A detecting method and device of aggregated link failures | |
| CN101841450B (en) | Method and system for realizing stable communication by forming multiple ring topologies into intersecting ring | |
| IL105671A (en) | Distributed control methodology and mechanism for implementing automatic protection switching | |
| CN108959167A (en) | A kind of seat system management method, device and seat system | |
| CN105357057B (en) | A kind of acentric monitoring management node strange land redundancy approach | |
| EP0748546A1 (en) | Hierarchical synchronization method | |
| CN114371912A (en) | Virtual network management method of data center and data center system | |
| CN110912815B (en) | Network element ring formation preventing method, device, equipment and readable storage medium | |
| CN102282787A (en) | Method for synchronizing local clocks in a distributed computer network | |
| CN105812492B (en) | A kind of method of data synchronization and system | |
| CN105763483A (en) | Message sending method and message sending device | |
| CN105553765A (en) | FC-AV protocol processing chip network communication robustness testing method | |
| CN108259110A (en) | Main selection method is synchronized for keeping synchronous between multinode in bidirectional redundancy looped network | |
| CN101771580A (en) | Processing method for redundancy checking of ring network | |
| US7162544B2 (en) | Message transfer method and apparatus | |
| CN103414591A (en) | Method and system for fast converging when port failure is recovered | |
| CN104483828A (en) | Distributed fault tolerance computer member consistency ensuring method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |