CN112187542A - Data communication clustering method and system - Google Patents

Data communication clustering method and system Download PDF

Info

Publication number
CN112187542A
CN112187542A CN202011042848.2A CN202011042848A CN112187542A CN 112187542 A CN112187542 A CN 112187542A CN 202011042848 A CN202011042848 A CN 202011042848A CN 112187542 A CN112187542 A CN 112187542A
Authority
CN
China
Prior art keywords
node
nodes
main node
previous
logical address
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.)
Pending
Application number
CN202011042848.2A
Other languages
Chinese (zh)
Inventor
贾昌武
黄筱炼
盛英杰
李鸿峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Xuanyu Technology Co ltd
Original Assignee
Shenzhen Xuanyu Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Xuanyu Technology Co ltd filed Critical Shenzhen Xuanyu Technology Co ltd
Priority to CN202011042848.2A priority Critical patent/CN112187542A/en
Publication of CN112187542A publication Critical patent/CN112187542A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0668Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/04Network management architectures or arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0803Configuration setting
    • H04L41/0823Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
    • H04L41/0836Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability to enhance reliability, e.g. reduce downtime

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)

Abstract

The invention discloses a clustering method and a system for data communication, wherein the method comprises the following steps: sequencing N nodes of all clusters, and sequentially editing a logic address to respectively form nodes with a first logic address to an Nth logic address, wherein N is a natural number greater than 1; setting the node with the minimum serial number logical address as a main node, and setting other nodes as slave nodes respectively, wherein the main node broadcasts a heartbeat message containing the own logical address to the other slave nodes according to a preset time interval; and responding to the stop of broadcasting the heartbeat message by the main node, setting the nodes with the minimum serial number logical addresses except the main node as the current main node for taking over the work of the previous main node, setting the other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the own logical address to the other nodes by the current main node according to a preset time interval. The invention simply, quickly and conveniently realizes the clustering, and improves the stability and reliability of the clustering.

Description

Data communication clustering method and system
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and a system for clustering data communications.
Background
With the outbreak of the internet, various big data applications, cloud computing and AI artificial intelligence are rapidly developed. At the same time, the requirements for the underlying services are increasing, and therefore, high-availability solutions for various technologies appear, such as: the web container, the database, the basic service and the like support the main-standby switching and service clustering technology.
Generally, only large companies or organizations have technical and capital investment, develop powerful big data components (such as Spark (computing engine), Hadoop (distributed system infrastructure), Zookeeper (reliable coordination system of distributed system)), so that third party applications mostly realize high availability of their own applications by means of the HA scheme (high availability cluster solution) of the big data component Zookeeper. The HA scheme based on the big data component Zookeeper needs at least 3 servers to build a cluster, and for some industrial or embedded projects, the project implementation cost is high, and the deployment and maintenance complexity is increased.
At present, the existing cluster processing scheme has the defect that if a master node is disconnected and not down, the original node cannot be switched back, and in an actual project, appropriate inclination needs to be made according to different resource configurations, namely, the node with high configuration is switched back to service after the fault is recovered. In addition, the nodes need to maintain the active and standby linked lists together, which is easy to cause loss of synchronization information to a great extent and causes abnormal operation of the cluster. In addition, complex node management information needs to be maintained, thereby increasing complexity.
Disclosure of Invention
The technical problem to be solved by the invention is to provide a clustering method and system for data communication in order to overcome the defects that a clustering processing scheme in the prior art is lack of simplicity, convenience and poor stability.
The invention solves the technical problems through the following technical scheme:
a clustering method of data communication, comprising:
sequencing N nodes of all clusters, and sequentially editing a logic address to respectively form nodes with a first logic address to an Nth logic address, wherein N is a natural number greater than 1;
setting the node with the minimum serial number logical address as a main node, and setting other nodes as slave nodes respectively, wherein the main node broadcasts a heartbeat message containing the own logical address to the other slave nodes according to a preset time interval;
and responding to the stop of broadcasting the heartbeat message by the main node, setting the nodes with the minimum serial number logical addresses except the main node as the current main node for taking over the work of the previous main node, setting the other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the own logical address to the other nodes by the current main node according to a preset time interval.
Optionally, after setting the current master node, the clustering method further includes:
responding to the restart of the previous node stopping broadcasting, judging whether the logic address of the previous node is smaller than that of the current main node or not, if so, resetting the current main node of the previous node to be restarted, setting the other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the logic address of the current main node to the other nodes by the current main node according to a preset time interval.
Optionally, the method further comprises:
and when the number of the restarted previous nodes is at least two and the logical addresses of all the restarted previous nodes are smaller than the logical address of the current main node, selecting the node with the smallest logical address from all the restarted previous nodes and resetting the node as the current main node.
Optionally, the step of sorting the N nodes of all the clusters includes:
and sequencing the N nodes of all the clusters from high to low according to the hardware configuration indexes of the nodes.
Optionally, the step of the master node stopping broadcasting the heartbeat packet includes:
the master node generates an exception or downtime to stop broadcasting the heartbeat message.
A cluster system for data communication, comprising:
the node management module is configured to sequence the N nodes of all the clusters and sequentially edit a logic address to form nodes with first to Nth logic addresses respectively, wherein N is a natural number greater than 1;
the node setting module is configured to set the node with the smallest sequence number logical address as a master node, set the other nodes as slave nodes respectively, and broadcast a heartbeat message containing the own logical address to the other slave nodes by the master node according to a preset time interval;
and the node monitoring module is configured to monitor the broadcast state of the main node, respond to the stop of broadcasting the heartbeat message by the main node, call the node setting module to set the nodes with the minimum serial number logical addresses except the main node as the current main node for taking over the work of the previous main node, set the other nodes as slave nodes respectively, and broadcast the heartbeat message containing the own logical address to the other nodes by the current main node according to a preset time interval.
Optionally, after the node setting module sets the current master node, the node monitoring module is further configured to: monitoring the restarting state of a previous node stopping broadcasting, responding to the restarting of the previous node stopping broadcasting, judging whether the logic address of the previous node is smaller than that of the current main node or not, if so, calling the node setting module to reset the current main node of the previous node to be restarted, setting other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the logic address of the current main node to the other nodes according to a preset time interval by the current main node.
Optionally, the node setting module is further configured to: and when the number of the restarted previous nodes is at least two and the logical addresses of all the restarted previous nodes are smaller than the logical address of the current main node, selecting the node with the smallest logical address from all the restarted previous nodes and resetting the node as the current main node.
Optionally, the node management module is configured to: and sequencing the N nodes of all the clusters from high to low according to the hardware configuration indexes of the nodes.
Optionally, the node monitoring module is configured to: and responding to the abnormal or downtime of the main node to stop broadcasting the heartbeat message, and calling the node setting module.
On the basis of the common knowledge in the field, the preferred conditions can be combined randomly to obtain the preferred embodiments of the invention.
The positive progress effects of the invention are as follows:
the clustering method and the clustering system for data communication can fully respond to various application scenes needing master-slave switching or clustering, simply, quickly and conveniently realize clustering, effectively reduce the requirements on hardware and software performance, and effectively realize the mode of providing the clustering in a single chip microcomputer system, thereby improving the realizability and the operability and further improving the stability and the reliability.
Drawings
The features and advantages of the present disclosure will be better understood upon reading the detailed description of embodiments of the disclosure in conjunction with the following drawings. In the drawings, components are not necessarily drawn to scale, and components having similar relative characteristics or features may have the same or similar reference numerals.
Fig. 1 is a schematic main flow chart of a clustering method of data communication according to an embodiment of the present invention.
FIG. 2 is a diagram illustrating states of master and slave nodes when a default first boot-up occurs.
Fig. 3 is a schematic diagram illustrating states of master and slave nodes when a master node having a first logical address is down.
FIG. 4 is a diagram illustrating the states of the master and slave nodes when the node with the second logical address becomes the new master node.
Fig. 5 is a schematic diagram illustrating states of master and slave nodes when a master node having a second logical address is down.
FIG. 6 is a diagram illustrating the states of the master and slave nodes when the node with the fourth logical address becomes the new master node.
FIG. 7 is a diagram illustrating states of a master node and a slave node when a node having a first logical address restarts and resumes.
FIG. 8 is a diagram illustrating states of a master node and a slave node when a node with a first logical address becomes a master node after a reboot is resumed.
Fig. 9 is a schematic structural diagram of a cluster system for data communication according to an embodiment of the present invention.
Detailed Description
The present invention is further illustrated by the following examples, which are not intended to limit the scope of the invention.
In order to overcome the above existing defects, this embodiment provides a clustering method for data communication, where the clustering method includes the following steps:
sequencing N nodes of all clusters, and sequentially editing a logic address to respectively form nodes with a first logic address to an Nth logic address, wherein N is a natural number greater than 1;
setting the node with the minimum serial number logical address as a main node, and setting other nodes as slave nodes respectively, wherein the main node broadcasts a heartbeat message containing the own logical address to the other slave nodes according to a preset time interval;
and responding to the abnormal or downtime of the main node to stop broadcasting the heartbeat message, setting the nodes with the minimum serial number logical addresses except the main node as the current main node for taking over the work of the previous main node, setting the other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the own logical address to the other nodes by the current main node according to a preset time interval.
Preferably, as an embodiment, the step of ordering the N nodes of all the clusters includes the following steps:
and sequencing the N nodes of all the clusters from high to low according to the hardware configuration indexes of the nodes.
Specifically, as an embodiment, after the current master node is set, the clustering method further includes the following steps:
responding to the restart of the previous node stopping broadcasting, judging whether the logic address of the previous node is smaller than that of the current main node or not, if so, resetting the current main node of the previous node to be restarted, setting the other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the logic address of the current main node to the other nodes by the current main node according to a preset time interval.
Preferably, as an embodiment, the clustering method further includes the steps of:
and when the number of the restarted previous nodes is at least two and the logical addresses of all the restarted previous nodes are smaller than the logical address of the current main node, selecting the node with the smallest logical address from all the restarted previous nodes and resetting the node as the current main node.
In the embodiment, the scheme that the clustering is quickly and conveniently realized when high availability or server clustering is required under the application of internet big data is mainly involved, the simplification idea is fully utilized, the requirements on hardware and software performance are extremely low, and the mode of providing the clustering in the single chip microcomputer system can be completely realized.
Specifically, the following describes a specific flow of the clustering method with reference to the drawings.
Referring to fig. 1, in this embodiment, based on the idea of token ring, all cluster nodes edit one logical address (1, 2, 3 … N), that is, a token, and node No. 1 (i.e., a node with a first logical address) is a default master node and is also a node with a relatively high configuration. One node is always kept as a master node in the whole cluster, and a node with a first logical address is set as the master node under normal conditions and broadcasts a survival heartbeat to other slave nodes at regular time (the heartbeat message contains the master node address).
Referring to fig. 2, when first started, a node having a first logical address is set as a master node by default and broadcasts a heartbeat message.
Referring to fig. 3 and 4, once the master node is abnormal or goes down to stop broadcasting the heartbeat, the token is invalid, and a new token is generated, and the new token may be delivered by: the new token is the home node address + 1. The new token owner continues to broadcast the heartbeat message containing the own logical address for the new host node, and so on until the token is lost, all nodes broadcast the heartbeat outwards, each node receives all the surviving node addresses, and the node with the smallest logical address can be elected as the host node (the node address is the token at this time) through simple election processing, so that the host node is continuously taken over to work and the heartbeat message is continuously broadcast. Therefore, the clustering process is circulated all the time, and the clustering can be carried out without the limitation of the number of nodes as long as the survival node services are available.
Referring to fig. 5 and 6, when the master node with the second logical address goes down, the master node with the second logical address stops broadcasting, all nodes live and wait for a period of time, and after a period of time, no heartbeat is received, the live nodes send broadcast elections, and confirm that the node with the smallest logical address is set as the new master node, and the node with the third logical address is also found to go down in fig. 5 and 6, so the node with the fourth logical address is set as the master node.
Referring to fig. 7 and 8, when a node having a smaller logical address than the current master node is restarted, a heartbeat is automatically broadcasted, all nodes that receive a heartbeat packet having a smaller logical address than the current master node immediately stop broadcasting and change into slave nodes, and after the node having the first logical address in fig. 7 and 8 is restarted and recovered, the node becomes a new master node, and the original master node (i.e., the master node having the fourth logical address) becomes a slave node.
The following describes an application of the clustering method.
The first step is as follows: selecting a service system or a device needing the cluster, such as: an anodic oxidation data acquisition system, an edge computing box device, and the like, which are not particularly limited to a cluster service system or device in this embodiment, and can be selected and adjusted accordingly according to actual needs.
The second step is that: based on the above system or apparatus, the upgrade code implements a clustering function.
The third step: n servers or devices having the same logical function, that is, nodes, are prepared, and the edited logical addresses 1, 2, and 3 … N, that is, the first logical address and the nth logical address of the second logical address …, are configured at the same time. Relevant information (IP (internet protocol), port, logical address, etc.) is configured in all node configurations for use by heartbeat broadcasts.
The fourth step: the start service loads the cluster configuration information, and then the cluster can be easily realized according to a set mode.
The clustering method for data communication provided by the embodiment can fully respond to various application scenes needing master-slave switching or clustering, simply, quickly and conveniently realize clustering, effectively reduces the requirements on hardware and software performance, and effectively realizes a clustering mode provided in a single chip microcomputer system, thereby improving the realizability and the operability, and further improving the stability and the reliability.
In order to overcome the above-mentioned defects at present, this embodiment further provides a cluster system for data communication, as shown in fig. 9, the cluster system mainly includes a node management module 1, a node setting module 2, and a node monitoring module, and the cluster system utilizes the above-mentioned cluster method for data communication.
The node management module 1 is configured to sort N nodes of all clusters, and sequentially edit one logical address to form nodes having first to nth logical addresses, respectively, where N is a natural number greater than 1.
Preferably, as an embodiment, the node management module 1 is configured to sort the N nodes of all the clusters according to the order of the hardware configuration indexes of the nodes from high to low.
The node setting module 2 is configured to set the node with the smallest sequence number logical address as a master node, and set the remaining nodes as slave nodes, respectively, and the master node broadcasts a heartbeat message including its own logical address to the remaining slave nodes according to a preset time interval.
The node monitoring module 3 is configured to monitor a broadcast state of the main node, respond to an exception or downtime generated by the main node to stop broadcasting the heartbeat message, and invoke the node setting module 2 to set the node with the smallest sequence number logical address except the main node as a current main node for taking over the previous main node work, and set the other nodes as slave nodes respectively, and the current main node broadcasts the heartbeat message containing the own logical address to the other nodes according to a preset time interval.
Specifically, as an embodiment, after the node setting module 2 sets the current master node, the node monitoring module 3 is further configured to monitor a restart state of a previous node that stops broadcasting, and in response to a restart of the previous node that stops broadcasting, determine whether a logical address of the previous node that is restarted is smaller than a logical address of the current master node, if so, invoke the node setting module to reset the current master node on the previous node that is restarted, and set the remaining nodes as slave nodes, respectively, and the current master node broadcasts a heartbeat packet including its own logical address to the remaining nodes according to a preset time interval.
Preferably, as an embodiment, the node setting module 2 is further configured to select a node with the smallest logical address from all the restarted previous nodes and reset the node as the current master node when the number of the restarted previous nodes is at least two and the logical addresses of all the restarted previous nodes are smaller than the logical address of the current master node.
The cluster system for data communication provided by the embodiment can fully respond to various application scenes needing master-slave switching or clustering, simply, quickly and conveniently realize clustering, effectively reduces the requirements on hardware and software performance, and effectively realizes the mode of providing the clustering in the single chip microcomputer system, thereby improving the realizability and the operability, and further improving the stability and the reliability.
While specific embodiments of the invention have been described above, it will be appreciated by those skilled in the art that this is by way of example only, and that the scope of the invention is defined by the appended claims. Various changes and modifications to these embodiments may be made by those skilled in the art without departing from the spirit and scope of the invention, and these changes and modifications are within the scope of the invention.

