CN115840639A - Service access method, device, equipment and medium based on Hash algorithm - Google Patents

Abstract

The invention relates to the technical field of server management, and particularly discloses a service access method, a device, equipment and a medium based on a hash algorithm, wherein the method comprises the following steps: receiving a first request sent by a first client; determining a first hash value corresponding to the first request through a hash algorithm; according to the first hash value, a first server is addressed in a designated hash value interval along a preset sequence, and the designated hash value interval corresponds to the identification of each server in the server cluster one by one; and distributing the first request of the first client to the first server for processing. Through a consistent hash algorithm, a distributed system is built to solve the performance problem caused by high concurrency and centralized access, the access efficiency is improved through dynamically controlling the access of a server, and the product quality and the usability of the system are greatly improved.

Description

Service access method, device, equipment and medium based on Hash algorithm

Technical Field

The present invention relates to the technical field of server management, and in particular, to a service access method, apparatus, device, and medium based on a hash algorithm.

Background

At present, a supervision system is mostly deployed in a single server and data synchronization mode, but as the service coverage of the supervision system is continuously enlarged and the application of the supervision system is continuously deepened, the self limitation of the system is very obvious when the traditional single server mode is used for processing explosive centralized access. Since the number of connections that can be handled by a single server is limited, access speeds are becoming slower and slower for a large number of users using only one application server, and especially during peak periods of website access, the application server becomes an efficiency bottleneck for the entire website.

Disclosure of Invention

In view of this, an object of the embodiments of the present invention is to provide a service access method, a device and a readable medium based on a hash algorithm, which establish a distributed service cluster by increasing the number of servers, so that each server in the cluster shares the access and storage pressure of the original server, thereby reducing the server pressure, improving the service access efficiency, and reducing the work of service data migration as much as possible when the number of services needs to be increased or decreased in the server cluster.

One aspect of the embodiments of the present invention provides a service access method based on a hash algorithm, where the method includes:

receiving a first request sent by a first client;

determining a first hash value corresponding to the first request through a hash algorithm;

according to the first hash value, the first server is addressed in a designated hash value interval along a preset sequence, and the designated hash value interval corresponds to the identification of each server in the server cluster one by one;

and distributing the first request of the first client to the first server for processing.

Further, before receiving the first request sent by the first client, the method further includes:

and establishing a corresponding relation between each hash value in the appointed hash value interval and the identification of each server in the server cluster.

Further, after the first server is addressed according to the first hash value along the preset sequence within the designated hash value interval, the method further includes:

adding a second server in the server cluster, wherein the hash value corresponding to the second server and the hash value corresponding to the first server are arranged along a preset sequence;

and distributing the first request of the first client to the second server for processing.

Further, the server cluster comprises a third server, and the hash value corresponding to the first server and the hash value corresponding to the third server are arranged along a preset sequence;

after addressing the first server along the preset sequence within the designated hash value interval according to the first hash value, the method further comprises the following steps:

and when a first server in the server cluster is down or the first server is removed, distributing the first request of the first client to a third server for processing.

Further, establishing a corresponding relationship between each hash value in the designated hash value interval and the identifier of each server in the server cluster includes:

when the appointed subinterval of the appointed hash value interval is larger than the preset range, mapping each virtual node by each hash value in the appointed subinterval;

and establishing an incidence relation between each virtual node and each server.

Further, each virtual node comprises a first node, and the first node is associated with the first server; addressing to a first server along a preset order within a specified hash value interval according to a first hash value, comprising:

according to the first hash value, addressing to a first node along a preset sequence in a designated hash value interval;

the first request of the first client is processed at the first server based on the first node being addressed to the first server.

Further, the hash algorithm includes any one of: linear function direct addressing method, number analysis method, square taking and centering method, folding method, remainder dividing and remaining method and random function method.

In view of the foregoing, an aspect of the embodiments of the present invention provides a service access apparatus based on a hash algorithm, where the apparatus includes: a receiving module, a determining module, an addressing module and a distributing module, wherein,

the receiving module is used for receiving a first request sent by a first client;

the determining module is used for determining a first hash value corresponding to the first request through a hash algorithm;

the addressing module is used for addressing the first server along a preset sequence in an appointed hash value interval according to the first hash value, and the appointed hash value interval corresponds to the identification of each server in the server cluster one by one;

the distribution module is used for distributing the first request of the first client to the first server for processing.

In view of the above object, an aspect of the embodiments of the present invention provides a computer device, including:

at least one processor; and

a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of the method described above.

In view of the above object, an aspect of the embodiments of the present invention provides a computer-readable storage medium storing a computer program, which when executed by a processor implements the steps of the method described above.

