CN110795442A - Key value updating method, device, equipment and readable storage medium - Google Patents

Key value updating method, device, equipment and readable storage medium Download PDF

Info

Publication number
CN110795442A
CN110795442A CN201910927747.4A CN201910927747A CN110795442A CN 110795442 A CN110795442 A CN 110795442A CN 201910927747 A CN201910927747 A CN 201910927747A CN 110795442 A CN110795442 A CN 110795442A
Authority
CN
China
Prior art keywords
path
key value
target
node
etcd cluster
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910927747.4A
Other languages
Chinese (zh)
Other versions
CN110795442B (en
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.)
Beijing Inspur Data Technology Co Ltd
Original Assignee
Beijing Inspur Data 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 Beijing Inspur Data Technology Co Ltd filed Critical Beijing Inspur Data Technology Co Ltd
Priority to CN201910927747.4A priority Critical patent/CN110795442B/en
Publication of CN110795442A publication Critical patent/CN110795442A/en
Application granted granted Critical
Publication of CN110795442B publication Critical patent/CN110795442B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/125Shortest path evaluation based on throughput or bandwidth
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/24Multipath
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/12Avoiding congestion; Recovering from congestion
    • H04L47/125Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application discloses a key value updating method, a key value updating device, key value updating equipment and a readable storage medium. The method disclosed by the application comprises the following steps: if the key value update time point of the target node is reached, determining a path set corresponding to the target node; selecting a target path from the path set by using a preset path selection strategy, and determining the target path as a transmission path of a current key value of a target node; and sending the current key value to the etcd cluster through the target path for storage so that the etcd cluster updates the key value of the target node. According to the method and the device, a plurality of paths are arranged for each node, when any node needs to update the key value corresponding to the node, at least one available path can be selected from the plurality of paths to transmit the key value, so that the condition that the key value cannot be updated in time is avoided, and the reliability and the service capability of the distributed system are improved. Accordingly, the key value updating device, the apparatus and the readable storage medium disclosed in the present application also have the above technical effects.

Description

