CN111130979B - Method and equipment for connecting branch node with central node in SDWAN (software development wide area network) scene - Google Patents
Method and equipment for connecting branch node with central node in SDWAN (software development wide area network) scene Download PDFInfo
- Publication number
- CN111130979B CN111130979B CN201911250390.7A CN201911250390A CN111130979B CN 111130979 B CN111130979 B CN 111130979B CN 201911250390 A CN201911250390 A CN 201911250390A CN 111130979 B CN111130979 B CN 111130979B
- Authority
- CN
- China
- Prior art keywords
- node
- central
- central node
- nodes
- branch
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 230000004044 response Effects 0.000 claims abstract description 15
- 229920006235 chlorinated polyethylene elastomer Polymers 0.000 claims description 10
- 238000000136 cloud-point extraction Methods 0.000 claims description 10
- 238000012423 maintenance Methods 0.000 abstract description 6
- 238000004590 computer program Methods 0.000 description 6
- 238000001514 detection method Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000010355 oscillation Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
Abstract
The invention provides a method and a device for connecting branch nodes with a central node in an SDWAN (software development wide area network) scene, which comprises the following steps: acquiring state information of each central node through branch nodes and dividing priorities for the central nodes; the branch nodes are connected with the central node with the highest priority, and the state information of all the central nodes is obtained at intervals of threshold value time; in response to the status information of a connected central node exceeding a threshold, comparing it with the status information of an unconnected and highest priority central node; in response to the state information of the unconnected and highest priority center node being superior to the state information of the connected center node and the connection being above a threshold period since the last handover, the branch node disconnects from the center node that exceeded the threshold and simultaneously connects to the unconnected and highest priority center node. By using the scheme of the invention, the method for the operation and maintenance of the client can be simplified, the reliability of the network can be better maintained, and the stable operation of the key service of the client can be ensured.
Description
Technical Field
The field relates to the field of computers, and more particularly to a method and apparatus for connecting branch nodes to a central node in an SDWAN scenario.
Background
SDWAN (software defined wide area network) is a service formed by applying SDN (software defined networking) technology to a wide area network scenario. At present, enterprises are willing to adopt the SDWAN as a solution, on one hand, the SDWAN is cheaper than the traditional special line MPLS (multiprotocol label switching), and the service quality can also reach the level of the special line, and on the other hand, the SDWAN can be rapidly deployed and is rapidly on line, so that the requirement of rapid expansion of enterprise networks is met.
Because the development process of the SDWAN is short, the SDWAN is not uniformly defined in the industry, and various problems exist at present. Currently, SDWAN branch nodes are all connected to certain central nodes through overlay (overlay network) links. Due to network instability, such as when a network of branch nodes to connected central nodes is interrupted or congested, or a central node is upgraded or down, how to ensure that critical customer services are not affected becomes a technical problem that an SDWAN must face.
Disclosure of Invention
In view of this, an object of the embodiments of the present invention is to provide a method and a device for connecting a branch node to a central node in an SDWAN scenario, which can simplify a method for client operation and maintenance, better maintain reliability of a network, and ensure stable operation of a client key service.
In view of the above, an aspect of the embodiments of the present invention provides a method for connecting a branch node to a central node in an SDWAN scenario, including the following steps:
putting all the central nodes into a central node resource pool, and acquiring the state information of each central node through branch nodes;
dividing priorities for the central nodes according to the state information;
the branch nodes are connected with the central node with the highest priority based on the node parameters, and the state information of all the central nodes is obtained at intervals of threshold time;
in response to the status information of the connected central node exceeding a threshold, comparing the status information of the connected central node with the status information of the central node that is not connected and has the highest priority;
in response to the state information of the unconnected and highest priority center node being superior to the state information of the connected center node and the connection being above a threshold period since the last handover, the branch node disconnects from the center node that exceeded the threshold and simultaneously connects to the unconnected and highest priority center node.
According to one embodiment of the present invention, acquiring the status information of each central node through the branch node includes:
the method comprises the steps of sequentially ping the addresses of central nodes at threshold time intervals through the IP (Internet protocol) addresses of CPE (customer premises equipment) of branch nodes, and detecting and acquiring the time delay from the CPE to each central node.
According to one embodiment of the present invention, prioritizing the center nodes according to the status information comprises:
the priority of the central node with small delay is higher than that of the central node with large delay.
According to one embodiment of the present invention, the branch node connects the central node with the highest priority based on the node parameter, including:
based on the number of central nodes to be connected set by the user, the branch node establishes an ipsec (protocol security) tunnel connection with the central nodes with the highest priority.
According to one embodiment of the invention, the threshold period comprises 1 to 3 minutes.
In another aspect of the embodiments of the present invention, an apparatus for connecting a branch node to a central node in an SDWAN scenario is further provided, where the apparatus includes:
at least one processor; and
a memory storing program code executable by the processor, the program code when executed by the processor performing the steps of:
putting all the central nodes into a central node resource pool, and acquiring the state information of each central node through branch nodes;
dividing priorities for the central nodes according to the state information;
the branch nodes are connected with the central node with the highest priority based on the node parameters, and the state information of all the central nodes is obtained at intervals of threshold time;
in response to the status information of the connected central node exceeding a threshold, comparing the status information of the connected central node with the status information of the central node that is not connected and has the highest priority;
in response to the state information of the unconnected and highest priority center node being superior to the state information of the connected center node and the connection being above a threshold period since the last handover, the branch node disconnects from the center node that exceeded the threshold and simultaneously connects to the unconnected and highest priority center node.
According to one embodiment of the present invention, acquiring the status information of each central node through the branch node includes:
and sequentially ping the addresses of the central nodes at intervals of threshold time by the IP addresses of the CPEs of the branch nodes, and detecting and acquiring the time delay from the CPEs to each central node.
According to one embodiment of the present invention, prioritizing the center nodes according to the status information comprises:
the priority of the central node with small delay is higher than that of the central node with large delay.
According to one embodiment of the present invention, the branch node connects the central node with the highest priority based on the node parameter, including:
based on the number of central nodes needing to be connected and set by a user, the branch nodes establish the ipsec tunnel connection with the central nodes with the highest priority.
According to one embodiment of the invention, the threshold period comprises 1 to 3 minutes.
The invention has the following beneficial technical effects: the method for connecting the branch nodes with the central nodes in the SDWAN scene, provided by the embodiment of the invention, comprises the steps of putting all the central nodes into a central node resource pool, and acquiring the state information of each central node through the branch nodes; dividing priorities for the central nodes according to the state information; the branch nodes are connected with the central node with the highest priority based on the node parameters, and the state information of all the central nodes is obtained at intervals of threshold time; in response to the status information of the connected central node exceeding a threshold, comparing the status information of the connected central node with the status information of the central node that is not connected and has the highest priority; in response to the technical scheme that the state information of the central node which is not connected and has the highest priority is superior to the state information of the central node which is connected and is switched to be connected above the threshold period since the last time, the branch node disconnects the central node which exceeds the threshold and is connected to the central node which is not connected and has the highest priority, the method for operation and maintenance of the client can be simplified, the reliability of the network is better maintained, and the stable operation of the key service of the client is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other embodiments can be obtained by using the drawings without creative efforts.
FIG. 1 is a schematic flow chart diagram of a method for a branch node to connect to a central node in an SDWAN scenario in accordance with one embodiment of the present invention;
fig. 2 is a schematic diagram of a connection between a branch node and a central node in an SDWAN scenario, according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
In view of the foregoing, a first aspect of the embodiments of the present invention provides an embodiment of a method for connecting a branch node to a central node in an SDWAN scenario. Fig. 1 shows a schematic flow diagram of the method.
As shown in fig. 1, the method may include the steps of:
s1, all central nodes are placed in a central node resource pool, and the state information of each central node is obtained through branch nodes, so that the resource pool is formed, and all the central nodes can be better managed;
s2, dividing priority for the central node according to the state information;
s3 the branch node connects the center node with the highest priority based on the node parameter, and acquires the state information of all center nodes at intervals of threshold value time, and the connected center nodes can be used as the backup of the center nodes, and the state information of the center nodes is acquired constantly and the priority sequence is updated continuously;
s4, in response to the state information of the connected center nodes exceeding a threshold value set by the customer as needed, comparing the state information of the connected center nodes with the state information of the center node which is not connected and has the highest priority, and detecting the state of the center node having the highest priority among the center nodes which are not connected even if the state information of the connected center nodes exceeds the threshold value;
s5 responds to the situation that the state information of the central node which is not connected and has the highest priority is superior to that of the central node which is connected and the last time the connection is switched to be above the threshold period, the branch node disconnects the central node which exceeds the threshold value and is connected to the central node which is not connected and has the highest priority, when the state of the central node which is connected is not good, the connection is switched to the central node which has a better state, but the connection can only be switched once in each threshold period, if the time of the threshold period is not exceeded, even if the state information of the central node which is not connected is superior to that of the central node which is connected, the network can not be switched, and if the state information of all the central nodes which are connected and all the central nodes which are not connected exceeds the threshold value, an alarm is given to inform operation and maintenance personnel to check the state of the network.
By the technical scheme, the method for operation and maintenance of the client can be simplified, the reliability of the network can be better maintained, and the stable operation of the key service of the client can be ensured.
In a preferred embodiment of the present invention, the obtaining the status information of each central node through the branch node includes:
and sequentially ping the addresses of the central nodes at intervals of threshold time by the IP addresses of the CPEs of the branch nodes, and detecting and acquiring the time delay from the CPEs to each central node. The threshold time is preferably 3 seconds, and can be modified according to actual conditions and needs.
In a preferred embodiment of the present invention, prioritizing the center nodes according to the status information comprises:
the priority of the central node with small delay is higher than that of the central node with large delay. Smaller delays represent faster network transmission speeds and therefore higher priorities. The priority ranking is updated continuously, typically once a threshold time, and typically preferably 3 seconds.
In a preferred embodiment of the present invention, the branch node connects the central node with the highest priority based on the node parameter, including:
based on the number of central nodes needing to be connected and set by a user, the branch nodes establish the ipsec tunnel connection with the central nodes with the highest priority. The user presets the number of the branch nodes connected with the central nodes, and if the number is set to be 2, the branch nodes automatically select 2 central nodes with the highest priority to establish connection. And the other central nodes are backup central nodes, are sorted according to the priority and are continuously updated.
In a preferred embodiment of the invention, the threshold period comprises 1 to 3 minutes. To prevent frequent link tear-down and link setup, the CPE locally starts a switch timer, and the link can only be switched once in a timing period. If the connection is frequently switched, data loss and other problems can be caused.
Examples
As shown in fig. 2, the process of connecting the branch nodes to the central node in the SDWAN scenario is as follows:
1. dividing all the central nodes into a central node resource pool, wherein the central node resource pool sequentially comprises a central node 1, a central node 2 and a central node 3.
2. The user sets the number of the branch nodes connected with the central node, if set to be 2, the branch nodes are connected with 2 central nodes;
3. setting a detection period, defaulting for 3 seconds, and enabling a user to define the detection period according to network requirements;
4. using the IP address of the CPE interface to sequentially poll and ping to each central node address in the central node resource pool, and detecting and collecting the time delay of each central node by the CPE;
5. and generating a corresponding tunnel connection priority table entry according to the size of the detection delay. The center node with the shortest delay has the highest priority, the serial number is arranged in front, the center node with longer delay has lower priority, and the serial number is arranged in back;
6. setting the central node roles equivalent to the central node number of user connection as 'current connection' and the other central node roles as 'backup central node';
7. the branch node automatically establishes a corresponding IPSEC tunnel connection for the currently connected central node in a role.
8. Judging whether the delay of the currently connected central node exceeds a preset threshold, and updating the sequence of other central nodes when the delay of the currently connected central node does not exceed a related threshold, wherein the role is kept unchanged because no switching condition is triggered;
9. and triggering a relevant tunnel switching condition when the time delay of the currently connected central node exceeds a preset threshold and the time delay of the backup central node is less than the time delay of the currently connected central node. The branch node selects a central node with high priority to establish a new IPSEC (protocol security) tunnel connection, and after the new connection is established successfully, the original tunnel connection is removed;
10. and updating the corresponding central node role in the relevant tunnel connection priority table, and waiting for a new detection period.
In order to prevent frequent oscillation of the tunnel link, a link switching detection mechanism is introduced:
1. before the delay of the currently connected central node exceeds a preset threshold value and the link switching is ready to be started, whether the switching has already occurred within a switching period is required to be judged;
2. when the switching from the branch node to the central node occurs once in the switching period, the switching is not performed at this time.
3. And when the switching from the branch node to the central node does not occur in the switching period, starting a switching mechanism, and establishing connection between the branch node and the backup central node with higher priority. And after the new connection is established, automatically removing the original old connection and updating the related roles.
By the technical scheme, the method for operation and maintenance of the client can be simplified, the reliability of the network can be better maintained, and the stable operation of the key service of the client can be ensured.
It should be noted that, as will be understood by those skilled in the art, all or part of the processes in the methods of the above embodiments may be implemented by instructing relevant hardware through a computer program, and the above programs may be stored in a computer-readable storage medium, and when executed, the programs may include the processes of the embodiments of the methods as described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like. The embodiments of the computer program may achieve the same or similar effects as any of the above-described method embodiments.
Furthermore, the method disclosed according to an embodiment of the present invention may also be implemented as a computer program executed by a CPU, and the computer program may be stored in a computer-readable storage medium. The computer program, when executed by the CPU, performs the above-described functions defined in the method disclosed in the embodiments of the present invention.
In view of the above object, a second aspect of the embodiments of the present invention provides an apparatus for connecting a branch node to a central node in an SDWAN scenario, where the apparatus includes:
at least one processor; and
a memory storing program code executable by the processor, the program code when executed by the processor performing the steps of:
putting all the central nodes into a central node resource pool, and acquiring the state information of each central node through branch nodes;
dividing priorities for the central nodes according to the state information;
the branch nodes are connected with the central node with the highest priority based on the node parameters, and the state information of all the central nodes is obtained at intervals of threshold time;
in response to the status information of the connected central node exceeding a threshold, comparing the status information of the connected central node with the status information of the central node that is not connected and has the highest priority;
in response to the state information of the unconnected and highest priority center node being superior to the state information of the connected center node and the connection being above a threshold period since the last handover, the branch node disconnects from the center node that exceeded the threshold and simultaneously connects to the unconnected and highest priority center node.
In a preferred embodiment of the present invention, the obtaining the status information of each central node through the branch node includes:
and sequentially ping the addresses of the central nodes at intervals of threshold time by the IP addresses of the CPEs of the branch nodes, and detecting and acquiring the time delay from the CPEs to each central node.
In a preferred embodiment of the present invention, prioritizing the center nodes according to the status information comprises:
the priority of the central node with small delay is higher than that of the central node with large delay.
In a preferred embodiment of the present invention, the branch node connects the central node with the highest priority based on the node parameter, including:
based on the number of central nodes needing to be connected and set by a user, the branch nodes establish the ipsec tunnel connection with the central nodes with the highest priority.
In a preferred embodiment of the invention, the threshold period comprises 1 to 3 minutes.
It should be particularly noted that the embodiment of the system described above employs the embodiment of the method described above to specifically describe the working process of each module, and those skilled in the art can easily think that the modules are applied to other embodiments of the method described above.
Further, the above-described method steps and system elements or modules may also be implemented using a controller and a computer-readable storage medium for storing a computer program for causing the controller to implement the functions of the above-described steps or elements or modules.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments of the present invention.
The embodiments described above, particularly any "preferred" embodiments, are possible examples of implementations and are presented merely to clearly understand the principles of the invention. Many variations and modifications may be made to the above-described embodiments without departing from the spirit and principles of the technology described herein. All such modifications are intended to be included within the scope of this disclosure and protected by the following claims.
Claims (4)
1. A method for connecting branch nodes with a central node in an SDWAN (software development wide area network) scene is characterized by comprising the following steps:
putting all central nodes into a central node resource pool, and acquiring the state information of each central node through branch nodes, wherein the acquisition of the state information of each central node through the branch nodes comprises the following steps:
sequentially ping the addresses of the central nodes at intervals of threshold time through the IP addresses of the CPEs of the branch nodes, and detecting and acquiring the time delay from the CPEs to each central node;
prioritizing the central node according to the state information, wherein prioritizing the central node according to the state information comprises:
the priority of the central node with small delay is higher than that of the central node with large delay;
the branch node connects the central node with the highest priority based on the node parameter, and acquires the state information of all the central nodes at intervals of a threshold value, wherein the branch node connects the central node with the highest priority based on the node parameter, and the branch node includes:
based on the number of central nodes needing to be connected and set by a user, the branch nodes establish ipsec tunnel connection with the central nodes with the highest priority;
in response to the status information of the connected central node exceeding a threshold, comparing the status information of the connected central node with the status information of the central node that is not connected and has the highest priority;
in response to the status information of the unconnected and highest priority central node being superior to the status information of the connected central node and exceeding a threshold period since the last handover connection, the branch node disconnects from the threshold-exceeding central node and simultaneously connects to the unconnected and highest priority central node.
2. The method of claim 1, wherein the threshold period comprises 1 to 3 minutes.
3. An apparatus for connecting a branch node to a central node in an SDWAN scenario, the apparatus comprising:
at least one processor; and
a memory storing program code executable by the processor, the program code, when executed by the processor, performing the steps of:
putting all central nodes into a central node resource pool, and acquiring the state information of each central node through branch nodes, wherein the acquisition of the state information of each central node through the branch nodes comprises the following steps:
sequentially ping the addresses of the central nodes at intervals of threshold time through the IP addresses of the CPEs of the branch nodes, and detecting and acquiring the time delay from the CPEs to each central node;
prioritizing the central node according to the state information, wherein prioritizing the central node according to the state information comprises:
the priority of the central node with small delay is higher than that of the central node with large delay;
the branch node connects the central node with the highest priority based on the node parameter, and acquires the state information of all the central nodes at intervals of a threshold value, wherein the branch node connects the central node with the highest priority based on the node parameter, and the branch node includes:
based on the number of central nodes needing to be connected and set by a user, the branch nodes establish ipsec tunnel connection with the central nodes with the highest priority;
in response to the status information of the connected central node exceeding a threshold, comparing the status information of the connected central node with the status information of the central node that is not connected and has the highest priority;
in response to the status information of the unconnected and highest priority central node being superior to the status information of the connected central node and exceeding a threshold period since the last handover connection, the branch node disconnects from the threshold-exceeding central node and simultaneously connects to the unconnected and highest priority central node.
4. The apparatus of claim 3, wherein the threshold period comprises 1 to 3 minutes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911250390.7A CN111130979B (en) | 2019-12-09 | 2019-12-09 | Method and equipment for connecting branch node with central node in SDWAN (software development wide area network) scene |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911250390.7A CN111130979B (en) | 2019-12-09 | 2019-12-09 | Method and equipment for connecting branch node with central node in SDWAN (software development wide area network) scene |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111130979A CN111130979A (en) | 2020-05-08 |
| CN111130979B true CN111130979B (en) | 2022-02-22 |
Family
ID=70497818
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911250390.7A Active CN111130979B (en) | 2019-12-09 | 2019-12-09 | Method and equipment for connecting branch node with central node in SDWAN (software development wide area network) scene |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111130979B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111901428B (en) * | 2020-07-29 | 2021-04-06 | 广州市番禺区中心医院 | Multi-tenant access system based on wide-area medical cloud |
| CN112564983B (en) * | 2020-12-23 | 2023-05-26 | 奇安信网神信息技术(北京)股份有限公司 | Data transmission method, device, computer system and medium |
| CN113630276B (en) * | 2021-08-16 | 2024-04-09 | 迈普通信技术股份有限公司 | Main-standby switching control method and device and DVPN network system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1578320A (en) * | 2003-06-30 | 2005-02-09 | 微软公司 | Network load balancing with main machine status information |
| CN101626314A (en) * | 2009-08-07 | 2010-01-13 | 杭州华三通信技术有限公司 | Backup method and backup system of central node of star topology network |
| CN101656624A (en) * | 2008-08-18 | 2010-02-24 | 中兴通讯股份有限公司 | Multi-node application-level disaster recovery system and multi-node application-level disaster recovery method |
| CN107547380A (en) * | 2017-05-12 | 2018-01-05 | 新华三信息安全技术有限公司 | A kind of communication link determines method and device |
| CN108696428A (en) * | 2018-05-17 | 2018-10-23 | 北京大米科技有限公司 | Routing detection method, routing node based on tunneling technique and central server |
| CN108769961A (en) * | 2018-04-28 | 2018-11-06 | 上海与德科技有限公司 | Host node switching method, child node, blueteeth network based on blueteeth network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190207844A1 (en) * | 2018-01-03 | 2019-07-04 | Hewlett Packard Enterprise Development Lp | Determining routing decisions in a software-defined wide area network |
-
2019
- 2019-12-09 CN CN201911250390.7A patent/CN111130979B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1578320A (en) * | 2003-06-30 | 2005-02-09 | 微软公司 | Network load balancing with main machine status information |
| CN101656624A (en) * | 2008-08-18 | 2010-02-24 | 中兴通讯股份有限公司 | Multi-node application-level disaster recovery system and multi-node application-level disaster recovery method |
| CN101626314A (en) * | 2009-08-07 | 2010-01-13 | 杭州华三通信技术有限公司 | Backup method and backup system of central node of star topology network |
| CN107547380A (en) * | 2017-05-12 | 2018-01-05 | 新华三信息安全技术有限公司 | A kind of communication link determines method and device |
| CN108769961A (en) * | 2018-04-28 | 2018-11-06 | 上海与德科技有限公司 | Host node switching method, child node, blueteeth network based on blueteeth network |
| CN108696428A (en) * | 2018-05-17 | 2018-10-23 | 北京大米科技有限公司 | Routing detection method, routing node based on tunneling technique and central server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111130979A (en) | 2020-05-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111130979B (en) | Method and equipment for connecting branch node with central node in SDWAN (software development wide area network) scene | |
| CN108965123B (en) | Link switching method and network communication system | |
| EP2045965B1 (en) | Resource state monitoring method, device and communication network | |
| CN100553213C (en) | A kind of method and apparatus of WLAN abnormal quick restoring | |
| CN106789638B (en) | Method for processing route and network equipment | |
| CN106878072B (en) | Message transmission method and device | |
| CN101310475B (en) | Recovery method and apparatus for abnormal delete of optical network LSP | |
| CN101951345A (en) | Message transmitting method and equipment | |
| CN106059793A (en) | Router information processing method and apparatus based on graceful restart | |
| CN110943878A (en) | Heartbeat packet transmission method, terminal and device with storage function | |
| CN111552543A (en) | Container management and control method and processing node | |
| JP6421516B2 (en) | Server device, redundant server system, information takeover program, and information takeover method | |
| CN100461764C (en) | Method and system for implementing consistency of message forwarding routes | |
| CN112333013B (en) | Self-adaptive networking method, device, router and storage medium | |
| CN112969244B (en) | Session recovery method and device | |
| CN107872822B (en) | Service bearing method and device | |
| RU2693903C1 (en) | Method, apparatus and processing system for expanded port | |
| CN115378815A (en) | Data recovery method, device, network equipment and storage medium | |
| CN105072185A (en) | TR069 (Technical Report 069) remote monitoring method and system, and communication equipment | |
| CN113098709B (en) | Network recovery method and device based on distributed networking system and computer equipment | |
| WO2017162172A1 (en) | Method and device for adjusting restart-recovery time | |
| CN108712782B (en) | Tunnel establishment method and device, electronic equipment and readable storage medium | |
| US20050120100A1 (en) | Method and system for updating synchronization status of managed objects | |
| WO2017118425A1 (en) | Service processing method and device | |
| CN101959223A (en) | Self-healing control method and self-healing control device of flow-control transport protocol link failure |
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 |