The invention has at least the following beneficial technical effects:

in the embodiment of the invention, the distributed service cluster is established by increasing the number of the servers, each server in the cluster shares the access and storage pressure of the original server, the server pressure can be reduced, the service access efficiency is improved, and the work of service data migration is reduced as much as possible when the number of the services needs to be increased or reduced in the server cluster.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other embodiments can be obtained by using the drawings without creative efforts.

Fig. 1 is a schematic diagram of an embodiment of a service access method based on a hash algorithm according to the present invention;

fig. 2 is a schematic diagram of distribution of a server cluster on a hash ring according to the present invention;

FIG. 3 is a schematic diagram of a client request addressing server in a server cluster based on a hash algorithm according to the present invention;

FIG. 4 is a diagram illustrating a client requesting addressing of a server in a server cluster on a hash ring according to the present invention;

FIG. 5 is a diagram illustrating a client requesting addressing of a server in a server cluster on a hash ring according to the present invention;

FIG. 6 is a diagram illustrating a client requesting addressing of a server in a server cluster on a hash ring according to the present invention;

fig. 7 is a schematic diagram of distribution of a server cluster on a hash ring according to the present invention;

FIG. 8 is a diagram illustrating a client requesting addressing of a server in a server cluster over a hash ring according to the present invention;

fig. 9 is a schematic diagram of an embodiment of a service access device based on a hash algorithm according to the present invention;

FIG. 10 is a schematic diagram of an embodiment of a computer device provided by the present invention;

FIG. 11 is a schematic diagram of an embodiment of a computer-readable storage medium provided by the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.

It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it should be noted that "first" and "second" are merely for convenience of description and should not be construed as limitations of the embodiments of the present invention, and they are not described in any more detail in the following embodiments.

In view of the above, a first aspect of the embodiments of the present invention provides an embodiment of a service access method based on a hash algorithm. Fig. 1 is a schematic diagram illustrating an embodiment of a service access method based on a hash algorithm according to the present invention. As shown in fig. 1, a service access method based on a hash algorithm according to an embodiment of the present invention may include:

s100, establishing a corresponding relation between each hash value in the designated hash value interval and the identification of each server in the server cluster.

Wherein specifying a hash value interval can be understood as a range of values, such as 0 values and 2^32-1 values. The number intervals can be arranged linearly or circularly. If the hash value interval is specified as a circular arrangement, the number interval can be called a hash ring. The specific example in the embodiment of the present application takes a hash ring as an example for description.

Specifically, a hash algorithm is adopted to establish a mapping relationship between the hash value and each server in the server cluster. The hash algorithm is a mapping function that maps a key value to a location in a hash ring to access a record to speed up the lookup. This mapping function is called a hash algorithm and the array of deposited records is called a hash ring.

For example, assume that a server cluster includes server a, server B, and server C, which correspond to three values on the hash ring, i.e., three locations on the hash ring as shown in fig. 2.

The hash algorithm may include any of: linear function direct addressing method, number analysis method, square taking and centering method, folding method, remainder dividing and remaining method and random function method.

For example, the expression of the hash algorithm may be: f = Hash (orgInfo)

S101, receiving a first request sent by a first client.

The first request carries the identifier of the first client. For example, when a first client needs to access a first service, the first client may send a request for accessing the first service, where the request carries an identifier of the first client.

S102, determining a first hash value corresponding to the first request through a hash algorithm.

S103, according to the first hash value, the first server is addressed in a designated hash value interval along a preset sequence, and the designated hash value interval corresponds to the identification of each server in the server cluster one by one.

The preset sequence may be a clockwise sequence or a counterclockwise sequence. The specific example in the embodiment of the present application is described by taking a clockwise direction as an example.

For example, as shown in fig. 3, the identifier of server a is 0, the identifier of server B is 1, the request key of the enterprise client request 01 is orgInfo _01, the request key of the enterprise client request 02 is orgInfo _02, and the request key of the enterprise client request 03 is orgInfo _03.

The calculation result is 0 or 1 by Hash calculation formula (e.g. Hash (orglnfo _ 01)% 2). When the calculation result is 0, server a identified as 0 is addressed. When the result of the calculation is 1, server B identified as 1 is addressed. Accordingly, based on the hash ring shown in FIG. 2, as shown in FIG. 4, enterprise client request 01 is addressed to server A, identified as 0, and enterprise client request 02 is addressed to server B, identified as 1.

And S104, distributing the first request of the first client to the first server for processing.

Following the example above, when the computation result is 0, server a identified as 0 is addressed, and the request from key _01 is processed in server a. When the result of the calculation is 1, server B identified as 1 is addressed, and the request from key _01 is processed in server B.