Claims (10)

1. A method for clustering data communications, comprising:
sequencing N nodes of all clusters, and sequentially editing a logic address to respectively form nodes with a first logic address to an Nth logic address, wherein N is a natural number greater than 1;
setting the node with the minimum serial number logical address as a main node, and setting other nodes as slave nodes respectively, wherein the main node broadcasts a heartbeat message containing the own logical address to the other slave nodes according to a preset time interval;
and responding to the stop of broadcasting the heartbeat message by the main node, setting the nodes with the minimum serial number logical addresses except the main node as the current main node for taking over the work of the previous main node, setting the other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the own logical address to the other nodes by the current main node according to a preset time interval.
2. The clustering method of claim 1, wherein after setting a current master node, the clustering method further comprises:
responding to the restart of the previous node stopping broadcasting, judging whether the logic address of the previous node is smaller than that of the current main node or not, if so, resetting the current main node of the previous node to be restarted, setting the other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the logic address of the current main node to the other nodes by the current main node according to a preset time interval.
3. The clustering method of claim 2, further comprising:
and when the number of the restarted previous nodes is at least two and the logical addresses of all the restarted previous nodes are smaller than the logical address of the current main node, selecting the node with the smallest logical address from all the restarted previous nodes and resetting the node as the current main node.
4. The clustering method of claim 1, wherein the step of ordering the N nodes of all clusters comprises:
and sequencing the N nodes of all the clusters from high to low according to the hardware configuration indexes of the nodes.
5. The clustering method of claim 1, wherein the step of the master node stopping broadcasting the heartbeat message comprises:
the master node generates an exception or downtime to stop broadcasting the heartbeat message.
6. A cluster system for data communication, comprising:
the node management module is configured to sequence the N nodes of all the clusters and sequentially edit a logic address to form nodes with first to Nth logic addresses respectively, wherein N is a natural number greater than 1;
the node setting module is configured to set the node with the smallest sequence number logical address as a master node, set the other nodes as slave nodes respectively, and broadcast a heartbeat message containing the own logical address to the other slave nodes by the master node according to a preset time interval;
and the node monitoring module is configured to monitor the broadcast state of the main node, respond to the stop of broadcasting the heartbeat message by the main node, call the node setting module to set the nodes with the minimum serial number logical addresses except the main node as the current main node for taking over the work of the previous main node, set the other nodes as slave nodes respectively, and broadcast the heartbeat message containing the own logical address to the other nodes by the current main node according to a preset time interval.
7. The cluster system of claim 6, wherein after the node setting module sets the current master node, the node monitoring module is further configured to: monitoring the restarting state of a previous node stopping broadcasting, responding to the restarting of the previous node stopping broadcasting, judging whether the logic address of the previous node is smaller than that of the current main node or not, if so, calling the node setting module to reset the current main node of the previous node to be restarted, setting other nodes as slave nodes respectively, and broadcasting the heartbeat message containing the logic address of the current main node to the other nodes according to a preset time interval by the current main node.
8. The cluster system of claim 7, wherein the node setup module is further configured to: and when the number of the restarted previous nodes is at least two and the logical addresses of all the restarted previous nodes are smaller than the logical address of the current main node, selecting the node with the smallest logical address from all the restarted previous nodes and resetting the node as the current main node.
9. The cluster system of claim 6, wherein the node management module is configured to: and sequencing the N nodes of all the clusters from high to low according to the hardware configuration indexes of the nodes.
10. The cluster system of claim 6, wherein the node monitoring module is configured to: and responding to the abnormal or downtime of the main node to stop broadcasting the heartbeat message, and calling the node setting module.
CN202011042848.2A 2020-09-28 2020-09-28 Data communication clustering method and system Pending CN112187542A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011042848.2A CN112187542A (en) 2020-09-28 2020-09-28 Data communication clustering method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011042848.2A CN112187542A (en) 2020-09-28 2020-09-28 Data communication clustering method and system

