WO2019200714A1

WO2019200714A1 - Server connection method, computer readable storage medium, terminal device, and apparatus

Info

Publication number: WO2019200714A1
Application number: PCT/CN2018/093342
Authority: WO
Inventors: 王丽
Original assignee: 平安科技（深圳）有限公司
Priority date: 2018-04-17
Filing date: 2018-06-28
Publication date: 2019-10-24
Also published as: CN108769111B; CN108769111A

Abstract

The present application relates to the technical field of computers, and in particular, to a server connection method, a computer readable storage medium, a terminal device, and an apparatus. The method in embodiments of the present application comprises: obtaining an identification of a terminal device; performing hash operation on the identification by using a first preset hash function to obtain a hash value of the terminal device; mapping the hash value of the terminal device onto a first node of a hash ring; obtaining reference nodes on the hash ring; searching for the reference nodes clockwise or counterclockwise from the first node, and determining a server corresponding to the first searched reference node to be a preferred server; and establishing a communication connection between the terminal device and the preferred server. A waste of server resources is reduced and the probability of message retransmission is significantly reduced.

Description

Server connection method, computer readable storage medium, terminal device and device

This application claims priority to Chinese Patent Application No. 201810341964.0, entitled "A Server Connection Method, Computer Readable Storage Media, and Terminal Equipment", filed on April 17, 2018, the entire contents of which are incorporated herein by reference. This is incorporated herein by reference.

Technical field

The present application belongs to the field of computer technologies, and in particular, to a server connection method, a computer readable storage medium, a terminal device, and a device.

Background technique

The basics of message push need to maintain a long connection between the user's terminal device and the server. As the number of user terminals increases, the long connection server also needs to be scaled horizontally at any time. Currently, a long connection is established by the user's terminal device randomly requesting a server to maintain a long connection. In this case, when the message is pushed, the message needs to be distributed to each server, and the server that keeps the long connection is pushed to the user's terminal device, which not only causes waste of server resources, but also increases the probability of message retransmission. .

technical problem

In view of this, the embodiment of the present application provides a server connection method, a computer readable storage medium, a terminal device, and a device, to solve a waste of server resources caused by a user terminal device randomly requesting a server to maintain a long connection. The problem of increased chances of resending messages.

Technical solution

A first aspect of the embodiment of the present application provides a server connection method, which may include:

Obtaining the identity of the terminal device;

And performing a hash operation on the identifier by using a preset first hash function to obtain a hash value of the terminal device;

Mapping the hash value of the terminal device to the first node of the hash ring, where the hash ring is connected clockwise or counterclockwise in order from all the functions of the first hash function in ascending order a ring formed by each node is a function value constituting the hash ring, and the first node is any one of the nodes on the hash ring;

Obtaining each reference node on the hash ring, where each reference node is a node corresponding to one server on the hash ring;

Searching the reference node clockwise or counterclockwise from the first node, and determining the server corresponding to the first reference node that is found as a preferred server;

Establishing a communication connection between the terminal device and the preferred server.

A second aspect of embodiments of the present application provides a computer readable storage medium storing computer readable instructions, the steps of implementing the server connection method when executed by a processor .

A third aspect of an embodiment of the present application provides a server connection terminal device including a memory, a processor, and computer readable instructions stored in the memory and executable on the processor, the processor executing the The steps of the above server connection method are implemented when the computer readable instructions are described.

A fourth aspect of the embodiments of the present application provides a server connection apparatus, which may include a module for implementing the steps of the server connection method described above.

Beneficial effect

Compared with the prior art, the embodiment of the present application has the beneficial effects that: the embodiment of the present application is configured by sequentially connecting all the function values of the first hash function in a clockwise or counterclockwise sequence from small to large. The hash ring maps the server and the terminal device to the hash ring, establishes the spatial correspondence between the server and the terminal device, and determines the corresponding device corresponding to the terminal device by clockwise or counterclockwise searching. Preferably, the probability that the collision occurs due to the hash operation is almost negligible, so the preferred server determined in this way can be regarded as unique, thereby reducing the waste of server resources and greatly reducing the probability of message retransmission. .

DRAWINGS

FIG. 1 is a flowchart of an embodiment of a server connection method according to an embodiment of the present application;

2 is a schematic diagram of a hash ring;

3 is a schematic diagram of a hash value of a terminal device mapped to a node of a hash ring;

4 is a schematic diagram of a hash value of a server mapped to a node of a hash ring;

