Method and device for updating routing information
What is AI technical title?
AI technical title is built by Patsnap AI team. It summarizes the technical point description of the patent document.
An information update and routing technology, applied in the Internet field, can solve the problem of increasing the burden of the distributed KV storage system, and achieve the effect of load distribution balance
Active Publication Date: 2016-12-07
ZHEJIANG TMALL TECH CO LTD
View PDF2 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0011] The embodiment of the present application provides a method and device for updating routing information, which is used to provide a solution for updating routing information after the storage capacity of the distributed KV storage system increases, so as to solve the problem of ensuring the load distribution of storage servers. Balanced, it is necessary to add more virtual nodes in the distributed KV storage system, which leads to the problem of increasing the burden of the distributed KV storage system
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0068] suppose as Figure 2a There are currently 12 virtual nodes n in the distributed KV storage system shown 1 ~n 12 , 2 storage server PN 1 、PN 2 . For ease of description, this state is referred to as state 1 below.
[0069] At this time, if a linear table is used to save the mapping relationship between virtual nodes and storage servers, it will be shown in Table 1 below:
[0070] Table 1:
[0071] 1
2
3
4
5
6
7
8
9
10
11
12
PN 1
PN 2
PN 1
PN 2
PN 1
PN 2
PN 1
PN 2
PN 1
PN 2
PN 1
PN 2
[0072] Numbers in the first row in Table 1 represent virtual nodes n 1 ~n 12 (the number of the virtual node can also be understood as the digital identification of the virtual node) and the number in the second line represents the number of the storage server corresponding to the virtual node (the number of the storage server can also be understood as the digit...
Embodiment 2
[0095] Embodiment 2 provides a solution for determining the number of virtual nodes corresponding to a storage server. When there are N virtual nodes {n 1 ,n 2 ,n 3 ,n 4 …n N} is mapped to M storage servers {m 1 ,m 2 ,...m M}, assuming that the xth storage server m x The corresponding virtual node is {n x1 ,n x2 ,...n xy}(where, y≤Y x , Y x for the storage server m x The number of corresponding virtual nodes Y x ), then Y x The calculation formula of is shown in formula [1] mentioned above:
[0096] Y x = [ N - Σ d = 0 x - 1 Y d M + 1 - x ...
Embodiment 3
[0124] Embodiment 3 uses the same technical means as Embodiment 2 to determine the number of virtual nodes corresponding to the storage server, that is, the number is determined according to the above formula [1]. However, the difference from implementation 2 is that when a storage server is added to the distributed KV storage system, the virtual node is selected according to the virtual node selection rule different from formula [2] in embodiment 3.
[0125] For example, when the distributed KV storage system contains 12 virtual nodes and a storage server PN 1 When, PN 1 The mapping relationship with virtual nodes is shown in Table 10 below, that is, PN 1 with all virtual nodes n 1 ~n 12 Corresponding.
[0126] Table 10:
[0127] PN 1
n 1
n 2
n 3
n 4
n 5
n 6
n 7
n 8
n 9
n 10
n 11
n 12
[0128] When a storage server PN is added to the distributed KV storage system 2 After that, as shown in the formula [3]...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
PUM
Login to View More
Abstract
The invention discloses a routing information update method and device to solve the problem that more virtual nodes need to be added in a distributed KV storage system to increase the burden if the load distribution is guaranteed to be balanced. The method includes: after adding the storage server, determine the first number of the storage server and the second number of virtual nodes included; for each storage server, perform The first sequence number of the distributed storage system, the total number of virtual nodes allocated to the storage server after adding the storage server in the distributed storage system, determine the third number of virtual nodes allocated to the storage server; according to the third number and The corresponding relationship determining rule is to respectively determine the corresponding relationship between each storage server and the virtual node; and update the routing information according to the determined corresponding relationship.
Description
technical field [0001] The invention relates to the technical field of the Internet, in particular to a method and device for updating routing information. Background technique [0002] A distributed KV (Key-Value) storage system is usually composed of a client and a storage server. The function of the storage server is to store the key-value (Value, that is, data), and the function of the client is to pass certain routing algorithms (such as Ha The routing information determined by the hash algorithm) is routed to the corresponding storage server, so as to realize the access and operation of the Value corresponding to the key (Key, that is, the data identifier) (for example, the Value can be written, read, write, delete, etc.). [0003] When the storage capacity of the distributed KV storage system increases, data will migrate between storage servers. At this time, it is necessary to re-determine the corresponding relationship between the data and the storage server acco...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More