Publications (1)

Publication Number Publication Date
CN112187542A true CN112187542A (en) 2021-01-05

Family

ID=73945350

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011042848.2A Pending CN112187542A (en) 2020-09-28 2020-09-28 Data communication clustering method and system

Country Status (1)

Country Link
CN (1) CN112187542A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115514689A (en) * 2022-09-22 2022-12-23 成都中航信虹科技股份有限公司 Application program daemon method and device and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101217402A (en) * 2008-01-15 2008-07-09 杭州华三通信技术有限公司 A method to enhance the reliability of the cluster and a high reliability communication node
CN102202425A (en) * 2011-06-24 2011-09-28 中国人民解放军国防科学技术大学 Satellite cluster self-organization networking method based on master-slave heterogeneous data transmission module
CN102571452A (en) * 2012-02-20 2012-07-11 华为技术有限公司 Multi-node management method and system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101217402A (en) * 2008-01-15 2008-07-09 杭州华三通信技术有限公司 A method to enhance the reliability of the cluster and a high reliability communication node
CN102202425A (en) * 2011-06-24 2011-09-28 中国人民解放军国防科学技术大学 Satellite cluster self-organization networking method based on master-slave heterogeneous data transmission module
CN102571452A (en) * 2012-02-20 2012-07-11 华为技术有限公司 Multi-node management method and system

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115514689A (en) * 2022-09-22 2022-12-23 成都中航信虹科技股份有限公司 Application program daemon method and device and storage medium
CN115514689B (en) * 2022-09-22 2024-04-02 成都中航信虹科技股份有限公司 Application program daemon method, device and storage medium

Similar Documents

Publication Publication Date Title
US8024477B2 (en) System and method to establish a peer-to-peer IT backbone
CN114500521A (en) Computing power scheduling method, device, scheduling equipment, system and storage medium
CN112202746B (en) RPC member information acquisition method, device, electronic equipment and storage medium
US20040064553A1 (en) Computer network solution and software product to establish error tolerance in a network environment
CN111459639A (en) Distributed task management platform and method supporting global multi-machine-room deployment
CN111209084B (en) FAAS distributed computing method and device
CN111865632A (en) Switching method of distributed data storage cluster and switching instruction sending method and device
CN114124650A (en) Master-slave deployment method of SPTN (shortest Path bridging) network controller
CN112187542A (en) Data communication clustering method and system
CN113765690A (en) Cluster switching method, system, device, terminal, server and storage medium
CN111901395A (en) Multi-cluster switching method and device
CN111614702B (en) Edge calculation method and edge calculation system
CN114598593B (en) Message processing method, system, computing device and computer storage medium
CN114422335A (en) Communication method, communication device, server and storage medium
CN111935296B (en) System for high-availability infinite MQTT message service capacity expansion
US20040153714A1 (en) Method and apparatus for providing error tolerance in a network environment
CN112437146B (en) Equipment state synchronization method, device and system
CN109327529B (en) Distributed scanning method and system
CN109150941B (en) Data center physical resource floating method
CN112416495A (en) Super-fusion cloud terminal resource unified management system and method
JPH07319836A (en) Fault monitoring system
CN114629783B (en) State monitoring method, system, equipment and computer readable storage medium
CN115834691B (en) Distributed publishing and subscribing method and device, electronic equipment and storage medium
CN114979037B (en) Multicast method, device, switch and storage medium
CN112994918B (en) Equipment management method and device

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