CN108492109B - Electronic device, dynamic code request processing method and storage medium - Google Patents
Electronic device, dynamic code request processing method and storage medium Download PDFInfo
- Publication number
- CN108492109B CN108492109B CN201810215687.9A CN201810215687A CN108492109B CN 108492109 B CN108492109 B CN 108492109B CN 201810215687 A CN201810215687 A CN 201810215687A CN 108492109 B CN108492109 B CN 108492109B
- Authority
- CN
- China
- Prior art keywords
- service system
- service
- dynamic code
- threshold
- data transmission
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/385—Payment protocols; Details thereof using an alias or single-use codes
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Engineering & Computer Science (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer And Data Communications (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention relates to an electronic device, a processing method of dynamic code request and a storage medium, wherein the method comprises the following steps: acquiring the type of a service in each service system accessed to the dynamic code service system, counting the data transmission quantity of each type of service in each service system, and calculating the corresponding important coefficient of each service system according to the data transmission quantity of each type of service and the weight of each type of service; the method comprises the steps of obtaining the total times and the successful response times of the dynamic code service system called by a service system, calculating the successful response rate of the dynamic code service system based on the total times and the successful response times, and dynamically processing the dynamic code request of the service system according to the successful response rate and the important coefficient of the service system. When the dynamic code service system has abnormal conditions affecting the stability, the access of the dynamic code service can be dynamically adjusted according to the importance of the service type, and the request of the service system with lower important coefficient is rejected so as to ensure the sequence of important services.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to an electronic device, a method for processing a dynamic code request, and a storage medium.
Background
At present, dynamic code services are widely applied to various financial business scenes of the internet, such as user registration, user login, activity confirmation, payment confirmation and the like, a plurality of business systems are accessed into a dynamic code service system, and the business scenes, the usage amount and the like of each business system are different. The current dynamic code service system pays more attention to the sending timeliness of the dynamic code, namely, the dynamic code is quickly generated and sent to a user, the influence of the stability of the dynamic code service system is ignored, if the dynamic code service system is unstable, financial transactions can be influenced, for example, dynamic code authentication is carried out in a premium payment link, if the data processed by the dynamic code service system at present is very large, abnormal conditions such as interruption can occur, the user can not complete payment, and great loss can be brought to a company. In view of this, how to dynamically adjust the access of the dynamic code service according to the importance of the service type when the dynamic code service system has an abnormal condition that affects the stability, so as to ensure the sequence of the important services, becomes a problem to be solved.
Disclosure of Invention
The invention aims to provide an electronic device, a dynamic code request processing method and a storage medium, aiming at dynamically adjusting the access of dynamic code service according to the importance of service types when an abnormal condition occurs in a dynamic code service system.
In order to achieve the above object, the present invention provides an electronic device, which includes a memory and a processor connected to the memory, wherein the memory stores a processing system capable of running on the processor, and when executed by the processor, the processing system implements the following steps:
a counting step, namely acquiring the type of the service in each service system accessed to the dynamic code service system, counting the data transmission quantity of each type of service in each service system, and calculating an important coefficient R corresponding to each service system according to the data transmission quantity of each type of service and the weight of each type of service;
and a dynamic processing step, namely acquiring the total times and successful response times of the dynamic code service system called by the service system, calculating the successful response rate of the dynamic code service system based on the total times and the successful response times, and dynamically processing the dynamic code request of the service system according to the successful response rate and the important coefficient R of the service system.
Preferably, the type of the service includes financial transactions and general transactions, data transmission amounts corresponding to the financial transactions and the general transactions are c1 and c2, weights corresponding to the financial transactions and the general transactions are w1 and w2, and w1> w2, respectively, and an importance coefficient R of the service system is (w1+ w 2)/(pi w1/2arctan (c1/α) + pi w2/2arctan (c2/α)), where α is an average data transmission amount of the service system accessing the dynamic code service system.
Preferably, the types of the services include financial transactions, general transactions, core services, and non-core services, data transmission amounts corresponding to the financial transactions, the general transactions, the core services, and the non-core services are c1, c2, c3, and c4, weights corresponding to the financial transactions, the general transactions, the core services, and the non-core services are w1, w2, w3, w4, w1> w2> w3> w4, and an importance coefficient R of the service system is (w1+ w2+ w3+ w 4)/(pi w1/2arctan (c1/α) + pi 2/2arctan (c2/α) + pi 3/2arctan (c3/α) + pi 4/2arctan (c4/α)), where α is an average data transmission amount of a service system accessing the dynamic code service system.
Preferably, the dynamic processing step specifically includes:
if the successful response rate is lower than a preset first threshold and higher than a preset second threshold, rejecting a dynamic code request of a service system of which an important coefficient R of the service system is lower than a preset first coefficient value, wherein the first threshold is larger than the second threshold;
if the successful response rate is lower than a preset second threshold and higher than a preset third threshold, rejecting a dynamic code request of a service system of which an important coefficient R of the service system is lower than a preset second coefficient value, wherein the second threshold is greater than the third threshold, and the second coefficient value is greater than the first coefficient value;
and if the successful response rate is lower than a preset third threshold value, rejecting the dynamic code request of the service system with the important coefficient R of the service system lower than a preset third coefficient value, wherein the third coefficient value is larger than the second coefficient value.
In order to achieve the above object, the present invention further provides a method for processing a dynamic code request, where the method for processing a dynamic code request includes:
s1, obtaining the type of the service in each service system accessing the dynamic code service system, counting the data transmission amount of each type of service in each service system, and calculating the corresponding important coefficient R of each service system according to the data transmission amount of each type of service and the weight of each type of service;
s2, obtaining the total times and successful response times of the dynamic code service system called by the service system, calculating the successful response rate of the dynamic code service system based on the total times and the successful response times, and dynamically processing the dynamic code request of the service system according to the successful response rate and the important coefficient R of the service system.
Preferably, the type of the service includes financial transactions and general transactions, data transmission amounts corresponding to the financial transactions and the general transactions are c1 and c2, weights corresponding to the financial transactions and the general transactions are w1 and w2, and w1> w2, respectively, and an importance coefficient R of the service system is (w1+ w 2)/(pi w1/2arctan (c1/α) + pi w2/2arctan (c2/α)), where α is an average data transmission amount of the service system accessing the dynamic code service system.
Preferably, the types of the services include financial transactions, general transactions, core services, and non-core services, data transmission amounts corresponding to the financial transactions, the general transactions, the core services, and the non-core services are c1, c2, c3, and c4, weights corresponding to the financial transactions, the general transactions, the core services, and the non-core services are w1, w2, w3, w4, w1> w2> w3> w4, and an importance coefficient R of the service system is (w1+ w2+ w3+ w 4)/(pi w1/2arctan (c1/α) + pi 2/2arctan (c2/α) + pi 3/2arctan (c3/α) + pi 4/2arctan (c4/α)), where α is an average data transmission amount of a service system accessing the dynamic code service system.
Preferably, the step S2 specifically includes:
if the successful response rate is lower than a preset first threshold and higher than a preset second threshold, rejecting a dynamic code request of a service system of which an important coefficient R of the service system is lower than a preset first coefficient value, wherein the first threshold is larger than the second threshold;
if the successful response rate is lower than a preset second threshold and higher than a preset third threshold, rejecting a dynamic code request of a service system of which an important coefficient R of the service system is lower than a preset second coefficient value, wherein the second threshold is greater than the third threshold, and the second coefficient value is greater than the first coefficient value;
and if the successful response rate is lower than a preset third threshold value, rejecting the dynamic code request of the service system with the important coefficient R of the service system lower than a preset third coefficient value, wherein the third coefficient value is larger than the second coefficient value.
Preferably, after the step S2, the method further includes:
when the dynamic code service system rejects the dynamic code request of the service system for the first time, a reset time T is set, and after the reset time T is reached, the dynamic code service system receives the dynamic code requests of all the service systems, and returns to execute the step S2.
The present invention also provides a computer readable storage medium having stored thereon a processing system, which when executed by a processor implements the steps of the method described above.
The invention has the beneficial effects that: the invention calculates the important coefficient of the service system through the use scene and the service quantity of the service system under the condition that the service system requests the dynamic code service system for the dynamic code, analyzes whether the dynamic code service system has abnormal conditions affecting the stability of the system or not through the successful response rate of the dynamic code service system, dynamically adjusts the access of the dynamic code service according to the importance of the service type when the dynamic code service system has the abnormal conditions affecting the stability, and rejects the request of the service system with lower important coefficient to ensure the sequence of important services.
Drawings
FIG. 1 is a schematic diagram of an alternative application environment according to various embodiments of the present invention;
fig. 2 is a graph illustrating the importance coefficient R of the service system and the total data transmission amount C of the service system in fig. 1;
fig. 3 is a flowchart illustrating a method for processing a dynamic code request according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the description relating to "first", "second", etc. in the present invention is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present invention.
Fig. 1 is a schematic application environment diagram illustrating a method for processing a dynamic code request according to a preferred embodiment of the present invention. The schematic diagram of the application environment includes an electronic device 1, a dynamic code service system and a plurality of business systems, wherein the electronic device 1 and the dynamic code service system may be integrated in the same device (e.g., a server) or may be respectively located in different devices. The electronic device 1 may perform data interaction with the dynamic code service system through a suitable technology such as a network, a near field communication technology, and the like, and a plurality of service systems interact with the dynamic code service system to request the dynamic code from the dynamic code service system.
The electronic apparatus 1 is a device capable of automatically performing numerical calculation and/or information processing in accordance with a command set or stored in advance. The electronic device 1 may be a computer, or may be a single network server, a server group composed of a plurality of network servers, or a cloud composed of a large number of hosts or network servers based on cloud computing, where cloud computing is one of distributed computing and is a super virtual computer composed of a group of loosely coupled computers.
In the present embodiment, the electronic device 1 may include, but is not limited to, a memory 11, a processor 12, and a network interface 13, which are communicatively connected to each other through a system bus, wherein the memory 11 stores a processing system operable on the processor 12. It is noted that fig. 1 only shows the electronic device 1 with components 11-13, but it is to be understood that not all shown components are required to be implemented, and that more or less components may be implemented instead.
The storage 11 includes a memory and at least one type of readable storage medium. The memory provides cache for the operation of the electronic device 1; the readable storage medium may be a non-volatile storage medium such as flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, etc. In some embodiments, the readable storage medium may be an internal storage unit of the electronic apparatus 1, such as a hard disk of the electronic apparatus 1; in other embodiments, the non-volatile storage medium may also be an external storage device of the electronic apparatus 1, such as a plug-in hard disk provided on the electronic apparatus 1, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like. In this embodiment, the readable storage medium of the memory 11 is generally used for storing an operating system and various types of application software installed in the electronic device 1, for example, program codes of a processing system in an embodiment of the present invention. Further, the memory 11 may also be used to temporarily store various types of data that have been output or are to be output.
The processor 12 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor 12 is generally configured to control the overall operation of the electronic device 1, such as performing control and processing related to data interaction or communication with the dynamic code service system. In this embodiment, the processor 12 is configured to run the program code stored in the memory 11 or process data, for example, run a processing system.
The network interface 13 may comprise a wireless network interface or a wired network interface, and the network interface 13 is generally used for establishing a communication connection between the electronic apparatus 1 and other electronic devices.
The processing system is stored in the memory 11 and includes at least one computer readable instruction stored in the memory 11, which is executable by the processor 12 to implement the method of the embodiments of the present application; and the at least one computer readable instruction may be divided into different logic blocks depending on the functions implemented by the respective portions.
In one embodiment, the processing system described above, when executed by the processor 12, performs the following steps:
a counting step, namely acquiring the type of the service in each service system accessed to the dynamic code service system, counting the data transmission quantity of each type of service in each service system, and calculating an important coefficient R corresponding to each service system according to the data transmission quantity of each type of service and the weight of each type of service;
among them, there are many business systems accessing the dynamic code service system, for example, various business systems used in financial institutions such as banks.
In an embodiment, the service types in each service system are divided into financial transactions and ordinary transactions, wherein the financial transactions include, for example, bank transfer, fund purchase and the like, the ordinary transactions include, for example, premium payment, premium renewal and the like, data transmission amounts of all services related to financial transactions in the service system are accumulated and counted to obtain data transmission amounts of financial transactions of the service system, and the data transmission amounts of all services related to ordinary transactions in the service system are accumulated and counted to obtain data transmission amounts of ordinary transactions of the service system. In a specific example, the data transmission amount of the financial transaction is c1 respectively, the data transmission amount of the ordinary transaction is c2 respectively, the weight of the financial transaction is w1, the weight of the ordinary transaction is w2 respectively, w1> w2 respectively, namely, the financial transaction accounts for the greatest proportion, the importance coefficient R of the computing business system is (w1+ w 2)/(pi w1/2arctan (c1/α) + pi w2/2arctan (c2/α)), 0< R <1, wherein alpha is the average data transmission quantity of the service system accessing the dynamic code service system, that is, α is (data transmission amount of financial transaction of all business systems + data transmission amount of ordinary transaction of all business systems)/number of business systems, and the importance coefficient R is higher, the higher the importance degree of the business system is, and generally, the higher the importance coefficient R is in the business scenario such as financial transaction.
In another embodiment, the service types in each service system are divided into financial transactions such as bank transfer, fund purchase and the like, common transactions such as premium payment, premium renewal and the like, core services such as user registration, user login and the like, and non-core services such as user information modification and the like. The data sending quantity of all services related to the financial transaction in the service system is accumulated and counted to obtain the data sending quantity of the financial transaction of the service system, the data sending quantity of all services related to the common transaction in the service system is accumulated and counted to obtain the data sending quantity of the common transaction of the service system, the data sending quantity of all services related to the core service in the service system is accumulated and counted to obtain the data sending quantity of the core service of the service system, and the data sending quantity of all services related to the non-core service in the service system is accumulated and counted to obtain the data sending quantity of the non-core service of the service system. In a specific example, the data transmission amounts corresponding to the financial transaction, the normal transaction, the core service and the non-core service are c1, c2, c3 and c4, the weights corresponding to the financial transaction, the normal transaction, the core service and the non-core service are w1, w2, w3, w4 and w1> w2> w3> w4, i.e. the weight of the financial transaction is the maximum weight and the weight of the non-core service is the minimum weight, and the important coefficient R of the service system is (w1+ w2+ w3+ w 4)/(w 1/2arctan (c1/α) + pi w2/2arctan (c2/α) + pi w3/2arctan (c3/α) + pi w4/2arctan (c4/α)), 0< R <1, where α is the average service data transmission amount of the service system accessing the dynamic service code, i.e. the average service system data transmission amount of the data of the financial transaction system and the data transmission system is the total data transmission amount of the normal transaction data transmission system and the total service transmission amount of all the normal transaction data transmission system Data transmission amount + data transmission amount of non-core services of all service systems)/number of service systems, the greater the importance coefficient R, the higher the importance degree of the service system, and generally, the higher the importance coefficient R is in the ratio of service scenarios such as financial transactions.
In the two embodiments of calculating the importance coefficient R of the service system according to the usage scenario and the traffic volume of the service system, the second embodiment makes a more detailed distinction in terms of service types than the first embodiment, and the calculated importance coefficient R of the service system is more objective and comprehensive for evaluating the service system, as shown in fig. 2, in fact, the importance coefficient R of the service system is in direct proportion to the total data transmission amount C of the service system, and the larger the traffic volume of the service system is, the more important it is.
And a dynamic processing step, namely acquiring the total times and successful response times of the dynamic code service system called by the service system, calculating the successful response rate of the dynamic code service system based on the total times and the successful response times, and dynamically processing the dynamic code request of the service system according to the successful response rate and the important coefficient R of the service system.
In this embodiment, the number of successful responses S of the dynamic code service system, the total number of times that the dynamic code service system is called by the service system is M, where the total number of times may be a predetermined value (for example, 300 times) that is continuously preset and called by the service system, or may be the total number of times that the dynamic code service system is called by the service system within a preset period of time (for example, 5 minutes), and a successful response rate P is S/M, and whether an abnormal condition affecting system stability occurs in the dynamic code service system is analyzed by the successful response rate P.
Wherein, the dynamic processing step specifically comprises: if the successful response rate is lower than a preset first threshold and higher than a preset second threshold, rejecting the dynamic code request of the service system of which the important coefficient R of the service system is lower than a preset first coefficient value, wherein the first threshold is larger than the second threshold; if the successful response rate is lower than a preset second threshold and higher than a preset third threshold, rejecting the dynamic code request of the service system of which the important coefficient R of the service system is lower than a preset second coefficient value, wherein the second threshold is larger than the third threshold, and the second coefficient value is larger than the first coefficient value; and if the successful response rate is lower than a preset third threshold value, rejecting the dynamic code request of the service system with the important coefficient R of the service system lower than a preset third coefficient value, wherein the third coefficient value is larger than the second coefficient value.
In a specific example, when the successful response rate P is lower than 0.8, it is considered that the dynamic code service system has an abnormal condition affecting the stability, and the process of dynamically processing the dynamic code request by the dynamic code service system includes:
if the successful response rate is not lower than 0.8, receiving dynamic code requests of all service systems;
if the successful response rate is lower than 0.8 and higher than 0.6 (including 0.6), rejecting the dynamic code request of the service system with the lowest 20% of the importance coefficient R of the service system;
if the successful response rate is lower than 0.6 and higher than 0.4 (including 0.4), rejecting the dynamic code request of the service system with the lowest 40% of the importance coefficient R of the service system;
and if the successful response rate is lower than 0.4, rejecting the dynamic code request of the service system with the lowest 60% of the importance coefficient R of the service system.
The dynamic code service system refuses the dynamic code request of the business system with the lowest important coefficient R of 60% at most.
In other embodiments, when the dynamic code service system rejects the dynamic code request of the service system for the first time, a reset time T may be set, that is, the countdown starts, considering that the dynamic code service system is generally unstable time step, preferably, T is 5 minutes, after the reset time T is reached, that is, after the countdown finishes, the dynamic code service system receives the dynamic code requests of all the service systems, then recalculates the successful response rate of the dynamic code service system, and dynamically rejects the dynamic code request of the service system according to the successful response rate and the importance coefficient R of the service system. For the abnormal condition which is short and affects the stability of the dynamic code service system, the reset time T is set so that the dynamic code service system restores to the normal processing state, but not always in the state of processing the abnormal condition.
Compared with the prior art, the method and the system have the advantages that under the condition that the service system requests the dynamic code from the dynamic code service system, the important coefficient R of the service system is calculated through the use scene and the service quantity of the service system, whether the dynamic code service system has abnormal conditions affecting the stability of the system is analyzed through the successful response rate P of the dynamic code service system, when the dynamic code service system has the abnormal conditions affecting the stability, the access of the dynamic code service is dynamically adjusted according to the importance of the service type, the request of the service system with lower important coefficient R is rejected, and the sequence of important services is guaranteed.
As shown in fig. 3, fig. 3 is a schematic flowchart of an embodiment of a processing method for a dynamic code request according to the present invention, where the processing method for a dynamic code request includes the following steps:
step S1, obtaining the type of service in each service system accessing the dynamic code service system, counting the data transmission amount of each type of service in each service system, and calculating the corresponding important coefficient R of each service system according to the data transmission amount of each type of service and the weight of each type of service;
among them, there are many business systems accessing the dynamic code service system, for example, various business systems used in financial institutions such as banks.
In an embodiment, the service types in each service system are divided into financial transactions and ordinary transactions, wherein the financial transactions include, for example, bank transfer, fund purchase and the like, the ordinary transactions include, for example, premium payment, premium renewal and the like, data transmission amounts of all services related to financial transactions in the service system are accumulated and counted to obtain data transmission amounts of financial transactions of the service system, the data transmission amounts of all services related to ordinary transactions in the service system are accumulated and counted to obtain data transmission amounts of ordinary transactions of the service system, and the larger the data transmission amount is, the larger the service amount is. In a specific example, the data transmission amount of the financial transaction is c1 respectively, the data transmission amount of the ordinary transaction is c2 respectively, the weight of the financial transaction is w1, the weight of the ordinary transaction is w2 respectively, w1> w2 respectively, namely, the financial transaction accounts for the greatest proportion, the importance coefficient R of the computing business system is (w1+ w 2)/(pi w1/2arctan (c1/α) + pi w2/2arctan (c2/α)), 0< R <1, wherein alpha is the average data transmission quantity of the service system accessing the dynamic code service system, that is, α is (data transmission amount of financial transaction of all business systems + data transmission amount of ordinary transaction of all business systems)/number of business systems, and the importance coefficient R is higher, the higher the importance degree of the business system is, and generally, the higher the importance coefficient R is in the business scenario such as financial transaction.
In another embodiment, the service types in each service system are divided into financial transactions such as bank transfer, fund purchase and the like, common transactions such as premium payment, premium renewal and the like, core services such as user registration, user login and the like, and non-core services such as user information modification and the like. The data transmission quantity of all services related to the financial transaction in the service system is accumulated and counted to obtain the data transmission quantity of the financial transaction of the service system, the data transmission quantity of all services related to the common transaction in the service system is accumulated and counted to obtain the data transmission quantity of the common transaction of the service system, the data transmission quantity of all services related to the core service in the service system is accumulated and counted to obtain the data transmission quantity of the core service of the service system, the data transmission quantity of all services related to the non-core service in the service system is accumulated and counted to obtain the data transmission quantity of the non-core service of the service system, and the larger the data transmission quantity is, the larger the traffic quantity is. In a specific example, the data transmission amounts corresponding to the financial transaction, the normal transaction, the core service and the non-core service are c1, c2, c3 and c4, the weights corresponding to the financial transaction, the normal transaction, the core service and the non-core service are w1, w2, w3, w4 and w1> w2> w3> w4, i.e. the weight of the financial transaction is the maximum weight and the weight of the non-core service is the minimum weight, and the important coefficient R of the service system is (w1+ w2+ w3+ w 4)/(w 1/2arctan (c1/α) + pi w2/2arctan (c2/α) + pi w3/2arctan (c3/α) + pi w4/2arctan (c4/α)), 0< R <1, where α is the average service data transmission amount of the service system accessing the dynamic service code, i.e. the average service system data transmission amount of the data of the financial transaction system and the data transmission system is the total data transmission amount of the normal transaction data transmission system and the total service transmission amount of all the normal transaction data transmission system Data transmission amount + data transmission amount of non-core services of all service systems)/number of service systems, the greater the importance coefficient R, the higher the importance degree of the service system, and generally, the higher the importance coefficient R is in the ratio of service scenarios such as financial transactions.
In the two embodiments of calculating the importance coefficient R of the service system according to the usage scenario and the traffic volume of the service system, the second embodiment makes a more detailed distinction in terms of service types than the first embodiment, and the calculated importance coefficient R of the service system is more objective and comprehensive for evaluating the service system, as shown in fig. 2, in fact, the importance coefficient R of the service system is in direct proportion to the total data transmission amount C of the service system, and the larger the traffic volume of the service system is, the more important it is.
Step S2, obtaining the total number of times of calling the dynamic code service system by the service system and the number of successful responses, calculating the successful response rate of the dynamic code service system based on the total number of times and the number of successful responses, and dynamically processing the dynamic code request of the service system according to the successful response rate and the important coefficient R of the service system.
In this embodiment, the number of successful responses S of the dynamic code service system, the total number of times that the dynamic code service system is called by the service system is M, where the total number of times may be a predetermined value (for example, 300 times) that is continuously preset and called by the service system, or may be the total number of times that the dynamic code service system is called by the service system within a preset period of time (for example, 5 minutes), and a successful response rate P is S/M, and whether an abnormal condition affecting system stability occurs in the dynamic code service system is analyzed by the successful response rate P.
Wherein, step S2 specifically includes: if the successful response rate is lower than a preset first threshold and higher than a preset second threshold, rejecting the dynamic code request of the service system of which the important coefficient R of the service system is lower than a preset first coefficient value, wherein the first threshold is larger than the second threshold; if the successful response rate is lower than a preset second threshold and higher than a preset third threshold, rejecting the dynamic code request of the service system of which the important coefficient R of the service system is lower than a preset second coefficient value, wherein the second threshold is larger than the third threshold, and the second coefficient value is larger than the first coefficient value; and if the successful response rate is lower than a preset third threshold value, rejecting the dynamic code request of the service system with the important coefficient R of the service system lower than a preset third coefficient value, wherein the third coefficient value is larger than the second coefficient value.
In a specific example, when the successful response rate P is lower than 0.8, it is considered that the dynamic code service system has an abnormal condition affecting the stability, and the process of dynamically processing the dynamic code request by the dynamic code service system includes:
if the successful response rate is not lower than 0.8, receiving dynamic code requests of all service systems;
if the successful response rate is lower than 0.8 and higher than 0.6 (including 0.6), rejecting the dynamic code request of the service system with the lowest 20% of the importance coefficient R of the service system;
if the successful response rate is lower than 0.6 and higher than 0.4 (including 0.4), rejecting the dynamic code request of the service system with the lowest 40% of the importance coefficient R of the service system;
and if the successful response rate is lower than 0.4, rejecting the dynamic code request of the service system with the lowest 60% of the importance coefficient R of the service system.
The dynamic code service system refuses the dynamic code request of the business system with the lowest important coefficient R of 60% at most.
In other embodiments, when the dynamic code service system rejects the dynamic code request of the service system for the first time, a reset time T may be set, that is, the countdown starts, considering that the dynamic code service system is generally unstable time step, preferably, T is 5 minutes, after the reset time T is reached, that is, after the countdown finishes, the dynamic code service system receives the dynamic code requests of all the service systems, then recalculates the successful response rate of the dynamic code service system, and dynamically rejects the dynamic code request of the service system according to the successful response rate and the importance coefficient R of the service system. For the abnormal condition which is short and affects the stability of the dynamic code service system, the reset time T is set so that the dynamic code service system restores to the normal processing state, but not always in the state of processing the abnormal condition.
The present invention also provides a computer readable storage medium, which stores a processing system, and when the processing system is executed by a processor, the processing system implements the steps of the above-mentioned method for processing dynamic code request.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium (such as ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (such as a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (6)
1. An electronic device, comprising a memory and a processor connected to the memory, wherein the memory stores a processing system operable on the processor, and the processing system when executed by the processor implements the following steps:
a counting step, namely acquiring a plurality of different types of services contained in each service system accessed to the dynamic code service system, counting the data transmission amount of each type of service in each service system, and calculating an important coefficient R corresponding to each service system according to the data transmission amount of each type of service and the weight of each type of service, wherein the calculation formula of R is as follows:
when the type of the business comprises financial transactions and ordinary transactions, R ═ w1+ w 2)/(pi w1/2arctan (c1/α) + pi w2/2arctan (c2/α)), wherein c1 and c2 are data transmission amounts corresponding to the financial transactions and the ordinary transactions respectively, w1 and w2 are weights corresponding to the financial transactions and the ordinary transactions respectively, w1> w2, and α is an average data transmission amount of a business system accessing the dynamic code service system;
when the type of the service comprises financial transaction, normal transaction, core service and non-core service, R ═ w1+ w2+ w3+ w4)/(π w1/2arctan (c1/α) + π w2/2arctan (c2/α) + π w3/2arctan (c3/α) + π w4/2arctan (c4/α)), wherein c1, c2, c3, c4 are data transmission amounts corresponding to the financial transaction, normal transaction, core service and non-core service, respectively, w1, w2, w3 and w4 are weight corresponding to the financial transaction, normal transaction, core service and non-core service, respectively, and w1> w2> 3> w4, and α is average data transmission amount of a service system accessing the dynamic code service system;
and a dynamic processing step, namely acquiring the total times and successful response times of the dynamic code service system called by the service system, calculating the successful response rate of the dynamic code service system based on the total times and the successful response times, analyzing whether the dynamic code service system has abnormal conditions affecting the stability of the system or not according to the successful response rate, and dynamically processing the dynamic code request of the service system according to the successful response rate and the important coefficient R of the service system when the abnormal conditions affecting the stability occur.
2. The electronic device according to claim 1, wherein the dynamic processing step specifically comprises:
if the successful response rate is lower than a preset first threshold and higher than a preset second threshold, rejecting a dynamic code request of a service system of which an important coefficient R of the service system is lower than a preset first coefficient value, wherein the first threshold is larger than the second threshold;
if the successful response rate is lower than a preset second threshold and higher than a preset third threshold, rejecting a dynamic code request of a service system of which an important coefficient R of the service system is lower than a preset second coefficient value, wherein the second threshold is greater than the third threshold, and the second coefficient value is greater than the first coefficient value;
and if the successful response rate is lower than a preset third threshold value, rejecting the dynamic code request of the service system with the important coefficient R of the service system lower than a preset third coefficient value, wherein the third coefficient value is larger than the second coefficient value.
3. A processing method of a dynamic code request is characterized in that the processing method of the dynamic code request comprises the following steps:
s1, acquiring a plurality of different types of services included in each service system accessing the dynamic code service system, counting data transmission amount of each type of service in each service system, and calculating an importance coefficient R corresponding to each service system according to the data transmission amount of each type of service and the weight of each type of service, wherein a calculation formula of R is as follows:
when the type of the business comprises financial transactions and ordinary transactions, R ═ w1+ w 2)/(pi w1/2arctan (c1/α) + pi w2/2arctan (c2/α)), wherein c1 and c2 are data transmission amounts corresponding to the financial transactions and the ordinary transactions respectively, w1 and w2 are weights corresponding to the financial transactions and the ordinary transactions respectively, w1> w2, and α is an average data transmission amount of a business system accessing the dynamic code service system;
when the type of the service comprises financial transaction, normal transaction, core service and non-core service, R ═ w1+ w2+ w3+ w4)/(π w1/2arctan (c1/α) + π w2/2arctan (c2/α) + π w3/2arctan (c3/α) + π w4/2arctan (c4/α)), wherein c1, c2, c3, c4 are data transmission amounts corresponding to the financial transaction, normal transaction, core service and non-core service, respectively, w1, w2, w3 and w4 are weight corresponding to the financial transaction, normal transaction, core service and non-core service, respectively, and w1> w2> 3> w4, and α is average data transmission amount of a service system accessing the dynamic code service system;
s2, obtaining the total times and successful response times of the dynamic code service system called by the service system, calculating the successful response rate of the dynamic code service system based on the total times and the successful response times, analyzing whether the dynamic code service system has abnormal conditions affecting the stability of the system or not through the successful response rate, and dynamically processing the dynamic code request of the service system according to the successful response rate and the important coefficient R of the service system when the abnormal conditions affecting the stability occur.
4. The method for processing a dynamic code request according to claim 3, wherein the step S2 specifically includes:
if the successful response rate is lower than a preset first threshold and higher than a preset second threshold, rejecting a dynamic code request of a service system of which an important coefficient R of the service system is lower than a preset first coefficient value, wherein the first threshold is larger than the second threshold;
if the successful response rate is lower than a preset second threshold and higher than a preset third threshold, rejecting a dynamic code request of a service system of which an important coefficient R of the service system is lower than a preset second coefficient value, wherein the second threshold is greater than the third threshold, and the second coefficient value is greater than the first coefficient value;
and if the successful response rate is lower than a preset third threshold value, rejecting the dynamic code request of the service system with the important coefficient R of the service system lower than a preset third coefficient value, wherein the third coefficient value is larger than the second coefficient value.
5. The method for processing dynamic code request according to claim 4, wherein after the step S2, the method further comprises:
when the dynamic code service system rejects the dynamic code request of the service system for the first time, a reset time T is set, and after the reset time T is reached, the dynamic code service system receives the dynamic code requests of all the service systems, and returns to execute the step S2.
6. A computer-readable storage medium, having stored thereon a processing system, which when executed by a processor, performs the steps of the method of processing a dynamic code request according to any one of claims 3 to 5.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810215687.9A CN108492109B (en) | 2018-03-15 | 2018-03-15 | Electronic device, dynamic code request processing method and storage medium |
| PCT/CN2018/102092 WO2019174185A1 (en) | 2018-03-15 | 2018-08-24 | Electronic device, dynamic code request processing method and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810215687.9A CN108492109B (en) | 2018-03-15 | 2018-03-15 | Electronic device, dynamic code request processing method and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108492109A CN108492109A (en) | 2018-09-04 |
| CN108492109B true CN108492109B (en) | 2021-09-21 |
Family
ID=63339577
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810215687.9A Active CN108492109B (en) | 2018-03-15 | 2018-03-15 | Electronic device, dynamic code request processing method and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108492109B (en) |
| WO (1) | WO2019174185A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109525552B (en) * | 2018-10-11 | 2021-08-31 | 平安科技（深圳）有限公司 | Dynamic code synchronous process capacity expansion method, dynamic code generator and storage medium |
| CN111290928B (en) * | 2018-12-06 | 2023-08-01 | 中国移动通信集团陕西有限公司 | Atomic service importance determining method, device, medium and equipment |
| CN109697113B (en) * | 2018-12-29 | 2021-06-01 | 广州方硅信息技术有限公司 | Method, device and equipment for requesting retry and readable storage medium |
| CN111324471B (en) * | 2020-01-22 | 2023-07-21 | 远景智能国际私人投资有限公司 | Service adjustment method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8655939B2 (en) * | 2007-01-05 | 2014-02-18 | Digital Doors, Inc. | Electromagnetic pulse (EMP) hardened information infrastructure with extractor, cloud dispersal, secure storage, content analysis and classification and method therefor |
| CN104104673A (en) * | 2014-06-30 | 2014-10-15 | 重庆智韬信息技术中心 | Method for realizing security payment through third party unified dynamic authorization code |
| CN105450598A (en) * | 2014-08-14 | 2016-03-30 | 上海坤士合生信息科技有限公司 | Information identification method, information identification equipment and user terminal |
| CN105868982A (en) * | 2016-04-15 | 2016-08-17 | 姚晓宁 | Improved mobile Internet payment system and control method thereof |
| CN107592345A (en) * | 2017-08-28 | 2018-01-16 | 中国工商银行股份有限公司 | Transaction current-limiting apparatus, method and transaction system |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110121119A (en) * | 2010-04-30 | 2011-11-07 | 한국정보통신주식회사 | Affiliated store's terminal and customer's terminal |
| CN103218715A (en) * | 2013-03-26 | 2013-07-24 | 苏州通付盾信息技术有限公司 | Dynamic payment code implementation method in cloud payment system |
| CN105590199B (en) * | 2014-11-14 | 2020-08-25 | 中国银联股份有限公司 | Payment method and payment system based on dynamic two-dimensional code |
| WO2017128684A1 (en) * | 2016-01-29 | 2017-08-03 | 上海新卡说信息技术有限公司 | Transaction system and transaction processing method |
| CN106447332A (en) * | 2016-10-14 | 2017-02-22 | 冯文军 | Safety management method and system for bank card |
-
2018
- 2018-03-15 CN CN201810215687.9A patent/CN108492109B/en active Active
- 2018-08-24 WO PCT/CN2018/102092 patent/WO2019174185A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8655939B2 (en) * | 2007-01-05 | 2014-02-18 | Digital Doors, Inc. | Electromagnetic pulse (EMP) hardened information infrastructure with extractor, cloud dispersal, secure storage, content analysis and classification and method therefor |
| CN104104673A (en) * | 2014-06-30 | 2014-10-15 | 重庆智韬信息技术中心 | Method for realizing security payment through third party unified dynamic authorization code |
| CN105450598A (en) * | 2014-08-14 | 2016-03-30 | 上海坤士合生信息科技有限公司 | Information identification method, information identification equipment and user terminal |
| CN105868982A (en) * | 2016-04-15 | 2016-08-17 | 姚晓宁 | Improved mobile Internet payment system and control method thereof |
| CN107592345A (en) * | 2017-08-28 | 2018-01-16 | 中国工商银行股份有限公司 | Transaction current-limiting apparatus, method and transaction system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108492109A (en) | 2018-09-04 |
| WO2019174185A1 (en) | 2019-09-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108492109B (en) | Electronic device, dynamic code request processing method and storage medium | |
| JP6703013B2 (en) | Payment threshold acquisition method and device | |
| CN109885399A (en) | Data processing method, electronic device, computer equipment and storage medium | |
| CN108711047B (en) | Automatic repayment method, system and terminal equipment | |
| JP2012533824A (en) | Systems and methods for real-time batch account processing | |
| CN111641563B (en) | Flow self-adaption method and system based on distributed scene | |
| CN107527222B (en) | Information processing method, device and system | |
| CN108446270B (en) | Electronic device, early warning method of system sensitive content and storage medium | |
| CN108985801A (en) | channel management method and system | |
| CN114257551A (en) | Distributed current limiting method and system and storage medium | |
| CN112132674A (en) | Transaction processing method and device | |
| CN115145587A (en) | Product parameter checking method and device, electronic equipment and storage medium | |
| CN111541703B (en) | Terminal equipment authentication method and device, computer equipment and storage medium | |
| CN111105238A (en) | Transaction risk control method and device | |
| CN114157482A (en) | Service access control method, device, control equipment and storage medium | |
| CN112330448A (en) | Fund management method, terminal device and storage medium | |
| CN108038783B (en) | Position management method, system and computer readable storage medium | |
| WO2020191338A1 (en) | Resource stabilization in a distributed network | |
| CN106570734B (en) | Game transaction request processing method and device | |
| US10050979B2 (en) | Executing a process based on validity information indicating one of validity and invalidity | |
| CN113971552B (en) | Batch data processing method, device, equipment and storage medium | |
| CN116723156A (en) | Transaction flow switching method, device, equipment and storage medium | |
| CN112822022B (en) | Multi-signature address updating method and related device | |
| CN113766442B (en) | Telephone traffic resource sharing method and device, computing equipment and storage medium | |
| CN109039691B (en) | Server, method for predicting system call amount 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 |