5 is another schematic diagram of a node whose hash value is mapped to a hash ring;

FIG. 6 is a schematic block diagram of a server connection apparatus according to an embodiment of the present application.

FIG. 7 is a schematic block diagram of a server connection terminal device according to an embodiment of the present application.

Embodiments of the invention

Referring to FIG. 1, an embodiment of a server connection method in an embodiment of the present application may include:

Step S101: Acquire an identity identifier of the terminal device.

The identity of the terminal device may refer to the International Mobile Equipment Identity (IMEI) of the terminal, and the international mobile device identity code is an electronic serial number consisting of 15 digits, which corresponds to each terminal device one by one. And the code is the only one in the world. Each terminal device will be assigned a globally unique number after assembly, and this number will be recorded by the manufacturer of the manufacturing from production to delivery.

Step S102: Perform a hash operation on the identity identifier by using a preset first hash function to obtain a hash value of the terminal device.

All hash functions have one of the following basic properties: If the two hash values are not identical (based on the same hash function), the original input of the two hash values is also different. This feature gives the hash function a deterministic result. On the other hand, the input and output of the hash function are not unique. If the two hash values are the same, the two input values are likely to be the same, but they may be different. This case is called a "hash collision." "This is usually two different input values, deliberately calculating the same output value." However, for the hash function commonly used in the prior art, the probability of collision is extremely low, almost negligible, inputting some data to calculate a hash value, and then partially changing the input value, a hash with strong confusion characteristics. The function produces a completely different hash value.

The first hash function in this embodiment may include, but is not limited to, a hash function commonly used in the prior art such as MD4, MD5, and SHA1.

The identifiers of the obtained terminal devices are respectively represented as: IMEI ₁ , IMEI ₂ , IMEI ₃ , . . . , IMEI _m , . . . , IMEI _M , where IMEI _m is the identity of the mth terminal device, 1≤ m ≤ M, M is the total number of terminal devices.

Then, calculate the hash value of each terminal device:

Key _m =HashFunc1(IMEI _m )

Among them, HashFunc1 is the first hash function, and Key _m is the hash value of the mth terminal device.

Step S103: Map the hash value of the terminal device to the first node of the hash ring.

The hash ring is a ring formed by sequentially connecting all the function values of the first hash function in a clockwise or counterclockwise order from small to large, and each node is a one constituting the hash ring. The function value, if the value range of the first hash function is [0, N], and is arranged in a clockwise order, may constitute a hash ring as shown in FIG. 2.

The first node is any one of the nodes on the hash ring, and the value is a hash value of the terminal device. FIG. 3 shows a case where the hash values of the four terminal devices are respectively mapped to the nodes of the hash ring.

Step S104: Acquire each reference node on the hash ring.

Each of the reference nodes is a node corresponding to one server on the hash ring. The setting process of the reference node includes:

Obtaining the identity of each server, hashing the identity of each server by using a preset second hash function, obtaining a hash value of each server, and mapping the hash value of each server to the hash ring Above, each of the reference nodes is obtained.

The identifier of the server may be an IP address of the server, and the identifiers of the obtained servers are respectively represented as: IP ₁ , IP ₂ , IP ₃ , . . . , IP _m′ , . . . , IP _M′ , where IP _m' is the identity of the mth server, 1 ≤ m' ≤ M', and M' is the total number of servers.

Use the following formula to calculate the hash value for each server:

Key'_m' =HashFunc2(IP _m' )

Where HashFunc2 is the second hash function, and Key'_m' is the hash value of the mth server. It is particularly noted that the value range of the second hash function and the first hash function are The values are consistent, so that both can be mapped to the same hash ring.

Figure 4 shows the case where the hash values of the seven servers are mapped to the nodes of the hash ring, respectively, Key' ₁ , Key' ₂ , Key' ₃ , Key' ₄ , Key' ₅ , Key' ₆ , Key' The node corresponding to ₇ is the reference node.

Step S105: Find the reference node clockwise or counterclockwise from the first node, and determine the server corresponding to the first reference node that is found as a preferred server.

In FIG. 4, the corresponding IMEI ₁ Key _1, for example, from its corresponding node, i.e. the node starts to find the reference node clockwise, to find the first reference node Key _'1, The server with the address IP ₁ is determined as the preferred server of the IMEI ₁ . Using the same method, it can be determined that the server whose address is IP ₃ is determined to be the preferred server of IMEI ₂ , the server whose address is IP ₄ is determined to be the preferred server of IMEI ₃ , and the server whose address is IP ₆ is determined to be the preferred server of IMEI ₄ .

Similarly, if the counterclockwise search method is adopted, it may be determined that the server whose address is IP ₇ is determined to be the preferred server of IMEI ₁ , the server whose address is IP ₂ is determined to be the preferred server of IMEI ₂ , and the server whose address is IP ₃ is determined as The preferred server of the IMEI _{3 and} the server of the IP ₅ are determined as the preferred servers of the IMEI ₄ .

Step S106: Establish a communication connection between the terminal device and the preferred server.

After the communication connection between the two is established, it is not necessary to distribute the message to each server when pushing the message, but only the message is sent to the preferred server of the target terminal device, and the message is pushed by the preferred server to the target terminal device. , thereby reducing the waste of server resources, and greatly reducing the probability of message retransmission.

Further, considering that the processing capabilities of different servers are different, the number of different mapping locations may be set for different servers according to the processing capability of the server. For example, the server processing power from high to low is: server 1, server 2, server 3. Then, the mapping position of the server 1 is set to three, the mapping position of the server 2 is set to two, and the mapping position of the server 1 is set to one. Specifically, the IP address IP _{1 of the} server 1 is expanded to three virtual IPs: IP _{1_1} , IP _{1_2} , IP _{1_3} , and the IP address IP _{2 of the} server 2 is expanded to two virtual IPs: IP _{2_1} , IP _{2_2} , IP _{1_3} The IP address IP _{3 of the} server 3 is kept unchanged, and the corresponding node of each IP hash value on the hash ring is as shown in FIG. 5 .

According to this idea, the reference node in step S104 can also be set by the following process:

First, get the identity of each server.

Then, calculate the extended identity of each server according to the following formula:

Ext_ServerIDm, n=ExtFunc(ServerIDm,n)

Where m is the serial number of the server, 1≤m≤M, M is the total number of servers, ServerIDm is the identity of the mth server, n is the serial number of the extended identity, and the extended identity can be the aforementioned virtual IP , 1≤n≤Nm, Nm is the total number of extended identity identifiers of the mth server, Nm is positively correlated with the frequency of the central processor of the mth server, and is positively correlated with the memory capacity of the mth server, that is, the central The higher the main frequency of the processor and the larger the memory capacity, the larger the total number of extended identities. Conversely, the lower the main frequency of the central processing unit and the smaller the memory capacity, the smaller the total number of extended identities. . ExtFunc is a preset function. In one of the implementations, ExtFunc(ServerIDm,n)=ServerIDm∪.n, that is, add a .n suffix after ServerIDm. If ServerIDm=120.132.55.7, then ExtFunc(ServerIDm, 1) = 120.132.55.7.1, Ext_ServerIDm, where n is the nth extended identity of the mth server;

Then, using the preset second hash function, respectively hashing the extended identity of each server to obtain a hash value of each server, and the value range of the second hash function and the first hash function The values are consistent.

Finally, the hash values of the respective servers are mapped onto the hash ring to obtain each of the reference nodes.

At this time, it should be noted that the servers corresponding to the three virtual IP nodes of the server 1 in FIG. 5 are both the server 1, and the servers corresponding to the two virtual IP nodes of the server 2 are the servers 2.

Further, a setting method of the second hash function may include:

A hash function is arbitrarily selected from the preset hash function set as a candidate function, and the hash function set includes more than one hash function.

The candidate function is used to hash the extended identity of each server to obtain a hash value of each server.

Construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt ₁ , hashvt ₂ , ..., hashvt _tn , ..., hashvt _TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and

Hashvt _tn ∈HashValueSetT, and hashvt _tn ≤hashvt _tn+1 , HashValueSetT is a collection of hash values from each server.

The uniformity of the candidate function is calculated according to the following formula:

Where HashMax is the maximum function value of the candidate function, and EvenDeg is the uniformity of the candidate function.

If the uniformity of the candidate function is greater than a preset uniformity threshold, deleting the candidate function from the hash function set, and then returning to perform the arbitrarily selecting one of the preset hash function sets. The step of the Greek function as a candidate function;

If the uniformity of the candidate function is less than or equal to a preset uniformity threshold, the candidate function is determined as a second hash function.

Further, another setting method of the second hash function may include:

Construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt ₁ , hashvt ₂ , ..., hashvt _tn , ..., hashvt _TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and

Hashvt _tn ∈HashValueSetT, and hashvt _tn ≤hashvt _tn+1 , HashValueSetT is a set of hash values from each server, hashv _m,n ∈HashValueSet _m , and hashv _m,n ≤hashv _m,n+1 ,HashValueSet _m A collection consisting of the hash values of the mth server.

Where HashMax is the maximum function value of the candidate function, η is a preset proportional coefficient, and EvenDeg is the uniformity of the candidate function.

In summary, the embodiment of the present application sets a hash ring formed by sequentially connecting all the function values of the first hash function in a clockwise or counterclockwise order from small to large, and the server and the terminal device are both Mapping to the hash ring, establishing a spatial correspondence between the server and the terminal device, and determining the preferred server corresponding to the terminal device by clockwise or counterclockwise searching, the probability of collision due to hash operation It is almost negligible, so the preferred server determined in this way can be regarded as unique, which reduces the waste of server resources and greatly reduces the chance of message retransmission.

Corresponding to a server connection method described in the foregoing embodiment, FIG. 6 is a structural diagram of an embodiment of a server connection apparatus according to an embodiment of the present application.

In this embodiment, a server connection device may include:

The terminal identifier obtaining module 601 is configured to acquire an identity identifier of the terminal device.

The first hash operation module 602 is configured to perform hash operation on the identity identifier by using a preset first hash function to obtain a hash value of the terminal device.

a first mapping module 603, configured to map a hash value of the terminal device to a first node of a hash ring, where the hash ring is a function of all functions of the first hash function from small to large Arranging the formed rings sequentially in a clockwise or counterclockwise manner, each node is a function value constituting the hash ring, and the first node is any one of the nodes on the hash ring;

a reference node obtaining module 604, configured to acquire each reference node on the hash ring, where each reference node is a node corresponding to one server on the hash ring;

a server determining module 605, configured to search the reference node clockwise or counterclockwise from the first node, and determine a server corresponding to the first reference node that is found as a preferred server;

The communication connection establishing module 606 is configured to establish a communication connection between the terminal device and the preferred server.

Optionally, the server connection device may further include:

a server identifier obtaining module, configured to acquire an identity of each server;

a second hash operation module, configured to hash the identity of each server by using a preset second hash function, to obtain a hash value of each server, and a value field of the second hash function The value range of the first hash function is consistent;

And a second mapping module, configured to map hash values of the respective servers to the hash ring to obtain each of the reference nodes.

Optionally, the server connection device may further include:

An identity extension module for calculating an extended identity of each server according to the following formula:

Ext_ServerIDm, n=ExtFunc(ServerIDm,n)

Where m is the serial number of the server, 1≤m≤M, M is the total number of servers, ServerIDm is the identity of the mth server, n is the serial number of the extended identity, 1≤n≤Nm, and Nm is the mth server The total number of extended identities, Nm is positively correlated with the frequency of the central processor of the mth server, and is positively related to the memory capacity of the mth server, ExtFunc is the default function, Ext_ServerIDm, n is the mth server The nth extended identity.

Optionally, the server connection device may further include:

a candidate function selection module, configured to arbitrarily select one hash function from the preset hash function set as a candidate function, the hash function set includes one or more hash functions;

a hash operation module, configured to hash the extended identity of each server by using the candidate function, to obtain a hash value of each server;

The first sequence construction module is configured to construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt ₁ , hashvt ₂ , ..., hashvt _tn , ..., hashvt _TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and

Hashvt _tn ∈HashValueSetT, and hashvt _tn ≤hashvt _tn+1 , HashValueSetT is a set consisting of hash values of the respective servers;

a first uniformity calculation module, configured to calculate a uniformity of the candidate function according to the following formula:

Where HashMax is the maximum function value of the candidate function, and EvenDeg is the uniformity of the candidate function;

a candidate function deleting module, configured to delete the candidate function from the hash function set if a uniformity of the candidate function is greater than a preset uniformity threshold;

The function determining module is configured to determine the candidate function as the second hash function if the uniformity of the candidate function is less than or equal to a preset uniformity threshold.

Optionally, the server connection device may further include:

The second sequence construction module is configured to construct each hash value sequence according to the following formula:

HashArrayT=(hashvt ₁ , hashvt ₂ , ..., hashvt _tn , ..., hashvt _TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and

Hashvt _tn ∈HashValueSetT, and hashvt _tn ≤hashvt _tn+1 , HashValueSetT is a set of hash values from each server, hashv _m,n ∈HashValueSet _m , and hashv _m,n ≤hashv _m,n+1 ,HashValueSet _m a collection consisting of the hash values of the mth server;

a second uniformity calculation module, configured to calculate a uniformity of the candidate function according to the following formula:

FIG. 7 is a schematic block diagram of a server connection terminal device provided by an embodiment of the present application. For convenience of description, only parts related to the embodiment of the present application are shown.

In this embodiment, the server connection terminal device 7 may be a computing device such as a desktop computer, a notebook, a palmtop computer, and a cloud server. The server connection terminal device 7 may include a processor 70, a memory 71, and computer readable instructions 72 stored in the memory 71 and operable on the processor 70, such as a computer executing the server connection method described above. Read the instruction. When the processor 70 executes the computer readable instructions 72, the steps in the above embodiments of the respective server connection methods are implemented.

The functional units in the various embodiments of the present application may be stored in a computer readable storage medium if implemented in the form of a software functional unit and sold or used as a separate product. Based on such understanding, the technical solution of the present application, in essence or the contribution to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium. A number of computer readable instructions are included to cause a computer device to perform all or part of the steps of the methods described in various embodiments of the present application.

Claims

A server connection method, comprising:

Obtaining the identity of the terminal device;

And performing a hash operation on the identifier by using a preset first hash function to obtain a hash value of the terminal device;

Mapping the hash value of the terminal device to the first node of the hash ring, where the hash ring is connected clockwise or counterclockwise in order from all the functions of the first hash function in ascending order a ring formed by each node is a function value constituting the hash ring, and the first node is any one of the nodes on the hash ring;

Obtaining each reference node on the hash ring, where each reference node is a node corresponding to one server on the hash ring;

Searching the reference node clockwise or counterclockwise from the first node, and determining the server corresponding to the first reference node that is found as a preferred server;

Establishing a communication connection between the terminal device and the preferred server.
The server connection method according to claim 1, wherein the setting process of the reference node comprises:

Obtain the identity of each server;

Performing a hash operation on the identifiers of the respective servers by using a preset second hash function to obtain a hash value of each server, a value range of the second hash function and a value range of the first hash function Consistent

Mapping the hash values of the respective servers onto the hash ring to obtain each of the reference nodes.
The server connection method according to claim 1, wherein the setting process of the reference node comprises:

Obtain the identity of each server;

Calculate the extended identity of each server according to the following formula:

Ext_ServerIDm, n=ExtFunc(ServerIDm,n)

Where m is the serial number of the server, 1≤m≤M, M is the total number of servers, ServerIDm is the identity of the mth server, n is the serial number of the extended identity, 1≤n≤Nm, and Nm is the mth server The total number of extended identities, Nm is positively correlated with the frequency of the central processor of the mth server, and is positively related to the memory capacity of the mth server, ExtFunc is the default function, Ext_ServerIDm, n is the mth server The nth extended identity;

Performing a hash operation on the extended identity of each server by using a preset second hash function to obtain a hash value of each server, a value range of the second hash function and a value of the first hash function Domain consistent;

Mapping the hash values of the respective servers onto the hash ring to obtain each of the reference nodes.
The server connection method according to claim 3, wherein the setting process of the second hash function comprises:

Arbitrarily selecting a hash function as a candidate function from a preset set of hash functions, the hash function set including more than one hash function;

Using the candidate function, respectively hashing the extended identity of each server to obtain a hash value of each server;

Construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt 1 , hashvt 2 , ..., hashvt tn , ..., hashvt TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and
Hashvt tn ∈HashValueSetT, and hashvt tn ≤hashvt tn+1 , HashValueSetT is a set consisting of hash values of the respective servers;

The uniformity of the candidate function is calculated according to the following formula:

Where HashMax is the maximum function value of the candidate function, and EvenDeg is the uniformity of the candidate function;

If the uniformity of the candidate function is greater than a preset uniformity threshold, deleting the candidate function from the hash function set, and then returning to perform the arbitrarily selecting one of the preset hash function sets. The step of the Greek function as a candidate function;

If the uniformity of the candidate function is less than or equal to a preset uniformity threshold, the candidate function is determined as a second hash function.
The server connection method according to claim 3, wherein the setting process of the second hash function comprises:

Arbitrarily selecting a hash function as a candidate function from a preset set of hash functions, the hash function set including more than one hash function;

Using the candidate function, respectively hashing the extended identity of each server to obtain a hash value of each server;

Construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt 1 , hashvt 2 , ..., hashvt tn , ..., hashvt TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and
Hashvt tn ∈HashValueSetT, and hashvt tn ≤hashvt tn+1 , HashValueSetT is a set of hash values from each server, hashv m,n ∈HashValueSet m , and hashv m,n ≤hashv m,n+1 ,HashValueSet m a collection consisting of the hash values of the mth server;

The uniformity of the candidate function is calculated according to the following formula:

Where HashMax is the maximum function value of the candidate function, η is a preset proportional coefficient, and EvenDeg is the uniformity of the candidate function;

If the uniformity of the candidate function is greater than a preset uniformity threshold, deleting the candidate function from the hash function set, and then returning to perform the arbitrarily selecting one of the preset hash function sets. The step of the Greek function as a candidate function;

If the uniformity of the candidate function is less than or equal to a preset uniformity threshold, the candidate function is determined as a second hash function.
A computer readable storage medium storing computer readable instructions, wherein the computer readable instructions, when executed by a processor, implement the following steps:

Obtaining the identity of the terminal device;

And performing a hash operation on the identifier by using a preset first hash function to obtain a hash value of the terminal device;

Mapping the hash value of the terminal device to the first node of the hash ring, where the hash ring is connected clockwise or counterclockwise in order from all the functions of the first hash function in ascending order a ring formed by each node is a function value constituting the hash ring, and the first node is any one of the nodes on the hash ring;

Obtaining each reference node on the hash ring, where each reference node is a node corresponding to one server on the hash ring;

Searching the reference node clockwise or counterclockwise from the first node, and determining the server corresponding to the first reference node that is found as a preferred server;

Establishing a communication connection between the terminal device and the preferred server.
The computer readable storage medium according to claim 6, wherein the setting process of the reference node comprises:

Obtain the identity of each server;

Performing a hash operation on the identifiers of the respective servers by using a preset second hash function to obtain a hash value of each server, a value range of the second hash function and a value range of the first hash function Consistent

Mapping the hash values of the respective servers onto the hash ring to obtain each of the reference nodes.
The computer readable storage medium according to claim 6, wherein the setting process of the reference node comprises:

Obtain the identity of each server;

Calculate the extended identity of each server according to the following formula:

Ext_ServerIDm, n=ExtFunc(ServerIDm,n)

Where m is the serial number of the server, 1≤m≤M, M is the total number of servers, ServerIDm is the identity of the mth server, n is the serial number of the extended identity, 1≤n≤Nm, and Nm is the mth server The total number of extended identities, Nm is positively correlated with the frequency of the central processor of the mth server, and is positively related to the memory capacity of the mth server, ExtFunc is the default function, Ext_ServerIDm, n is the mth server The nth extended identity;

Performing a hash operation on the extended identity of each server by using a preset second hash function to obtain a hash value of each server, a value range of the second hash function and a value of the first hash function Domain consistent;

Mapping the hash values of the respective servers onto the hash ring to obtain each of the reference nodes.
The computer readable storage medium according to claim 8, wherein the setting process of the second hash function comprises:

Arbitrarily selecting a hash function as a candidate function from a preset set of hash functions, the hash function set including more than one hash function;

Using the candidate function, respectively hashing the extended identity of each server to obtain a hash value of each server;

Construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt 1 , hashvt 2 , ..., hashvt tn , ..., hashvt TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and
Hashvt tn ∈HashValueSetT, and hashvt tn ≤hashvt tn+1 , HashValueSetT is a set consisting of hash values of the respective servers;

The uniformity of the candidate function is calculated according to the following formula:

Where HashMax is the maximum function value of the candidate function, and EvenDeg is the uniformity of the candidate function;

If the uniformity of the candidate function is greater than a preset uniformity threshold, deleting the candidate function from the hash function set, and then returning to perform the arbitrarily selecting one of the preset hash function sets. The step of the Greek function as a candidate function;

If the uniformity of the candidate function is less than or equal to a preset uniformity threshold, the candidate function is determined as a second hash function.
The computer readable storage medium according to claim 8, wherein the setting process of the second hash function comprises:

Arbitrarily selecting a hash function as a candidate function from a preset set of hash functions, the hash function set including more than one hash function;

Using the candidate function, respectively hashing the extended identity of each server to obtain a hash value of each server;

Construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt 1 , hashvt 2 , ..., hashvt tn , ..., hashvt TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and
Hashvt tn ∈HashValueSetT, and hashvt tn ≤hashvt tn+1 , HashValueSetT is a set of hash values from each server, hashv m,n ∈HashValueSet m , and hashv m,n ≤hashv m,n+1 ,HashValueSet m a collection consisting of the hash values of the mth server;

The uniformity of the candidate function is calculated according to the following formula:

Where HashMax is the maximum function value of the candidate function, η is a preset proportional coefficient, and EvenDeg is the uniformity of the candidate function;

If the uniformity of the candidate function is greater than a preset uniformity threshold, deleting the candidate function from the hash function set, and then returning to perform the arbitrarily selecting one of the preset hash function sets. The step of the Greek function as a candidate function;

If the uniformity of the candidate function is less than or equal to a preset uniformity threshold, the candidate function is determined as a second hash function.
A server connection terminal device comprising a memory, a processor, and computer readable instructions stored in the memory and operable on the processor, wherein when the processor executes the computer readable instructions Implement the following steps:

Obtaining the identity of the terminal device;

And performing a hash operation on the identifier by using a preset first hash function to obtain a hash value of the terminal device;

Mapping the hash value of the terminal device to the first node of the hash ring, where the hash ring is connected clockwise or counterclockwise in order from all the functions of the first hash function in ascending order a ring formed by each node is a function value constituting the hash ring, and the first node is any one of the nodes on the hash ring;

Obtaining each reference node on the hash ring, where each reference node is a node corresponding to one server on the hash ring;

Searching the reference node clockwise or counterclockwise from the first node, and determining the server corresponding to the first reference node that is found as a preferred server;

Establishing a communication connection between the terminal device and the preferred server.
The server connection terminal device according to claim 11, wherein the setting process of the reference node comprises:

Obtain the identity of each server;

Performing a hash operation on the identifiers of the respective servers by using a preset second hash function to obtain a hash value of each server, a value range of the second hash function and a value range of the first hash function Consistent

Mapping the hash values of the respective servers onto the hash ring to obtain each of the reference nodes.
The server connection terminal device according to claim 12, wherein the setting process of the reference node comprises:

Obtain the identity of each server;

Calculate the extended identity of each server according to the following formula:

Ext_ServerIDm, n=ExtFunc(ServerIDm,n)

Where m is the serial number of the server, 1≤m≤M, M is the total number of servers, ServerIDm is the identity of the mth server, n is the serial number of the extended identity, 1≤n≤Nm, and Nm is the mth server The total number of extended identities, Nm is positively correlated with the frequency of the central processor of the mth server, and is positively related to the memory capacity of the mth server, ExtFunc is the default function, Ext_ServerIDm, n is the mth server The nth extended identity;

Performing a hash operation on the extended identity of each server by using a preset second hash function to obtain a hash value of each server, a value range of the second hash function and a value of the first hash function Domain consistent;

Mapping the hash values of the respective servers onto the hash ring to obtain each of the reference nodes.
The server connection terminal device according to claim 13, wherein the setting process of the second hash function comprises:

Arbitrarily selecting a hash function as a candidate function from a preset set of hash functions, the hash function set including more than one hash function;

Using the candidate function, respectively hashing the extended identity of each server to obtain a hash value of each server;

Construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt 1 , hashvt 2 , ..., hashvt tn , ..., hashvt TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and
Hashvt tn ∈HashValueSetT, and hashvt tn ≤hashvt tn+1 , HashValueSetT is a set consisting of hash values of the respective servers;

The uniformity of the candidate function is calculated according to the following formula:

Where HashMax is the maximum function value of the candidate function, and EvenDeg is the uniformity of the candidate function;

If the uniformity of the candidate function is greater than a preset uniformity threshold, deleting the candidate function from the hash function set, and then returning to perform the arbitrarily selecting one of the preset hash function sets. The step of the Greek function as a candidate function;

If the uniformity of the candidate function is less than or equal to a preset uniformity threshold, the candidate function is determined as a second hash function.
The server connection terminal device according to claim 13, wherein the setting process of the second hash function comprises:

Arbitrarily selecting a hash function as a candidate function from a preset set of hash functions, the hash function set including more than one hash function;

Using the candidate function, respectively hashing the extended identity of each server to obtain a hash value of each server;

Construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt 1 , hashvt 2 , ..., hashvt tn , ..., hashvt TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and
Hashvt tn ∈HashValueSetT, and hashvt tn ≤hashvt tn+1 , HashValueSetT is a set of hash values from each server, hashv m,n ∈HashValueSet m , and hashv m,n ≤hashv m,n+1 ,HashValueSet m a collection consisting of the hash values of the mth server;

The uniformity of the candidate function is calculated according to the following formula:

Where HashMax is the maximum function value of the candidate function, η is a preset proportional coefficient, and EvenDeg is the uniformity of the candidate function;

If the uniformity of the candidate function is greater than a preset uniformity threshold, deleting the candidate function from the hash function set, and then returning to perform the arbitrarily selecting one of the preset hash function sets. The step of the Greek function as a candidate function;

If the uniformity of the candidate function is less than or equal to a preset uniformity threshold, the candidate function is determined as a second hash function.
A server connection device, comprising:

a terminal identifier obtaining module, configured to acquire an identity identifier of the terminal device;

a first hash operation module, configured to perform a hash operation on the identity identifier by using a preset first hash function, to obtain a hash value of the terminal device;

a first mapping module, configured to map a hash value of the terminal device to a first node of a hash ring, where the hash ring is in a descending order of all function values of the first hash function Connecting the formed ring in a clockwise or counterclockwise manner, each node is a function value constituting the hash ring, and the first node is any one of the nodes on the hash ring;

a reference node obtaining module, configured to acquire each reference node on the hash ring, where each reference node is a node corresponding to one server on the hash ring;

a server determining module, configured to search the reference node clockwise or counterclockwise from the first node, and determine a server corresponding to the first reference node that is found as a preferred server;

And a communication connection establishing module, configured to establish a communication connection between the terminal device and the preferred server.
The server connection device according to claim 16, further comprising:

a server identifier obtaining module, configured to acquire an identity of each server;

a second hash operation module, configured to hash the identity of each server by using a preset second hash function, to obtain a hash value of each server, and a value field of the second hash function The value range of the first hash function is consistent;

And a second mapping module, configured to map hash values of the respective servers to the hash ring to obtain each of the reference nodes.
The server connection device according to claim 16, further comprising:

An identity extension module for calculating an extended identity of each server according to the following formula:

Ext_ServerIDm, n=ExtFunc(ServerIDm,n)

Where m is the serial number of the server, 1≤m≤M, M is the total number of servers, ServerIDm is the identity of the mth server, n is the serial number of the extended identity, 1≤n≤Nm, and Nm is the mth server The total number of extended identities, Nm is positively correlated with the frequency of the central processor of the mth server, and is positively related to the memory capacity of the mth server, ExtFunc is the default function, Ext_ServerIDm, n is the mth server The nth extended identity.
The server connection device according to claim 18, further comprising:

a candidate function selection module, configured to arbitrarily select one hash function from the preset hash function set as a candidate function, the hash function set includes one or more hash functions;

a hash operation module, configured to hash the extended identity of each server by using the candidate function, to obtain a hash value of each server;

The first sequence construction module is configured to construct a sequence of hash values according to the following formula:

HashArrayT=(hashvt 1 , hashvt 2 , ..., hashvt tn , ..., hashvt TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and
Hashvt tn ∈HashValueSetT, and hashvt tn ≤hashvt tn+1 , HashValueSetT is a set consisting of hash values of the respective servers;

a first uniformity calculation module, configured to calculate a uniformity of the candidate function according to the following formula:

Where HashMax is the maximum function value of the candidate function, and EvenDeg is the uniformity of the candidate function;

a candidate function deleting module, configured to delete the candidate function from the hash function set if a uniformity of the candidate function is greater than a preset uniformity threshold;

The function determining module is configured to determine the candidate function as the second hash function if the uniformity of the candidate function is less than or equal to a preset uniformity threshold.
The server connection device according to claim 18, further comprising:

The second sequence construction module is configured to construct each hash value sequence according to the following formula:

HashArrayT=(hashvt 1 , hashvt 2 , ..., hashvt tn , ..., hashvt TN )

Where 1≤tn≤TN, TN is the total number of hash values of each server, and
Hashvt tn ∈HashValueSetT, and hashvt tn ≤hashvt tn+1 , HashValueSetT is a set of hash values from each server, hashv m,n ∈HashValueSet m , and hashv m,n ≤hashv m,n+1 ,HashValueSet m a collection consisting of the hash values of the mth server;

a second uniformity calculation module, configured to calculate a uniformity of the candidate function according to the following formula:

Where HashMax is the maximum function value of the candidate function, η is a preset proportional coefficient, and EvenDeg is the uniformity of the candidate function.