CN111338806B

CN111338806B - Service control method and device

Info

Publication number: CN111338806B
Application number: CN202010428700.6A
Authority: CN
Inventors: 张淼; 邓晓峰
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2020-05-20
Filing date: 2020-05-20
Publication date: 2020-09-04
Anticipated expiration: 2040-05-20
Also published as: CN111338806A

Abstract

The embodiment of the application provides a service control method and a device, relates to the technical field of data processing, and is applied to a distributed system formed by service node clusters, wherein the method comprises the following steps: when receiving a newly added service node message sent by a control node, a first routing node obtains identification information of the newly added service node and unavailable state information of the newly added service node from the newly added service node message; when a first routing node receives a service request sent by a terminal and determines that identification information of a service node corresponding to the service request is identification information of a newly added service node, caching the service request; and after receiving a newly added service node state change message sent by the control node, the first routing node forwards the cached service request to the newly added service node, wherein the newly added service node state change message is sent by the control node after the control node determines that the newly added service node completes data migration. The stability of data and the business processing efficiency in the distributed system are effectively improved.

Description

Service control method and device

Technical Field

The embodiment of the invention relates to the technical field of data processing, in particular to a service control method and device.

Background

At present, with the popularization of the internet, internet users grow rapidly and the application scenes of big data are increasing continuously, and in order to improve the data processing efficiency, a distributed system is generally adopted for data processing. In the distributed system, due to the continuous increase of data, in order to improve the response speed of the system and the data storage capacity of the system, the capacity expansion of the distributed system is required, service nodes responding to services are added, and part of data in the original service nodes is migrated to the newly added service nodes for storage.

However, in the capacity expansion process, due to the addition of the new service node, the topology architecture in the distributed system is changed, which causes disorder of the processing logic for processing the service request, and further causes the problems of data stability reduction and low service processing efficiency in the distributed system.

Disclosure of Invention

The embodiment of the application provides a service control method and a service control device, which are used for effectively improving the stability of data and the service processing efficiency in a distributed system in the capacity expansion process.

In one aspect, an embodiment of the present application provides a service control method, which is applied to a distributed system formed by a service node cluster, and the method includes:

when receiving a newly added service node message sent by a control node, a first routing node obtains identification information of the newly added service node and unavailable state information of the newly added service node from the newly added service node message, wherein the newly added service node message is sent by the control node when the newly added service node is determined to be added into a service node cluster;

when a first routing node receives a service request sent by a terminal and determines that identification information of a service node corresponding to the service request is identification information of a newly added service node, caching the service request;

and after receiving a newly added service node state change message sent by the control node, the first routing node forwards the cached service request to the newly added service node, wherein the newly added service node state change message is sent by the control node after the control node determines that the newly added service node completes data migration.

In one aspect, an embodiment of the present application provides a service control apparatus, which is applied in a distributed system formed by a service node cluster, and includes:

a receiving unit, configured to obtain, when a new service node message sent by a control node is received, identification information of the new service node and unavailable state information of the new service node from the new service node message, where the new service node message is sent by the control node when it is determined that the new service node is added to a service node cluster;

the cache unit is used for caching the service request when the service request sent by the terminal is received and the identification information of the service node corresponding to the service request is determined to be the identification information of the newly added service node;

and the sending unit is used for forwarding the cached service request to the newly added service node after receiving a newly added service node state change message sent by the control node, wherein the newly added service node state change message is sent by the control node after the control node determines that the newly added service node completes data migration.

In one aspect, an embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the service control method when executing the computer program.

In one aspect, an embodiment of the present application provides a computer-readable storage medium, which stores a computer program executable by a computer device, and when the program runs on the computer device, the computer device is caused to execute the steps of the service control method.

In the service control method provided by the embodiment of the application, the first routing node can receive the service request sent by the client, the service request is processed by the corresponding service node, and each service node also stores information such as service data corresponding to the service request.

Meanwhile, in the embodiment of the present application, when the first routing node receives a new service node message sent by the control node, it can be determined that a new service node is added in the distributed system, that is, a capacity expansion action occurs, at this time, the first routing node can obtain identification information of the new service node being expanded from the new service node message sent by the control node, and the control node notifies the first routing node that the currently new service node is still in the capacity expansion, that is, when the new service node transfers part or all of data in the original service node, the state is an unavailable state.

After the first routing node obtains the message of the newly added service node, if the first routing node receives the service request sent by the terminal and determines that the identification information of the service node corresponding to the service request is the identification information of the newly added service node, the first routing node determines that the newly added service node is still in an expansion state, and if the newly added service node is used at the moment, data processing is disturbed, so in the embodiment of the application, the first routing node caches the service request.

If the first routing node receives a new service node state change message sent by the control node, the first routing node can determine that the capacity of the new service node is completely expanded and can be used, the first routing node sends the cached service request to the new service node, and the new service node processes the service request.

That is to say, in the embodiment of the present application, when the capacity of the newly added service node is not completely expanded, the first routing node does not send the service request to the newly added service node for processing, and when the capacity of the newly added service node is completely expanded, the first routing node sends the service request to the newly added service node for processing, and the newly added service node can process the service request in time.

To sum up, the service control method in this embodiment of the present application may add a new service node in the distributed system, and when the new service node is still in a data migration state, the service request sent by the terminal may not be sent to the new service node, nor sent to the original service node for processing, but the service request is cached.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced 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 to obtain other drawings based on these drawings without inventive exercise.

Fig. 1 is a schematic diagram of a capacity expansion architecture of a distributed system according to an embodiment of the present application;

fig. 2 is a schematic structural diagram of a distributed system according to an embodiment of the present application;

fig. 3 is a schematic flowchart of a service control method according to an embodiment of the present application;

fig. 4 is a schematic structural diagram of a consistent hash ring according to an embodiment of the present application;

fig. 5 is a schematic flowchart of a service control method according to an embodiment of the present application;

fig. 6 is a schematic flowchart of a service control method in a game scene according to an embodiment of the present application;

fig. 7 is a schematic structural diagram of a service control apparatus according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of a computer device according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more clearly apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

For convenience of understanding, terms referred to in the embodiments of the present application are explained below:

distributed system: the system is composed of a group of computer nodes which are communicated through a network and coordinately work for completing common tasks, in a distributed system, a group of independent computers are displayed to a user to form a unified whole, the system has various general physical and logical resources and can dynamically distribute tasks, and information exchange is realized through the dispersed physical and logical resources through the computer network. According to different application modes, distributed systems can be divided into distributed file systems such as HDFS of Hadoop, GFS of ***, TFS of Taobao, distributed cache systems such as memcache, hbase, mongdb and the like, and distributed databases such as MySQL, Mariadb, PostgreSQL and the like.

Load balancing: in the embodiment of the present application, the first routing node is responsible for performing a processing procedure of load balancing.

And (3) hashing: hash, which is generally translated as a Hash, or transliteration, is a process of converting an input of arbitrary length (also called pre-map image) into an output of fixed length by a hashing algorithm, where the output is a Hash value. This transformation is a kind of compression mapping, i.e. the space of hash values is usually much smaller than the space of inputs, different inputs may hash to the same output, so it is not possible to determine a unique input value from a hash value. In short, it is a function of compressing a message of an arbitrary length to a message digest of a certain fixed length.

Consistent hashing: the method is a special hash algorithm and aims to solve the problem of distributed caching. When a server or a service node is removed or added, the mapping relation between the existing service request and the service node for processing the request can be changed as little as possible. The consistent hash is to map all service data and service nodes corresponding to the service request to a numerical space of 0-231, and simultaneously connect the numerical space end to end, namely 0 is behind 231, as a hash ring. The hash operation is carried out on the service node, the hash operation is mapped to a number on the hash ring, and the corresponding relation between the number and the service node is stored to be the hash mapping table. When inserting the service data or the service request, the service request is hashed, and the service request is stored on the nearest node with the hash value larger than the hash value of the service request.

Routing table: refers to a table stored on a router or other internet network device that stores paths to a particular network terminal and, in some cases, metrics associated with those paths. In this embodiment of the present application, both the first routing node and the second routing node in the distributed system store routing tables, and the stored routing tables are used for serving a routing query request of each node in each distributed system.

Capacity expansion: the method refers to a method for adding nodes or increasing storage space in a distributed system, for example, in the distributed system, the amount of data stored by each service node is large, such as the actual amount of data of one hard disk is 2.8T. When the system processing capacity is insufficient, a service node needs to be added to improve the data processing capacity in the distributed system, and the process of adding the service node is a capacity expansion process.

In a specific practical process, the inventors of the present application find that, in a distributed system in the prior art, as the data volume is continuously increased, service nodes of the distributed system need to be added to improve the data processing capacity in the distributed system.

However, in the prior art, in the capacity expansion process, if a newly added service node is still in the data migration process, and at this time, if there is a service request that needs to be sent to the newly added service node, the first routing node in the distributed system may send the service request to the original service node for processing, and may also send the service request to the newly added service node for processing, but because the data in the original service node is being subjected to data migration processing to the newly added service node, a problem of data processing disorder occurs, that is, the original service node and the newly added service node that has data migration cannot effectively process the service request, so that the stability of data and the service processing efficiency in the distributed system are affected.

Further, in order to facilitate understanding of the problems in the prior art, the expansion scenario shown in fig. 1 is used for explanation, and fig. 1 shows an expansion process of a distributed system suitable for each game player, in which a game player P1 sends a game scenario switching request OP1 through a terminal, and after receiving the request, a routing node determines that the requests of game players P1 are all sent to a service node of game scenario 1, where game data of game player P1 is stored. The routing node sends OP1 to the game scenario 1 service node. It should be further noted that the distributed system may be a server cluster formed by a plurality of physical servers, and may be a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDNs, and big data and artificial intelligence platforms. The following terminal may be, but is not limited to, a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart speaker, a smart watch, and the like. The terminal and the server may be directly or indirectly connected through wired or wireless communication, and the application is not limited herein.

However, as the number of game players increases, the distributed system starts to expand, and the game data of the game player P1 needs to be transferred to a newly added service node, i.e. the service node of game scenario 2 in fig. 1, if the routing node sends the OP1 to the service node of game scenario 1 for processing, the service node of game scenario 1 cannot correctly process the game scenario switching request because the game data is being transferred; similarly, if the routing node sends the OP1 to the service node of game scenario 2, since the game data is not transferred completely, the service node of game scenario 2 cannot correctly process the game scenario switching request.

Based on the above problems, the inventor of the present application proposes a service control method, which is applied to the distributed system, where a control node monitors whether a new service node is added, and when a new service node is added to the distributed system, sends a new service node message to a first routing node, notifies the first routing node of which new service nodes are added, and notifies the first routing node that the new service nodes cannot process a service request; after receiving the message of the newly added service node, the first routing node can obtain the information of the newly added service node, and determines that the newly added service node can not process the service request.

When a first routing node receives a service request sent by a terminal, if the service request is determined to be sent to a newly added service node, temporarily caching the service request; and the control node monitors whether each newly added node finishes data migration or not, and if so, the control node sends a newly added service node state change message to the first routing node to inform the first routing node that the newly added node can process the service request, so that the first routing node sends the cached service request to the newly added service node after receiving the newly added service node state change message.

Through the caching mode of the first routing node, the ordered process of processing the service request can be realized, the problem of disorder processing sequence in the service request processing process due to capacity expansion is avoided, and therefore the stability of data in a distributed system and the service processing efficiency can be effectively improved.

After introducing the design concept of the embodiment of the present application, some simple descriptions are provided below for application scenarios to which the technical solution of the embodiment of the present application can be applied, and it should be noted that the application scenarios described below are only used for describing the embodiment of the present application and are not limited. In specific implementation, the technical scheme provided by the embodiment of the application can be flexibly applied according to actual needs.

To further illustrate the technical solutions provided by the embodiments of the present application, the following detailed description is made with reference to the accompanying drawings and the detailed description. Although the embodiments of the present application provide method steps as shown in the following embodiments or figures, more or fewer steps may be included in the method based on conventional or non-inventive efforts. In steps where no necessary causal relationship exists logically, the order of execution of the steps is not limited to that provided by the embodiments of the present application.

Reference is made to fig. 2, which is a block diagram illustrating a distributed system according to an embodiment of the present disclosure. The system at least comprises a service node cluster 201, the service node cluster 201 comprises a plurality of service nodes 2011, and each service node 2011 can process service requests of the same type and can also process service requests of different types.

Each service node 2011 may be an entity node having a service processing capability, or may be a virtual node having a service processing capability. If each service node 2011 is a virtual node, each service node 2011 may be each virtual node in the same physical machine or may be a virtual node between different physical machines.

According to different types of service requests processed by the service nodes 2011, the service nodes are divided into a plurality of service node clusters 201, the service node clusters 201 are connected through the routing node 202, and meanwhile, in a distributed system, the routing node 202 can also receive the service requests sent by the terminal 203 to the service nodes 2011, so in this embodiment of the application, the routing node 202 connected with the terminal 203 is used as the first routing node 2021, and the routing node 202 connected with the service nodes 2011 is used as the second routing node 2022. Of course, in the embodiment of the present application, the first routing node 2021 and the second routing node 2022 may be two functional modules in the same routing node 202.

In this embodiment of the application, the first routing node 2021 and the second routing node 2022 are load balancing devices, and are located between the terminal 203 and the service node cluster 201, and configured to receive a service request sent by the terminal 203 and send the service request to one service node 2011 in the service node cluster 201.

In this embodiment of the present application, the load balancing device may determine, according to a certain allocation policy, to which service node 2011 in the service node cluster 201 the service request sent by the terminal 203 should be sent for processing. As a dispatcher between the terminal 203 and the service node cluster 201, the purpose of setting the allocation policy by the load balancing device is to send the service request sent by the terminal 203 as a whole to each service node 2011 in the service node cluster 201 as uniformly as possible, so that each service node 2011 cooperatively provides services to the outside, and commonly undertakes access services from the terminal 203, thereby avoiding the conditions that the load of each service node 2011 in the service node cluster 201 is uneven and part of the service nodes 2011 are overloaded, and improving the availability of the whole distributed system.

The distributed system in the embodiment of the present application further includes a control node 204, where the control node 204 is configured to manage other nodes in the distributed system, such as the service node cluster 201 and the routing node 202, and the control node 204 can determine an operating state of each service node 2011 in the service node cluster 201 through a heartbeat signal, and also can determine whether there is a new service node 2011 in the service node cluster 201.

Meanwhile, the control node 204 can also send the acquired message of the new service node 2011 to the routing node 202, that is, the first routing node 2021 and the second routing node 2022, and after receiving the message, the first routing node 2021 caches the service request sent to the new service node 2011.

The control node 204 can also send the state change message of the new service node 2011 to the first routing node 2021 after determining that the data transfer of the new service node 2011 is completed, and then the first routing node 2021 sends the cached service request to the new service node 2011.

In the embodiment of the present application, each node in the distributed system may interact in a public network, and may also interact in a private network, such as a private cloud network or a restricted local area network. And are not limited in this application.

In an alternative embodiment, each service node 2011 in each service node cluster 201 completes the service request processing capability through a data sharing system of a block chain, specifically, as shown in fig. 2, the data sharing system 205 is a system for performing data sharing between the service node 2011 and the service node 2011, and the data sharing system may include a plurality of service nodes 2011 and may perform data sharing.

Each service node 2011 may receive a service request while operating normally and maintain shared data within the data sharing system based on the received service request or service data. In order to ensure information intercommunication in the data sharing system, information connection may exist between each node in the data sharing system, and information transmission may be performed between each service node 2011. For example, when any service node 2011 in the data sharing system receives a service request, other service nodes 2011 in the data sharing system obtain the service request according to the consensus algorithm, and store the request data in the service request as data in shared data, so that the data stored in all the nodes in the data sharing system are consistent.

Each service node 2011 in the data sharing system has a service node 2011 identifier corresponding thereto, and each service node 2011 in the data sharing system may store node identifiers of other service nodes 2011 in the data sharing system, so that the generated blocks are broadcast to the other service nodes 2011 in the data sharing system according to the node identifiers of the other service nodes 2011 in the following. Each service node 2011 may maintain a node identifier list, and store the node name and the node identifier in the node identifier list correspondingly. The node identifier may be an IP (internet protocol) address and any other information that can be used to identify the node.

Each node in the data sharing system stores one identical blockchain. The block chain is composed of a plurality of blocks, the starting block comprises a block head and a block main body, the block head stores an input information characteristic value, a version number, a timestamp and a difficulty value, and the block main body stores input information; the next block of the starting block takes the starting block as a parent block, the next block also comprises a block head and a block main body, the block head stores the input information characteristic value of the current block, the block head characteristic value of the parent block, the version number, the timestamp and the difficulty value, and the like, so that the block data stored in each block in the block chain is associated with the block data stored in the parent block, and the safety of the input information in the block is ensured.

Of course, the method provided in the embodiment of the present application is not limited to be used in the application scenario shown in fig. 2, and may also be used in other possible application scenarios, and the embodiment of the present application is not limited. The functions that can be implemented by each device in the application scenario shown in fig. 2 will be described in the following embodiment of the method, and will not be described in detail herein.

The following describes the technical solution provided in the embodiment of the present application with reference to the application scenario shown in fig. 2.

Specifically, in this embodiment of the present application, since the first routing node has a capability of caching the service request, a process flow of the first routing node in the service control method is introduced first, as shown in fig. 3, and includes:

step S301, when receiving a new service node message sent by a control node, a first routing node obtains identification information of the new service node and unavailable state information of the new service node from the new service node message, wherein the new service node message is sent by the control node when determining that the new service node is added to a service node cluster.

In step S301, the first routing node can receive instruction information sent by the control node, and when receiving a new service node message sent by the control node, the first routing node can determine information of a currently newly added service node from the message.

Optionally, in this embodiment of the present application, the information of the newly added service node may include identification information of the newly added service node, where the identification information is a representation of uniqueness of each newly added service node, and the identification information may be a device identifier of the newly added service node, or an IP identifier of the newly added service node, and the like.

In this embodiment, the control node needs to notify the first routing node that there is a newly added service node, and needs to notify the first routing node that the newly added service node cannot process the service request at this time, so the message of the newly added service node also includes information that the state of each newly added service node is unavailable, and after the first routing node obtains the information that the state of the newly added service node is unavailable, it determines that the newly added service node cannot process the service request.

Optionally, in this embodiment of the application, the message of the newly added service node includes information of a plurality of newly added service nodes, where the number of information included in the message is not limited.

Describing the process of the first routing node receiving the message of the newly added service node and obtaining the message content, how the control node sends the message of the newly added service node is described below.

In this embodiment of the present application, when a newly added service node is added to a distributed system, the newly added service node is added to a certain service node cluster, a second routing node connected to the service node cluster can determine that a new service node is added, assign identification information, such as IP information, to the new service node, send the identification information of the newly added service node to a control node, and the control node sends a message of the newly added service node to the first routing node after receiving the identification information of the newly added service node.

In an optional embodiment, the second routing node may return the identification information of the newly added service node to the control node together when the control node sends the heartbeat signal.

Optionally, in this embodiment of the present application, the control node may send a new service node message to the first routing node when it is determined that there are new service nodes, or may send a new service node message to the first routing node when it is determined that there are a set number of new service nodes, or the control node generates a new service node message according to the new service nodes acquired within a set time, and sends the new service node message to the first routing node.

Optionally, in this embodiment of the application, after receiving the message of the newly added service node, the first routing node may establish a newly added service node information table according to the identification information of the newly added service node and the unavailable state information of the newly added service node, for example, as shown in table 1, the identification information and the state of the newly added service node are stored in table 1.

TABLE 1

Step S302, when the first routing node receives the service request sent by the terminal and determines that the identification information of the service node corresponding to the service request is the identification information of the newly added service node, the service request is cached.

Specifically, after acquiring the message of the newly added service node, the first routing node may also continuously receive service requests sent by the terminal, and these service requests need to be sent to the service node for processing. Optionally, the service request may be a data acquisition request, a data query request, a data deletion request, or the like, or may be other data processing requests, which is not limited herein.

When the first routing node determines the received service sent by the terminal and determines that the identification information of the service node corresponding to the service request is the identification information of the newly added service node, the first routing node determines that the newly added service node cannot perform service processing, so that the service request is cached.

In this embodiment of the present application, the service request received by the first routing node corresponds to the identification information of the service node, so when the first routing node determines that the identification information of the node that needs to process the service request is the identification information of the newly added node, the cache processing is performed, and several methods for determining that the identification information of the service node corresponding to the service request is the identification information of the newly added service node are described in the following examples.

In an optional embodiment, the service request received by the first routing node includes service node identification information corresponding to the service request, and the first routing node can determine whether the service node identification information corresponding to the received service request is the identification information of the newly added service node according to the obtained identification information of the newly added service node. Optionally, the first routing node may further perform matching according to each identification information stored in table 1, and if the matching is obtained, determine whether the service node identification information corresponding to the received service request is the identification information of the newly added service node.

In another optional embodiment, each service node is distributed in the distributed system according to the hash value, so that the first routing node needs to determine whether the hash value corresponding to the service request matches with the identification information of the newly added service node, and if so, determines whether the identification information of the service node corresponding to the received service request is the identification information of the newly added service node.

Specifically, in this embodiment of the present application, the service request includes request identification information, where the identification information may be a user identification ID of a user sending the service request, or a terminal device identification ID used by the user, or an IP address used by the terminal.

And if the remainder is determined to be the identification information of the newly added service node, the hash corresponding to the service request needs to be determined to be matched with the identification information of the newly added service node, so that the identification information of the service node corresponding to the received service request is determined to be the identification information of the newly added service node. The identification information of the newly added service node in the above embodiment refers to a node identification number of the service node, such as an identification 1, an identification 2, an identification 3, and the like, the identification number of the service node is related to the number of the service nodes, and each service node has a unique node identification number.

In another alternative embodiment, the first routing node may determine whether the hash value corresponding to the service request matches the identification information of the newly added service node according to the consistent hash ring, and further determine whether the identification information of the service node corresponding to the received service request is the identification information of the newly added service node.

Specifically, the first routing node constructs an integer ring of 0-2 ^32, namely a hash ring, and then takes a hash value for the identifier of each service node in the distributed storage system, so that each service node is mapped onto the hash ring, wherein the mapping comprises the original service node and the newly added service node in the distributed storage system, namely, each service node in the hash ring has a first position, namely the mapping position.

And the first routing node maps the service request to the hash ring according to the request hash value to obtain a second position mapped by the service request.

The first routing node takes the second position as a reference, the first position determined along the hash ring in the clockwise direction is the position of the service node corresponding to the service request, the request hash value can be determined to be matched with the identification information of the newly added service node, and the identification information of the service node corresponding to the received service request is further determined to be the identification information of the newly added service node.

For example, as shown in fig. 4, a consistent hash ring is shown, where a solid dot in the consistent hash ring indicates a first position to which each service node is mapped, a hollow dot in the consistent hash ring indicates a second position to which a service request is mapped, starting from the second position, the first position a is determined along a clockwise direction of the consistent hash ring, and it is determined that a service node corresponding to the first position a is a newly added service node, it is determined that a request hash value matches identification information of the newly added service node, and it is further determined that service node identification information corresponding to a received service request is identification information of the newly added service node.

Step S303, after receiving a new service node state change message sent by the control node, the first routing node forwards the cached service request to the new service node, where the new service node state change message is sent by the control node after determining that the new service node completes data migration.

Specifically, in this embodiment of the present application, if the first routing node receives a new service node state change message sent by the control node, it can be determined that the new node has completed data migration, and then the first routing node may send a service request to the new service node.

Optionally, in this embodiment of the application, if it is determined that the state change message of the newly added service node includes newly added service nodes corresponding to all service requests of the cache, the first routing node sends the service request to the newly added service node, where the number of the newly added service nodes is one or more.

Illustratively, the first routing node caches 3 corresponding service requests to be sent to the newly added service node 1, the newly added service node 2, and the newly added service node 3, the first routing node receives a state change message of the newly added service node, the state change message of the newly added service node indicates that the state of the newly added service node 1 is changed, and the first routing node sends the cached service requests to be sent to the newly added service node 1.

Or, the first routing node caches 3 corresponding service requests to be sent to the newly added service node 1, the newly added service node 2 and the newly added service node 3, the first routing node receives a newly added service node state change message, the newly added service node state change message indicates that the states of the newly added service node 1 and the newly added service node 2 are changed, the first routing node sends the cached service request to be sent to the newly added service node 1, and sends the cached service request to be sent to the newly added service node 2.

Therefore, as can be seen from the above, the new service node state change message may be sent by the control node after the control node determines that all the new service nodes have completed data migration, may also be sent by the control node after determining that each new service node has completed data migration, or may be sent by the control node according to information that the new service node has completed data migration within a set time when the control node arrives at the set time, and certainly, other determination methods exist, which are not limited herein.

In this embodiment of the present application, since the service node is under a certain second routing node, when the first routing node needs to send the cached service request to a newly added service node, it needs to determine the second routing node corresponding to the newly added service, and send the second routing node to the second routing node.

In the embodiment of the present application, the first routing node determines the second routing node according to the routing table, so when there is a new service node in the distributed system, the second routing node updates the routing table and sends the updated routing table to the control node, and the control node sends the routing table to the first routing node, where the first routing node can obtain the updated routing table.

Specifically, in the embodiment of the present application, the routing table stores the association relationship between the service node identification information and the routing node identification information, so that the first routing node determines the identification information of the second routing node according to the identification information of the newly added service node, and sends the cached service request to the second routing node.

In this embodiment of the present application, in order to ensure that each service request received by the first routing node before the service node is newly added can be processed normally, in this embodiment of the present application, the first routing node receives an emptying incomplete service request message sent by the control node, and the control node notifies the first routing node to complete all service requests.

The first routing node acquires the uncompleted service requests, determines each original service node in the service node cluster according to the identification information of each uncompleted service request, and sends all the emptied uncompleted service request messages to the control node after determining that the processed uncompleted service requests sent by all the original service nodes are received.

And after receiving all the emptied incomplete service request messages of the first routing node, the control node sends a data migration starting message to each newly added service node to start an expansion process.

Optionally, in this embodiment of the present application, after receiving all the cleared uncompleted service request messages of the first routing node, the control node further needs to receive all the cleared uncompleted service request messages sent by the second routing node, and when determining that all the cleared uncompleted service request messages have been sent by all the first routing nodes and all the second routing nodes, the control node sends a data migration start message to all the newly added service nodes, and starts a capacity expansion process.

After the processes of caching the service request and forwarding the service request by the first routing node are introduced, each processing process triggered after a new service node is added in the distributed system is introduced below by taking the distributed system as a whole.

Specifically, as shown in fig. 5, the method includes:

step S501, adding a new service node into the distributed system, and sending identification information to a second routing node;

step S502, the second routing node obtains the newly added routing information and updates the routing table;

step S503, the second routing node sends the new routing information and the updated routing table to the control node;

step S504, the control node generates a new service node message according to the new routing information;

step S505, the control node sends the message of the newly added service node and the updated routing table to each first routing node and other second routing nodes;

step S506, the second routing node sends the message of the newly added service node and the updated routing table to each service node;

step S507, each service node determines whether the data managed by each service node needs to be migrated or not according to a consistent Hash algorithm, and waits for migration;

step S508, the control node sends the request message of clearing the unfinished service to the first routing node and second routing node;

step S509, the first routing node and the second routing node clear the incomplete service request;

step S510, the first routing node and the second routing node send all the messages of clearing the unfinished service request to the control node;

step S511, the control node sends a data migration starting message to each second routing node;

step S512, the first routing node receives a service request sent by the terminal;

step S513, when the first routing node determines that the service request pair is sent to the newly added service node, the service request is cached;

step S514, the second routing node sends the message for starting data migration to each service node;

step S515, each service node performs data migration;

step S516, after the data migration is completed, each service node sends a message of completing the data migration to the second routing node;

step S517, the second routing node sends the completed data migration message of each newly added service node to the control node;

step S518, the control node sends a new service node state change message to the first routing node and the second routing node;

step S519, the first routing node sends each cached service request to a corresponding second routing node;

step S520, the second routing node sends the cached service request to the corresponding newly added service node;

in step S521, the new service node processes the service request.

In the above flow, there is no restriction on the order between step S507 and step S508, and there is no restriction on the order between step S512 and any of steps S513 to S517.

For better explaining the embodiment of the present application, the service control method provided in the embodiment of the present application is described below in combination with a specific implementation scenario, as shown in fig. 6, in the embodiment of the present application, each service node is a game node, and is divided into a function cluster 1, a function cluster 2, and a function cluster 3 according to the function of each game node, where the function cluster 1 is a guild cluster, the function cluster 2 is a combat cluster, and the kinetic energy cluster 3 is a competition cluster.

Each functional cluster is provided with each service node, the functional cluster 1 is provided with a service node 1 and a service node 2, the functional cluster 2 is provided with a service node 3, a service node 4 and a service node 5, and the functional cluster 3 is provided with a service node 6.

Function cluster 1 is suspended in route 1, function cluster 2 is suspended in route 2, and function cluster 3 is suspended in route 3. And the control node performs data interaction with each route.

The route 3 determines that a new service node exists in the functional cluster 3, and the new service node is the service node 7, informs the control node that the service node 7 is added, and sends the routing table information of the service node 7 to the control node. The route 3 informs the service node 6 of the data that needs to be transferred to the service node 7 according to the game account of the game player, the IP address of the service node, and the consistent hash ring, and waits for the transfer. For example, in the embodiment of the present application, the data of the user G1 and the user G2 need to be transferred.

Upon receiving the message, the control node broadcasts a notification to the route 1, the route 2, and the route 3, notifies each route, adds the service node 7, and makes the service node unusable, and transmits the updated routing table to the route 1, the route 2, and the route 3.

The control node broadcasts a notification to each of route 1, route 2, and route 3, and clears the received service request.

And the route 1, the route 2 and the route 3 determine corresponding service nodes according to the original service processing logic and send the service nodes to be processed. Illustratively, the service request Q1 which is received by the route 1 but not completed is sent by the user G1, and according to the original service processing logic, the service node is determined to be the service node 6, and then the service node is sent to the route 3, and the route 3 is sent to the service node 6.

After determining that all the service requests are completed, the route 1, the route 2 and the route 3 notify the control node that all the service requests are completed, the control node sends a data migration start data message to the route 1, the route 2 and the route 3, and the route 3 notifies the service node 6 and the service node 7 of data migration.

When the first terminal receives the user G2 in the functional cluster 1 and needs to send the service request Q2 to the competition cluster, at this time, the first terminal determines that the service node 7 corresponding to G2 is data migration, so that the service request Q2 is cached.

After determining that the service node 7 completes the data migration, the route 3 notifies the control node, and the control node notifies the route 1 that the service node 7 has completed the data migration, so the route 1 sends Q2 to the route 3, and the route 3 sends Q2 to the service node 7.

As can be seen from the above example, the route for receiving the game user service request is the first route, and route 1, route 2, and route 3 in the above example may all be the first routing node, and similarly, route 1, route 2, and route 3 in the above example may all be the second routing node.

Based on the same technical concept, an embodiment of the present application further provides a service control apparatus 700, which is applied to a distributed system formed by a service node cluster, as shown in fig. 7, and includes:

a receiving unit 701, configured to, when receiving a new service node message sent by a control node, obtain identification information of the new service node and unavailable state information of the new service node from the new service node message, where the new service node message is sent by the control node when it is determined that a new service node is added to a service node cluster;

a caching unit 702, configured to cache a service request when the service request sent by the terminal is received and it is determined that identification information of a service node corresponding to the service request is identification information of a newly added service node;

a sending unit 703, configured to forward the cached service request to the newly added service node after receiving a new service node state change message sent by the control node, where the new service node state change message is sent by the control node after determining that the newly added service node completes data migration.

Optionally, the service request includes request identifier information, and the cache unit 702 is specifically configured to:

determining a request hash value according to the request identification information;

and if the request hash value is determined to be matched with the identification information of the newly added service node, determining the identification information of the service node corresponding to the service request as the identification information of the newly added service node.

Optionally, the cache unit 702 is specifically configured to:

constructing a consistent hash ring;

determining each first position corresponding to each service node in the consistent hash ring according to the identification information of each newly added service node and the identification information of the original service node;

determining a second position corresponding to the service request in the consistent hash ring according to the request hash value;

and if the service node corresponding to the first position closest to the second position is determined to be a newly added service node, determining that the request hash value is matched with the identification information of the newly added service node.

Optionally, the receiving unit 701 is further configured to:

receiving an emptying unfinished service request message sent by a control node, and acquiring an unfinished service request;

the cache unit 702 is further configured to:

determining each original service node in the service node cluster according to the identification information of each unfinished service request;

the sending unit 703 is further configured to:

after determining that the processed completion messages aiming at the uncompleted service requests sent by all the original service nodes are received, sending all the emptied uncompleted service request messages to the control node so that the control node sends a data migration starting message to each newly added service node.

Optionally, the receiving unit 701 is further configured to:

receiving an updated routing table sent by the control node and storing the updated routing table, wherein the updated routing table is determined when the second routing node determines that the newly added service node is added into the service node cluster and is sent to the control node, and the updated routing table comprises an incidence relation between the identification information of the newly added service node and the identification information of the second routing node;

the sending unit 703 is specifically configured to:

determining the identification information of a second routing node corresponding to the newly added service node according to the updated routing table and the identification information of the newly added service node;

and sending the service request to the second routing node according to the identification information of the second routing node so that the second routing node forwards the service request to the newly added service node.

Optionally, the newly added service node message includes identification information of a plurality of newly added service nodes, and the newly added service node state change message is sent by the control node after determining that all the newly added service nodes complete data migration.

Based on the same technical concept, the embodiment of the present application provides a computer device, as shown in fig. 8, including at least one processor 801 and a memory 802 connected to the at least one processor, where a specific connection medium between the processor 801 and the memory 802 is not limited in the embodiment of the present application, and the processor 801 and the memory 802 are connected through a bus in fig. 8 as an example. The bus may be divided into an address bus, a data bus, a control bus, etc.

In the embodiment of the present application, the memory 802 stores instructions executable by the at least one processor 801, and the at least one processor 801 may execute the steps included in the above-mentioned federal learning method by executing the instructions stored in the memory 802.

The processor 801 is a control center of the computer device, and may connect various parts of the terminal device by using various interfaces and lines, and obtain the client address by executing or executing instructions stored in the memory 802 and calling data stored in the memory 802. Alternatively, the processor 801 may include one or more processing units, and the processor 801 may integrate an application processor, which mainly handles operating systems, user interfaces, application programs, and the like, and a modem processor, which mainly handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 801. In some embodiments, the processor 801 and the memory 802 may be implemented on the same chip, or in some embodiments, they may be implemented separately on separate chips.

The processor 801 may be a general-purpose processor, such as a Central Processing Unit (CPU), a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, configured to implement or perform the methods, steps, and logic blocks disclosed in the embodiments of the present Application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor.

Memory 802, which is a non-volatile computer-readable storage medium, may be used to store non-volatile software programs, non-volatile computer-executable programs, and modules. The Memory 802 may include at least one type of storage medium, and may include, for example, a flash Memory, a hard disk, a multimedia card, a card-type Memory, a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Programmable Read Only Memory (PROM), a Read Only Memory (ROM), a charged Erasable Programmable Read Only Memory (EEPROM), a magnetic Memory, a magnetic disk, an optical disk, and so on. The memory 802 is 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 computer, but is not limited to such. The memory 802 in the embodiments of the present application may also be circuitry or any other device capable of performing a storage function for storing program instructions and/or data.

Based on the same technical concept, embodiments of the present application provide a computer-readable storage medium storing a computer program executable by a computer device, which, when the program is run on the computer device, causes the computer device to perform the steps of the federal learning method.

The computer-readable storage medium may be any available medium or data storage device that can be accessed by a computer, including but not limited to magnetic memory (e.g., floppy disks, hard disks, magnetic tape, magneto-optical disks (MOs), etc.), optical memory (e.g., CDs, DVDs, BDs, HVDs, etc.), and semiconductor memory (e.g., ROMs, EPROMs, EEPROMs, nonvolatile memories (NANDFLASHs), Solid State Disks (SSDs)), etc.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A service control method is applied to a distributed system formed by service node clusters, and the method comprises the following steps:

when receiving a newly added service node message sent by a control node, a first routing node obtains identification information of the newly added service node and unavailable state information of the newly added service node from the newly added service node message, wherein the newly added service node message is sent by the control node when the newly added service node is determined to be added into the service node cluster;

when the first routing node receives a service request sent by a terminal and determines that the identification information of a service node corresponding to the service request is the identification information of the newly added service node, caching the service request;

after receiving a new service node state change message sent by the control node, the first routing node forwards the cached service request to the new service node, where the new service node state change message is sent by the control node after determining that the new service node completes data migration, a topological relationship between an original service node corresponding to the service request and a second routing node corresponding to the original service node does not change, and the first routing node communicates with each service node through the second routing node.

2. The method of claim 1, wherein the service request includes request identification information, and the determining, by the first routing node, that the identification information of the service node corresponding to the service request is the identification information of the newly added service node includes:

the first routing node determines a request hash value according to the request identification information;

and if the first routing node determines that the request hash value is matched with the identification information of the newly added service node, determining that the identification information of the service node corresponding to the service request is the identification information of the newly added service node.

3. The method of claim 2, wherein the determining, by the first routing node, that the request hash value matches the identification information of the newly added service node comprises:

the first routing node constructs a consistent hash ring;

the first routing node determines each first position corresponding to each service node in the consistent hash ring according to the identification information of each newly added service node and the identification information of the original service node;

the first routing node determines a second position corresponding to the service request in the consistent hash ring according to the request hash value;

and if the first routing node determines that the service node corresponding to the first position closest to the second position is a newly added service node, determining that the request hash value is matched with the identification information of the newly added service node.

4. The method of claim 1, wherein after the first routing node receives a new service node message sent by a control node, the method further comprises:

the first routing node receives an emptying uncompleted service request message sent by the control node and acquires an uncompleted service request;

the first routing node determines each original service node in the service node cluster according to the identification information of each unfinished service request;

and after determining that the processed completion messages aiming at each uncompleted service request sent by all the original service nodes are received, the first routing node sends all the emptied uncompleted service request messages to the control node so that the control node sends a data migration starting message to each newly added service node.

5. The method of claim 1, wherein after the first routing node receives a new service node message sent by a control node, the method further comprises:

the first routing node receives an updated routing table sent by the control node and stores the updated routing table, the updated routing table is determined when a second routing node determines that a newly added service node is added to the service node cluster and is sent to the control node, and the updated routing table comprises an association relation between identification information of the newly added service node and identification information of the second routing node;

the first routing node forwards the cached service request to the newly added service node, including:

the first routing node determines the identification information of a second routing node corresponding to the newly added service node according to the updated routing table and the identification information of the newly added service node;

and the first routing node sends the service request to the second routing node according to the identification information of the second routing node, so that the second routing node forwards the service request to the newly added service node.

6. The method of claim 1, wherein the new service node message comprises identification information of a plurality of new service nodes, and wherein the new service node status change message is sent by the control node after determining that all new service nodes complete data migration.

7. A service control apparatus, applied to a distributed system formed by a service node cluster, comprising:

a receiving unit, configured to, when a first routing node receives a new service node message sent by a control node, obtain, from the new service node message, identification information of a new service node and unavailable state information of the new service node, where the new service node message is sent by the control node when it is determined that the new service node is added to the service node cluster;

a sending unit, configured to forward the cached service request to the new service node after receiving a new service node state change message sent by the control node, where the new service node state change message is sent by the control node after determining that the new service node completes data migration, a topological relationship between an original service node corresponding to the service request and a second routing node corresponding to the original service node does not change, and the first routing node communicates with each service node through the second routing node.

8. The apparatus according to claim 7, wherein the service request includes request identification information, and the cache unit is specifically configured to:

9. The apparatus of claim 8, wherein the cache unit is specifically configured to:

constructing a consistent hash ring;

10. The apparatus of claim 7, wherein the receiving unit is further configured to:

receiving an emptying unfinished service request message sent by the control node, and acquiring an unfinished service request;

the cache unit is further configured to:

the sending unit is further configured to:

after determining that all processed completion messages aiming at each uncompleted service request sent by the original service node are received, sending all emptied uncompleted service request messages to the control node so that the control node sends a data migration starting message to each newly added service node.

11. The apparatus of claim 7, wherein the receiving unit is further configured to:

receiving an updated routing table sent by the control node and storing the updated routing table, wherein the updated routing table is determined by a second routing node when a newly added service node is determined to be added into the service node cluster and is sent to the control node, and the updated routing table comprises an incidence relation between identification information of the newly added service node and identification information of the second routing node;

the sending unit is specifically configured to:

and sending the service request to the second routing node according to the identification information of the second routing node, so that the second routing node forwards the service request to the newly added service node.

12. The apparatus of claim 7, wherein the new service node message comprises identification information of a plurality of new service nodes, and wherein the new service node status change message is sent by the control node after determining that all new service nodes complete data migration.

13. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the steps of the method of any one of claims 1 to 6 are performed by the processor when the program is executed.

14. A computer-readable storage medium, in which a computer program is stored which is executable by a computer device, and which, when run on the computer device, causes the computer device to carry out the steps of the method as claimed in any one of claims 1 to 6.