Key value updating method, device, equipment and readable storage medium
Technical Field
The present application relates to the field of computer technologies, and in particular, to a key value updating method, device, apparatus, and readable storage medium.
Background
The etcd is an open-source distributed key-value pair storage that can record the key value of each node in the distributed system, so the distributed system can be regarded as an etcd cluster. The key value of each node changes periodically and is used for representing the survival state of each node.
If the etcd cluster manages three nodes: node1, node2 and node3, and the key value pairs corresponding to these three nodes are: key-node1, key-node2, and key-node 3. Wherein, key in the key-node1 is the key value, and node1 is the identification information of node 1. Each node updates its corresponding key at regular time. Any node of the etcd cluster management can acquire the key value updating information of other nodes, so that the survival state of other nodes in the cluster can be sensed.
Currently, there is only one transmission path for each node of the etcd cluster management to update the key value. Thus, there will appear: when a transmission path corresponding to the node a fails, the node a cannot update its corresponding key value in time, and then the node a loses contact with the etcd cluster, and other nodes in the etcd cluster cannot sense the node a, so that reliability and service capability of the distributed system are reduced.
Therefore, how to improve the reliability and service capability of the distributed system is a problem to be solved by those skilled in the art.
Disclosure of Invention
In view of the above, an object of the present application is to provide a key value updating method, device, apparatus and readable storage medium, so as to improve reliability and service capability of a distributed system. The specific scheme is as follows:
in a first aspect, the present application provides a key value updating method, including:
if the key value update time point of the target node is reached, determining a path set corresponding to the target node, wherein a plurality of paths are arranged in the path set;
selecting a target path from the path set by using a preset path selection strategy, and determining the target path as a transmission path of a current key value of a target node;
sending the current key value to the etcd cluster through the target path for storage, so that the etcd cluster updates the key value stored in the etcd cluster by the target node to the current key value; the target node is any node of the etcd cluster management.
Preferably, selecting a target path from the path set by using a preset path selection policy includes:
calculating the load of each path in the path set to obtain the load of each path;
and determining the path with the minimum load amount as a target path.
Preferably, selecting a target path from the path set by using a preset path selection policy includes:
detecting the performance of each path in the path set to obtain a performance evaluation value of each path;
and determining the path with the maximum performance evaluation value as the target path.
Preferably, selecting a target path from the path set by using a preset path selection policy includes:
calculating the load of each path in the path set to obtain the load of each path;
detecting the performance of each path in the path set to obtain a performance evaluation value of each path;
calculating the comprehensive score of each path according to the load and the performance evaluation value of each path;
and determining the path with the maximum comprehensive score as the target path.
Preferably, selecting a target path from the path set by using a preset path selection policy includes:
and selecting a target path from the path set by using a failover policy or a Multibus policy.
Preferably, the updating, by the etcd cluster, the key value stored by the target node in the etcd cluster to the current key value includes:
and the etcd cluster updates the key value stored in the etcd cluster by the target node into the current key value according to the identification information of the target node.
Preferably, the paths in the path set correspond to the network cards in the target nodes one to one.
In a second aspect, the present application provides a key value updating apparatus, including:
the determining module is used for determining a path set corresponding to the target node if the key value update time point of the target node is reached, wherein the path set is provided with a plurality of paths;
the selection module is used for selecting a target path from the path set by using a preset path selection strategy and determining the target path as a transmission path of a current key value of a target node;
the updating module is used for sending the current key value to the etcd cluster through the target path for storage so that the etcd cluster updates the key value stored in the etcd cluster by the target node into the current key value; the target node is any node of the etcd cluster management.
In a third aspect, the present application provides a key value updating device, including:
a memory for storing a computer program;
a processor for executing a computer program to implement the key value updating method disclosed in the foregoing.
In a fourth aspect, the present application provides a readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the key-value updating method disclosed in the foregoing.
According to the above scheme, the present application provides a key value updating method, including: if the key value update time point of the target node is reached, determining a path set corresponding to the target node, wherein a plurality of paths are arranged in the path set; selecting a target path from the path set by using a preset path selection strategy, and determining the target path as a transmission path of a current key value of a target node; sending the current key value to the etcd cluster through the target path for storage, so that the etcd cluster updates the key value stored in the etcd cluster by the target node to the current key value; the target node is any node of the etcd cluster management.
It can be seen that, the method is provided with a plurality of paths for each node of the etcd cluster management, when any node needs to update its corresponding key value, at least one available path can be selected from the plurality of paths by using a preset path selection policy to transmit the key value, so that the situation that the key value cannot be updated in time does not occur, and other nodes in the etcd cluster can sense the survival state of the current node in time, thereby improving the reliability and service capability of the distributed system.
Accordingly, the key value updating device, the apparatus and the readable storage medium provided by the present application also have the above technical effects.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a first key value updating method disclosed in the present application;
fig. 2 is a flowchart of a second key value updating method disclosed in the present application;
fig. 3 is a schematic diagram illustrating a correspondence relationship between a node and a transmission path disclosed in the present application;
fig. 4 is a schematic diagram of a key value update architecture disclosed in the present application;
fig. 5 is a schematic diagram of a key value updating apparatus disclosed in the present application;
fig. 6 is a schematic diagram of a key value updating device disclosed in the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Currently, there is only one transmission path for each node of the etcd cluster management to update the key value. Thus, there will appear: when a transmission path corresponding to the node a fails, the node a cannot update its corresponding key value in time, and then the node a loses contact with the etcd cluster, and other nodes in the etcd cluster cannot sense the node a, so that reliability and service capability of the distributed system are reduced. Therefore, the key value updating scheme is provided, and the reliability and the service capability of the distributed system can be improved.
Referring to fig. 1, an embodiment of the present application discloses a first key value updating method, including:
s101, if the key value update time point of the target node is reached, determining a path set corresponding to the target node;
wherein, a plurality of paths are arranged in the path set.
S102, selecting a target path from the path set by using a preset path selection strategy, and determining the target path as a transmission path of a current key value of a target node;
s103, sending the current key value to the etcd cluster through the target path for storage, so that the etcd cluster updates the key value stored in the etcd cluster by the target node as the current key value.
And the target node is any node of the etcd cluster management.
In this embodiment, the updating, by the etcd cluster, the key value stored by the target node in the etcd cluster to the current key value includes: and the etcd cluster updates the key value stored in the etcd cluster by the target node into the current key value according to the identification information of the target node.
It should be noted that the paths in the path set correspond to the network cards in the target nodes one to one. Since the path may be a combination of IP address and port, multiple network cards are typically plugged into each node. In the prior art, only one of the network cards is used for maintaining the node state, and the other network cards are used for normal service processing. As such, the prior art has only one path for transmitting the key. According to the method and the device, other network cards used for normal service processing on each node are also used for transmitting the key values, and the redundant transmission paths of the key values are set, so that more optional paths are provided for the transmission of the key values, and the reliability of the system is improved. In this embodiment, each network card on a node is used not only for normal service processing, but also for maintaining the node state.
In a specific embodiment, selecting a target path from a set of paths using a preset path selection policy includes: calculating the load of each path in the path set to obtain the load of each path; and determining the path with the minimum load amount as a target path. Because each network card on the node is not only used for normal service processing, but also used for maintaining the node state, the load of each path is constantly changed. When the key value is transmitted, the path with the minimum load capacity can be selected according to the load capacity of each path for transmitting the key value. The amount of load may be viewed as the amount of data transmitted over the path.
In a specific embodiment, selecting a target path from a set of paths using a preset path selection policy includes: detecting the performance of each path in the path set to obtain a performance evaluation value of each path; and determining the path with the maximum performance evaluation value as the target path. In the actual use process, the performance of each network card is different, so the performance of the path corresponding to each network card is also different. When the key value is transmitted, the path with the largest performance evaluation value can be selected according to the performance evaluation value of each path for transmitting the key value. The performance evaluation value can be regarded as an evaluation value of the network card performance.
In a specific embodiment, selecting a target path from a set of paths using a preset path selection policy includes: and selecting a target path from the path set by using a failover policy or a Multibus policy. Wherein, the failover policy is as follows: and selecting a certain path in the path set as a target path for a long time, and selecting other paths in the path set when the path fails. In the failover policy, the path selection may be performed by polling or random selection. The Multibus strategy is to distribute the IO of the key value to be transmitted to a plurality of paths according to a set strategy, that is, to transmit the current key value through the plurality of paths. For example: and the IOs of the key values to be transmitted are uniformly distributed on the paths, the IOs of the key values to be transmitted are distributed on the paths according to the designated proportion, and the like, so that the key values to be transmitted can be ensured to reach the etcd cluster through the paths.
It can be seen that, in the embodiment of the present application, multiple paths are provided for each node of the etcd cluster management, and when any node needs to update its corresponding key value, a preset path selection policy may be used to select at least one available path from the multiple paths to transmit the key value, so that a situation that the key value cannot be updated in time does not occur, and thus other nodes in the etcd cluster can sense the survival state of the current node in time, thereby improving reliability and service capability of the distributed system.
Referring to fig. 2, an embodiment of the present application discloses a second key value updating method, including:
s201, if the key value update time point of the target node is reached, determining a path set corresponding to the target node;
wherein, a plurality of paths are arranged in the path set;
s202, calculating the load of each path in the path set to obtain the load of each path;
s203, detecting the performance of each path in the path set to obtain a performance evaluation value of each path;
s204, calculating a comprehensive score of each path according to the load and the performance evaluation value of each path;
s205, determining the path with the maximum comprehensive score as a target path;
s206, determining the target path as a transmission path of the current key value of the target node;
and S207, sending the current key value to the etcd cluster through the target path for storage, so that the etcd cluster updates the key value stored in the etcd cluster by the target node as the current key value.
It should be noted that, the implementation steps in this embodiment are the same as or similar to those in the above embodiments, and thus reference may be made to these steps, which are not repeated herein.
As can be seen from the above, in this embodiment, a plurality of paths are provided for each node of the etcd cluster management, and when any node needs to update its corresponding key value, at least one available path can be selected from the plurality of paths by using a preset path selection policy to transmit the key value, so that a situation that the key value cannot be updated in time does not occur, and thus other nodes in the etcd cluster can sense the survival state of the current node in time, thereby improving the reliability and service capability of the distributed system.
According to the key value updating method provided by the present application, the following example can be designed, and please refer to fig. 3 specifically. In fig. 3, a node represents any node of the etcd cluster management, path-set represents a path set corresponding to the current node, path-1, path-2, and path-3 … … path-n represent all transmission paths in the path set, path _ mgt (path management) represents a path management tool including a path selection policy corresponding to the current node, and v-end (visual end) represents a currently available transmission path selected from the path set. FIG. 3 implements the key value update path by defining v-endpoint. The path-set is managed through the path-mgt, the availability of any path in the path-set is guaranteed, and when the path in the path-set is unavailable, the unavailable path can be deleted from the path-set.
Under the principle shown in fig. 3, the architecture shown in fig. 4 is designed. In FIG. 4, a node is associated with a path-set that is the set of paths for all updatable key values of the node, which is simply understood to be a set of endpoints. However, the path-set is not limited to the end-point set, and may be a set of paths for updating the key value in the etcd, or may be a service set for updating the key value. The path-set is managed by path _ mgt, and path _ mgt manages the path-set uniformly and provides a unique v-endpoint for providing a unique path for updating the key value by the node. v-endpoint is a virtual endpoint definition that is associated with the actual physical device through path _ mgt. That is, although the transmission path being used by the node is always v-endpoint, the transmission path may be changed at the back end, but the node cannot sense the change of the transmission path. Every time the transmission path is changed, the association relationship between the v-endpoint and the changed physical transmission path is reestablished. Path _ mgt maintains and manages mapping management of v-endpoint with a path in path-set. Meanwhile, the path _ mgt has the function of monitoring and maintaining the health state (such as performance, load detection and the like) of each path in the path-set, and the optimal mapping and selection of the path-set and the v-endpoint are realized by acquiring the state information of the paths.
When the path mapped with the v-end fails, path _ mgt will detect the state abnormality of the path first, and then the mapping policy in path _ mgt selects the remaining working path and remaps to the v-end, thereby maintaining the high availability of the etcd cooperative management function.
It should be noted that, the implementation steps in this embodiment are the same as or similar to those in the above embodiments, and thus reference may be made to these steps, which are not repeated herein.
As can be seen from the above, this embodiment discloses that, in this embodiment, multiple paths available for updating the key value on the node can be managed uniformly through the path _ mgt, and only one virtual path is provided for the outside to update the key value, that is, details of the key value updating path are hidden in the etcd cluster, so that the path _ mgt can better define the mapping policy from the path-set to the v-endpoint. Meanwhile, path _ mgt is defined as having the function of monitoring and maintaining paths in path-set, so that all paths in path-set can be quantitatively graded, and the optimal path can be selected. When the physical path which normally works fails, the path _ mgt can sense and seamlessly switch the path in advance, and high availability of the etcd cooperation management function is ensured.
In the following, a key value updating apparatus provided in an embodiment of the present application is introduced, and a key value updating apparatus described below and a key value updating method described above may refer to each other.
Referring to fig. 5, an embodiment of the present application discloses a key value updating apparatus, including:
a determining module 501, configured to determine a path set corresponding to a target node if a key value update time point of the target node is reached, where the path set is provided with multiple paths;
a selecting module 502, configured to select a target path from the path set by using a preset path selection policy, and determine the target path as a transmission path of a current key value of a target node;
an updating module 503, configured to send the current key value to the etcd cluster through the target path for storage, so that the etcd cluster updates the key value stored by the target node in the etcd cluster to the current key value; the target node is any node of the etcd cluster management.
In one embodiment, the selection module comprises:
the calculating unit is used for calculating the load of each path in the path set to obtain the load of each path;
and a first determining unit for determining the path with the minimum load amount as the target path.
In one embodiment, the selection module comprises:
the detection unit is used for detecting the performance of each path in the path set to obtain a performance evaluation value of each path;
a second determination unit configured to determine the path having the largest performance evaluation value as the target path.
In one embodiment, the selection module comprises:
the calculating unit is used for calculating the load of each path in the path set to obtain the load of each path;
the detection unit is used for detecting the performance of each path in the path set to obtain a performance evaluation value of each path;
the comprehensive calculation unit is used for calculating comprehensive scores of each path according to the load and the performance evaluation value of each path;
and the third determining unit is used for determining the path with the maximum comprehensive score as the target path.
In a specific embodiment, the selection module is specifically configured to:
and selecting a target path from the path set by using a failover policy or a Multibus policy.
In a specific embodiment, the etcd cluster updates the key value stored by the target node in the etcd cluster to the current key value according to the identification information of the target node.
In one embodiment, the paths in the path set correspond to network cards in the target node one-to-one.
For more specific working processes of each module and unit in this embodiment, reference may be made to corresponding contents disclosed in the foregoing embodiments, and details are not described here again.
It can be seen that, this embodiment provides a key value updating apparatus, where the apparatus provides multiple paths for each node of an etcd cluster management, and when any node needs to update its corresponding key value, at least one available path can be selected from the multiple paths by using a preset path selection policy to transmit the key value, so that a situation that the key value cannot be updated in time does not occur, and thus other nodes in the etcd cluster can sense the survival state of the current node in time, thereby improving reliability and service capability of a distributed system.
In the following, a key value updating device provided in an embodiment of the present application is introduced, and a key value updating device described below and a key value updating method and apparatus described above may refer to each other.
Referring to fig. 6, an embodiment of the present application discloses a key value updating device, including:
a memory 601 for storing a computer program;
a processor 602 for executing the computer program to implement the method disclosed in any of the embodiments above.
In the following, a readable storage medium provided by an embodiment of the present application is introduced, and a readable storage medium described below and a key value updating method, apparatus, and device described above may be referred to each other.
A readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the key value updating method disclosed in the foregoing embodiments. For the specific steps of the method, reference may be made to the corresponding contents disclosed in the foregoing embodiments, which are not described herein again.
References in this application to "first," "second," "third," "fourth," etc., if any, are intended to distinguish between similar elements and not necessarily to describe a particular order or sequence. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprises" and "comprising," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, or apparatus.
It should be noted that the descriptions in this application referring to "first", "second", etc. are for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present application.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of readable storage medium known in the art.
The principle and the implementation of the present application are explained herein by applying specific examples, and the above description of the embodiments is only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims (10)

