CN113132133A - 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
- CN113132133A CN113132133A CN201911406140.8A CN201911406140A CN113132133A CN 113132133 A CN113132133 A CN 113132133A CN 201911406140 A CN201911406140 A CN 201911406140A CN 113132133 A CN113132133 A CN 113132133A
- Authority
- CN
- China
- Prior art keywords
- service
- response time
- time data
- service node
- estimated value
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 230000004044 response Effects 0.000 claims abstract description 129
- 238000004891 communication Methods 0.000 claims abstract description 16
- 238000004364 calculation method Methods 0.000 claims description 46
- 230000000875 corresponding effect Effects 0.000 claims 13
- 230000002596 correlated effect Effects 0.000 claims 2
- 238000005516 engineering process Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 4
- 238000004590 computer program Methods 0.000 description 3
- 238000011156 evaluation Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
本发明实施例涉及通信技术领域，公开了一种分发用户配置数据的方法、装置、计算设备及存储介质，该方法包括：获取每个服务节点对应的服务请求的响应时间数据；按照时间顺序确定每个所述服务节点的预设数量个响应时间数据，并计算每个所述服务节点对应的所述响应时间数据的估算值；根据所述估算值计算每个所述服务节点的算力比例；根据所述算力比例向对应的所述服务节点分配服务请求。通过上述方式，本发明实施例能够加快服务节点的选择决策效率，有效利用不同时期采购的硬件，提升企业投资收益。
Embodiments of the present invention relate to the field of communication technologies, and disclose a method, device, computing device and storage medium for distributing user configuration data. The method includes: acquiring response time data of a service request corresponding to each service node; determining in chronological order a preset number of response time data for each of the service nodes, and calculate the estimated value of the response time data corresponding to each of the service nodes; calculate the computing power ratio of each of the service nodes according to the estimated value ; Allocate service requests to the corresponding service nodes according to the computing power ratio. In the above manner, the embodiments of the present invention can speed up the selection and decision-making efficiency of service nodes, effectively utilize hardware purchased in different periods, and improve the investment income of enterprises.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a method and a device for distributing user configuration data, computing equipment and a storage medium.
Background
Distribution of 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 the eSIM user configuration data is a massive request for the service end and a low-frequency request for the user end, the existing technical scheme has the problems of multiple polling, large difference in client experience, even service decision time longer than service response time and the like.
Disclosure of Invention
In view of the above, 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 above problems.
According to an aspect of an embodiment of the present invention, there is provided a method of distributing user configuration data, the method including: 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 power proportion of each service node according to the estimated value; and distributing service requests to the corresponding service nodes according to the calculation 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 the response time data corresponding to each service request.
In an optional manner, the determining a 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 alternative manner, said calculating an estimate of said response time data corresponding to each of said serving nodes comprises: and calculating the 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 from the response time data to the current time are in a negative correlation relationship.
In an alternative manner, said calculating an estimate of said response time data corresponding to each of said serving nodes comprises: calculating an estimated value of the response time data corresponding to each service node according to the following formula;
Tn,x＝(tn,m-x+1+…+(X-2)*tn,m-2+(X-1)*tn,m-1+X*tn,m) V. (1+2+3+ … + X) where tn,mThe latest response time data of the nth service node, X is a preset number, Tn,xN and m are both natural numbers, and are the estimated values of X pieces of the response time data of the nth service node.
In an alternative, said calculating a computational power proportion for each of said service nodes based on said estimates comprises: calculating the calculation power proportion of each service node according to the following formula according to the estimated value;
Pn＝Tn,x/(T1,x+T2,x+…+Tn,x) Wherein P isnThe computation force proportion for the nth service node, X being a predetermined number, Tn,xIs the estimated value of X response time data of the nth service node, n being a natural number.
In an optional manner, the allocating service requests to the corresponding service nodes according to the computation power proportion includes: arranging the computation force proportion according to a specified sequence, and sequentially distributing a specified number of the service requests to the service nodes according to the sequence; the calculation force proportion is in positive correlation with the specified quantity.
According to another aspect of the embodiments 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; the proportion calculation unit is used for calculating the calculation power proportion of each service node according to the estimated value; and the request distribution unit is used for distributing the service request to the corresponding service node according to the calculation force proportion.
According to another aspect of embodiments of the present invention, there is provided a computing device including: the system comprises a processor, a memory, a communication interface and a communication bus, wherein the processor, the memory and the communication interface complete mutual communication 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 for distributing user configuration data.
According to yet another aspect of the embodiments of the present invention, there is provided a computer storage medium having at least one executable instruction stored therein, the executable instruction causing the processor to perform the steps of the method for distributing user configuration data described above.
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 power proportion of each service node according to the estimated value; and distributing service requests to the corresponding service nodes according to the calculation ratio, so that the selection decision efficiency of the service nodes can be accelerated, the hardware purchased at different periods can be effectively utilized, and the investment income of enterprises can be improved.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and the embodiments of the present invention can be implemented according to the content of the description in order to make the technical means of the embodiments of the present invention more clearly understood, and the detailed description of the present invention is provided below in order to make the foregoing and other objects, features, and advantages of the embodiments of the present invention more clearly understandable.
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 refer to like parts throughout the drawings. In the drawings:
fig. 1 is a flowchart 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 is a schematic structural 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 invention are shown in the drawings, it should be understood that the invention can 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 flowchart 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: and acquiring response time data of the service request corresponding to each service node.
In the embodiment of the present invention, the number of the service nodes is uncertain, the computation power of each service node may be the same or different, each service node may be offline at any time, online at any time, and register with the decision server, the network conditions of each service node are different, and the eSIM configuration data of the eSIM user 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 the response time data corresponding to each service request. For example, the response time data of m service requests of each service node in n service nodes is as follows:
wherein, tn,mThe data is the mth response time data of 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 a time sequence, and calculating an estimation value of the response time data corresponding to each service node.
Specifically, for each service node, the preset number of response time data closest to the current time is selected according to a time sequence. And calculating the 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 from the response time data to the current time are in a negative correlation relationship. 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 estimate of said response time data for each of said serving nodes according to the following formula:
Tn,x＝(tn,m-x+1+…+(X-2)*tn,m-2+(X-1)*tn,m-1+X*tn,m)/(1+2+3+…+X)，
wherein, tn,mThe latest response time data of the nth service node, X is a preset number, Tn,xN and m are both natural numbers, and are the estimated values of X pieces of the response time data of the nth service node. X, X-1 and X-2 are weights corresponding to the response time data, and the closer the response time data is to the current time, the more the weight of the response time data is, so that the influence of single impulse noise on the estimated value can be reduced.
Step S13: and calculating the calculation power proportion of each service node according to the estimation value.
Specifically, the computation power ratio of any service node is the ratio of the evaluation value of the service node to the sum of the evaluation values of all service nodes. Calculating a calculation force proportion of each service node according to the following formula according to the estimation value:
Pn＝Tn,x/(T1,x+T2,x+…+Tn,x)，
wherein, PnThe computation force proportion for the nth service node, X being a predetermined number, Tn,xIs the estimated value of X response time data of the nth service node, n being a natural number.
Step S14: and distributing service requests to the corresponding service nodes according to the calculation force proportion.
Specifically, the computation force proportion is arranged according to a specified sequence, and a specified number of the service requests are distributed to the service nodes in sequence. The calculation force proportion is in positive correlation with the specified quantity. The greater the computational rate proportion of the service node, the greater the specified number of service requests assigned to the service node, thereby implementing a request assignment decision. The request distribution decision of the embodiment of the invention is a preposed service performance estimation strategy, when a request for downloading the eSIM user configuration data by a user terminal is received, a service node is selected, and even if the hardware conditions of all the service nodes are different and the network environments are different, the eSIM user configuration data distribution service with basically consistent performance can be provided for the client, which is unrelated to the terminal trust problem, the transmission safety problem, the storage safety problem, the data deletion safety problem and the safety problem of switching operators.
In the embodiment of the invention, when the service nodes are added or deleted or the network is unstable, the calculation proportion of each service node is recalculated every time a service request is received, and the service request is distributed according to the calculation proportion. When the number of the service nodes is stable and the network is stable, the calculation proportion of each service node does not need to be calculated repeatedly, and the service request is directly distributed according to the calculation proportion of each service node calculated before. Through actual tests, the embodiment of the invention can effectively solve the problem of fluctuation of algorithms such as the current average allocation strategy, the polling strategy, the random allocation strategy and the like, effectively reduces the problem of larger data fluctuation of service response time caused by different hardware conditions and network conditions of service nodes, enables the load of each service node to be more stable, avoids the phenomenon of node service congestion with strong calculation capacity, effectively utilizes hardware purchased at different periods through estimation, promotes enterprise investment income, and accelerates the decision-making efficiency of selection of 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 power proportion of each service node according to the estimated value; and distributing service requests to the corresponding service nodes according to the calculation ratio, so that the selection decision efficiency of the service nodes can be accelerated, the hardware purchased at different periods can be effectively utilized, and the investment income of enterprises can be improved.
Fig. 2 shows a schematic structural diagram of 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 evaluation value acquisition unit 202, a proportion calculation unit 203, and a request allocation unit 204. Wherein:
the data obtaining unit 201 is configured to obtain 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 calculation unit 203 is configured to calculate a computation proportion of each service node according to the estimation value; the request allocating unit 204 is configured to allocate a service request to the corresponding service node according to the computation power ratio.
In an alternative manner, the data obtaining unit 201 is configured to: acquiring a service request of each service node eSIM configuration data; and recording the response time data corresponding to each service request.
In an alternative manner, the estimated 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 manner, the estimated value obtaining unit 202 is configured to: and calculating the 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 from the response time data to the current time are in a negative correlation relationship.
In an alternative manner, the estimated 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;
Tn,x＝(tn,m-x+1+…+(X-2)*tn,m-2+(X-1)*tn,m-1+X*tn,m)/(1+2+3+…+X)，
wherein, tn,mThe latest response time data of the nth service node, X is a preset number, Tn,xN and m are both natural numbers, and are the estimated values of X pieces of the response time data of the nth service node.
In an alternative manner, the proportion calculation unit 203 is configured to: calculating the calculation power proportion of each service node according to the following formula according to the estimated value;
Pn＝Tn,x/(T1,x+T2,x+…+Tn,x)，
wherein, PnThe computation force proportion for the nth service node, X being a predetermined number, Tn,xIs the estimated value of X response time data of the nth service node, n being a natural number.
In an alternative manner, the request allocating unit 204 is configured to: arranging the computation force proportion according to a specified sequence, and sequentially distributing a specified number of the service requests to the service nodes according to the sequence; the calculation force proportion is in positive correlation with the specified quantity.
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 power proportion of each service node according to the estimated value; and distributing service requests to the corresponding service nodes according to the calculation ratio, so that the selection decision efficiency of the service nodes can be accelerated, the hardware purchased at different periods can be effectively utilized, and the investment income of enterprises can be improved.
An embodiment of the present invention provides a non-volatile computer storage medium, where the computer storage medium stores at least one executable instruction, and the computer executable instruction may execute the method for distributing user configuration data in any method embodiment described above.
The executable instructions may be specifically configured to cause the 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 power proportion of each service node according to the estimated value;
and distributing service requests to the corresponding service nodes according to the calculation force proportion.
In an alternative, the executable instructions cause the processor to:
acquiring a service request of each service node eSIM configuration data; and recording the response time data corresponding to each service request.
In an 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 an alternative, the executable instructions cause the processor to:
and calculating the 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 from the response time data to the current time are in a negative correlation relationship.
In an 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;
Tn,x＝(tn,m-x+1+…+(X-2)*tn,m-2+(X-1)*tn,m-1+X*tn,m)/(1+2+3+…+X)，
wherein, tn,mThe response time data of the nth service node, X is a preset number, Tn,xN and m are both natural numbers, and are the estimated values of X pieces of the response time data of the nth service node.
In an alternative, the executable instructions cause the processor to:
calculating the calculation power proportion of each service node according to the following formula according to the estimated value;
Pn＝Tn,x/(T1,x+T2,x+…+Tn,x)，
wherein, PnThe computation force proportion for the nth service node, X being a predetermined number, Tn,xIs the estimated value of X response time data of the nth service node, n being a natural number.
In an alternative, the executable instructions cause the processor to:
arranging the computation force proportion according to a specified sequence, and sequentially distributing a specified number of the service requests to the service nodes according to the sequence; the calculation force proportion is in positive correlation with the specified quantity.
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 power proportion of each service node according to the estimated value; and distributing service requests to the corresponding service nodes according to the calculation ratio, so that the selection decision efficiency of the service nodes can be accelerated, the hardware purchased at different periods can be effectively utilized, and the investment income of enterprises can be improved.
Embodiments of the present invention provide a computer program product comprising a computer program stored on a computer storage medium, the computer program comprising program instructions that, when executed by a computer, cause the computer to perform a method of distributing user configuration data in any of the method embodiments described above.
The executable instructions may be specifically configured to cause the 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 power proportion of each service node according to the estimated value;
and distributing service requests to the corresponding service nodes according to the calculation force proportion.
In an alternative, the executable instructions cause the processor to:
acquiring a service request of each service node eSIM configuration data; and recording the response time data corresponding to each service request.
In an 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 an alternative, the executable instructions cause the processor to:
and calculating the 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 from the response time data to the current time are in a negative correlation relationship.
In an 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;
Tn,x＝(tn,m-x+1+…+(X-2)*tn,m-2+(X-1)*tn,m-1+X*tn,m)/(1+2+3+…+X)，
wherein, tn,mThe response time data of the nth service node, X is a preset number, Tn,xN and m are both natural numbers, and are the estimated values of X pieces of the response time data of the nth service node.
In an alternative, the executable instructions cause the processor to:
calculating the calculation power proportion of each service node according to the following formula according to the estimated value;
Pn＝Tn,x/(T1,x+T2,x+…+Tn,x)，
wherein, PnThe computation force proportion for the nth service node, X being a predetermined number, Tn,xIs the estimated value of X response time data of the nth service node, n being a natural number.
In an alternative, the executable instructions cause the processor to:
arranging the computation force proportion according to a specified sequence, and sequentially distributing a specified number of the service requests to the service nodes according to the sequence; the calculation force proportion is in positive correlation with the specified quantity.
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 power proportion of each service node according to the estimated value; and distributing service requests to the corresponding service nodes according to the calculation ratio, so that the selection decision efficiency of the service nodes can be accelerated, the hardware purchased at different periods can be effectively utilized, and the investment income of enterprises can be improved.
Fig. 3 is a schematic structural diagram of a computing device according to an embodiment of the present invention, and the specific embodiment of the present invention does not limit the specific implementation of the device.
As shown in fig. 3, the computing device may include: a processor (processor)302, a communication Interface 304, a memory 306, and a communication bus 308.
Wherein: the processor 302, communication interface 304, and memory 306 communicate with each other via a communication bus 308. A communication interface 304 for communicating with network elements of other devices, such as clients or other servers. The processor 302 is configured to execute the program 310, and may specifically execute the relevant steps in the above-described method embodiment for distributing the user configuration data.
In particular, program 310 may include program code comprising computer operating instructions.
The processor 302 may be a central processing unit CPU or an application Specific Integrated circuit asic or an Integrated circuit or Integrated circuits configured to implement embodiments of the present invention. The one or each processor included in the device may be the same type of processor, such as one or each CPU; or may be different types of processors such as one or each CPU and one or each ASIC.
And a memory 306 for storing a program 310. Memory 306 may comprise high-speed RAM memory and may also include non-volatile memory (non-volatile memory), such as at least one disk memory.
The program 310 may specifically be configured to cause the processor 302 to perform the following operations:
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 power proportion of each service node according to the estimated value;
and distributing service requests to the corresponding service nodes according to the calculation 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 the 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 the 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 from the response time data to the current time are in a negative correlation relationship.
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;
Tn,x＝(tn,m-x+1+…+(X-2)*tn,m-2+(X-1)*tn,m-1+X*tn,m)/(1+2+3+…+X)，
wherein, tn,mThe response time data of the nth service node, X is a preset number, Tn,xN and m are both natural numbers, and are the estimated values of X pieces of the response time data of the nth service node.
In an alternative, the program 310 causes the processor to:
calculating the calculation power proportion of each service node according to the following formula according to the estimated value;
Pn＝Tn,x/(T1,x+T2,x+…+Tn,x)，
wherein, PnThe computation force proportion for the nth service node, X being a predetermined number, Tn,xIs the estimated value of X response time data of the nth service node, n being a natural number.
In an alternative, the program 310 causes the processor to:
arranging the computation force proportion according to a specified sequence, and sequentially distributing a specified number of the service requests to the service nodes according to the sequence; the calculation force proportion is in positive correlation with the specified quantity.
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 power proportion of each service node according to the estimated value; and distributing service requests to the corresponding service nodes according to the calculation ratio, so that the selection decision efficiency of the service nodes can be accelerated, the hardware purchased at different periods can be effectively utilized, and the investment income of enterprises can be 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 constructing such a system will be apparent from the description above. In addition, embodiments of the present invention are not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any descriptions of specific languages are provided above to disclose the best mode of the invention.
In the description provided herein, numerous specific details are set forth. It is understood, however, 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 foregoing 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 invention and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that the invention as claimed 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 device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. 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. All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except combinations where at least some of such features and/or processes or elements 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 included in other embodiments, rather than other features, 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 may 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 usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names. The steps in the above embodiments should not be construed as limiting the order of execution unless specified otherwise.
Claims (10)
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 true CN113132133A (en) | 2021-07-16 |
| CN113132133B 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 (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090113447A1 (en) * | 2007-10-26 | 2009-04-30 | Masanori Kamiyai | Client-side selection of a server |
| 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 |
| US20190182168A1 (en) * | 2017-12-11 | 2019-06-13 | International Business Machines Corporation | Dynamic throttling thresholds |
| 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 |
-
2019
- 2019-12-31 CN CN201911406140.8A patent/CN113132133B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090113447A1 (en) * | 2007-10-26 | 2009-04-30 | Masanori Kamiyai | Client-side selection of a server |
| 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 |
| US20190182168A1 (en) * | 2017-12-11 | 2019-06-13 | International Business Machines Corporation | Dynamic throttling thresholds |
| 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 (2)
| Title |
|---|
| JUNWEI CAO；等: "Optimal Power Allocation and Load Distribution for Multiple Heterogeneous Multicore Server Processors across Clouds and Data Centers", 《IEEE TRANSACTIONS ON COMPUTERS 》, vol. 63, no. 1, XP011532987, DOI: 10.1109/TC.2013.122 * |
| 陈大才;吕立;高岑;孙咏;: "基于预测模型及独立训练节点的负载均衡策略", 计算机系统应用, no. 09 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113132133B (en) | 2023-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200364608A1 (en) | Communicating in a federated learning environment | |
| US11159406B2 (en) | Load balancing web service by rejecting connections | |
| US10466899B2 (en) | Selecting controllers based on affinity between access devices and storage segments | |
| EP3419247B1 (en) | Method and device for storage resource allocation for video cloud storage | |
| Lu et al. | Join-idle-queue: A novel load balancing algorithm for dynamically scalable web services | |
| CN106095572B (en) | distributed scheduling system and method for big data processing | |
| CN103716251B (en) | Load balancing method and device for content distribution network | |
| CN112506643A (en) | Load balancing method and device of distributed system and electronic equipment | |
| CN108933829A (en) | A kind of load-balancing method and device | |
| GB2412980A (en) | A method of distributing load amongst two or more computer system resources | |
| Nahir et al. | Replication-based load balancing | |
| CN110233866A (en) | A kind of load-balancing method and load balancer | |
| JP6519111B2 (en) | Data processing control method, data processing control program and data processing control device | |
| CN110933136A (en) | Service node selection method, device, equipment and readable storage medium | |
| CN113377866A (en) | Load balancing method and device for virtualized database proxy service | |
| CN114003337A (en) | Access request distribution method and device | |
| Vashistha et al. | Comparative study of load balancing algorithms | |
| CN113608870A (en) | Load balancing method and device of message queue, electronic equipment and storage medium | |
| US9501321B1 (en) | Weighted service requests throttling | |
| CN108200185B (en) | Method and device for realizing load balance | |
| CN113132133A (en) | Method, device, computing equipment and storage medium for distributing user configuration data | |
| CN112260962A (en) | A kind of bandwidth control method and device | |
| CN115168017B (en) | Task scheduling cloud platform and task scheduling method thereof | |
| CN117640541A (en) | Cloud server resource allocation method, device, equipment and medium | |
| Birke et al. | Power of redundancy: Designing partial replication for multi-tier applications |
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 |