In the embodiment of the application, a distributed system is built by using unit information as a hash variable key according to the characteristics of state resource supervision business and data through a consistent hash algorithm to solve the performance problem caused by high concurrency and centralized access, the access efficiency is improved by dynamically controlling the access of the server, the influence range of the service cluster on the whole system when the server is increased or decreased is reduced, and the product quality and the usability of the system are greatly improved.

In some embodiments, a second server is added to the server cluster, and the hash values corresponding to the second server and the hash values corresponding to the first server are arranged along a preset sequence. And distributing the first request of the first client to the second server for processing.

For example, as shown in fig. 5, assume that the second server is server D. The hash value corresponding to server D is located between server a and server B, and the enterprise client request 02 is no longer addressed to server B, but to server D, thus migrating the data of the original server B to server D. The addressing of client request 01 and client request 03 does not change, so a and B do not need to change.

In some embodiments, the server cluster includes a third server, and when a first server in the server cluster goes down or is removed, the first request of the first client is distributed to the third server for processing.

For example, as shown in fig. 6, assume that the third server is server C. When server B is down or removed from the server cluster, the enterprise client request 02 will not address server B any more, but address server C clockwise, thus migrating the data of the original server B to server C. Requests originally addressed to server a and server B are unaffected,

in the embodiment of the application, when the server cluster needs to expand or reduce the capacity, only a small part of data in the hash ring space needs to be relocated, which indicates that the consistent hash algorithm has better fault tolerance and expandability. When the number of the nodes is more, the data to be migrated is more when a general hash algorithm is used, and relatively speaking, when consistent hash is used, the data to be migrated is less, a new server is replaced in time, the corresponding data is migrated, all servers under the system cannot be affected, and the stability of the system is enhanced.

In some embodiments, S100 may be specifically implemented as: when the appointed subinterval of the appointed hash value interval is larger than the preset range, mapping each virtual node by each hash value in the appointed subinterval; and establishing an incidence relation between each virtual node and each server.

The preset range may refer to a range of values, for example, specifying half of a hash value range.

For example, the server clusters are distributed in a half or a small half of the hash ring on the hash ring, as shown in fig. 7, and the server a, the server B, and the server C are distributed in a small part of the hash ring, as the interval [ a, B ]. The sub-regions are designated as intervals outside the interval in which the servers are distributed, such as the interval B, a.

It can be seen that [ B-ase:Sub>A ] interval on the Hash ring occupies most part, according to the principle of finding the nearest server clockwise, server ase:Sub>A will process the request of unit information Hash value Hash (orglnfo) in (B-ase:Sub>A ], server C processes the request of interval (ase:Sub>A-C), and server B processes the request of interval (C-B), so that most of the unit requests under national supervision will be processed in server ase:Sub>A, which will cause uneven cooling and heating of server access.

In this case, as shown in fig. 8, a plurality of virtual nodes are mapped within the section [ B, a ] of the hash ring, and the virtual nodes may be uniformly distributed within the section [ B, a ]. And the virtual nodes establish an incidence relation with each server in the server cluster, preferably, the virtual nodes uniformly map each server in the server cluster.

Wherein each virtual node may comprise a first node associated with a first server. 103 may specifically be implemented as: according to the first hash value, addressing to a first node along a preset sequence in a designated hash value interval; the first request of the first client is processed at the first server based on the first node being addressed to the first server.

For example, if the enterprise client request 02 is addressed to node 02, which node 02 is associated with server B, then the enterprise client request 02 is addressed to server B and will be processed in server B.

In the embodiment of the application, by establishing a plurality of virtual nodes and establishing the association relationship between the virtual nodes and each server in the server cluster, each server in the server cluster can bear the pressure as evenly as possible.

In view of the above object, a second aspect of the embodiment of the present invention provides a service access apparatus based on a hash algorithm, and fig. 9 is a schematic diagram illustrating an embodiment of the service access apparatus based on a hash algorithm provided in the present invention. As shown in fig. 9, the hash-based service access apparatus 900 may include: a receiving module 901, a determining module 902, an addressing module 903 and a distributing module 904, wherein,

the receiving module 901 is configured to receive a first request sent by a first client;

the determining module 902 is configured to determine, by using a hash algorithm, a first hash value corresponding to the first request;

the addressing module 903 is configured to address the first server along a preset sequence within an assigned hash value interval according to the first hash value, where the assigned hash value interval corresponds to the identifier of each server in the server cluster one to one;

the distributing module 904 is configured to distribute the first request of the first client to the first server for processing.

The invention also provides computer equipment. Fig. 10 is a schematic diagram of an embodiment of a computer device provided by the present invention. As shown in fig. 10, the computer apparatus of the embodiment of the present invention includes: at least one processor 021; and a memory 022, the memory 022 storing computer instructions 023 executable on the processor 021, the instructions 023 when executed by the processor 021 implementing the method described above.

The invention also provides a computer readable storage medium. FIG. 11 is a schematic diagram illustrating an embodiment of a computer-readable storage medium provided by the present invention. As shown in fig. 11, the computer readable storage medium 031 stores a computer program 032 which, when executed by a processor, performs the method as described above.

Finally, it should be noted that, as one of ordinary skill in the art can appreciate, all or part of the processes in the method according to the above embodiments may be implemented by instructing relevant hardware through a computer program, and the program of the method for document early warning may be stored in a computer-readable storage medium, and when executed, may include the processes according to the embodiments of the methods described above. The storage medium of the program may be a magnetic disk, an optical disk, a Read Only Memory (ROM), a Random Access Memory (RAM), or the like. The embodiments of the computer program may achieve the same or similar effects as any of the above-described method embodiments.

Furthermore, the methods disclosed according to embodiments of the present invention may also be implemented as a computer program executed by a processor, which may be stored in a computer-readable storage medium. Which when executed by a processor performs the above-described functions defined in the methods disclosed in embodiments of the invention.

Further, the above method steps and system elements may also be implemented using a controller and a computer readable storage medium for storing a computer program for causing the controller to implement the functions of the above steps or elements.

Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

In one or more exemplary designs, the functions may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital Subscriber Line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, D0L, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes Compact Disc (CD), laser disc, optical disc, digital Versatile Disc (DVD), floppy disk, blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the present disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.

It should be understood that, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly supports the exception. It should also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.

The numbers of the embodiments disclosed in the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments.

It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.

Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, of embodiments of the invention is limited to these examples; within the idea of an embodiment of the invention, also combinations between technical features in the above embodiments or in different embodiments are possible, and there are many other variations of the different aspects of the embodiments of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present invention are intended to be included within the scope of the embodiments of the present invention.

Claims (10)

1. A service access method based on a hash algorithm, the method comprising:

receiving a first request sent by a first client;

determining a first hash value corresponding to the first request through a hash algorithm;

according to the first hash value, a first server is addressed in a designated hash value interval along a preset sequence, and the designated hash value interval corresponds to the identification of each server in the server cluster one by one;

and distributing the first request of the first client to the first server for processing.

2. The method of claim 1, further comprising, prior to receiving the first request sent by the first client:

and establishing a corresponding relation between each hash value in the appointed hash value interval and the identification of each server in the server cluster.

3. The method of claim 1 or 2, further comprising, after addressing to the first server along a preset order within a specified hash value interval according to the first hash value:

adding a second server in the server cluster, wherein the hash values corresponding to the second server and the hash values corresponding to the first server are arranged along a preset sequence;

and distributing the first request of the first client to the second server for processing.

4. The method according to claim 1 or 2, wherein the server cluster includes a third server, and the hash values corresponding to the first server and the third server are arranged along a preset sequence;

after addressing the first server along a preset sequence within a specified hash value interval according to the first hash value, the method further comprises:

and when the first server in the server cluster is down or the first server is removed, distributing the first request of the first client to the third server for processing.

5. The method of claim 2, wherein establishing a correspondence between each hash value in the specified hash value interval and an identifier of each server in the server cluster comprises:

when the appointed subinterval of the appointed hash value interval is larger than a preset range, mapping each virtual node on each hash value in the appointed subinterval;

and establishing the association relationship between each virtual node and each server.

6. The method of claim 5, wherein each of the virtual nodes comprises a first node, the first node associated with the first server; the addressing to the first server along a preset sequence within a specified hash value interval according to the first hash value includes:

according to the first hash value, the first node is addressed along a preset sequence in a designated hash value interval;

causing a first request of the first client to be processed at the first server in accordance with the first node being addressed to the first server.

7. The method of claim 1, wherein the hash algorithm comprises any of: linear function direct addressing method, number analysis method, square taking and centering method, folding method, remainder dividing and remaining method and random function method.

8. A service access device based on a hash algorithm, comprising: a receiving module, a determining module, an addressing module and a distributing module, wherein,

the receiving module is used for receiving a first request sent by a first client;

the determining module is used for determining a first hash value corresponding to the first request through a hash algorithm;

the addressing module is used for addressing the first server along a preset sequence in an appointed hash value interval according to the first hash value, and the appointed hash value interval corresponds to the identification of each server in the server cluster one by one;

the distribution module is used for distributing the first request of the first client to the first server for processing.

9. A computer device, comprising:

at least one processor; and

a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of the method of any one of claims 1 to 7.

10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.

Images