1. A key value updating method is characterized by comprising the following steps:
if the key value update time point of a target node is reached, determining a path set corresponding to the target node, wherein the path set is provided with a plurality of paths;
selecting a target path from the path set by using a preset path selection strategy, and determining the target path as a transmission path of a current key value of the target node;
sending the current key value to an etcd cluster through the target path for storage, so that the etcd cluster updates the key value stored in the etcd cluster by the target node as the current key value; the target node is any node of the etcd cluster management.
2. The key-value updating method of claim 1, wherein the selecting a target path from the set of paths using a preset path selection policy comprises:
calculating the load of each path in the path set to obtain the load of each path;
and determining the path with the minimum load amount as the target path.
3. The key-value updating method of claim 1, wherein the selecting a target path from the set of paths using a preset path selection policy comprises:
detecting the performance of each path in the path set to obtain a performance evaluation value of each path;
and determining the path with the largest performance evaluation value as the target path.
4. The key-value updating method of claim 1, wherein the selecting a target path from the set of paths using a preset path selection policy comprises:
calculating the load of each path in the path set to obtain the load of each path;
detecting the performance of each path in the path set to obtain a performance evaluation value of each path;
calculating the comprehensive score of each path according to the load and the performance evaluation value of each path;
and determining the path with the maximum comprehensive score as the target path.
5. The key-value updating method of claim 1, wherein the selecting a target path from the set of paths using a preset path selection policy comprises:
and selecting the target path from the path set by utilizing a failover strategy or a Multibus strategy.
6. The key value updating method according to any one of claims 1 to 5, wherein the updating, by the etcd cluster, the key value stored by the target node in the etcd cluster to the current key value includes:
and the etcd cluster updates the key value stored in the etcd cluster by the target node into the current key value according to the identification information of the target node.
7. The key value updating method according to claim 1, wherein the paths in the path set correspond to network cards in the target nodes one to one.
8. A key value updating apparatus, comprising:
the system comprises a determining module, a judging module and a judging module, wherein the determining module is used for determining a path set corresponding to a target node if a key value update time point of the target node is reached, and a plurality of paths are arranged in the path set;
a selection module, configured to select a target path from the path set by using a preset path selection policy, and determine the target path as a transmission path of a current key value of the target node;
an updating module, configured to send the current key value to an etcd cluster through the target path for storage, so that the etcd cluster updates the key value stored by the target node in the etcd cluster to the current key value; the target node is any node of the etcd cluster management.
9. A key value updating apparatus, comprising:
a memory for storing a computer program;
a processor for executing the computer program to implement the key-value updating method of any one of claims 1 to 7.
10. A readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the key-value updating method according to any one of claims 1 to 7.
CN201910927747.4A 2019-09-27 2019-09-27 Key value updating method, device, equipment and readable storage medium Active CN110795442B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910927747.4A CN110795442B (en) 2019-09-27 2019-09-27 Key value updating method, device, equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910927747.4A CN110795442B (en) 2019-09-27 2019-09-27 Key value updating method, device, equipment and readable storage medium

Publications (2)

Publication Number Publication Date
CN110795442A true CN110795442A (en) 2020-02-14
CN110795442B CN110795442B (en) 2022-04-22

Family

ID=69439955

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910927747.4A Active CN110795442B (en) 2019-09-27 2019-09-27 Key value updating method, device, equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN110795442B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111651123A (en) * 2020-06-02 2020-09-11 苏宁云计算有限公司 Processing method, device and equipment for concurrent IO (input/output) requests
CN112333093A (en) * 2020-11-23 2021-02-05 迈普通信技术股份有限公司 Policy routing path determining method and device, network equipment and readable storage medium
US11726764B2 (en) 2020-11-11 2023-08-15 Nutanix, Inc. Upgrade systems for service domains
US11736585B2 (en) 2021-02-26 2023-08-22 Nutanix, Inc. Generic proxy endpoints using protocol tunnels including life cycle management and examples for distributed cloud native services and applications

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103902632A (en) * 2012-12-31 2014-07-02 华为技术有限公司 File system building method and device in key-value storage system, and electronic device
CN105897942A (en) * 2015-09-17 2016-08-24 乐视云计算有限公司 Domain name resolution system and domain name resolution method
CN106790660A (en) * 2017-01-18 2017-05-31 咪咕视讯科技有限公司 A kind of dispositions method and device for realizing distributed memory system
US20180239559A1 (en) * 2017-02-23 2018-08-23 Arrikto Inc. Multi-platform data storage system supporting containers of virtual storage resources
CN108924215A (en) * 2018-06-28 2018-11-30 北京顺丰同城科技有限公司 A kind of service discovery processing method and processing device based on tree structure
US20190065258A1 (en) * 2017-08-30 2019-02-28 ScalArc Inc. Automatic Provisioning of Load Balancing as Part of Database as a Service
CN109462511A (en) * 2018-12-11 2019-03-12 中科曙光国际信息产业有限公司 The method for building up and device of network

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103902632A (en) * 2012-12-31 2014-07-02 华为技术有限公司 File system building method and device in key-value storage system, and electronic device
CN105897942A (en) * 2015-09-17 2016-08-24 乐视云计算有限公司 Domain name resolution system and domain name resolution method
CN106790660A (en) * 2017-01-18 2017-05-31 咪咕视讯科技有限公司 A kind of dispositions method and device for realizing distributed memory system
US20180239559A1 (en) * 2017-02-23 2018-08-23 Arrikto Inc. Multi-platform data storage system supporting containers of virtual storage resources
US20190065258A1 (en) * 2017-08-30 2019-02-28 ScalArc Inc. Automatic Provisioning of Load Balancing as Part of Database as a Service
CN108924215A (en) * 2018-06-28 2018-11-30 北京顺丰同城科技有限公司 A kind of service discovery processing method and processing device based on tree structure
CN109462511A (en) * 2018-12-11 2019-03-12 中科曙光国际信息产业有限公司 The method for building up and device of network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
孙健波: ""PaaS云平台自动化部署和监控的设计与实现"", 《中国优秀硕士学位论文全文数据库(电子期刊)工程科技辑》 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111651123A (en) * 2020-06-02 2020-09-11 苏宁云计算有限公司 Processing method, device and equipment for concurrent IO (input/output) requests
CN111651123B (en) * 2020-06-02 2022-11-18 苏宁云计算有限公司 Processing method, device and equipment for concurrent IO (input/output) requests
US11726764B2 (en) 2020-11-11 2023-08-15 Nutanix, Inc. Upgrade systems for service domains
CN112333093A (en) * 2020-11-23 2021-02-05 迈普通信技术股份有限公司 Policy routing path determining method and device, network equipment and readable storage medium
US11736585B2 (en) 2021-02-26 2023-08-22 Nutanix, Inc. Generic proxy endpoints using protocol tunnels including life cycle management and examples for distributed cloud native services and applications

Also Published As

Publication number Publication date
CN110795442B (en) 2022-04-22

Similar Documents

Publication Publication Date Title
CN110795442B (en) Key value updating method, device, equipment and readable storage medium
EP3419247B1 (en) Method and device for storage resource allocation for video cloud storage
CN108881512B (en) CTDB virtual IP balance distribution method, device, equipment and medium
CN107872402B (en) Global flow scheduling method and device and electronic equipment
CN109302498B (en) Network resource access method and device
CN108259629B (en) Virtual internet protocol address switching method and device
JP6248560B2 (en) Management program, management method, and management apparatus
US8635319B1 (en) Operational status of network nodes
CN105915650B (en) Load-balancing method and device
US20100161852A1 (en) Data storage network management method, computer program and server
JP2011175357A5 (en) Management device and management program
CN107463342B (en) CDN edge node file storage method and device
US10802716B2 (en) Hard disk management method, system, electronic device, and storage medium
CN111562884B (en) Data storage method and device and electronic equipment
CN111399761B (en) Storage resource allocation method, device and equipment, and storage medium
CN103823727B (en) A kind of backup method of live recording and device
CA2624273C (en) Next site for distributed service connections
US10536394B2 (en) Resource allocation
JP2008268994A (en) Computer system, load dispersion method and management computer
CN111905362A (en) Game guild loading method and server
JP4743904B2 (en) Resource over-distribution prevention system
CN108769123B (en) Data system and data processing method
CN110704244B (en) Disk offline processing method, device and equipment and readable storage medium
WO2015196769A1 (en) Method for processing data in iptv system, and network element device
CN112532448A (en) Network topology processing method and device and electronic equipment

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