CN113132133B - Method, device, computing equipment and storage medium for distributing user configuration data - Google Patents
Method, device, computing equipment and storage medium for distributing user configuration data Download PDFInfo
- Publication number
- CN113132133B CN113132133B CN201911406140.8A CN201911406140A CN113132133B CN 113132133 B CN113132133 B CN 113132133B CN 201911406140 A CN201911406140 A CN 201911406140A CN 113132133 B CN113132133 B CN 113132133B
- Authority
- CN
- China
- Prior art keywords
- response time
- service node
- time data
- service
- calculating
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/63—Routing a service request depending on the request content or context
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The embodiment of the invention relates to the technical field of communication, and discloses a method, a device, computing equipment and a storage medium for distributing user configuration data, wherein the method comprises the following steps: acquiring response time data of a service request corresponding to each service node; determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node; calculating the calculation force proportion of each service node according to the estimation value; and distributing service requests to the corresponding service nodes according to the calculated force proportion. By means of the method, the device and the system, selection decision-making efficiency of the service node can be improved, hardware purchased in different periods can be effectively utilized, and investment benefits of enterprises are improved.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a method, a device, computing equipment and a storage medium for distributing user configuration data.
Background
The distribution of the existing Embedded subscriber identity module (eSIM) user configuration data mostly adopts an average distribution strategy, a polling strategy, a random distribution strategy and the like.
Because the distribution of eSIM user configuration data is a massive request for a service end and a low-frequency request for a user end, the prior art scheme has the problems of multiple polling, large client experience difference, longer service decision time than service response time and the like.
Disclosure of Invention
In view of the foregoing, embodiments of the present invention provide a method, apparatus, computing device, and storage medium for distributing user configuration data, which overcome or at least partially solve the foregoing problems.
According to an aspect of an embodiment of the present invention, there is provided a method of distributing user configuration data, the method comprising: acquiring response time data of a service request corresponding to each service node; determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node; calculating the calculation force proportion of each service node according to the estimation value; and distributing service requests to the corresponding service nodes according to the calculated force proportion.
In an optional manner, the obtaining response time data of the service request corresponding to each service node includes: acquiring a service request of each service node eSIM configuration data; and recording response time data corresponding to each service request.
In an alternative manner, the determining the preset number of response time data of each service node according to the time sequence includes: and selecting the preset number of response time data closest to the current time according to the time sequence for each service node.
In an optional manner, the calculating an estimated value of the response time data corresponding to each service node includes: and calculating a weighted average value of the preset number of response time data corresponding to each service node, wherein the weight of the response time data and the distance between the response time data and the current time are in a negative correlation.
In an optional manner, the calculating an estimated value of the response time data corresponding to each service node includes: calculating an estimated value of the response time data corresponding to each service node according to the following formula;
T n,x ＝(t n,m-x+1 +…+(X-2)*t n,m-2 +(X-1)*t n,m-1 +X*t n,m ) /(1+2+3+ … +X), where t n,m For the most recent response time data of the nth service node, X is a preset number, T n,x And (3) for the estimated value of the response time data of the nth service node, n and m are natural numbers.
In an alternative manner, the calculating the calculation force proportion of each service node according to the estimation value includes: calculating the calculation force proportion of each service node according to the estimated value and the following formula;
P n ＝T n,x /(T 1,x +T 2,x +…+T n,x ) Wherein P is n For the calculation force proportion of the nth service node, X is a preset quantity, T n,x And (c) for the estimated value of the response time data of the nth service node, n is a natural number.
In an optional manner, the distributing the service request to the corresponding service node according to the computing power proportion includes: arranging the calculation ratios according to a specified sequence, and sequentially distributing a specified number of service requests to the service nodes according to the sequence; the calculated force proportion and the appointed number are in positive correlation.
According to another aspect of an embodiment of the present invention, there is provided an apparatus for distributing user configuration data, the apparatus including: the data acquisition unit is used for acquiring response time data of the service request corresponding to each service node; an estimated value obtaining unit, configured to determine a preset number of response time data of each service node according to a time sequence, and calculate an estimated value of the response time data corresponding to each service node; a proportion calculating unit, configured to calculate a calculation force proportion of each service node according to the estimated value; and the request distribution unit is used for distributing service requests to the corresponding service nodes according to the calculation force proportion.
According to another aspect of an embodiment of the present invention, there is provided a computing device including: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
the memory is configured to store at least one executable instruction that causes the processor to perform the steps of the method of distributing user configuration data described above.
According to yet another aspect of the embodiments of the present invention, there is provided a computer storage medium having stored therein at least one executable instruction for causing the processor to perform the steps of the above method of distributing user configuration data.
The embodiment of the invention obtains the response time data of the service request corresponding to each service node; determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node; calculating the calculation force proportion of each service node according to the estimation value; and distributing service requests to the corresponding service nodes according to the calculation force proportion, so that the selection decision-making efficiency of the service nodes can be improved, hardware purchased in different periods can be effectively utilized, and the investment income of enterprises is improved.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and may be implemented according to the content of the specification, so that the technical means of the embodiments of the present invention can be more clearly understood, and the following specific embodiments of the present invention are given for clarity and understanding.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to designate like parts throughout the figures. In the drawings:
FIG. 1 is a flow chart illustrating a method for distributing user configuration data according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an apparatus for distributing user configuration data according to an embodiment of the present invention;
FIG. 3 illustrates a schematic diagram of a computing device provided by an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present invention are shown in the drawings, it should be understood that the present invention may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
Fig. 1 is a flow chart illustrating a method for distributing user configuration data according to an embodiment of the present invention. As shown in fig. 1, the method for distributing user configuration data includes:
step S11: response time data of the service request corresponding to each service node is obtained.
In the embodiment of the invention, the number of the service nodes is uncertain, the calculation power of each service node can be the same or different, each service node can be off-line at any time, can be on-line at any time, and is registered with a decision server, the network condition of each service node is different, and the eSIM configuration data of eSIM users required to be issued in response to each service request is different.
In step S11, a service request of each service node eSIM configuration data is obtained; and recording response time data corresponding to each service request. For example, among n service nodes, response time data of m service requests of each service node is as follows:
wherein t is n,m And the mth response time data is the nth service node, and n and m are positive integers.
Step S12: and determining a preset number of response time data of each service node according to the time sequence, and calculating an estimated value of the response time data corresponding to each service node.
Specifically, for each service node, selecting the preset number of response time data closest to the current time according to a time sequence. And calculating a weighted average value of the preset number of response time data corresponding to each service node, wherein the weight of the response time data and the distance between the response time data and the current time are in a negative correlation. That is, the closer the response time data is to the current time, i.e., the closer to the current time, the greater the weight of the response time data. Calculating an estimated value of the response time data corresponding to each service node according to the following formula:
T n,x ＝(t n,m-x+1 +…+(X-2)*t n,m-2 +(X-1)*t n,m-1 +X*t n,m )/(1+2+3+…+X)，
wherein t is n,m For the most recent response time data of the nth service node, X is a preset number, T n,x And (3) for the estimated value of the response time data of the nth service node, n and m are natural numbers. X, X-1 and X-2 are weights corresponding to the response time data, and the response time data is larger when the response time data is closer to the current time, so that the influence of single impulse noise on the estimated value can be reduced.
Step S13: and calculating the calculation force proportion of each service node according to the estimation value.
Specifically, the calculated force ratio of any one service node is the ratio of the estimated value of that service node to the sum of the estimated values of all service nodes. According to the estimated value, calculating the calculation ratio example of each service node according to the following formula:
P n ＝T n,x /(T 1,x +T 2,x +…+T n,x )，
wherein P is n For the calculated force proportion of the nth service node, X isPreset number T n,x And (c) for the estimated value of the response time data of the nth service node, n is a natural number.
Step S14: and distributing service requests to the corresponding service nodes according to the calculated force proportion.
Specifically, the calculation ratios are arranged according to a specified sequence, and a specified number of service requests are sequentially distributed to the service nodes according to the sequence. The calculated force proportion and the appointed number are in positive correlation. The greater the computational power proportion of the service node, the greater the specified number of service requests allocated to the service node, thereby enabling a request allocation decision. The request allocation decision in the embodiment of the invention is a front-end service performance estimation strategy, when receiving an eSIM user configuration data request downloaded by a user terminal, a service node is selected, and even if the hardware conditions of all the service nodes are different and the network environment is different, the eSIM user configuration data allocation service with basically consistent performance can be provided for the client terminal, and the request allocation decision is irrelevant to the terminal trust problem, the transmission security problem, the storage security problem, the data deletion security problem and the security problem of a switching operator.
In the embodiment of the invention, when the service nodes are added or deleted or the network is unstable, each time a service request is received, the calculation ratio of each service node is recalculated, and the service request is distributed according to the calculation ratio. When the number of the service nodes is stable and the network is also stable, the calculation force proportion of each service node is not required to be repeatedly calculated, and the service request is directly distributed according to the calculated calculation force proportion of each service node. The embodiment of the invention can effectively solve the fluctuation problem of algorithms such as the current average allocation strategy, the polling strategy, the random allocation strategy and the like through actual tests, effectively reduces the problem of larger service response time data fluctuation caused by different service node hardware conditions and network conditions, ensures that the load of each service node is relatively stable, does not cause the phenomenon of crowding of node service with strong calculation power, effectively utilizes the purchased hardware in different periods through estimation, improves the investment income of enterprises, and quickens the selection decision-making efficiency of the service nodes.
The embodiment of the invention obtains the response time data of the service request corresponding to each service node; determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node; calculating the calculation force proportion of each service node according to the estimation value; and distributing service requests to the corresponding service nodes according to the calculation force proportion, so that the selection decision-making efficiency of the service nodes can be improved, hardware purchased in different periods can be effectively utilized, and the investment income of enterprises is improved.
Fig. 2 is a schematic structural diagram showing an apparatus for distributing user configuration data according to an embodiment of the present invention. As shown in fig. 2, the apparatus for distributing user configuration data includes: a data acquisition unit 201, an estimation value acquisition unit 202, a proportion calculation unit 203, and a request distribution unit 204. Wherein:
the data acquisition unit 201 is configured to acquire response time data of a service request corresponding to each service node; the estimated value obtaining unit 202 is configured to determine a preset number of response time data of each service node according to a time sequence, and calculate an estimated value of the response time data corresponding to each service node; the proportion calculating unit 203 is configured to calculate a calculation force proportion of each service node according to the estimation value; the request allocation unit 204 is configured to allocate a service request to the corresponding service node according to the computing power proportion.
In an alternative way, the data acquisition unit 201 is configured to: acquiring a service request of each service node eSIM configuration data; and recording response time data corresponding to each service request.
In an alternative way, the estimation value obtaining unit 202 is configured to: and selecting the preset number of response time data closest to the current time according to the time sequence for each service node.
In an alternative way, the estimation value obtaining unit 202 is configured to: and calculating a weighted average value of the preset number of response time data corresponding to each service node, wherein the weight of the response time data and the distance between the response time data and the current time are in a negative correlation.
In an alternative way, the estimation value obtaining unit 202 is configured to: calculating an estimated value of the response time data corresponding to each service node according to the following formula;
T n,x ＝(t n,m-x+1 +…+(X-2)*t n,m-2 +(X-1)*t n,m-1 +X*t n,m )/(1+2+3+…+X)，
wherein t is n,m For the most recent response time data of the nth service node, X is a preset number, T n,x And (3) for the estimated value of the response time data of the nth service node, n and m are natural numbers.
In an alternative way, the proportion calculation unit 203 is configured to: calculating the calculation force proportion of each service node according to the estimated value and the following formula;
P n ＝T n,x /(T 1,x +T 2,x +…+T n,x )，
wherein P is n For the calculation force proportion of the nth service node, X is a preset quantity, T n,x And (c) for the estimated value of the response time data of the nth service node, n is a natural number.
In an alternative way, the request allocation unit 204 is configured to: arranging the calculation ratios according to a specified sequence, and sequentially distributing a specified number of service requests to the service nodes according to the sequence; the calculated force proportion and the appointed number are in positive correlation.
The embodiment of the invention obtains the response time data of the service request corresponding to each service node; determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node; calculating the calculation force proportion of each service node according to the estimation value; and distributing service requests to the corresponding service nodes according to the calculation force proportion, so that the selection decision-making efficiency of the service nodes can be improved, hardware purchased in different periods can be effectively utilized, and the investment income of enterprises is improved.
Embodiments of the present invention provide a non-volatile computer storage medium having stored thereon at least one executable instruction for performing the method of distributing user configuration data in any of the method embodiments described above.
The executable instructions may be particularly useful for causing a processor to:
acquiring response time data of a service request corresponding to each service node;
determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node;
calculating the calculation force proportion of each service node according to the estimation value;
and distributing service requests to the corresponding service nodes according to the calculated force proportion.
In one alternative, the executable instructions cause the processor to:
acquiring a service request of each service node eSIM configuration data; and recording response time data corresponding to each service request.
In one alternative, the executable instructions cause the processor to:
and selecting the preset number of response time data closest to the current time according to the time sequence for each service node.
In one alternative, the executable instructions cause the processor to:
and calculating a weighted average value of the preset number of response time data corresponding to each service node, wherein the weight of the response time data and the distance between the response time data and the current time are in a negative correlation.
In one alternative, the executable instructions cause the processor to:
calculating an estimated value of the response time data corresponding to each service node according to the following formula;
T n,x ＝(t n,m-x+1 +…+(X-2)*t n,m-2 +(X-1)*t n,m-1 +X*t n,m )/(1+2+3+…+X)，
wherein t is n,m For the response time data of the nth service node, X is a preset number, T n,x And (3) for the estimated value of the response time data of the nth service node, n and m are natural numbers.
In one alternative, the executable instructions cause the processor to:
calculating the calculation force proportion of each service node according to the estimated value and the following formula;
P n ＝T n,x /(T 1,x +T 2,x +…+T n,x )，
wherein P is n For the calculation force proportion of the nth service node, X is a preset quantity, T n,x And (c) for the estimated value of the response time data of the nth service node, n is a natural number.
In one alternative, the executable instructions cause the processor to:
arranging the calculation ratios according to a specified sequence, and sequentially distributing a specified number of service requests to the service nodes according to the sequence; the calculated force proportion and the appointed number are in positive correlation.
The embodiment of the invention obtains the response time data of the service request corresponding to each service node; determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node; calculating the calculation force proportion of each service node according to the estimation value; and distributing service requests to the corresponding service nodes according to the calculation force proportion, so that the selection decision-making efficiency of the service nodes can be improved, hardware purchased in different periods can be effectively utilized, and the investment income of enterprises is improved.
An embodiment of the present invention provides a computer program product comprising a computer program stored on a computer storage medium, the computer program comprising program instructions which, when executed by a computer, cause the computer to perform the method of distributing user configuration data in any of the method embodiments described above.
The executable instructions may be particularly useful for causing a processor to:
acquiring response time data of a service request corresponding to each service node;
determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node;
calculating the calculation force proportion of each service node according to the estimation value;
and distributing service requests to the corresponding service nodes according to the calculated force proportion.
In one alternative, the executable instructions cause the processor to:
acquiring a service request of each service node eSIM configuration data; and recording response time data corresponding to each service request.
In one alternative, the executable instructions cause the processor to:
and selecting the preset number of response time data closest to the current time according to the time sequence for each service node.
In one alternative, the executable instructions cause the processor to:
and calculating a weighted average value of the preset number of response time data corresponding to each service node, wherein the weight of the response time data and the distance between the response time data and the current time are in a negative correlation.
In one alternative, the executable instructions cause the processor to:
calculating an estimated value of the response time data corresponding to each service node according to the following formula;
T n,x ＝(t n,m-x+1 +…+(X-2)*t n,m-2 +(X-1)*t n,m-1 +X*t n,m )/(1+2+3+…+X)，
wherein t is n,m For the response time data of the nth service node, X is a preset number, T n,x And (3) for the estimated value of the response time data of the nth service node, n and m are natural numbers.
In one alternative, the executable instructions cause the processor to:
calculating the calculation force proportion of each service node according to the estimated value and the following formula;
P n ＝T n,x /(T 1,x +T 2,x +…+T n,x )，
wherein P is n For the calculation force proportion of the nth service node, X is a preset quantity, T n,x And (c) for the estimated value of the response time data of the nth service node, n is a natural number.
In one alternative, the executable instructions cause the processor to:
arranging the calculation ratios according to a specified sequence, and sequentially distributing a specified number of service requests to the service nodes according to the sequence; the calculated force proportion and the appointed number are in positive correlation.
The embodiment of the invention obtains the response time data of the service request corresponding to each service node; determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node; calculating the calculation force proportion of each service node according to the estimation value; and distributing service requests to the corresponding service nodes according to the calculation force proportion, so that the selection decision-making efficiency of the service nodes can be improved, hardware purchased in different periods can be effectively utilized, and the investment income of enterprises is improved.
FIG. 3 illustrates a schematic diagram of a computing device according to an embodiment of the present invention, and the embodiment of the present invention is not limited to the specific implementation of the device.
As shown in fig. 3, the computing device may include: a processor (processor) 302, a communication interface (Communications Interface) 304, a memory (memory) 306, and a communication bus 308.
Wherein: processor 302, communication interface 304, and memory 306 perform communication with each other via communication bus 308. A communication interface 304 for communicating with network elements of other devices, such as clients or other servers. Processor 302 is configured to execute program 310 and may specifically perform the relevant steps of the method embodiments for distributing user configuration data described above.
In particular, program 310 may include program code including computer-operating instructions.
The processor 302 may be a central processing unit CPU, or a specific integrated circuit ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present invention. The device includes one or each processor, which may be the same type of processor, such as one or each CPU; but may also be different types of processors such as one or each CPU and one or each ASIC.
Memory 306 for storing programs 310. Memory 306 may comprise high-speed RAM memory or may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
Program 310 may be specifically operable to cause processor 302 to:
acquiring response time data of a service request corresponding to each service node;
determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node;
calculating the calculation force proportion of each service node according to the estimation value;
and distributing service requests to the corresponding service nodes according to the calculated force proportion.
In an alternative, the program 310 causes the processor to:
acquiring a service request of each service node eSIM configuration data; and recording response time data corresponding to each service request.
In an alternative, the program 310 causes the processor to:
and selecting the preset number of response time data closest to the current time according to the time sequence for each service node.
In an alternative, the program 310 causes the processor to:
and calculating a weighted average value of the preset number of response time data corresponding to each service node, wherein the weight of the response time data and the distance between the response time data and the current time are in a negative correlation.
In an alternative, the program 310 causes the processor to:
calculating an estimated value of the response time data corresponding to each service node according to the following formula;
T n,x ＝(t n,m-x+1 +…+(X-2)*t n,m-2 +(X-1)*t n,m-1 +X*t n,m )/(1+2+3+…+X)，
wherein t is n,m For the response time data of the nth service node, X is a preset number, T n,x And (3) for the estimated value of the response time data of the nth service node, n and m are natural numbers.
In an alternative, the program 310 causes the processor to:
calculating the calculation force proportion of each service node according to the estimated value and the following formula;
P n ＝T n,x /(T 1,x +T 2,x +…+T n,x )，
wherein P is n For the calculation force proportion of the nth service node, X is a preset quantity, T n,x And (c) for the estimated value of the response time data of the nth service node, n is a natural number.
In an alternative, the program 310 causes the processor to:
arranging the calculation ratios according to a specified sequence, and sequentially distributing a specified number of service requests to the service nodes according to the sequence; the calculated force proportion and the appointed number are in positive correlation.
The embodiment of the invention obtains the response time data of the service request corresponding to each service node; determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node; calculating the calculation force proportion of each service node according to the estimation value; and distributing service requests to the corresponding service nodes according to the calculation force proportion, so that the selection decision-making efficiency of the service nodes can be improved, hardware purchased in different periods can be effectively utilized, and the investment income of enterprises is improved.
The algorithms or displays presented herein are not inherently related to any particular computer, virtual system, or other apparatus. Various general-purpose systems may also be used with the teachings herein. The required structure for a construction of such a system is apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It will be appreciated that the teachings of the present invention described herein may be implemented in a variety of programming languages, and the above description of specific languages is provided for disclosure of enablement and best mode of the present invention.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the above description of exemplary embodiments of the invention, various features of the embodiments of the invention are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be construed as reflecting the intention that: i.e., the claimed invention requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this invention.
Those skilled in the art will appreciate that the modules in the apparatus of the embodiments may be adaptively changed and disposed in one or more apparatuses different from the embodiments. The modules or units or components of the embodiments may be combined into one module or unit or component and, furthermore, they may be divided into a plurality of sub-modules or sub-units or sub-components. Any combination of all features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or units of any method or apparatus so disclosed, may be used in combination, except insofar as at least some of such features and/or processes or units are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings), may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features but not others included in other embodiments, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, in the following claims, any of the claimed embodiments can be used in any combination.
It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In the unit claims enumerating several means, several of these means may be embodied by one and the same item of hardware. The use of the words first, second, third, etc. do not denote any order. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specifically stated.
Claims (7)
1. A method of distributing user configuration data, comprising:
acquiring response time data of a service request corresponding to each service node;
determining a preset number of response time data of each service node according to a time sequence, and calculating an estimated value of the response time data corresponding to each service node, wherein the method comprises the following steps: for each service node, calculating a weighted average value of the preset number of response time data corresponding to the service node, wherein the weight of the response time data and the distance between the response time data and the current time are in a negative correlation;
calculating an estimated value of the response time data corresponding to each service node according to the following formula;
T n,x ＝(t n,m-x+1 +…+(X-2)*t n,m-2 +(X-1)*t n,m-1 +X*t n,m )/(1+2+3+…+X)；
wherein t is n,m For the most recent response time data of the nth service node, X is a preset number, T n,x For the estimated value of the response time data of the nth service node, n and m are natural numbers; x, X-1 and X-2 are weighted averages corresponding to the response time data;
calculating the calculation force proportion of each service node according to the estimation value;
distributing service requests to the corresponding service nodes according to the calculation force proportion, wherein the service requests comprise: arranging the calculation ratios according to a specified sequence, and sequentially distributing a specified number of service requests to the service nodes according to the sequence; the calculated force proportion and the appointed number are in positive correlation.
2. The method according to claim 1, wherein the obtaining response time data of the service request corresponding to each service node includes:
acquiring a service request of each service node eSIM configuration data; and recording response time data corresponding to each service request.
3. The method of claim 1, wherein determining a predetermined number of response time data for each of the service nodes in a time sequence comprises:
and selecting the preset number of response time data closest to the current time according to the time sequence for each service node.
4. The method of claim 1, wherein said calculating a calculated force ratio for each of said service nodes based on said estimates comprises:
calculating the calculation force proportion of each service node according to the estimated value and the following formula;
P n ＝T n,x /(T 1,x +T 2,x +…+T n,x )；
wherein P is n For the calculation force proportion of the nth service node, X is a preset quantity, T n,x And (c) for the estimated value of the response time data of the nth service node, n is a natural number.
5. An apparatus for distributing user configuration data, the apparatus comprising:
the data acquisition unit is used for acquiring response time data of the service request corresponding to each service node;
an estimated value obtaining unit, configured to determine a preset number of response time data of each service node according to a time sequence, and calculate an estimated value of the response time data corresponding to each service node, where the estimated value obtaining unit includes: for each service node, calculating a weighted average value of the preset number of response time data corresponding to the service node, wherein the weight of the response time data and the distance between the response time data and the current time are in a negative correlation;
calculating an estimated value of the response time data corresponding to each service node according to the following formula;
T n,x ＝(t n,m-x+1 +…+(X-2)*t n,m-2 +(X-1)*t n,m-1 +X*t n,m )/(1+2+3+…+X)；
wherein t is n,m For the most recent response time data of the nth service node, X is a preset number, T n,x For the estimated value of the response time data of the nth service node, n and m are natural numbers; x, X-1 and X-2 are weighted averages corresponding to the response time data;
a proportion calculating unit, configured to calculate a calculation force proportion of each service node according to the estimated value;
a request distribution unit, configured to distribute a service request to the corresponding service node according to the computing power proportion, including: arranging the calculation ratios according to a specified sequence, and sequentially distributing a specified number of service requests to the service nodes according to the sequence; the calculated force proportion and the appointed number are in positive correlation.
6. A computing device, comprising: the device comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete communication with each other through the communication bus;
the memory is configured to hold at least one executable instruction that causes the processor to perform the steps of the method of distributing user configuration data according to any one of claims 1-4.
7. A computer storage medium having stored therein at least one executable instruction for causing a processor to perform the steps of the method of distributing user configuration data according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911406140.8A CN113132133B (en) | 2019-12-31 | 2019-12-31 | Method, device, computing equipment and storage medium for distributing user configuration data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911406140.8A CN113132133B (en) | 2019-12-31 | 2019-12-31 | Method, device, computing equipment and storage medium for distributing user configuration data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113132133A CN113132133A (en) | 2021-07-16 |
| CN113132133B true CN113132133B (en) | 2023-08-15 |
Family
ID=76768703
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911406140.8A Active CN113132133B (en) | 2019-12-31 | 2019-12-31 | Method, device, computing equipment and storage medium for distributing user configuration data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113132133B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7631034B1 (en) * | 2008-09-18 | 2009-12-08 | International Business Machines Corporation | Optimizing node selection when handling client requests for a distributed file system (DFS) based on a dynamically determined performance index |
| CN105897838A (en) * | 2015-12-07 | 2016-08-24 | 乐视云计算有限公司 | Network service node selection method and device |
| CN105897836A (en) * | 2015-12-07 | 2016-08-24 | 乐视云计算有限公司 | Back source request processing method and device |
| CN106020732A (en) * | 2016-05-27 | 2016-10-12 | 乐视控股（北京）有限公司 | Node disk space determining method and system |
| US9559900B1 (en) * | 2013-06-13 | 2017-01-31 | Amazon Technologies, Inc. | Dedicated endpoints for network-accessible services |
| CN107196869A (en) * | 2017-07-14 | 2017-09-22 | 北京知道创宇信息技术有限公司 | The adaptive load balancing method, apparatus and system of Intrusion Detection based on host actual loading |
| CN110311987A (en) * | 2019-07-24 | 2019-10-08 | 中南民族大学 | Node scheduling method, apparatus, equipment and the storage medium of microserver |
| CN110532092A (en) * | 2019-08-21 | 2019-12-03 | 云湾科技(嘉兴)有限公司 | Reso urce matching method, device and equipment |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8037197B2 (en) * | 2007-10-26 | 2011-10-11 | International Business Machines Corporation | Client-side selection of a server |
| US10581745B2 (en) * | 2017-12-11 | 2020-03-03 | International Business Machines Corporation | Dynamic throttling thresholds |
-
2019
- 2019-12-31 CN CN201911406140.8A patent/CN113132133B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7631034B1 (en) * | 2008-09-18 | 2009-12-08 | International Business Machines Corporation | Optimizing node selection when handling client requests for a distributed file system (DFS) based on a dynamically determined performance index |
| US9559900B1 (en) * | 2013-06-13 | 2017-01-31 | Amazon Technologies, Inc. | Dedicated endpoints for network-accessible services |
| CN105897838A (en) * | 2015-12-07 | 2016-08-24 | 乐视云计算有限公司 | Network service node selection method and device |
| CN105897836A (en) * | 2015-12-07 | 2016-08-24 | 乐视云计算有限公司 | Back source request processing method and device |
| CN106020732A (en) * | 2016-05-27 | 2016-10-12 | 乐视控股（北京）有限公司 | Node disk space determining method and system |
| CN107196869A (en) * | 2017-07-14 | 2017-09-22 | 北京知道创宇信息技术有限公司 | The adaptive load balancing method, apparatus and system of Intrusion Detection based on host actual loading |
| CN110311987A (en) * | 2019-07-24 | 2019-10-08 | 中南民族大学 | Node scheduling method, apparatus, equipment and the storage medium of microserver |
| CN110532092A (en) * | 2019-08-21 | 2019-12-03 | 云湾科技(嘉兴)有限公司 | Reso urce matching method, device and equipment |
Non-Patent Citations (1)
| Title |
|---|
| Optimal Power Allocation and Load Distribution for Multiple Heterogeneous Multicore Server Processors across Clouds and Data Centers;Junwei Cao；等;《IEEE Transactions on Computers 》;第63卷(第1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113132133A (en) | 2021-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11159406B2 (en) | Load balancing web service by rejecting connections | |
| CN103716251B (en) | For the load-balancing method and equipment of content distributing network | |
| EP2335154B1 (en) | Distributed data processing system | |
| CN108933829A (en) | A kind of load-balancing method and device | |
| CN110233866B (en) | Load balancing method and load balancer | |
| CN112506643A (en) | Load balancing method and device of distributed system and electronic equipment | |
| US8813087B2 (en) | Managing a workload in a cluster of computing systems with multi-type operational resources | |
| CN110933136A (en) | Service node selection method, device, equipment and readable storage medium | |
| CN108259603A (en) | A kind of load-balancing method and device | |
| CN114095567B (en) | Data access request processing method and device, computer equipment and medium | |
| CN110198267B (en) | Traffic scheduling method, system and server | |
| Vashistha et al. | Comparative study of load balancing algorithms | |
| CN111385328B (en) | Service request processing method, system and electronic equipment | |
| CN113132133B (en) | Method, device, computing equipment and storage medium for distributing user configuration data | |
| CN112187924B (en) | Service request method, device, equipment and computer storage medium | |
| CN114003337A (en) | Access request distribution method and device | |
| CN108111567A (en) | Realize the uniform method and system of server load | |
| CN114615276B (en) | Domain name scheduling method and device for content distribution network | |
| CN108200185B (en) | Method and device for realizing load balance | |
| CN116302534A (en) | Method, device, equipment and medium for optimizing performance of server storage equipment | |
| CN111858014A (en) | Resource allocation method and device | |
| Birke et al. | Power of redundancy: Designing partial replication for multi-tier applications | |
| CN108600308A (en) | Data uploading method, device, storage medium and server | |
| CN114489463A (en) | Method and device for dynamically adjusting QOS (quality of service) of storage volume and computing equipment | |
| CN113783919A (en) | Access request distribution method, system, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |