CN110381125A - A kind of information acquisition method and device - Google Patents
A kind of information acquisition method and device Download PDFInfo
- Publication number
- CN110381125A CN110381125A CN201910580921.2A CN201910580921A CN110381125A CN 110381125 A CN110381125 A CN 110381125A CN 201910580921 A CN201910580921 A CN 201910580921A CN 110381125 A CN110381125 A CN 110381125A
- Authority
- CN
- China
- Prior art keywords
- node
- nodal information
- host
- variation
- target
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
- H04L67/025—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP] for remote control or remote monitoring of applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
A kind of information acquisition method and device, comprising: host node monitors all nodal informations from node being stored in destination node；Wherein, nodal information is from all from being obtained ahead of time and be stored in destination node in node in cluster；When stored on destination node it is any change from the nodal information of node, host node obtain variation nodal information；The nodal information of variation is sent to all from node by host node.The application can make it is all from node in time know variation nodal information improve information acquisition efficiency to reduce the consumption of computing resource.
Description
Technical field
Present document relates to computer technology, espespecially a kind of information acquisition method and device.
Background technique
Cluster is the node set for including a host node with several from node.
In the related technology, when being deployed in some from the client on node it should be understood that from the variation of node state in cluster
When situation, the acquisition request by this from node to cluster proposition from node state change information is needed, then by cluster
The list of host node refresh node is all from node state to obtain, and then obtains then returning again to from node state change information
To the slave node that acquisition request is based on, so that client knows.
However, since host node is obtained from node state change information in this method carried out by the way of poll,
Therefore computing resource is very consumed, and makes information acquisition efficiency low.
Summary of the invention
This application provides an information acquisition method and devices, can reduce the consumption of computing resource, improve acquisition of information
Efficiency.
This application provides a kind of information acquisition methods, comprising:
Host node monitors all nodal informations from node being stored in destination node；Wherein, the nodal information is
From all from being obtained ahead of time and be stored in the destination node in node in cluster；
When stored on the destination node it is any change from the nodal information of node, the host node obtains variation
Nodal information；
The nodal information of variation is sent to all from node by the host node.
All in the destination node are both provided with corresponding survival count-down device from the nodal information of node；It is described to deposit
The initial time for storing up timer is preset time.
The nodal information of the variation includes: increased nodal information；
The host node obtains before the nodal information of variation, further includes:
The host node obtains nodal information of the first object from node；Wherein, the first object is to be added from node
Enter the slave node of the cluster；
The host node is connected to first object from the nodal information of node from node according to the first object；
The host node stores the first object into the destination node from the nodal information of node；
The host node is the first object from the corresponding survival count-down device of the nodal information of node setting, and is activated
Set survival count-down device countdown since preset time.
The nodal information of the variation includes: the nodal information of deletion；
The host node obtains before the nodal information of variation, further includes:
The host node obtains nodal information of second target from node；Wherein, second target from node be from institute
It states to be deleted from node in cluster；
The host node disconnects the connection with the second target from node according to second target from the nodal information of node；
When the number remaining time for getting survival count-down device corresponding with the nodal information of the second target from the node
It is 0, the host node deletes second target from the nodal information of node from the destination node.
The nodal information of the variation includes: the nodal information of deletion；
The host node obtains before the nodal information of variation, further includes:
The host node obtains the target survival count-down device that remaining time is 0 from the destination node；
The host node obtains the nodal information from node corresponding with target survival count-down device；
The host node deletes the nodal information of the slave node of acquisition from the destination node.
The nodal information of the variation includes: the nodal information of modification；
The host node obtains before the nodal information of variation, further includes:
The host node obtains nodal information of the third target from node；Wherein, the third target is described from node
The slave node of nodal information to be modified in cluster；
The host node is believed from the nodal information of node in the node that the destination node stores according to the third target
It is accordingly modified in breath.
The host node obtains before the nodal information of variation, further includes:
The host node attempts that connection is all from node every preset time, and the slave node being determined in connection is the
Four targets are from node；
The host node refreshes the residue of survival count-down device corresponding with the nodal information of the 4th target from the node
Time is to preset time.
The nodal information includes: the internet protocol address and port numbers of node.
The destination node is the host node or any from node in the cluster.
Present invention also provides a kind of host nodes, comprising:
Monitoring module, for monitoring all nodal informations from node being stored in destination node；Wherein, the node
Information is from all from being obtained ahead of time and be stored in the destination node in node in cluster；
Processing module, for store on the destination node it is any change from the nodal information of node, obtain
The nodal information of variation；
Sending module, it is all from node for the nodal information of variation to be sent to.
Compared with prior art, the application includes: that host node monitors all sections from node being stored in destination node
Point information；Wherein, the nodal information is from all from being obtained ahead of time and be stored in the destination node in node in cluster
's；When stored on the destination node it is any change from the nodal information of node, the host node obtains the section of variation
Point information；The nodal information of variation is sent to all from node by the host node.Since host node is to all sections from node
Point information is monitored, and is changed when from the nodal information of node, the nodal information that host node can obtain variation is sent to
It is all from node, therefore, enable all nodal informations for knowing variation in time from node in cluster, to reduce calculating
The consumption of resource, improves information acquisition efficiency.
Other features and advantage will illustrate in the following description, also, partly become from specification
It obtains it is clear that being understood and implementing the application.Other advantages of the application can be by specification, claims
And scheme described in attached drawing is achieved and obtained.
Detailed description of the invention
Attached drawing is used to provide the understanding to technical scheme, and constitutes part of specification, with the application's
Embodiment is used to explain the technical solution of the application together, does not constitute the limitation to technical scheme.
Fig. 1 is a kind of flow diagram of information acquisition method provided by the embodiments of the present application；
Fig. 2 is a kind of structural schematic diagram of host node of the embodiment of the present application.
Specific embodiment
This application describes multiple embodiments, but the description is exemplary, rather than restrictive, and for this
It is readily apparent that can have more in the range of embodiments described herein includes for the those of ordinary skill in field
More embodiments and implementation.Although many possible feature combinations are shown in the attached drawings, and in a specific embodiment
It is discussed, but many other combinations of disclosed feature are also possible.Unless the feelings specially limited
Other than condition, any feature or element of any embodiment can be with any other features or element knot in any other embodiment
It closes and uses, or any other feature or the element in any other embodiment can be substituted.
The application includes and contemplates the combination with feature known to persons of ordinary skill in the art and element.The application is
It can also combine with any general characteristics or element through disclosed embodiment, feature and element, be defined by the claims with being formed
Unique scheme of the invention.Any feature or element of any embodiment can also be with features or member from other scheme of the invention
Part combination, to form the unique scheme of the invention that another is defined by the claims.It will thus be appreciated that showing in this application
Out and/or any feature of discussion can be realized individually or in any suitable combination.Therefore, in addition to according to appended right
It is required that and its other than the limitation done of equivalent replacement, embodiment is not limited.Furthermore, it is possible in the guarantor of appended claims
It carry out various modifications and changes in shield range.
In addition, method and/or process may be rendered as spy by specification when describing representative embodiment
Fixed step sequence.However, in the degree of this method or process independent of the particular order of step described herein, this method
Or process should not necessarily be limited by the step of particular order.As one of ordinary skill in the art will appreciate, other steps is suitable
Sequence is also possible.Therefore, the particular order of step described in specification is not necessarily to be construed as limitations on claims.This
Outside, the claim for this method and/or process should not necessarily be limited by the step of executing them in the order written, art technology
Personnel are it can be readily appreciated that these can sequentially change, and still remain in the spirit and scope of the embodiment of the present application.
The embodiment of the present application provides a kind of information acquisition method, as shown in Figure 1, this method comprises:
Step 101, host node monitor all nodal informations from node being stored in destination node.
Wherein, nodal information is from all from being obtained ahead of time and be stored in destination node in node in cluster.
In a kind of illustrative examples, all nodal informations from node can be stored in the specified text on destination node
In part.
In a kind of illustrative examples, host node can open a thread, then the thread monitor storage by opening
All nodal informations from node in destination node.
Step 102, when stored on destination node it is any change from the nodal information of node, host node obtain variation
Nodal information.
The nodal information of variation is sent to all from node by step 103, host node.
It is all that monitoring processing function is set with the section on monitoring objective node from node in a kind of illustrative examples
Point information, but due to destination node possibly can not with it is all between node generate connection, when host node monitor it is any
It changes from the nodal information of node, host node, which obtains the nodal information of variation and is sent to all be provided with, monitors processing letter
On several slave nodes.
In a kind of exemplary embodiment, all in destination node are both provided with corresponding deposit from the nodal information of node
Count-down device living；The initial time for storing timer is preset time.
In a kind of exemplary embodiment, the nodal information of variation includes: increased nodal information.Host node obtains variation
Nodal information before, further includes:
First, host node obtains nodal information of the first object from node；Wherein, first object from node be collection to be added
The slave node of group.
Secondly, host node is connected to first object from the nodal information of node from node according to first object.
Then, host node stores first object into destination node from the nodal information of node.
Finally, host node is first object from the corresponding survival count-down device of the nodal information of node setting, and activates institute
Survival count-down device countdown since preset time of setting.
In a kind of illustrative examples, client passes through the affiliated nodal information from node to collection pocket transmission increase from node
Request, the host node in cluster receives the nodal information of the node of cluster to be added, then carries out subsequent operation.
In a kind of exemplary embodiment, the nodal information of variation includes: the nodal information of deletion.Host node obtains variation
Nodal information before, further includes:
First, host node obtains nodal information of second target from node；Wherein, the second target from node be from cluster
Slave node to be deleted.
Then, host node disconnects the connection with the second target from node according to the second target from the nodal information of node.
Finally, when the number remaining time for getting survival count-down device corresponding with the nodal information of the second target from node
It is 0, host node deletes the second target from the nodal information of node from destination node.
In a kind of illustrative examples, client passes through the affiliated nodal information from node to collection pocket transmission deletion from node
Request, the host node in cluster receives the nodal information of the node of cluster to be deleted, then carries out subsequent operation.
In a kind of exemplary embodiment, the nodal information of variation includes: the nodal information of deletion.Host node obtains variation
Nodal information before, further includes:
First, host node obtains the target survival count-down device that remaining time is 0 from destination node.
In a kind of illustrative examples, host node, which can be, obtains remaining time by way of monitoring destination node in real time
For 0 target survival count-down device, it can also be that every whether there is remaining time in preset time detection destination node be 0
Target survival count-down device simultaneously obtains.
Then, host node obtains the nodal information from node corresponding with target survival count-down device.
Finally, host node deletes the nodal information of the slave node of acquisition from destination node.
In a kind of illustrative examples, the slave node not instead of client in cluster is actively deleted, not due to network
It is offline the accidentalia such as to stablize, for this part from node, host node obtains remaining time from destination node as 0 target
Then survival count-down device obtains the nodal information from node corresponding with target survival count-down device and deletion.
In a kind of exemplary embodiment, the nodal information of variation includes: the nodal information of modification.Host node obtains variation
Nodal information before, further includes:
First, host node obtains nodal information of the third target from node；Wherein, third target from node be in cluster to
Modify the slave node of nodal information.
Secondly, host node carries out in the nodal information that destination node stores according to third target from the nodal information of node
Corresponding modification.
In a kind of exemplary embodiment, host node is obtained before the nodal information of variation, further includes:
First, host node is attempted to connect all from node every preset time, and the slave node being determined in connection is
4th target is from node.
Secondly, host node refreshes the remaining time of survival count-down device corresponding with the nodal information of the 4th target from node
To preset time.
In a kind of exemplary embodiment, host node can open a thread, then be survived with the thread opened
The refreshing of count-down device.
In a kind of exemplary embodiment, nodal information include: node Internet protocol (Internet Protocol,
IP) address and port numbers.
In a kind of exemplary embodiment, destination node is the host node or any from node in cluster.
In a kind of illustrative examples, information acquisition method provided by the embodiments of the present application can be applied to reliably be distributed
In formula key assignments storage system etcd, etcd passes through raft agreement (raft for the critical data in distributed storage system, etcd
Agreement is a kind of common recognition algorithm applied in a distributed system, for guaranteeing the one of cluster in the case where network partition occurs
The agreement of cause property and availability) it ensure that its safety and reliability.
In a kind of illustrative examples, when information acquisition method provided by the embodiments of the present application is applied in etcd,
Essence is to realize the real-time informing changed from node state using the etcd key assignments storage system carried and key assignments monitoring system,
Specifically, it may comprise steps of:
First, it establishes a prefix prefix in etcd cluster to be named as "/member " ,/member " is used to record institute
There is the nodal information from node.The step can specifically be executed by selecting one in etcd cluster from node.
Secondly, all be arranged from node is monitored to monitor the prefix.The step can specifically be monitored by setting
It handles function to execute, wherein monitoring processing function judges event type and respective service is called to be handled.
Then, when being added cluster in new node, the key of entitled "/member/IP:PORT " is created at "/member "
Value key, wherein IP and PORT is the IP address and port numbers of this node, and accordingly can the time-to-live to key setting
(Time To Live, TTL) (is equivalent to the survival count-down device in examples detailed above), and after being provided with, TTL starts to count
When, when ttl value is 0, which will be deleted.
Finally, when offline from cluster from node, it should be unable to get update from the TTL of the corresponding key of node, and worked as timing
When time reaches 0, the host node in cluster can be automatically deleted the key, and the slave node of other all monitoring "/member " can also be stood
This is perceived from the offline of node.
Information acquisition method provided by the embodiments of the present application, since host node carries out all nodal informations from node
Monitoring, changes when from the nodal information of node, the nodal information that host node can obtain variation be sent to it is all from node, because
This, enables and all in cluster knows that the nodal information of variation mentions to reduce the consumption of computing resource in time from node
High information acquisition efficiency.
The embodiment of the present invention also provides a kind of host node, as shown in Fig. 2, the host node 2 includes:
Monitoring module 21, for monitoring all nodal informations from node being stored in destination node；Wherein, node is believed
Breath is from all from being obtained ahead of time and be stored in destination node in node in cluster.
Processing module 22, for store on the destination node it is any change from the nodal information of node, obtain and become
The nodal information of change；
Sending module 23, it is all from node for the nodal information of variation to be sent to.
In a kind of exemplary embodiment, all in destination node are both provided with corresponding deposit from the nodal information of node
Count-down device living；The initial time for storing timer is preset time.
In a kind of exemplary embodiment, the nodal information of variation includes: increased nodal information.Processing module 22, also
For:
Obtain nodal information of the first object from node；Wherein, first object is the slave node of cluster to be added from node.
It is connected to first object from the nodal information of node from node according to first object.
First object is stored from the nodal information of node into destination node.
Corresponding survival count-down device is set from the nodal information of node for first object, and set survival is activated to fall
Timer countdown since preset time.
In a kind of exemplary embodiment, the nodal information of variation includes: the nodal information of deletion.Processing module 22, also
For:
Obtain nodal information of second target from node；Wherein, the second target from node be from cluster it is to be deleted from
Node.
It is disconnected with the second target from the nodal information of node from the connection of node according to the second target.
It is 0 when the number remaining time for getting survival count-down device corresponding with the nodal information of the second target from node,
Second target is deleted from destination node from the nodal information of node.
In a kind of exemplary embodiment, the nodal information of variation includes: the nodal information of deletion.Processing module 22, also
For:
The target survival count-down device that remaining time is 0 is obtained from destination node.
Obtain the nodal information from node corresponding with target survival count-down device.
The nodal information of the slave node of acquisition is deleted from destination node.
In a kind of exemplary embodiment, the nodal information of variation includes: the nodal information of modification.Processing module 22, also
For:
Obtain nodal information of the third target from node；Wherein, third target from node be node to be modified letter in cluster
The slave node of breath.
It is accordingly modified in the nodal information that destination node stores according to third target from the nodal information of node.
In a kind of exemplary embodiment, processing module 22 is also used to:
Attempt that connection is all from node every preset time, and the slave node being determined in connection is the 4th target from section
Point.
Point refresh it is corresponding with the nodal information of the 4th target from node survive count-down device remaining time to it is default when
Between.
In a kind of exemplary embodiment, nodal information includes: the internet protocol address and port numbers of node.
In a kind of exemplary embodiment, destination node is the host node or any from node in cluster.
Host node provided by the embodiments of the present application, due to being monitored to all from the nodal information of node, when from section
Point nodal information change, the nodal information that host node can obtain variation be sent to it is all from node, therefore, so that cluster
In it is all from node can know in time variation nodal information improve information to reduce the consumption of computing resource and obtain
Take efficiency.
In practical applications, during the monitoring module 21, processing module 22 and sending module 23 are respectively positioned in host node
Central processor (Central Processing Unit, CPU), microprocessor (Micro Processor Unit, MPU), number
Signal processor (Digital Signal Processor, DSP) or field programmable gate array (Field Programmable
Gate Array, FPGA) etc. realize.
The embodiment of the present invention also provides a kind of cluster, including a host node as described above and several from node.
The embodiment of the present application also provides a kind of information acquisition device, including memory, and processor and storage are on a memory
And the computer program that can be run in processor, processor realize that any one in above-described embodiment is believed when executing computer program
Cease acquisition methods.
The embodiment of the present application also provides a kind of computer readable storage medium, and it is executable that computer is stored on storage medium
Order, computer executable command is for executing such as any one information acquisition method in above-described embodiment.
It will appreciated by the skilled person that whole or certain steps, system, dress in method disclosed hereinabove
Functional module/unit in setting may be implemented as software, firmware, hardware and its combination appropriate.In hardware embodiment,
Division between the functional module/unit referred in the above description not necessarily corresponds to the division of physical assemblies；For example, one
Physical assemblies can have multiple functions or a function or step and can be executed by several physical assemblies cooperations.Certain groups
Part or all components may be implemented as by processor, such as the software that digital signal processor or microprocessor execute, or by
It is embodied as hardware, or is implemented as integrated circuit, such as specific integrated circuit.Such software can be distributed in computer-readable
On medium, computer-readable medium may include computer storage medium (or non-transitory medium) and communication media (or temporarily
Property medium).As known to a person of ordinary skill in the art, term computer storage medium is included in for storing information (such as
Computer readable instructions, data structure, program module or other data) any method or technique in the volatibility implemented and non-
Volatibility, removable and nonremovable medium.Computer storage medium include but is not limited to RAM, ROM, EEPROM, flash memory or its
His memory technology, CD-ROM, digital versatile disc (DVD) or other optical disc storages, magnetic holder, tape, disk storage or other
Magnetic memory apparatus or any other medium that can be used for storing desired information and can be accessed by a computer.This
Outside, known to a person of ordinary skill in the art to be, communication media generally comprises computer readable instructions, data structure, program mould
Other data in the modulated data signal of block or such as carrier wave or other transmission mechanisms etc, and may include any information
Delivery media.
Claims (10)
1. a kind of information acquisition method characterized by comprising
Host node monitors all nodal informations from node being stored in destination node；Wherein, the nodal information is from collection
It is all from being obtained ahead of time and be stored in the destination node in node in group；
When stored on the destination node it is any change from the nodal information of node, the host node obtains the section of variation
Point information；
The nodal information of variation is sent to all from node by the host node.
2. the method according to claim 1, wherein all nodal informations from node in the destination node
It is both provided with corresponding survival count-down device；The initial time of the storage timer is preset time.
3. according to the method described in claim 2, it is characterized in that, the nodal information of the variation includes: increased node letter
Breath；
The host node obtains before the nodal information of variation, further includes:
The host node obtains nodal information of the first object from node；Wherein, the first object from node be institute to be added
State the slave node of cluster；
The host node is connected to first object from the nodal information of node from node according to the first object；
The host node stores the first object into the destination node from the nodal information of node；
The host node is the first object from the corresponding survival count-down device of the nodal information of node setting, and set by activation
The survival count-down device countdown since preset time set.
4. according to the method described in claim 2, it is characterized in that, the nodal information of the variation includes: the node letter of deletion
Breath；
The host node obtains before the nodal information of variation, further includes:
The host node obtains nodal information of second target from node；Wherein, second target from node be from the collection
It is to be deleted from node in group；
The host node disconnects the connection with the second target from node according to second target from the nodal information of node；
It is 0 when the number remaining time for getting survival count-down device corresponding with the nodal information of the second target from the node,
The host node deletes second target from the nodal information of node from the destination node.
5. according to the method described in claim 2, it is characterized in that, the nodal information of the variation includes: the node letter of deletion
Breath；
The host node obtains before the nodal information of variation, further includes:
The host node obtains the target survival count-down device that remaining time is 0 from the destination node；
The host node obtains the nodal information from node corresponding with target survival count-down device；
The host node deletes the nodal information of the slave node of acquisition from the destination node.
6. according to the method described in claim 2, it is characterized in that, the nodal information of the variation includes: the node letter of modification
Breath；
The host node obtains before the nodal information of variation, further includes:
The host node obtains nodal information of the third target from node；Wherein, the third target from node be the cluster
In nodal information to be modified slave node；
The host node according to the third target from the nodal information of node in the nodal information that the destination node stores
Accordingly modified.
7. according to the method described in claim 2, it is characterized in that, being gone back before the nodal information of host node acquisition variation
Include:
The host node is all from node every preset time trial connection, and the slave node being determined in connection is the 4th mesh
It marks from node；
The host node refreshes the remaining time of survival count-down device corresponding with the nodal information of the 4th target from the node
To preset time.
8. method according to claim 1-7, which is characterized in that the nodal information includes: the interconnection of node
FidonetFido IP address and port numbers.
9. method according to claim 1-6, which is characterized in that the destination node is in the cluster
Host node or any from node.
10. a kind of host node characterized by comprising
Monitoring module, for monitoring all nodal informations from node being stored in destination node；Wherein, the nodal information
It is from all from being obtained ahead of time and be stored in the destination node in node in cluster；
Processing module, for store on the destination node it is any change from the nodal information of node, obtain variation
Nodal information；
Sending module, it is all from node for the nodal information of variation to be sent to.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910580921.2A CN110381125A (en) | 2019-06-29 | 2019-06-29 | A kind of information acquisition method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910580921.2A CN110381125A (en) | 2019-06-29 | 2019-06-29 | A kind of information acquisition method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110381125A true CN110381125A (en) | 2019-10-25 |
Family
ID=68251328
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910580921.2A Pending CN110381125A (en) | 2019-06-29 | 2019-06-29 | A kind of information acquisition method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110381125A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130336166A1 (en) * | 2012-06-15 | 2013-12-19 | Tushar K. Swain | Systems and methods for deriving unique mac address for a cluster |
| CN104320459A (en) * | 2014-10-24 | 2015-01-28 | 杭州华三通信技术有限公司 | Node management method and device |
| CN105656653A (en) * | 2014-11-14 | 2016-06-08 | 华为技术有限公司 | Network access method of newly added node in distributed coordination system, device and system |
| US20160283335A1 (en) * | 2015-03-24 | 2016-09-29 | Xinyu Xingbang Information Industry Co., Ltd. | Method and system for achieving a high availability and high performance database cluster |
| CN106453512A (en) * | 2016-09-05 | 2017-02-22 | 努比亚技术有限公司 | Redis cluster information monitoring device and method |
| CN107948017A (en) * | 2017-09-30 | 2018-04-20 | 用友金融信息技术股份有限公司 | Highly available cluster system |
-
2019
- 2019-06-29 CN CN201910580921.2A patent/CN110381125A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130336166A1 (en) * | 2012-06-15 | 2013-12-19 | Tushar K. Swain | Systems and methods for deriving unique mac address for a cluster |
| CN104320459A (en) * | 2014-10-24 | 2015-01-28 | 杭州华三通信技术有限公司 | Node management method and device |
| CN105656653A (en) * | 2014-11-14 | 2016-06-08 | 华为技术有限公司 | Network access method of newly added node in distributed coordination system, device and system |
| US20160283335A1 (en) * | 2015-03-24 | 2016-09-29 | Xinyu Xingbang Information Industry Co., Ltd. | Method and system for achieving a high availability and high performance database cluster |
| CN106453512A (en) * | 2016-09-05 | 2017-02-22 | 努比亚技术有限公司 | Redis cluster information monitoring device and method |
| CN107948017A (en) * | 2017-09-30 | 2018-04-20 | 用友金融信息技术股份有限公司 | Highly available cluster system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106911728B (en) | The choosing method and device of host node in distributed system | |
| US11240115B2 (en) | Network topology display method and network management device | |
| CN103973725B (en) | A kind of distributed cooperative algorithm and synergist | |
| JP2017517817A (en) | Arbitration processing method, quorum storage device, and system after cluster brain division | |
| CN105407117B (en) | The methods, devices and systems of distributed backup data | |
| CN111538763B (en) | Method for determining master node in cluster, electronic equipment and storage medium | |
| CN108173691B (en) | Cross-device aggregation method and device | |
| US11416313B2 (en) | Equipment control method, cluster system , electronic device and readable storage medium | |
| CN105677673B (en) | Method for processing business, apparatus and system | |
| CN105162879B (en) | Realize the method, apparatus and system of multimachine room data consistency | |
| US11609556B2 (en) | Control method and device based on industrial ethernet | |
| CN108289034A (en) | A kind of fault discovery method and apparatus | |
| JP2016528630A (en) | Application-aware network management | |
| EP3817338B1 (en) | Method and apparatus for acquiring rpc member information, electronic device and storage medium | |
| CN107707370B (en) | Group communication method, server, terminal and computer storage medium | |
| CN103051470A (en) | Cluster and control method for magnetic disk heartbeat of cluster | |
| CN105208060A (en) | Service data synchronization method, service data synchronization device and service data synchronization system | |
| CN111352943A (en) | Method and device for realizing data consistency, server and terminal | |
| CN101969398A (en) | Aging method and system of MAC (Media Access Control) address | |
| US9342291B1 (en) | Distributed update service | |
| CN108259218A (en) | A kind of IP address distribution method and device | |
| CN106021527B (en) | A kind of data processing method and search server, sync server | |
| CN108900603A (en) | A kind of server discovery methods, devices and systems | |
| CN112492030B (en) | Data storage method, device, computer equipment and storage medium | |
| US20160191368A1 (en) | Information processing device, method, and medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191025 |
|
| RJ01 | Rejection of invention patent application after publication |