CN105515912B - Linkage availability detection and processing method between a kind of multinode - Google Patents
Linkage availability detection and processing method between a kind of multinode Download PDFInfo
- Publication number
- CN105515912B CN105515912B CN201510970908.XA CN201510970908A CN105515912B CN 105515912 B CN105515912 B CN 105515912B CN 201510970908 A CN201510970908 A CN 201510970908A CN 105515912 B CN105515912 B CN 105515912B
- Authority
- CN
- China
- Prior art keywords
- time
- link
- heartbeat
- node
- message
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
Abstract
The invention discloses linkage availability detection and processing methods between a kind of multinode, belong to TETRA digital cluster system Multi-node link transmission fields.A variety of phenomenons would generally occur on the chain road of multiple node mutual data transmissions:Permanently effective, link disconnects for a long time, link first disconnect restore afterwards, disconnected in link effective procedure, link disconnects and recovery phenomena such as being alternately present.These phenomenons cause various unusual conditions in actual operational process to application program.The present invention sends the time of heartbeat request by calculate node every time, when these times are dispersed on layout, the validity of link is detected in predetermined period, and carries out the detection of link-recovery using hypothetical recovery policy during link-recovery.The feedback that the validity of link is increased by these modes selects link to provide accurate guarantee for application program.
Description
Technical field
The present invention relates to TETRA digital cluster system Multi-node link transmission fields, more particularly, to a kind of multinode it
Between linkage availability detection and processing method.
Background technology
In digital cluster system, switching centre and base station can regard the node being in communication with each other as, lead between each node
It crosses selected communication protocol to be communicated, and requires the link between two nodes that there is wanting for reliability between each node
It asks.Under actual link circuit condition, the state of link may have after link is permanently effective, link disconnects for a long time, link first disconnects
Phenomena such as disconnection, link disconnection and recovery are alternately present in recovery, link effective procedure.In the case of complex network quality,
Unstable Transmission system the function of Digital Clustering can be generated various expections less than influence, for example cause prolonging for call setup
Late, call setup failure etc..It detects the stability of link, degree of jitter and the case where following link is prejudged, it is right
The function of digital cluster system has very great meaning.
In order to detect that these states, the continuous n times heartbeat detection of prior art generally use all do not receive other side's response
The mode of message detects, and this detection mode can to a certain extent be detected the above phenomenon, but in practical fortune
With in the process, the value of N decides the speed degree of testing result, and the too small detection of N values can quickly, but the tolerance of link is spent
It is low;And N values are excessive, detection can be very slow, but the tolerance of link can be very high.In addition continuous n times heartbeat detection disconnects link
It can fail with the condition detection for restoring to be alternately present, can also bring the possibility of continuous link state alarm sometimes.
With increasing for number of nodes, a node needs the quantity of the node connected also increasing, and can bring about in this way
The requirement of single node and Multi-node link high concurrent, while also reliability detection causes to detect required timer between node
Excessive puzzlement.Meeting since in this way, node is more, more to the consumption of resource, leaves the money of data packet transmission between node for
Source is fewer.
Invention content
The technical problem to be solved by the present invention is to:Link congestion between a kind of switching centre and base station site is provided, is trembled
Dynamic detection and processing method.In Digital Clustering field, it is ensured that the real-time of digital cluster system, switching centre and base station it
Between a kind of link of stabilization must be provided, to provide alarm in time in face of shaking more serious link, and in link-recovery
When can timely restore.In face of more complicated dither cycle also can intelligence predicted and judged, to ensure to exchange
Data can transmit correctly, in real time between control centre and base station.
The purpose of the present invention is achieved through the following technical solutions:Linkage availability detection method between a kind of multinode,
Include the following steps:
S1:The network connection between node is established, the corresponding link state of each node is initialized as Link down status;
S2:Source node sends heartbeat request message to each peer node respectively, records the time that heartbeat request message is sent,
And the stand-by period is responded according to heartbeat, calculate each nodes heart beat time-out time;
S3:Source node waits for the message that each peer node is sent within the current preset period, if receiving peer node
The message sent, record receive the time of message, and the state for updating this link is effective;If not receiving peer node hair
The message sent judges whether this link is effective according to slow detection, records the heartbeat timeout time;Wherein, message includes heartbeat
Response message or heartbeat request message;
S4:Layout when calculating separately each node and send the time of heartbeat request message next time, and corresponding node being placed on
It is interior;Wherein, the when layout is:Timeline is divided into same intervals, when the timeline between two adjacent spaces is as one
Layout, when layout memory put the heartbeat affairs to be completed in this time interval, heartbeat affairs include:Nodes heart beat initiates affairs
With nodes heart beat time-out affairs, the heartbeat affairs of each node are averagely distributed in time lattice;
S5:The stand-by period is responded according to the heartbeat next time of each node, calculates each node heartbeat timeout time next time, and
When corresponding node is placed in layout;
S6:Into next predetermined period S3 is executed using next predetermined period as the current preset period.
Wherein, the basis described in S3 detects slowly judges whether this link is effective, specially:Continuous n times send heartbeat
Request message, accumulative appearance do not receive heartbeat response message number and reach predetermined threshold value, then Link down;Otherwise, link is effective;
Wherein, N is natural number.
Wherein, 6 N, predetermined threshold value 3.
Wherein, the time for calculating separately each node and sending heartbeat request message next time described in S4, specially:
THeatbeat=MAX { THeartbeatExpiry,TDataConfirm,TDataIndication,THeartbeatRSP}+TPeriod;
Wherein:THeartbeat:Present node sends the time of heartbeat request message next time;THeartbeatExpiry:Work as prosthomere
The time of the last nodes heart beat time-out of point;TDataConfirm:The time that present node the last time node data packet confirms;
TDataHeartRSP:The time of present node the last time nodes heart beat response;TDataIndcation:Present node the last time receives
The time of node data packet;TPeriod:Heartbeat request message sending cycle.
Wherein, the stand-by period is responded according to the heartbeat next time of each node described in S5, calculates each node heart next time
Time-out time is jumped, specially:
TExpiry=THeartbeat+TWait,
Wherein:TExpiry:Present node heartbeat timeout time next time;THeartbeat:Present node sends heartbeat next time
The time of request message;TWait:Present node heartbeat next time responds the stand-by period.
The recovery detection method of link exception, includes the following steps between a kind of multinode:
(1) if current ink is invalid, current ink recovery is carried out using quickly hypothetical recovery policy;
(2) judge whether recovery policy succeeds, if it is successful, terminating this flow;If it fails, then thinking that current ink is trembled
It is dynamic, judge whether current ink is effective using slow Restoration Mechanism.
Wherein, the quick hypothetical recovery policy is specially:When link is chronically at invalid state, if chain
Road receives heartbeat response then this link-recovery.
Wherein, the slow Restoration Mechanism is specially:Packet loss in statistics setting time prejudges link state, when losing
Packet rate is more than upper threshold value, and judges Link down;When packet loss be less than lower threshold value, then judge that link is effective;When packet loss ratio position
In threshold interval, then the same data packet is sent twice.
Wherein, the threshold interval is:1%~3%.
Compared with prior art, the method have the advantages that:
(1) accurately and effectively break-make anticipation can be reached on IP chains road and carry out data transmission.
(2) can be in digital cluster system, data transmission provides very intelligent bearing capacity between multiple nodes.It can
To be described with following word:Link is stablized, normal work;Link is obstructed, alerts in time;Transmission is reinforced in the small shake of link
Channel;The big shake of link alerts in time.
Description of the drawings
Layout structure chart when Fig. 1 is the present invention;
Layout process chart when Fig. 2 is the present invention;
Fig. 3 be the present invention under Link down status, heartbeat process chart;
Fig. 4 be the present invention under Link up status, heartbeat process chart.
Specific implementation mode
Below in conjunction with the accompanying drawings, the method for the invention is described in further detail.
The case where link, is generally divided into following several situations:Link is unimpeded, link delay is big, link has packet loss, chain once in a while
Road randomness packet loss, isl cycle packet loss, a large amount of packet losses of link, link are obstructed.These are all to the performance of digital cluster system
Have a significant impact.The method of the present invention and calculates back by using the mechanism of message echo between switching control center and base station
Sound lag, the case where analyzed link condition according to the data of a period of time and obtain current ink, and to following chain
Road stability is prejudged.
Link is unimpeded, link delay is big, the obstructed these types of situation of link can directly can be obtained by the response of echo
The direct feedback of the case where conclusion, these conclusions directly can be as link.There is packet loss in link flapping i.e. link
In the case of detection need to analyze the echo in a period of time section feedback, packet loss ratio in the analystal section time, with
And packet loss trend, to be prejudged to following link condition.In face of packet loss ratio in the link of threshold value (1%~3%), use
Same data packet sends the transmission success rate that mode twice increases data, in face of packet loss ratio 3% or more threshold value chain
Road will stop the transmission of data, and generate warning information, inform that engineering staff repaiies into looking into for line link.
A kind of method that linkage availability detects between multinode, includes the following steps:
S1:The network connection between node is established according to communication requirement, and the corresponding link state of each node is initialized as
Link down state;
Embodiment:Switching centre and base station are regarded as identical transmission node, are attached by IP network.In node
It is interior, the storage region of the information of multiple nodes is established, the information of each node is stored in individual region, and to each section
The corresponding link state of point is initialized as link down state.
S2:Source node sends heartbeat request message, the time that record heartbeat request message is sent to each peer node respectively;
S3:Source node waits for the message that each peer node is sent within the current preset period, if receiving peer node
The message sent, record receive the time of message, and the state for updating this link is effective;If not receiving peer node hair
The message sent judges whether this link is effective according to slow detection, records the heartbeat timeout time;Wherein, message includes heartbeat
Response message or heartbeat request message;
Embodiment:After system starts, node sends heartbeat message to multiple peer nodes respectively, then waits for heartbeat response
Message, if receiving the heartbeat message that heartbeat response message or peer node are sent, the state for updating this link is
Can use, and notify correlation module, this link is available, can on this road Tiao Lian transmission data packet;
If not receiving the heartbeat message that heartbeat response message or peer node are sent, continuous 6 transmissions heart
Request message is jumped, accumulative occur not receiving heartbeat response message 3 times, then Link down;Otherwise, link is effective.As shown in Figure 4.
S4:Layout when calculating separately each node and send the time of heartbeat request message next time, and corresponding node being placed on
It is interior;
Embodiment:When sending heartbeat message, transmission data packet or receiving the data packet message of Correspondent Node, record in real time
Record following information:Heartbeat send time, receive heartbeat response time, the heartbeat timeout time, transmission data packet time,
Data packet is received to receive the time of response, response package time-out time, receive Correspondent Node packet time;By it is above this
A little temporal informations calculate the time of heartbeat next time, and this time is placed on planned in advance when layout in.
The when layout is:Timeline is divided into same intervals, when the timeline between two adjacent spaces is as one
Layout, when layout memory put the heartbeat affairs to be completed in this time interval, heartbeat affairs include:Nodes heart beat initiates affairs
With nodes heart beat time-out affairs, the heartbeat affairs of each node are averagely distributed in time lattice.As shown in Figure 1.
After system starts, prepare to send heartbeat message, layout when these affairs are placed on corresponding to each node first
Nodes heart beat initiate affairs in;Then according to nodes heart beat time-out affairs are first handled, reprocessing nodes heart beat initiates affairs
Affairs in sequence clock synchronization layout are handled.When layout in issued transaction after the completion of, the arrival of layout when waiting for next,
The issued transaction of layout when carrying out next.As shown in Figure 2.
Each node sends the time of heartbeat request message next time, specially:
THeatbeat=MAX { THeartbeatExpiry,TDataConfirm,TDataIndication,THeartbeatRSP}+TPeriod;
Wherein:THeartbeat:Present node sends the time of heartbeat request message next time;THeartbeatExpiry:Work as prosthomere
The time of the last nodes heart beat time-out of point;TDataConfirm:The time that present node the last time node data packet confirms;
TDataHeartRSP:The time of present node the last time nodes heart beat response;TDataIndcation:Present node the last time receives
The time of node data packet;TPeriod:Heartbeat request message sending cycle.
In this way, oriented peer node send time of heartbeat and be just evenly dispersed on timeline, avoid
Synchronization sends network congestion caused by a large amount of heartbeat message.
S5:The stand-by period is responded according to the heartbeat next time of each node, calculates each node heartbeat timeout time next time, and
When corresponding node is placed in layout;Specially:
TExpiry=THeartbeat+TWait,
Wherein:TExpiry:Present node heartbeat timeout time next time;THeartbeat:Present node sends heartbeat next time
The time of request message;TWait:Present node heartbeat next time responds the stand-by period.
S6:Into next predetermined period S3 is executed using next predetermined period as the current preset period.
When Fig. 3 is Link down, the flow chart of link-recovery is carried out.The recovery side of link exception between a kind of multinode
Method includes the following steps:
(1) if current ink is invalid, current ink recovery is carried out using quickly hypothetical recovery policy;
(2) judge whether recovery policy succeeds, if it is successful, terminating this flow;If it fails, then thinking that current ink is trembled
It is dynamic, judge whether current ink is effective using slow Restoration Mechanism.
Embodiment:In the case where link has judged obstructed, using quickly hypothetical recovery policy come into line link
Restore notice.Specially:When link is chronically at invalid state, this link-recovery if chain road receives heartbeat response.
The notice that alternately link disconnects and restores may be brought by the mechanism of fast quick-recovery, it in this way will certainly logarithm
Prodigious influence is caused according to transmission, here by accumulating study mechanism within a certain period of time, alternate link disconnects and restores super
It crosses 2 times, link-recovery mechanism next time will judge that this link-recovery is normal using the mechanism restored slowly.
Slowly Restoration Mechanism is specially:Link prejudges link state by the way of packet loss statistics, the number of transmission
It cannot be denoted as packet loss according to packet or heartbeat message, count the packet loss in nearest a period of time to prejudge link state:
When packet loss continues to increase, increase to 3% or more, it is unavailable to application module report link immediately;
When packet loss is reduced to 1% hereinafter, then available to application module report link;
It is located at 1%~3% link in face of packet loss ratio, increases data in such a way that the same data packet is sent twice
Transmission success rate, the link in face of packet loss ratio in 3% or more threshold value will stop the transmission of data, and generate warning information,
Inform that engineering staff repaiies into looking into for line link.
The congestion state of link can timely be notified to application module in this way, obtain application effect well
Fruit.
Claims (6)
1. linkage availability detection method between a kind of multinode, which is characterized in that include the following steps:
S1:The network connection between node is established, the corresponding link state of each node is initialized as Link down status;
S2:Source node sends heartbeat request message, the time that record heartbeat request message is sent, and root to each peer node respectively
The stand-by period is responded according to heartbeat, calculates each nodes heart beat time-out time;
S3:Source node waits for the message that each peer node is sent within the current preset period, if receiving peer node transmission
The message come, record receive the time of message, and the state for updating this link is effective;If not receiving peer node to send
Message, judge whether this link effective according to slow detection, the record heartbeat timeout time;Wherein, message includes heartbeat response
Message or heartbeat request message;The basis detects slowly judges whether this link is effective, specially:Continuous n times are sent
Heartbeat request message, accumulative appearance do not receive heartbeat response message number and reach predetermined threshold value, then Link down;Otherwise, link
Effectively;Wherein, N is natural number;
S4:When calculating separately each node and send the time of heartbeat request message next time, and corresponding node being placed in layout;Its
In, the when layout is:Timeline is divided into same intervals, the timeline between two adjacent spaces as layout at one,
When layout memory put the heartbeat affairs to be completed in this time interval, heartbeat affairs include:Nodes heart beat initiates affairs and section
Point heartbeat timeout affairs, are averagely distributed to the heartbeat affairs of each node in time lattice;
S5:The stand-by period is responded according to the heartbeat next time of each node, calculates each node heartbeat timeout time next time, and right
When node being answered to be placed in layout;
S6:Into next predetermined period S3 is executed using next predetermined period as the current preset period.
2. linkage availability detection method between a kind of multinode according to claim 1, it is characterised in that:N is 6, in advance
If threshold value is 3.
3. linkage availability detection method between a kind of multinode according to claim 1, it is characterised in that:Described in S4
The time for calculating separately each node and sending heartbeat request message next time, specially:
THeatbeat=MAX { THeartbeatExpiry,TDataConfirm,TDataIndication,THeartbeatRSP}+TPeriod;
Wherein:THeartbeat:Present node sends the time of heartbeat request message next time;THeartbeatExpiry:Present node is most
The time of nearly nodes heart beat time-out;TDataConfirm:The time that present node the last time node data packet confirms;
TDataHeartRSP:The time of present node the last time nodes heart beat response;TDataIndcation:Present node the last time receives
The time of node data packet;TPeriod:Heartbeat request message sending cycle.
4. linkage availability detection method between a kind of multinode according to claim 1, it is characterised in that:Described in S5
Stand-by period is responded according to the heartbeat next time of each node, calculate each node heartbeat timeout time next time, specially:
TExpiry=THeartbeat+TWait,
Wherein:TExpiry:Present node heartbeat timeout time next time;THeartbeat:Present node sends heartbeat request next time
The time of message;TWait:Present node heartbeat next time responds the stand-by period.
5. the recovery detection method of link exception, is characterized in that, includes the following steps between a kind of multinode:
(1) if current ink is invalid, current ink recovery is carried out using quickly hypothetical recovery policy;
(2) judge whether recovery policy succeeds, if it is successful, terminating this flow;If it fails, then think that current ink is shaken,
Judge whether current ink is effective using slow Restoration Mechanism;The quick hypothetical recovery policy is specially:Work as link
When being chronically at invalid state, this link-recovery if chain road receives heartbeat response;The slow Restoration Mechanism is specially:
Packet loss in statistics setting time prejudges link state, when packet loss is more than upper threshold value, and judges Link down;Work as packet loss
Rate is less than lower threshold value, then judges that link is effective;When packet loss ratio is located at threshold interval, then the same data packet is sent twice.
6. the recovery detection method of link exception, is characterized in that between a kind of multinode according to claim 5:Described
Threshold interval is:1%~3%.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510970908.XA CN105515912B (en) | 2015-12-22 | 2015-12-22 | Linkage availability detection and processing method between a kind of multinode |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510970908.XA CN105515912B (en) | 2015-12-22 | 2015-12-22 | Linkage availability detection and processing method between a kind of multinode |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105515912A CN105515912A (en) | 2016-04-20 |
CN105515912B true CN105515912B (en) | 2018-10-16 |
Family
ID=55723571
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510970908.XA Active CN105515912B (en) | 2015-12-22 | 2015-12-22 | Linkage availability detection and processing method between a kind of multinode |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105515912B (en) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107360012B (en) * | 2016-05-10 | 2020-05-05 | 大唐移动通信设备有限公司 | Link state processing method and network node equipment |
CN107659951B (en) | 2016-07-26 | 2020-10-09 | 华为技术有限公司 | Link recovery method, device and equipment |
CN106656606A (en) * | 2016-12-27 | 2017-05-10 | 北京奇虎科技有限公司 | Data path testing method, data path testing server and data path testing system |
CN109104338B (en) * | 2018-11-12 | 2020-10-16 | 北京天融信网络安全技术有限公司 | Link intelligent detection method, storage medium and computer equipment |
CN109803024B (en) * | 2019-01-28 | 2021-12-21 | 北京中科晶上科技股份有限公司 | Method for cluster node network |
WO2021207960A1 (en) * | 2020-04-15 | 2021-10-21 | 云图技术有限公司 | Data processing method, apparatus, device and system for implementing disconnected network reconnection |
CN112272110B (en) * | 2020-10-16 | 2022-11-18 | 苏州浪潮智能科技有限公司 | Connection jitter processing method, system and device for storage cluster controller node |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101640629A (en) * | 2008-07-29 | 2010-02-03 | 华为技术有限公司 | Method for monitoring link packet loss and bidirectional forwarding detector |
CN101695171A (en) * | 2009-10-16 | 2010-04-14 | 中兴通讯股份有限公司 | Method utilizing stream control transmission protocol to measure network transmission quality and device thereof |
CN103685248A (en) * | 2013-12-02 | 2014-03-26 | 许继电气股份有限公司 | Process layer tri-play message transport real-time scheduling method |
CN104933132A (en) * | 2015-06-12 | 2015-09-23 | 广州巨杉软件开发有限公司 | Distributed database weighted voting method based on operating sequence number |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101252500B (en) * | 2008-04-16 | 2012-08-08 | 杭州华三通信技术有限公司 | Intersect looped network, node and realizing method of random topology intersect looped network |
-
2015
- 2015-12-22 CN CN201510970908.XA patent/CN105515912B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101640629A (en) * | 2008-07-29 | 2010-02-03 | 华为技术有限公司 | Method for monitoring link packet loss and bidirectional forwarding detector |
CN101695171A (en) * | 2009-10-16 | 2010-04-14 | 中兴通讯股份有限公司 | Method utilizing stream control transmission protocol to measure network transmission quality and device thereof |
CN103685248A (en) * | 2013-12-02 | 2014-03-26 | 许继电气股份有限公司 | Process layer tri-play message transport real-time scheduling method |
CN104933132A (en) * | 2015-06-12 | 2015-09-23 | 广州巨杉软件开发有限公司 | Distributed database weighted voting method based on operating sequence number |
Also Published As
Publication number | Publication date |
---|---|
CN105515912A (en) | 2016-04-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105515912B (en) | Linkage availability detection and processing method between a kind of multinode | |
CN109218126B (en) | Method, device and system for monitoring node survival state | |
CN105245381B (en) | Cloud Server delay machine monitors migratory system and method | |
CN109245926B (en) | Intelligent network card, intelligent network card system and control method | |
CN104243259B (en) | Collaboration method and system in distributed elastic network interconnection system | |
CN110943878A (en) | Heartbeat packet transmission method, terminal and device with storage function | |
US8787178B2 (en) | Self monitoring of managed entities in a telecommunication network | |
CN109391691A (en) | The restoration methods and relevant apparatus that NAS is serviced under a kind of single node failure | |
CN108924195A (en) | A kind of unidirectional heartbeat mechanism implementation method, device, equipment and system | |
CN104579746A (en) | Method and device for controlling dual-link transmission | |
US8812801B2 (en) | Method of data replication in a distributed data storage system and corresponding device | |
CN111865674B (en) | Log processing method, device and medium | |
CN107181616A (en) | A kind of method and system for monitoring performance of storage system data | |
CN102868759A (en) | System and method for browser interface data refreshing controlled by server | |
EP3660679B1 (en) | Data backup method, device and system | |
CN111490859A (en) | Switching method and device of ARQ mode | |
CN104243473B (en) | A kind of method and device of data transmission | |
CN106487469B (en) | A kind of timing node switching method and system | |
CN112445809A (en) | Distributed database node survival state detection module and method | |
CN111881083A (en) | File synchronization method, device, equipment and medium | |
CN103414591A (en) | Method and system for fast converging when port failure is recovered | |
US11212204B2 (en) | Method, device and system for monitoring node survival state | |
CN113612636B (en) | Software defined network topology discovery method and system | |
US9900234B2 (en) | Direct link quality monitoring method, communications device, and system | |
CN112788794A (en) | Processing method, base station, device and medium for starting equipment |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |