Distributed service registration processing method and device

By monitoring the service usage frequency and controlling node pressure in the distributed service system, adjusting the number of registered nodes, the problem of pressure on the registration center and service consumers is solved, and equipment utilization is optimized and cost reduction is achieved.

CN115914403BActive Publication Date: 2024-11-05INDUSTRIAL AND COMMERCIAL BANK OF CHINA
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202211433881.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-11-16
Publication Date
2024-11-05
Estimated Expiration
2042-11-16

AI Technical Summary

Technical Problem

In the distributed service system, as the number, scale and number of service groups increases, the pressure on the registration center and service consumers increases, resulting in an increase in equipment configuration demand, and it is difficult for the existing technology to effectively identify the calls of high and low frequency services. Frequency and node pressure lead to high cost of service splitting and transformation and high coupling.

Method used

By monitoring the service usage frequency of the service provider, identifying the call frequency and node pressure thresholds, and subscribing to the pressure control parameters of the service node, adjusting the number of registered nodes for high and low frequency services, reducing the number of low frequency services of the service consumer and the service of the registration center quantity. The specific methods include determining the impact ratio, predicting the number of concurrencies, and adjusting the number of registered nodes based on the service call growth rate, the caller growth rate and the call relationship data.

Benefits of technology

The optimization of equipment utilization of service registration centers and service consumer parties has been achieved, reducing the cache pressure of the registration center and the cached data volume of service consumers has been achieved, reducing server configuration requirements, and improving the utilization rate of application service nodes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115914403B_ABST
    Figure CN115914403B_ABST
Patent Text Reader

Abstract

The present invention can be used in the technical field of the application of big data technology in finance. The present invention provides a distributed service registration processing method and device. The corresponding method includes: determining the influence proportion of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services under multiple cycles; predicting the expected service concurrency according to the influence proportion and the service call growth rate under multiple cycles; adjusting the number of registered nodes of the service according to the expected service concurrency and the current service concurrency. The present invention monitors the service usage frequency of each service provider to identify the call frequency of the called service and the pressure threshold of the service node. Then reduce the number of low-frequency services monitored by the service consumer and reduce the number of services registered by the registration center. Thereby optimizing the utilization rate of the service registration center and the service consumer equipment.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of big data technology, and specifically relates to a distributed service registration processing method and device. Background Art

[0002] In the distributed service system of the prior art, the services exposed by the application nodes are all registered in the service registration center. For the service registration center, the more service nodes and services are registered, the greater the pressure on the registration center to cache the service registration information. Specifically, the main factors that affect the number of services registered by the registration center are as follows: first, the more service groups are registered, the greater the service pressure on the registration center; second, the more nodes in each service group, the more services are registered by the registration center; third, the more services are registered by each service group, the greater the pressure on the registration center. The number of services registered by the registration center is the sum of the services (number of service nodes × number of registered services) on all application service groups connected to the registration center.

[0003] For the service consumer service group, the service information monitored by the consumer group needs to be cached in the consumer's local memory. The more services are cached, the greater the memory pressure of the service consumer group. The number of service information subscribed by the caller cache depends on two aspects: one is the number of services referenced by the caller service group; the other is the number of service nodes registered by the service provider. It is understandable that the more service nodes registered by the service provider, the greater the amount of data subscribed locally by the consumer service group, and the more memory consumed.

[0004] As the number of distributed application service groups, service group scale, and service quantity increase, the pressure on registration and subscription of registration center services is increasing, which in turn affects the safe operation of registration center. At the same time, as the number of consumer subscription services increases, the memory consumption of consumer service nodes caching subscription service information is increasing, and the requirements for equipment are getting higher and higher, resulting in a significant increase in the configuration of large-scale equipment production.

[0005] For an application group, the services it provides include high-frequency services and low-frequency access services. As the number of visits to its high-frequency services increases, it is necessary to add corresponding service nodes. Since its low-frequency services and high-frequency services are deployed on the same node at the same time, after adding application nodes, the number of registrations for low-frequency services also increases at the same time.

[0006] Under existing technical conditions, the only way to deal with the above scenario is to split the application group into two groups according to the high-frequency services, deploy more service group nodes, and deploy low-frequency services into one service group, deploy fewer service nodes, so as to reduce the service registration pressure of the service registration center. However, this approach has the following technical disadvantages:

[0007] On the one hand, the call frequency and classification of services are not easy to identify during the business design phase. After the system is put into operation, the service nodes need to be split according to the service call volume and call frequency, which is time-consuming and laborious. For example, if an enterprise involves a large number of service groups, if they are split according to high-frequency and low-frequency service groups, the transformation cost involved is very high.

[0008] On the other hand, services deployed in the same application group generally have a certain degree of coupling in business. After the service nodes are split according to high and low frequencies, the coupling parts between service groups need to add new service calls, which has a greater impact on the service nodes. Summary of the invention

[0009] The present invention can be used in the technical field of big data technology applied in finance, and can also be used in any field other than the financial field. The present invention monitors the service usage frequency of each service provider to identify the calling frequency of the called service and the pressure threshold of the service node. And by subscribing to the service node pressure control parameters, the linkage registration center adjusts the number of service nodes registered by high- and low-frequency services, reduces the number of low-frequency services monitored by the service consumer, and reduces the number of services registered by the registration center. Thereby, the utilization rate of the service registration center and the service consumer equipment is optimized.

[0010] In a first aspect, the present invention provides a distributed service registration processing method, the method comprising:

[0011] Determine the influence proportion of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles;

[0012] Predicting the expected number of concurrent services according to the impact proportion and the service call growth rate in the multiple cycles;

[0013] The number of registered nodes for the service is adjusted according to the expected service concurrency number and the current service concurrency number.

[0014] In one embodiment, the distributed service registration processing method further includes:

[0015] The service call growth rate and the service caller growth rate in the multiple cycles are generated according to the service call history data.

[0016] In one embodiment, determining the influence proportion of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles includes:

[0017] Determine, according to the service call history data, the influence ratio of the growth rate of each service caller in the multiple periods on the growth rate of the service call;

[0018] The impact proportion is determined according to the call relationship data, the impact proportion corresponding to each service caller, and the growth rate of the service callers.

[0019] In one embodiment, predicting the expected number of concurrent services according to the impact proportion and the service call growth rate in the multiple cycles includes:

[0020] Generate a relationship vector for representing the relationship between the expected service call growth rate and the service call growth rate according to the impact proportion and the service call growth rate in multiple cycles;

[0021] Determine the expected service call growth rate according to the relationship vector and the service caller growth rate;

[0022] The expected service concurrency number is determined according to the expected service call growth rate.

[0023] In one embodiment, adjusting the number of registered nodes of a service according to the expected number of concurrent services and the current number of concurrent services includes:

[0024] Calculate the expected demand sufficiency rate of the service based on the expected number of concurrent services;

[0025] Calculate the current service provider sufficiency rate of the service according to the current service concurrency number and the current number of service callers;

[0026] The number of registered nodes is adjusted according to the expected demand sufficiency rate and the current service provider sufficiency rate.

[0027] In one embodiment, adjusting the number of registered nodes according to the expected demand sufficiency rate and the current service provider sufficiency rate includes:

[0028] When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is greater than a preset threshold, increasing the number of registered nodes;

[0029] When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is less than a preset threshold, the number of registered nodes is reduced.

[0030] In one embodiment, adding the registration node includes:

[0031] Sorting the unregistered registered nodes according to the node load rate to generate a first sorting result;

[0032] Add the registered node according to the first sorting result;

[0033] The reducing the registered nodes comprises:

[0034] Sorting the registered nodes according to the node load rate to generate a second sorting result;

[0035] The registered nodes are reduced and added according to the second sorting result.

[0036] In a second aspect, the present invention provides a distributed service registration processing device, the device comprising:

[0037] An impact ratio determination module, used to determine the impact ratio of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles;

[0038] An expected concurrent number prediction module, used to predict the expected concurrent number of services according to the impact proportion and the service call growth rate in the multiple cycles;

[0039] The registration node quantity adjustment module is used to adjust the number of registration nodes of the service according to the expected service concurrency number and the current service concurrency number.

[0040] In one embodiment, the distributed service registration processing device further includes:

[0041] The historical growth rate generation module is used to generate the service call growth rate and the service caller growth rate in the multiple cycles according to the service call historical data.

[0042] In one embodiment, the impact ratio determination module includes:

[0043] An impact ratio determination unit, configured to determine, based on the service call history data, an impact ratio of the growth rate of each service caller in the multiple cycles to the service call growth rate;

[0044] An impact ratio determination unit is used to determine the impact ratio according to the call relationship data, the impact ratio corresponding to each service caller, and the growth rate of the service caller.

[0045] In one embodiment, the expected concurrent number prediction module includes:

[0046] A relationship vector generating unit, used to generate a relationship vector for representing the relationship between the expected service call growth rate and the service call growth rate according to the impact proportion and the service call growth rate in multiple cycles;

[0047] An expected growth rate determining unit, configured to determine the expected service call growth rate according to the relationship vector and the service caller growth rate;

[0048] The expected concurrent number prediction unit is used to determine the expected service concurrent number according to the expected service call growth rate.

[0049] In one embodiment, the registered node quantity adjustment module includes:

[0050] An expected sufficiency rate calculation unit, used to calculate the expected demand sufficiency rate of the service according to the expected concurrent number of services;

[0051] A current sufficiency rate calculation unit, used to calculate the current service provider sufficiency rate of the service according to the current service concurrency number and the current number of service callers;

[0052] A node number adjustment unit is used to adjust the number of registered nodes according to the expected demand sufficiency rate and the current service provider sufficiency rate.

[0053] In one embodiment, the node number adjustment unit includes:

[0054] A node number increasing unit, configured to increase the number of registered nodes when the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is greater than a preset threshold;

[0055] The node number reduction unit is used to reduce the number of registered nodes when the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is less than a preset threshold.

[0056] In one embodiment, the node number increasing unit includes:

[0057] A first result generating unit, used for sorting the unregistered registered nodes according to the node load rate to generate a first sorting result;

[0058] A node number increasing subunit, used for increasing the registered nodes according to the first sorting result;

[0059] The node number reduction unit comprises:

[0060] A second result generating unit, used for sorting the registered nodes according to the node load rate to generate a second sorting result;

[0061] The node number reduction subunit is used to reduce the number of registered nodes according to the second sorting result.

[0062] In a fifth aspect, the present invention provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of a distributed service registration processing method when executing the program.

[0063] In a sixth aspect, the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of a distributed service registration processing method.

[0064] From the above description, it can be seen that an embodiment of the present invention provides a distributed service registration processing method and device, including: first, according to the service call growth rate, service caller growth rate and call relationship data between services under multiple cycles, determine the influence ratio of the service caller growth rate on the service call growth rate; then, predict the expected service concurrency according to the influence ratio and the service call growth rate under multiple cycles; finally, adjust the number of registered nodes of the service according to the expected service concurrency and the current service concurrency. The present invention monitors the service usage frequency of each service provider to identify the call frequency of the called service and the pressure threshold of the service node. And by subscribing to the service node pressure control parameters, the registration center is linked to adjust the number of service nodes registered for high and low frequency services, reduce the number of low frequency services monitored by the service consumer, and reduce the number of services registered by the registration center. Thereby, the utilization rate of the service registration center and the service consumer equipment is optimized. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0066] Figure 1 The following is a flow chart of a distributed service registration processing method in an embodiment of the present invention. Figure 1 ;

[0067] Figure 2 The following is a flow chart of a distributed service registration processing method in an embodiment of the present invention. Figure 2 ;

[0068] Figure 3 This is a flow chart of step 100 of the distributed service registration processing method in an embodiment of the present invention;

[0069] Figure 4 This is a flow chart of step 200 of the distributed service registration processing method in an embodiment of the present invention;

[0070] Figure 5 This is a flow chart of step 300 of the distributed service registration processing method in an embodiment of the present invention;

[0071] Figure 6 This is a flow chart of step 303 of the distributed service registration processing method in an embodiment of the present invention;

[0072] Figure 7 This is a flow chart of step 3031 of the distributed service registration processing method in an embodiment of the present invention;

[0073] Figure 8 This is a flow chart of step 3032 of the distributed service registration processing method in an embodiment of the present invention;

[0074] Fig. 9 It is a structural diagram of a distributed service registration processing system in a specific implementation manner of the present invention;

[0075] Fig.10 It is a structural diagram of a distributed service registration coordination device in a specific implementation manner of the present invention;

[0076] Fig.11 It is a flowchart of a distributed service registration coordination method in a specific implementation manner of the present invention;

[0077] Fig.12 It is a flowchart of a method for predicting service call frequency in a specific implementation manner of the present invention;

[0078] Fig.13 It is block 1 of the distributed service registration processing device in the specific implementation mode of the present invention;

[0079] Fig.14 This is block 2 of the distributed service registration processing device in the specific implementation mode of the present invention;

[0080] Fig.15 is a block diagram of an impact specific gravity determination module 10 in an embodiment of the present invention;

[0081] Fig.16 is a block diagram of the expected concurrent number prediction module 20 in an embodiment of the present invention;

[0082] Fig.17 is a block diagram of a registered node quantity adjustment module 30 in an embodiment of the present invention;

[0083] Fig.18 is a block diagram of the node number adjustment unit 303 in an embodiment of the present invention;

[0084] Fig.19 is a block diagram of the node number adjustment unit 3031 in an embodiment of the present invention;

[0085] Fig. 20 is a block diagram of the node number reduction unit 3032 in an embodiment of the present invention;

[0086] Fig.21 It is a schematic diagram of the structure of an electronic device in an embodiment of the present invention. DETAILED DESCRIPTION

[0087] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0088] Those skilled in the art will appreciate that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0089] It should be noted that the terms "including" and "having" in the specification and claims of the present application and the above-mentioned drawings and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices. In the absence of conflict, the embodiments in the present application and the features in the embodiments may be combined with each other. The present application will be described in detail below with reference to the drawings and in combination with the embodiments.

[0090] The acquisition, storage, use, and processing of data in the technical solution of this application comply with the relevant provisions of national laws and regulations.

[0091] Based on the technical pain points in the prior art, the embodiment of the present invention provides a specific implementation method of a distributed service registration processing method, see Figure 1 , the method specifically includes the following contents:

[0092] Step 100: Determine the influence ratio of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles;

[0093] Preferably, the multiple periods include: year, month, day, hour, 30 minutes, and 15 minutes. It is understandable that multiple periods can meet the requirements of multiple services. When step 100 is implemented, the caller growth rate of the service and the service call growth rate of the service (both are data) are first statistically analyzed according to the multiple periods to determine the influence (influence ratio) of the service caller growth rate on the service call growth rate.

[0094] Step 200: predicting the expected number of concurrent services according to the impact proportion and the service call growth rate in the multiple cycles;

[0095] Specifically, first, a relationship vector is established based on multiple cycles, vector parameters corresponding to multiple cycles, impact proportions and their corresponding vector parameters to characterize the relationship between the expected increase rate of each service and the growth rate of the service callers of the service (historical call growth rate); then, the time slice in the next prediction cycle, the growth rate of the service callers and the relationship vector are used to predict the expected service concurrency in step 200.

[0096] Step 300: Adjust the number of registered nodes of the service according to the expected service concurrency number and the current service concurrency number.

[0097] Specifically, the expected demand sufficiency rate and the current service provider sufficiency rate are determined according to the expected service concurrency number and the current service concurrency number, and the difference between the two is calculated. The difference is compared with the preset threshold, and the number of registered nodes is increased or reduced according to the comparison result.

[0098] From the above description, it can be seen that an embodiment of the present invention provides a distributed service registration processing method, including: first, according to the service call growth rate, service caller growth rate and call relationship data between services under multiple cycles, determine the influence ratio of the service caller growth rate on the service call growth rate; then, predict the expected service concurrency according to the influence ratio and the service call growth rate under multiple cycles; finally, adjust the number of registered nodes of the service according to the expected service concurrency and the current service concurrency. The present invention monitors the service usage frequency of each service provider to identify the call frequency of the called service and the pressure threshold of the service node. And by subscribing to the service node pressure control parameters, the registration center is linked to adjust the number of service nodes registered for high and low frequency services, reduce the number of low frequency services monitored by the service consumer, and reduce the number of services registered by the registration center. Thereby, the utilization rate of the service registration center and the service consumer equipment is optimized.

[0099] In some embodiments, see Figure 2 , the distributed service registration processing method also includes:

[0100] Step 400: Generate the service call growth rate and service caller growth rate in the multiple cycles according to the service call history data.

[0101] First, obtain service call historical data from the service monitoring center. The historical data includes: historical service call growth rate and historical service caller growth rate. Then, classify and count the historical service call growth rate and historical service caller growth rate according to multiple periods to generate service call growth rate and service caller growth rate.

[0102] In some embodiments, see Figure 3 , step 100 comprises:

[0103] Step 101: determining the influence ratio of the growth rate of each service caller in the multiple periods on the growth rate of the service call according to the service call history data;

[0104] By counting the historical growth rates of callers of the service, we can obtain the influence ratio of the growth rate CGR of each service caller on the service call growth rate: A1, A2, ..., An (the ratio of each caller growth rate to the service growth rate).

[0105] Step 102: Determine the impact proportion according to the call relationship data, the impact proportion corresponding to each service caller, and the growth rate of the service callers.

[0106] Next, the influence ratio in step 102 is determined according to the following formula.

[0107] CGRA = ∑(CGR1×A1, CGR2×A2, ..., CGRn×An) where CGR1, CGR2, ..., CGRn are the growth rates of each caller of the service. In the above formula, CGRn is the growth rate of each caller of the service.

[0108] In some embodiments, see Figure 4 , step 200 comprises:

[0109] Step 201: generating a relationship vector for representing the relationship between the expected service call growth rate and the service call growth rate according to the impact proportion and the service call growth rate in multiple cycles;

[0110] Specifically, by calculating the historical data of service calls, the relationship vector SGRI between the expected increase rate of each service and the historical call growth rate of the service is obtained. For example, the expected growth rate vector of a certain service is SGRI = (YSGR×B1, MSGR×B2, DSGR×B3, ADSGR×B4, TSGR×B5, QSGR×B6, FSGR×B7, CGRA×B8), where YSGR, MSGR, DSGR, TSGR, QSGR, and FSGR are the service call growth rates in the historical periods of year, month, day, hour, 30 minutes, 15 minutes, and 5 minutes, respectively; B1, B2, B3, B4, B5, B6, B7, and B8 are the vector parameters of the service growth rate obtained after calculation.

[0111] Step 202: Determine the expected service call growth rate according to the relationship vector and the service caller growth rate;

[0112] Specifically, by substituting the time slice and service caller growth rate in the next forecast period into the above SGRI vector array, it is calculated that the expected service demand growth rate of the current service in the next period is ESGR.

[0113] Step 203: Determine the expected service concurrency number according to the expected service call growth rate.

[0114] Specifically, the maximum concurrent number CCS of the current time slice is multiplied by the expected service demand growth rate ESGR to obtain the expected concurrent number of services for the service in the next cycle.

[0115] In some embodiments, see Figure 5 , step 300 comprises:

[0116] Step 301: Calculate the expected demand sufficiency rate of the service according to the expected concurrent number of services;

[0117] Expected demand sufficiency rate: Based on the historical data of service concurrent calls and the service concurrency of the most recent cycle, the service demand concurrency of the next cycle is calculated. For example, if a service has 4 service nodes, each node provides 2 concurrency, and the latest predicted maximum service concurrency in the next cycle is 8, then the service provider sufficiency rate is 4×2 / 4=100%.

[0118] Step 302: Calculate the current service provider sufficiency rate of the service according to the current service concurrency number and the current number of service callers;

[0119] Service provider sufficiency rate: the ratio of the number of concurrent services provided by the service provider node to the maximum concurrent number of calls to the service in the most recent statistical period. For example, if a service has 4 service nodes, each node provides a concurrent number of 2, and the maximum concurrent number of services in the most recent statistical period is 4, then the service provider sufficiency rate is 4×2 / 4=200%.

[0120] Step 303: Adjust the number of registered nodes according to the expected demand sufficiency rate and the current service provider sufficiency rate.

[0121] Specifically, the difference between the expected demand adequacy rate of the service and the adequacy rate of the current service provider is calculated, and the difference is compared with parameters such as the lower limit of the expected demand adequacy rate threshold and the upper limit of the expected demand adequacy rate threshold, and a decision is made to increase or decrease the number of registered nodes based on the comparison result.

[0122] In some embodiments, see Figure 6 , step 303 includes:

[0123] Step 3031: when the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is greater than a preset threshold, increase the number of registered nodes;

[0124] The lower limit of the expected demand sufficiency rate threshold reflects the parameter set to reflect the sensitivity of the response to the expected demand changes. When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is less than the threshold, it means that the expected concurrent capacity of the service is insufficient and additional service node registrations are required.

[0125] Step 3032: When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is less than a preset threshold, reduce the number of registered nodes.

[0126] The upper limit of the expected demand sufficiency rate threshold is a parameter set to reflect the sensitivity of the response to expected demand changes. When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is greater than the upper limit, it indicates that there are too many registered nodes for the service and the registered service nodes can be taken offline.

[0127] In some embodiments, see Figure 7 , step 3031 includes:

[0128] Step 30311: sorting the unregistered registered nodes according to the node load rate to generate a first sorting result;

[0129] Step 30312: adding the registered node according to the first sorting result;

[0130] In step 30311 and step 30312, the nodes in the node list are arranged in ascending order according to load rate, and the service nodes that need to be registered are selected from low to high as the priority registration nodes of the service, and the above service nodes of the service are added to the service registration center.

[0131] In some embodiments, see Figure 8 , step 3032 includes:

[0132] Step 30321: Sort the registered nodes according to the node load rate to generate a second sorting result;

[0133] Step 30322: reduce and add the registered nodes according to the second sorting result.

[0134] In step 30321 and step 30322, the nodes in the node list are arranged in descending order according to the load rate, and the service nodes that need to be reduced are selected from high to low as the nodes for taking the service offline. The above-mentioned service nodes of the service are taken offline from the service registration center.

[0135] In a specific implementation, the present invention also provides a specific implementation of a distributed service registration processing method, which specifically includes the following contents.

[0136] Terminology explanation:

[0137] Service: A service is a discoverable, callable, reusable, and encapsulated software resource. Services are explicitly published through standardized service descriptions, and their internal technical implementation is transparent to their consumers.

[0138] Distributed service: implemented through a distributed service framework, generally refers to the use of object-oriented thinking to identify, abstract, and encapsulate business activities, forming a one-to-one mapping to an interface class in a specific program.

[0139] Service node: A group of programs in a distributed system that provide processing logic and can be deployed and run independently. In the entire distributed system, it can collaborate with other services and independently complete business request processing operations.

[0140] Service cluster: In a distributed system, in order to improve the concurrent processing capability of services, multiple nodes are deployed to provide the same set of business service operations. These multiple service-providing nodes form a service cluster. The relationship between a service cluster and service nodes is a one-to-many relationship.

[0141] Registration center: In the distributed technology framework, a type of device that provides distributed service registration, discovery, status monitoring and subscription services, and is used to coordinate the calling process of distributed services.

[0142] Provider: After startup, it registers the service information it provides with the registration center and provides specific service calls.

[0143] Consumers: Subscribe to services from the registry, which will send a list of all provider addresses of the corresponding services to consumers and update it regularly.

[0144] Service provider sufficiency rate: the ratio of the number of concurrent services provided by the service provider node to the maximum number of concurrent calls to the service in the most recent statistical period.

[0145] Expected demand sufficiency rate: Calculate the concurrent service demand for the next cycle based on the historical data of concurrent service calls and the concurrent service number of the most recent cycle.

[0146] Lower limit of expected demand sufficiency rate threshold: This threshold is a parameter set to reflect the sensitivity of the response to expected demand changes. When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is less than this threshold, it means that the expected concurrent capacity of the service is insufficient and additional service node registrations are required.

[0147] Upper limit of expected demand sufficiency rate threshold: This threshold is a parameter set to reflect the sensitivity of the response to expected demand changes. When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is greater than this upper limit, it indicates that there are too many registered nodes for the service and the registered service nodes can be taken offline.

[0148] See also Fig. 9 First, a specific embodiment of the present invention provides a distributed service registration processing system, which includes: a distributed service registration center 1, a service registration coordination center 2, a service monitoring center 3, a service provider 4, a service consumer 5, etc. The above devices and server equipment are connected through a 10G optical fiber / wired network. Specifically:

[0149] The service registration center 1 can be a service cluster deployed with mainstream service registration center middleware, including but not limited to any one of Zookeeper, Nacos, and ETCD, which is used to provide functions such as receiving service registration information provided by the service registration coordination device, maintaining all registered service information in the local cache, continuously monitoring the heartbeat status of each service provider node, maintaining locally available registration service information, providing subscription services for registered services, and synchronizing the status changes of service nodes to subscribed service consumer service nodes in a timely manner to maintain service availability.

[0150] The service registration coordination center 2 is a group of service node clusters used to provide distributed service registration agent, distributed service call trend prediction, distributed service node service registration coordination, distributed service node heartbeat detection and other services.

[0151] The service monitoring center 3 is a group of service node clusters deployed with service call log collection and analysis. The service group uses the service call logs of mobile service consumers, formats the logs, and extracts structured service call history data from the logs to provide basic data for the service call prediction service of the service registration coordination center.

[0152] After startup, the service provider 4 registers the service information it provides with the service registration center 1 and provides freedom to call specific services. For an enterprise application, there can be multiple such service clusters. A service cluster has multiple highly available equivalent service nodes, and each service node exposes the same application service to the outside world.

[0153] Service consumer 5 subscribes to the service from service registration center 1. Service registration center 1 sends a list of all provider addresses of the corresponding service to the consumer and updates it regularly. A service consumer service node will depend on multiple application service provider nodes. Each service that the consumer depends on will maintain a list of service nodes for the service in the local cache.

[0154] On the other hand, see Fig.10 The specific implementation of the present invention also provides a distributed service registration coordination device, which is composed of a service registration agent module 201, a service node management module 202, a service management module 203, a service call frequency prediction module 204, a service registration coordination module 205 and other parts. Specifically:

[0155] The distributed service registration agent module 201 is a distributed service registration agent. The module provides a set of service registration interfaces equivalent to the service registration center 1. The service provider 4 initiates service registration to the service registration center 2 through the internal wired network. The module agent receives the service registration request initiated by the service node, and records including but not limited to service node information, registration service name, method name and parameter type; and according to the service node.

[0156] The service node management module 202 stores and manages basic information of service nodes, service node availability, service node load information, etc. According to the service registration request received by the service registration agent module 201, the service node list of registered services is stored and managed; a heartbeat detection mechanism is established with the service provider 1 node to manage the availability of the service node. When the heartbeat detection fails at the service node, it is judged as a service node failure, and all service information registered by the node is found out, and the service registration coordination module is notified to disconnect the node information from the node list registered by the service in the registration center; the load information of the service node is managed by obtaining the service call status of the current service node from the service monitoring center 3, and the current load rate of each service node is updated according to the service call volume of the service node.

[0157] The service management module 203 stores the basic information of the registered services; the basic information includes the service name, service method, number of concurrent node services, number of service registered nodes, upper limit of expected demand sufficiency rate threshold, lower limit of expected demand sufficiency rate threshold and other information.

[0158] Next, the service management module 203 stores and manages the service list that has been registered and maintains the service status according to the service registration request received by the service registration agent module 201. The service management module 203 obtains the current service concurrency and the expected service concurrency for the service registered in the service registration list by calling the service call frequency monitoring module 204, and calculates the service provider sufficiency rate and the expected demand sufficiency rate according to the number of registered nodes of the local service and the number of node service concurrency, and obtains the difference between the expected demand sufficiency rate and the service provider sufficiency rate of the service. When the difference is less than the lower limit of the expected demand sufficiency rate threshold, it is necessary to increase the service node, and the number of increased service nodes = round up [(service provider sufficiency rate + expected demand sufficiency rate threshold lower limit) × expected service concurrency / node service concurrency - number of registered nodes]; when the difference is greater than the upper limit of the period sufficiency rate threshold, it is necessary to reduce the service node, and the number of reduced service nodes = round down [number of registered nodes - (expected demand sufficiency rate - expected demand sufficiency rate threshold upper limit) × expected service concurrency / node service concurrency]. When adding a service node, the service management module selects a list of nodes that have not yet been registered in the registration center from the service provider service nodes of the service.

[0159] Furthermore, the invention can also select nodes with lower node load rates as priority registration service nodes according to the node load rates of the nodes in the service node list. Call the service registration coordination module 205, and the service registration coordination module adds the above service nodes of the service to the service registration center. For details, see the flow chart of a distributed service registration coordination method provided by the invention (see FIG. Fig.11). When reducing service registration nodes, from the list of registered service nodes, sort them according to the node load rate of each node, and select the node service with the highest load rate to go offline.

[0160] The service call frequency prediction module 204 subscribes to the service monitoring information of the service monitoring center 3, and mainly provides the calculation of the current service concurrency and the expected service concurrency. First, the maximum concurrency of the service in the current time slice, the call growth rate and other information are obtained from the service monitoring center 3; then, the service call frequency historical data, including but not limited to the service call growth rate in the historical period such as the service year, month, day, hour, 30 minutes, 15 minutes, the service related caller growth rate and other information, are used to predict the service call frequency provided by the present invention (such as Fig.12 ), calculate and predict the expected service concurrency of the service in the next cycle through linear regression analysis, and use the expected service concurrency as the basis for calculating the expected service registration demand.

[0161] The service registration coordination module 205 is used to coordinate specific service registrations, manage and start service registration coordination operations, and provide service registration coordination tasks such as registering service nodes with the registration center 1 and delisting service registration nodes. The service registration coordination module 205 coordinates service registrations by regularly starting service registration management operations; when the number of service registration nodes does not meet the expected number of service nodes, the service registration coordination module completes the registration process of the service registration nodes to the registration center; when the number of service registration nodes exceeds the expected demand, the service registration node delisting operation is initiated to the registration center to reduce the number of service provider nodes registered for the service.

[0162] Based on the above-mentioned distributed service registration processing system and distributed service registration coordination device, the specific implementation of the present invention provides a distributed service registration coordination method and a service call frequency prediction method, and the specific implementation methods thereof are respectively referred to in Fig.11 as well as Fig.12 , the distributed service registration coordination method includes:

[0163] Step S301: The service registration coordination module 205 starts the service registration coordination job regularly, and concurrently schedules the service registration management module 203 to group by service, complete the service list that has been registered through the agent, and obtain the registration information of each service in the list, which includes but is not limited to the service name, service method, number of concurrent node services, number of registered service nodes, upper limit of expected demand sufficiency threshold, lower limit of expected demand sufficiency threshold and other information.

[0164] Step S302: For the service list scanned by the above task, call the service call frequency monitoring module 204 according to the service name to obtain the current service concurrency and the expected service concurrency, and calculate the service provider sufficiency rate and the expected demand sufficiency rate according to the number of registered nodes of the local service and the number of node service concurrency.

[0165] Step S303: Based on the calculation result of step S302, calculate the difference between the expected demand adequacy rate of the service and the adequacy rate of the current service provider, and use the difference to compare with parameters such as the lower limit of the expected demand adequacy rate threshold and the upper limit of the expected demand adequacy rate threshold.

[0166] Step S304: If the difference between the expected demand sufficiency rate and the service provider sufficiency rate is greater than the lower limit of the expected demand sufficiency rate threshold, continue to jump to S306; on the contrary, if the difference is less than the lower limit of the expected demand sufficiency rate threshold, it means that the expected demand of the service is close to the threshold, and it is necessary to increase the registered nodes of the service to increase the concurrency of the service. The number of service nodes to be registered = round up [(service provider sufficiency rate + lower limit of expected demand sufficiency rate threshold) × expected service concurrency / node service concurrency - number of registered nodes];

[0167] Step S305: The service management module 203 selects a list of nodes that have not yet registered in the registration center from the service nodes of the service provider, and arranges the nodes in the node list in ascending order according to the load rate through the service node management module 202, and selects the service nodes that need to be registered from low to high as the priority registration nodes of the service. The service registration coordination module 205 adds the above service nodes of the service to the service registration center 2, and continues to execute step S308.

[0168] Step S306: If the difference between the expected demand sufficiency rate and the service provider sufficiency rate is less than the upper limit of the expected demand sufficiency rate threshold, continue to jump to S308. If the difference is greater than the upper limit of the expected demand sufficiency rate threshold, it means that the service nodes registered for the service have far exceeded the expected demand, and the registration of some service nodes can be reduced. The number of service nodes to be reduced = round down [number of registered nodes - (expected demand sufficiency rate - upper limit of expected demand sufficiency rate threshold) × expected service concurrency / node service concurrency];

[0169] Step S307: The service management module 203 selects a list of nodes that have been registered in the registration center from the service nodes that provide the service, and arranges the nodes in the node list in descending order according to the load rate through the service node management module 202, and selects the service nodes that need to be reduced from high to low as the nodes for taking the service offline. The service registration coordination module 205 takes the above-mentioned service nodes of the service offline from the service registration center 2, and continues to execute S308.

[0170] Step S308: The service registration coordination module 205 determines whether the service list scanned by the current job has been completely processed. If not, it jumps to S302 to perform the same process on the next service. If it has been processed, the job goes into sleep and waits for the next batch of service scanning jobs to wake up.

[0171] See also Fig.12 ,The service call frequency prediction method includes the following steps.

[0172] Step S401: the service call frequency prediction module 204 collects and obtains the maximum concurrent number CCS (Current Currency of Service) of each service in the current time slice, the call growth rate and the call relationship data between each service from the service monitoring center 3.

[0173] Step S402: Process and count the above data to form historical data such as the service call growth rate of each service in historical periods such as year, month, day, hour, 30 minutes, 15 minutes, and 5 minutes, recorded as SGR (Service Growth Rate), service caller growth rate CGR (Called Growth Rate) and so on.

[0174] Step S403: By collecting statistics on the historical growth rates of the callers of the service, the influence of the growth rate CGR of each service caller on the service call growth rate is obtained, CGRA = wherein CGR1, CGR2, ..., CGRn are the growth rates of each caller of the service, and A1, A2, ..., An are the proportions of the growth rates of each caller to the growth rate of the service.

[0175] Step S404: By calculating the historical data of service calls, the relationship vector SGRI between the expected increase rate of each service and the historical call growth rate of the service is obtained. For example, the expected growth rate vector of a certain service is SGRI = (YSGR×B1, MSGR×B2, DSGR×B3, ADSGR×B4, TSGR×B5, QSGR×B6, FSGR×B7, CGRA×B8), wherein YSGR, MSGR, DSGR, TSGR, QSGR, FSGR are the service call growth rates in the historical periods of year, month, day, hour, 30 minutes, 15 minutes, 5 minutes, etc., respectively, and B1, B2, B3, B4, B5, B6, B7, B8, etc. are vector parameters of the service growth rate obtained after calculation.

[0176] Step S405: Substituting the time slice and service caller growth rate in the next forecast period into the SGRI vector array, the expected service demand growth rate of the current service in the next period is calculated to be ESGR.

[0177] Step S406: multiply the maximum concurrent number CCS of the current time slice by the expected service demand growth rate ESGR to obtain the expected concurrent number of services for the service in the next cycle.

[0178] From the above description, it can be seen that an embodiment of the present invention provides a distributed service registration processing method, which monitors the service usage frequency of each service provider to identify the call frequency of the called service and the pressure threshold of the service node. And by subscribing to the service node pressure control parameters, the registration center is linked to adjust the number of service nodes registered for high and low frequency services, reduce the number of low frequency services monitored by the service consumer, and reduce the number of services registered by the registration center. Thereby, the utilization rate of the service registration center and the service consumer equipment is optimized. Specifically, the present invention has the following beneficial effects:

[0179] 1. The present invention can significantly reduce the number of registration nodes for low-frequency services in the service registration center, reduce the cache pressure of the service registration center, and improve the registration center's capacity to accommodate service groups.

[0180] 2. The present invention should be able to significantly reduce the amount of cached data of the service consumer's subscription service and reduce the configuration requirements of the service consumer's server, so that the consumer's server has more space for application operation.

[0181] 3. The present invention can dynamically adjust the transaction pressure of each node in the service group by allocating the service registration quantity of each node in the service group, thereby maximizing the utilization rate of the application service node and reducing the server demand.

[0182] Based on the same inventive concept, the embodiments of the present application also provide a distributed service registration processing device, which can be used to implement the methods described in the above embodiments, such as the following embodiments. Since the principle of solving the problem by the distributed service registration processing device is similar to that of the distributed service registration processing method, the implementation of the distributed service registration processing device can refer to the implementation of the distributed service registration processing method, and the repeated parts will not be repeated. As used below, the terms "unit" or "module" can be a combination of software and / or hardware that implements predetermined functions. Although the system described in the following embodiments is preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceived.

[0183] The embodiment of the present invention first provides a specific implementation of a distributed service registration processing device capable of implementing a distributed service registration processing method, see Fig.13 , the distributed service registration processing device specifically includes the following contents:

[0184] An influence proportion determination module 10 is used to determine the influence proportion of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles;

[0185] An expected concurrent number prediction module 20, configured to predict the expected concurrent number of services according to the impact proportion and the service call growth rate in the multiple cycles;

[0186] The registration node quantity adjustment module 30 is used to adjust the number of registration nodes of the service according to the expected service concurrency number and the current service concurrency number.

[0187] In one embodiment, see Fig.14 , the distributed service registration processing device also includes:

[0188] The historical growth rate generating module 40 is used to generate the service call growth rate and the service caller growth rate in the multiple cycles according to the service call historical data.

[0189] In one embodiment, see Fig.15 , the impact proportion determination module 10 includes:

[0190] An impact ratio determination unit 101 is used to determine the impact ratio of the growth rate of each service caller in the multiple periods on the service call growth rate according to the service call history data;

[0191] The impact proportion determining unit 102 is used to determine the impact proportion according to the call relationship data, the impact proportion corresponding to each service caller, and the growth rate of the service caller.

[0192] In one embodiment, see Fig.16 , the expected concurrent number prediction module 20 includes:

[0193] A relationship vector generating unit 201 is used to generate a relationship vector for representing the relationship between the expected service call growth rate and the service call growth rate according to the impact proportion and the service call growth rate in multiple cycles;

[0194] An expected growth rate determining unit 202, configured to determine the expected service call growth rate according to the relationship vector and the service caller growth rate;

[0195] The expected concurrent number prediction unit 203 is used to determine the expected service concurrent number according to the expected service call growth rate.

[0196] In one embodiment, see Fig.17 , the registered node quantity adjustment module 30 includes:

[0197] An expected sufficiency rate calculation unit 301 is used to calculate the expected demand sufficiency rate of the service according to the expected concurrent number of services;

[0198] A current sufficiency rate calculation unit 302 is used to calculate the current service provider sufficiency rate of the service according to the current service concurrency number and the current number of service callers;

[0199] The node number adjustment unit 303 is used to adjust the number of registered nodes according to the expected demand sufficiency rate and the current service provider sufficiency rate.

[0200] In one embodiment, see Fig.18 , the node number adjustment unit 303 includes:

[0201] The node number increasing unit 3031 is used to increase the number of registered nodes when the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is greater than a preset threshold;

[0202] The node number reducing unit 3032 is used to reduce the number of registered nodes when the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is less than a preset threshold.

[0203] In one embodiment, see Fig.19 , the node number adjustment unit 3031 includes:

[0204] The first result generating unit 30311 is used to sort the unregistered registered nodes according to the node load rate to generate a first sorting result;

[0205] A node number increasing subunit 30312 is used to increase the registered nodes according to the first sorting result;

[0206] In one embodiment, see Fig. 20 , the node number reducing unit 3032 includes:

[0207] The second result generating unit 30321 is used to sort the registered nodes according to the node load rate to generate a second sorting result;

[0208] The node number reducing subunit 30322 is used to reduce the number of registered nodes according to the second sorting result.

[0209] From the above description, it can be seen that an embodiment of the present invention provides a distributed service registration processing device, including: first, according to the service call growth rate, service caller growth rate and call relationship data between services under multiple cycles, determine the influence ratio of the service caller growth rate on the service call growth rate; then, predict the expected service concurrency according to the influence ratio and the service call growth rate under multiple cycles; finally, adjust the number of registered nodes of the service according to the expected service concurrency and the current service concurrency. The present invention monitors the service usage frequency of each service provider to identify the call frequency of the called service and the pressure threshold of the service node. And by subscribing to the service node pressure control parameters, the registration center is linked to adjust the number of service nodes registered for high and low frequency services, reduce the number of low frequency services monitored by the service consumer, and reduce the number of services registered by the registration center. Thereby, the utilization rate of the service registration center and the service consumer equipment is optimized.

[0210] The embodiment of the present application also provides a specific implementation of an electronic device that can implement all steps in the distributed service registration processing method in the above embodiment, see Fig.21 , electronic equipment specifically includes the following:

[0211] Processor (processor) 1201, memory (memory) 1202, communication interface (CommunicationsInterface) 1203 and bus 1204;

[0212] The processor 1201, the memory 1202, and the communication interface 1203 communicate with each other through the bus 1204; the communication interface 1203 is used to realize information transmission between the server device and the client device and other related devices;

[0213] The processor 1201 is used to call the computer program in the memory 1202. When the processor executes the computer program, all steps in the distributed service registration processing method in the above embodiment are implemented. For example, when the processor executes the computer program, the following steps are implemented:

[0214] Step 100: Determine the influence ratio of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles;

[0215] Step 200: predicting the expected number of concurrent services according to the impact proportion and the service call growth rate in the multiple cycles;

[0216] Step 300: Adjust the number of registered nodes of the service according to the expected service concurrency number and the current service concurrency number.

[0217] The embodiments of the present application also provide a computer-readable storage medium capable of implementing all the steps in the distributed service registration processing method in the above embodiments. The computer-readable storage medium stores a computer program. When the computer program is executed by a processor, all the steps in the distributed service registration processing method in the above embodiments are implemented. For example, when the processor executes the computer program, the following steps are implemented:

[0218] Each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the hardware + program embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0219] The above is a description of a specific embodiment of the specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recorded in the claims can be performed in an order different from that in the embodiments and still achieve the desired results. In addition, the processes depicted in the drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0220] Although the present application provides method operation steps such as embodiments or flow charts, more or fewer operation steps may be included based on conventional or non-creative labor. The order of steps listed in the embodiments is only one way of executing the order of many steps and does not represent the only execution order. When the actual device or client product is executed, it can be executed in the order of the method shown in the embodiments or the drawings or in parallel (for example, in a parallel processor or multi-threaded processing environment).

[0221] For the convenience of description, the above devices are described in various modules according to their functions. Of course, when implementing the embodiments of this specification, the functions of each module can be implemented in the same or more software and / or hardware, or the module implementing the same function can be implemented by a combination of multiple sub-modules or sub-units. The device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0222] Those skilled in the art also know that, in addition to implementing the controller in a purely computer-readable program code, the controller can be made to implement the same function in the form of logic gates, switches, application-specific integrated circuits, programmable logic controllers, and embedded microcontrollers by logically programming the method steps. Therefore, such a controller can be considered as a hardware component, and the devices for implementing various functions included therein can also be considered as structures within the hardware component. Or even, the devices for implementing various functions can be considered as both software modules for implementing the method and structures within the hardware component.

[0223] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0224] The memory may include non-permanent storage in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.

[0225] The present specification embodiments may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present specification embodiments may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

[0226] Each embodiment in this specification is described in a progressive manner, and the same and similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment. In the description of this specification, the description of the reference terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the embodiment of this specification. In this specification, the schematic representation of the above terms does not necessarily target the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner. In addition, in the absence of contradiction, a person skilled in the art can combine and combine the different embodiments or examples described in this specification and the features of different embodiments or examples.

[0227] The above is only an example of the embodiment of the present specification and is not intended to limit the embodiment of the present specification. For those skilled in the art, the embodiment of the present specification may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the embodiment of the present specification shall be included in the scope of the claims of the embodiment of the present specification.

Claims

1. A distributed service registration processing method, characterized in that: include: Determine the influence proportion of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles; Predicting the expected number of concurrent services according to the impact proportion and the service call growth rate in the multiple cycles; Adjust the number of registered nodes for the service according to the expected number of concurrent services and the current number of concurrent services; Determining the influence proportion of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles includes: Determine, according to the service call history data, the influence ratio of the growth rate of each service caller in the multiple periods on the growth rate of the service call; Determine the impact proportion according to the call relationship data, the impact proportion corresponding to each service caller, and the growth rate of the service caller; Determining the influence ratio of each service caller growth rate on the service call growth rate in the multiple periods according to the service call history data includes: By counting the historical growth rates of the callers that call the service, the influence ratio of the growth rate CGR of each service caller on the service call growth rate is obtained: A1, A2, ..., An; wherein A1, A2, ..., An is the ratio of the growth rate of each caller to the growth rate of the service; The influence proportion is determined according to the call relationship data, the influence proportion corresponding to each service caller, and the growth rate of the service caller, including: The influence ratio is determined according to the following formula: CGRA=∑(CGR1×A1, CGR2×A2,..., CGRn×An); Among them, CGR1, CGR2, ..., CGRn are the growth rates of each caller of the service.

2. The distributed service registration processing method according to claim 1, characterized in that: Also includes: The service call growth rate and the service caller growth rate in the multiple cycles are generated according to the service call history data.

3. The distributed service registration processing method according to claim 1, characterized in that: The predicting the expected number of concurrent services according to the impact proportion and the service call growth rate in the multiple cycles includes: Generate a relationship vector for representing the relationship between the expected service call growth rate and the service call growth rate according to the impact proportion and the service call growth rate in multiple cycles; Determine the expected service call growth rate according to the relationship vector and the service caller growth rate; The expected service concurrency number is determined according to the expected service call growth rate.

4. The distributed service registration processing method according to claim 1, characterized in that: The adjusting the number of registered nodes of a service according to the expected number of concurrent services and the current number of concurrent services includes: Calculate the expected demand sufficiency rate of the service based on the expected number of concurrent services; Calculate the current service provider sufficiency rate of the service according to the current service concurrency number and the current number of service callers; The number of registered nodes is adjusted according to the expected demand sufficiency rate and the current service provider sufficiency rate.

5. The distributed service registration processing method according to claim 4, characterized in that: The adjusting the number of registered nodes according to the expected demand sufficiency rate and the current service provider sufficiency rate includes: When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is greater than a preset threshold, increasing the number of registered nodes; When the difference between the expected demand sufficiency rate and the current service provider sufficiency rate is less than a preset threshold, the number of registered nodes is reduced.

6. The distributed service registration processing method according to claim 5, characterized in that: The adding of the registration node comprises: Sorting the unregistered registered nodes according to the node load rate to generate a first sorting result; Add the registered node according to the first sorting result; The reducing the registered nodes comprises: Sorting the registered nodes according to the node load rate to generate a second sorting result; The registered nodes are reduced and added according to the second sorting result.

7. A distributed service registration processing device, characterized in that: include: An impact ratio determination module, used to determine the impact ratio of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles; An expected concurrent number prediction module, used to predict the expected concurrent number of services according to the impact proportion and the service call growth rate in the multiple cycles; A registration node quantity adjustment module, used to adjust the number of registration nodes of a service according to the expected service concurrency number and the current service concurrency number; Determining the influence proportion of the service caller growth rate on the service call growth rate according to the service call growth rate, the service caller growth rate and the call relationship data between the services in multiple cycles includes: Determine, according to the service call history data, the influence ratio of the growth rate of each service caller in the multiple periods on the growth rate of the service call; Determine the impact proportion according to the call relationship data, the impact proportion corresponding to each service caller, and the growth rate of the service caller; Determining the influence ratio of each service caller growth rate on the service call growth rate in the multiple periods according to the service call history data includes: By counting the historical growth rates of the callers that call the service, the influence ratio of the growth rate CGR of each service caller on the service call growth rate is obtained: A1, A2, ..., An; wherein A1, A2, ..., An is the ratio of the growth rate of each caller to the growth rate of the service; The influence proportion is determined according to the call relationship data, the influence proportion corresponding to each service caller, and the growth rate of the service caller, including: The influence ratio is determined according to the following formula: CGRA=∑(CGR1×A1, CGR2×A2,..., CGRn×An); Among them, CGR1, CGR2, ..., CGRn are the growth rates of each caller of the service.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, the steps of the distributed service registration processing method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the distributed service registration processing method described in any one of claims 1 to 6 are implemented.

Citation Information

Patent Citations

  • Call chain-based concurrency control method, device, and control node

    CN108633311A

  • Database scheduling method and system based on historical service flow

    CN111782386A

  • Distributed service calling method and device

    CN112910708A

  • Micro-service publishing method and device, storage medium and electronic equipment

    CN114968286A

  • Service registration method, usage method and relevant apparatus

    WO2017012383A1