CN111107075A

CN111107075A - Request response method and device, electronic equipment and computer-readable storage medium

Info

Publication number: CN111107075A
Application number: CN201911289780.5A
Authority: CN
Inventors: 牟天宇; 孟宪哲; 叶红; 吕博良
Original assignee: Industrial and Commercial Bank of China Ltd ICBC
Current assignee: Industrial and Commercial Bank of China Ltd ICBC
Priority date: 2019-12-13
Filing date: 2019-12-13
Publication date: 2020-05-05

Abstract

The present disclosure provides a request response method, including: monitoring the received resource request quantity, and determining whether the ratio of the received resource request quantity to the currently unallocated resource quantity is greater than or equal to a limit ratio; under the condition that the ratio of the received resource request amount to the currently unallocated resource amount is greater than or equal to the limit ratio, sending a computing task to a client sending the resource request so that the client can execute the computing task; receiving a calculation result sent by a client, wherein the calculation result is obtained after the client executes a calculation task; verifying whether the calculation result sent by the client is correct or not; and under the condition that the calculation result is correct, allocating resources to the client sending the correct calculation result. The present disclosure also provides a request response device, an electronic apparatus, and a computer-readable storage medium.

Description

Request response method and device, electronic equipment and computer-readable storage medium

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a request response method, a request response device, an electronic device, and a computer-readable storage medium.

Background

At present, when preferential promotion or scarce resource reservation is carried out through an internet channel, resources are generally released according to a requested time sequence, and the mode is easy to seize the nominal amount of network black-birth/yellow cattle holding a large number of virtual card numbers and account resources by a hand through a plug-in program, so that the profit is realized. For example, the e-commerce company carries out second killing of activities, ticket robbing, reservation registration, reservation commemorative coins and the like, and the user often has the situation that related resources cannot be obtained.

The existing prevention and control method generally adopts a mode of increasing man-machine authentication difficulty (such as increasing verification codes) or controlling network IP access frequency to prevent, but along with the prevalence of a code printing platform (a platform specially used for identifying verification codes) and an IP agent resource pool in a black birth circle, the measures are difficult to block the situation that the black birth occupies resources, but can reduce the use experience of users, and even normal users miss the name of scarce resources due to the fact that the normal users read the verification codes and increase the time for placing a single.

Disclosure of Invention

In view of the above, the present disclosure provides a request response method, a request response device, an electronic device, and a computer-readable storage medium.

One aspect of the present disclosure provides a request response method, including: monitoring the received resource request quantity, and determining whether the ratio of the received resource request quantity to the currently unallocated resource quantity is greater than or equal to a limit ratio; under the condition that the ratio of the received resource request amount to the currently unallocated resource amount is greater than or equal to the limit ratio, sending a computing task to a client sending a resource request, so that the client executes the computing task; receiving a calculation result sent by the client, wherein the calculation result is obtained after the client executes the calculation task; verifying whether the calculation result sent by the client is correct or not; and under the condition that the calculation result is correct, allocating resources to the client sending the correct calculation result.

According to an embodiment of the present disclosure, the method further includes: before sending a computing task to a client side sending a resource request, determining the computing difficulty of the computing task to be sent according to the ratio of the received resource request amount to the currently unallocated resource amount; and

and sending the computing task matched with the computing difficulty to the client sending the resource request.

According to the embodiment of the disclosure, sending the computing task matched with the computing difficulty to the client sending the resource request comprises: sending the computation difficulty value, the puzzle seed and the current timestamp to the client sending the resource request so that the client executes:

performing a hash operation using the computation difficulty value, the puzzle seed, the current timestamp, the network address of the client, the random number, and the initial value of the computation task as computation parameters;

transforming the initial value of the calculation task once or for many times, and continuing to perform Hash operation based on the transformed initial value until the result obtained by the Hash operation meets the preset condition; and

and under the condition that the result obtained by the Hash operation meets a preset condition, sending the calculation parameters participating in the Hash operation to a server for allocating resources, so that the server for allocating resources can verify the calculation parameters participating in the Hash operation.

According to an embodiment of the present disclosure, the method further includes: caching the received resource request in a request queue before sending a computing task to a client sending the resource request; and distributing the calculation difficulty value, the puzzle seed and the current timestamp of the calculation task to be sent for each resource request in the request queue.

According to an embodiment of the present disclosure, the method further includes: and under the condition that the calculation result is wrong, returning prompt information for refusing to allocate the resources to the client side which sends the wrong calculation result.

According to an embodiment of the present disclosure, the method further includes: and under the condition that the ratio of the received resource request amount to the currently unallocated resource amount is smaller than the limit ratio, allocating resources to all the clients sending the resource requests.

Another aspect of the present disclosure provides a request response apparatus including: the first determining module is used for monitoring the received resource request quantity and determining whether the ratio of the received resource request quantity to the currently unallocated resource quantity is greater than or equal to a limit ratio; a sending module, configured to send a computing task to a client that sends a resource request when a ratio between the received resource request amount and a currently unallocated resource amount is greater than or equal to the limit ratio, so that the client executes the computing task; a receiving module, configured to receive a calculation result sent by the client, where the calculation result is obtained after the client executes the calculation task; the verification module is used for verifying whether the calculation result sent by the client is correct or not; and the first allocation module is used for allocating resources to the client sending the correct calculation result under the condition that the calculation result is correct.

According to an embodiment of the present disclosure, the apparatus further includes: the second determining module is used for determining the calculation difficulty of the calculation task to be sent according to the ratio of the received resource request quantity to the currently unallocated resource quantity before sending the calculation task to the client side sending the resource request; and the sending module is used for sending the computing task matched with the computing difficulty to the client side sending the resource request.

According to an embodiment of the present disclosure, the sending module is configured to: sending the computation difficulty value, the puzzle seed and the current timestamp to the client sending the resource request so that the client executes: performing a hash operation using the computation difficulty value, the puzzle seed, the current timestamp, the network address of the client, the random number, and the initial value of the computation task as computation parameters; transforming the initial value of the calculation task once or for many times, and continuing to perform Hash operation based on the transformed initial value until the result obtained by the Hash operation meets the preset condition; and sending the calculation parameters participating in the hash operation to a server for allocating resources under the condition that the result obtained by the hash operation meets a preset condition, so that the server for allocating resources can verify the calculation parameters participating in the hash operation.

According to an embodiment of the present disclosure, the apparatus further includes a caching module, configured to cache the received resource request in a request queue before sending the computing task to the client that sends the resource request; and the second distribution module is used for distributing the calculation difficulty value, the puzzle seed and the current timestamp of the calculation task to be sent for each resource request in the request queue.

According to an embodiment of the present disclosure, the apparatus further includes: and the feedback module is used for returning prompt information for refusing to allocate resources to the client side which sends the wrong calculation result under the condition that the calculation result is wrong.

According to an embodiment of the present disclosure, the apparatus further includes a second allocating module, configured to allocate resources to all clients sending resource requests when a ratio of the received resource request amount to a currently unallocated resource amount is smaller than the limit ratio.

Another aspect of the present disclosure provides an electronic device including: one or more processors; a memory for storing one or more instructions, wherein the one or more instructions, when executed by the one or more processors, cause the one or more processors to implement the method as described above.

Another aspect of the present disclosure provides a computer-readable storage medium storing computer-executable instructions for implementing the method as described above when executed.

Another aspect of the disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.

According to the embodiment of the disclosure, if a large number of resource requests are sent by the same client, a large number of computing tasks will be received, and in the case that the client receives a large number of computing tasks, hardware resources such as memory and CPU resources of the client will be consumed greatly. By the embodiment of the disclosure, the memory and CPU resources of the black product equipment using a large number of plug-in tools can be greatly consumed while normal user equipment is not influenced by executing a calculation task, so that the working efficiency of the black product equipment is reduced, and normal users can obtain the welfare of activities.

By means of the method and the device, the behavior of using batch tools to brush the list of the black products is analyzed, the working efficiency of the list brushing equipment is controlled, black and gray product practitioners cannot bypass the request response method through black product tools such as a code printing platform and an IP proxy resource pool, and the effectiveness of the request response method is greatly improved. For the client, the conventional man-machine identification means such as picture authentication codes and answering are replaced, so that the user who normally initiates the request can pass the verification only by automatically calculating the answer of the puzzle once at the background for several seconds, the verification means is transparent to the client, and the effect of the client experience is improved.

Drawings

The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:

FIG. 1 schematically illustrates an exemplary system architecture to which the request response method and apparatus may be applied, according to an embodiment of the present disclosure;

FIG. 2 schematically illustrates a flow chart of a request response method according to an embodiment of the disclosure;

FIG. 3 schematically illustrates a flow diagram of a request response method according to another embodiment of the present disclosure;

FIG. 4 schematically illustrates a flow diagram of a computing task performed by a client in accordance with an embodiment of the present disclosure;

FIG. 5 schematically illustrates a flow diagram of a request response method according to another embodiment of the disclosure;

FIG. 6 schematically illustrates a flow diagram of a request response method according to another embodiment of the present disclosure;

FIG. 7 schematically shows a block diagram of a request response device according to an embodiment of the disclosure; and

FIG. 8 schematically illustrates a block diagram of a computer system suitable for implementing a request response method in accordance with an embodiment of the present disclosure.

Detailed Description

Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.

All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.

Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).

An embodiment of the present disclosure provides a request response method, including: monitoring the received resource request quantity, and determining whether the ratio of the received resource request quantity to the currently unallocated resource quantity is greater than or equal to a limit ratio; under the condition that the ratio of the received resource request amount to the currently unallocated resource amount is greater than or equal to the limit ratio, sending a computing task to a client sending the resource request so that the client can execute the computing task; receiving a calculation result sent by a client, wherein the calculation result is obtained after the client executes a calculation task; verifying whether the calculation result sent by the client is correct or not; and under the condition that the calculation result is correct, allocating resources to the client sending the correct calculation result.

The request response method provided by the disclosure can be used for the enterprises to give red packets, coupons, kill every second in limited time and other common activities, original man-machine identification (such as pictures and short message verification codes) is changed into control over equipment initiating transactions by changing the request response flow, the execution efficiency of black and grey product batch tools can be reduced, the enterprises are prevented from popularizing welfare resource waste, and the effective utilization rate of resources is improved.

Fig. 1 schematically illustrates an exemplary system architecture to which the request response method and apparatus may be applied, according to an embodiment of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.

As shown in fig. 1, the system architecture 100 according to this embodiment may include

terminal devices

101, 102, 103, a network 104 and a server 105. The network 104 serves as a medium for providing communication links between the

terminal devices

101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired and/or wireless communication links, and so forth.

The user may use the

terminal devices

101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The

terminal devices

101, 102, 103 may have installed thereon various communication client applications, such as a shopping-like application, a web browser application, a search-like application, an instant messaging tool, a mailbox client, and/or social platform software, etc. (by way of example only).

The

terminal devices

101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the

terminal devices

101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.

It should be noted that the request response method provided by the embodiment of the present disclosure may be generally executed by the server 105. Accordingly, the request response device provided by the embodiment of the present disclosure may be generally disposed in the server 105. The request response method provided by the embodiment of the present disclosure may also be performed by a server or a server cluster that is different from the server 105 and is capable of communicating with the

terminal devices

101, 102, 103 and/or the server 105. Accordingly, the request responding device provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the server 105 and capable of communicating with the

terminal devices

101, 102, 103 and/or the server 105.

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Fig. 2 schematically shows a flow chart of a request response method according to an embodiment of the present disclosure.

As shown in fig. 2, the method includes operations S201 to S205.

In operation S201, the received resource request amount is monitored, and it is determined whether a ratio of the received resource request amount to the currently unallocated resource amount is greater than or equal to a limit ratio.

According to an embodiment of the present disclosure, the resource requested to be allocated may be a coupon, a train ticket, a concert ticket, or other resources. The amount of resource requests received may be the amount of resource requests in the last period of time, e.g., the amount of resource requests in the last 30 seconds, the amount of resource requests in the last 5 seconds, etc.

According to the embodiment of the present disclosure, for example, the amount of the resource request received in the last 5 seconds is 1 ten thousand, the amount of the currently unallocated resource is 0.8 ten thousand train tickets, and the limit ratio is 90%. The ratio of the received resource request amount to the current unallocated resource amount is 125%, and the ratio of the received resource request amount to the current unallocated resource amount is greater than the limit ratio.

According to the embodiment of the present disclosure, for another example, the amount of the resource request received in the last 5 seconds is 0.4 ten thousand, the amount of the currently unallocated resource is 0.8 ten thousand train tickets, and the limit ratio is 45%. The ratio of the received resource request amount to the current unallocated resource amount is 50%, and the ratio of the received resource request amount to the current unallocated resource amount is greater than the limit ratio.

According to the embodiment of the disclosure, or monitoring the received resource request amount, it may also be determined whether the received resource request amount within the predetermined time length range is greater than or equal to a preset threshold, and if it is determined that the received resource request amount within the predetermined time length range is greater than or equal to the preset threshold, a resource contention mechanism based on workload certification is directly started. The resource competition mechanism based on the workload certification may refer to sending the computing task to the client for execution, and allocating the resource to the client with the correct computing result.

In operation S202, in a case that a ratio of the received resource request amount to the currently unallocated resource amount is greater than or equal to a limit ratio, a computing task is transmitted to the client that transmitted the resource request, so that the client performs the computing task.

According to the embodiment of the disclosure, if a large number of resource requests are sent by the same client, a large number of computing tasks will be received, and each computing task received by the client needs to be executed.

According to the embodiment of the disclosure, under the condition that the ratio of the received resource request amount to the currently unallocated resource amount is smaller than the limit ratio, resources are directly allocated to all clients sending resource requests without starting a resource competition mechanism based on workload certification.

In operation S203, a calculation result sent by the client is received, where the calculation result is obtained after the client performs a calculation task.

In operation S204, it is verified whether the calculation result sent by the client is correct.

In operation S205, in case the calculation result is correct, a resource is allocated to the client that transmitted the correct calculation result.

According to the embodiment of the disclosure, in the case that the calculation result sent by the client is wrong, the prompt information for refusing to allocate the resource can be returned to the client sending the wrong calculation result.

By the embodiment of the disclosure, the behavior of using a batch tool to brush the list of the black products can be analyzed, and the work efficiency of the list brushing equipment is controlled, so that black and gray product practitioners cannot bypass the request response method through black product tools such as a code printing platform and an IP proxy resource pool, and the effectiveness of the request response method is greatly improved. For the client, the conventional man-machine identification means such as picture authentication codes and answering are replaced, so that the user who normally initiates the request can pass the verification only by automatically calculating the answer of the puzzle once at the background for several seconds, the verification means is transparent to the client, and the effect of the client experience is improved.

The method shown in fig. 2 is further described with reference to fig. 3-6 in conjunction with specific embodiments.

Fig. 3 schematically shows a flow chart of a request response method according to another embodiment of the present disclosure.

As shown in fig. 3, the method includes operations S301 to S302.

In operation S301, before sending a computing task to a client that sends a resource request, a computing difficulty of the computing task to be sent is determined according to a ratio of a received resource request amount to a current unallocated resource amount.

According to the embodiment of the disclosure, different calculation difficulties can be determined for different ratios. For example, when the ratio is 0.8, the calculation difficulty of the corresponding calculation task is 5; when the ratio is 0.9, the calculation difficulty of the corresponding calculation task is 6. The computational difficulty of the computational task to be sent may increase with increasing ratio.

In operation S302, a computing task matching the computing difficulty is sent to the client sending the resource request.

According to the embodiment of the disclosure, when the unallocated resources are less and less, the calculation difficulty of the calculation task can be greater and greater, the difficulty of obtaining the resources is increased, and the resource competition severity can be increased.

According to the embodiment of the disclosure, the difficulty (complexity) of the calculation task is determined according to the proportion of the received resource request amount and the currently unallocated resource amount, so that the effect of dynamically adjusting the calculation difficulty is achieved, and the proper difficulty can enable normal user equipment not to be influenced and simultaneously enable a large amount of memory and CPU resources of grey product equipment using the plug-in tool to be consumed greatly, thereby reducing the working efficiency of the grey product tool and enabling normal users to obtain the benefit of activities.

According to an embodiment of the present disclosure, sending, by a server responsible for allocating resources, a computing task matching the computing difficulty to a client sending a resource request may include sending a computing difficulty value, a puzzle seed, and a current timestamp to the client sending the resource request.

According to embodiments of the present disclosure, the server responsible for allocating resources may include a puzzle issuing system. The server puzzle issuing system can comprise a puzzle difficulty generation module and a puzzle seed generation module.

The difficult problem difficulty generation module is used for counting the number of the cached resource requests, generating a difficult problem difficulty I according to the proportion of the difficult problem difficulty I to the marketing resources, and sending the difficult problem difficulty I to the difficult problem seed generation module.

The puzzle seed generation module generates a random number R by using a safe random number generation algorithm, the random number R serves as a seed of a Hash algorithm, and the random number R and the difficulty I generated by the puzzle difficulty generation module are sent to the client.

Fig. 4 schematically illustrates a flow diagram of a computing task performed by a client in accordance with an embodiment of the disclosure.

As shown in fig. 4, the method includes operations S401 to S403.

In operation S401, hash operation is performed using the computation difficulty value, the puzzle seed, the current timestamp, the network address of the client, the random number, and the initial value of the computation task as computation parameters.

In operation S402, the initial value of one or more computation tasks is transformed, and the hash operation is continued based on the transformed initial value until a result obtained by the hash operation satisfies a preset condition.

In operation S403, in a case that a result obtained by the hash operation satisfies a preset condition, the calculation parameter participating in the hash operation is sent to the server that allocates the resource, so that the server that allocates the resource verifies the calculation parameter participating in the hash operation.

According to the embodiment of the disclosure, for example, the client may obtain the current timestamp T of the server, and calculate the difficulty value I and the difficulty seed R. The client can generate the network address IP of the client, the random number Y and the initial value of the calculation task (namely the puzzle answer X) by itself, and then carry out the hash operation. The initial value (the difficult answer X) is continuously changed until an answer X is found to enable the last I bit of the character string obtained by H ((X Y R T IP I) to be 0, and the calculated parameter and the answer are sent to the server, wherein the preset condition can be that the last I bit of the character string obtained by H ((X Y R T IP I) is 0.

According to the embodiment of the disclosure, the server may further include a puzzle answer verification module for obtaining each calculation parameter in the resource request, calculating H ((X | | Y | | R | | T | | IP | | | I) according to the parameter, if the last I bit of the obtained character string is 0, considering that the user calculates correctly, and issuing the resource to the corresponding client.

Fig. 5 schematically shows a flow chart of a request response method according to another embodiment of the present disclosure.

As shown in fig. 5, the method includes operations S501 to S509.

In operation S501, resource contention is monitored. The ratio of resource requests to currently unallocated resources, i.e., the ratio of resource contention, may be monitored.

In operation S502, it is determined whether the resource contention ratio exceeds a threshold.

In operation S503, when the resource contention ratio is greater than or equal to the threshold value within the fixed time, resource contention based on the workload certification is started, and the resource contention ratio is transmitted to the difficulty level generation module. If the resource contention ratio is less than the threshold, indicating that the resources are sufficient, operation S508 is performed.

In operation S504, a puzzle is generated. The problem difficulty generating module of the problem issuing system generates a problem difficulty I according to the current resource competition proportion, and the problem seed generating module generates a random number R.

In operation S505, a puzzle is issued. And adding the difficulty I and the random number R to the current system timestamp T to form a formal difficulty (I, R, T) and issuing the formal difficulty (I, R, T) to the client.

In operation S506, the client calculates a puzzle. And a client-side puzzle calculation module of the client system calculates answers according to the formal puzzle, and sends the random number Y, the puzzle answer X and the IP of the client-side puzzle calculation module to the puzzle verification system together with the resource application by taking the random number Y, the puzzle answer X and the IP as answers.

In operation S507, the puzzle answer verifying module of the puzzle verifying system verifies whether the answer is correct according to the answer submitted by the user.

In operation S508, in case that the answer is accurate, a resource is allocated to the corresponding customer. Or, when the answer is accurate and the resource can be allocated, the resource is allocated to the corresponding client.

In operation S509, in case the answer is inaccurate, the allocation of the resource is denied. Or refusing to allocate the resource under the condition that the answer is not accurate and the resource is not allocable.

According to the embodiment of the disclosure, the request response method provided by the disclosure can be used for the enterprise to issue red packages, coupons, kills and other common activities in a limited time, original man-machine identification (such as pictures and short message verification codes) is changed into control over equipment initiating transactions by changing the request response flow, the execution efficiency of a black and grey product batch tool can be reduced, the enterprise is prevented from popularizing welfare resource waste, and the effective utilization rate of resources is improved.

Fig. 6 schematically shows a flow chart of a request response method according to another embodiment of the present disclosure.

As shown in fig. 6, the method includes operations S601 to S602.

In operation S601, received resource requests are buffered in a request queue before sending a computing task to a client sending the resource requests.

In operation S602, a computation difficulty value, a puzzle seed, and a current timestamp of a computation task to be sent are allocated for each resource request in the request queue.

According to the embodiment of the disclosure, the resource requests sent by the client within a fixed time can be cached in the request queue, and the calculation difficulty value, the puzzle seed and the current timestamp of the calculation task to be sent are allocated to each resource request according to the sequence in the request queue.

Fig. 7 schematically shows a block diagram of a request response device according to an embodiment of the present disclosure.

As shown in fig. 7, the request response apparatus 700 includes a first determining module 701, a sending module 702, a receiving module 703, a verifying module 704, and a first allocating module 705.

The first determining module 701 is configured to monitor the received resource request amount, and determine whether a ratio of the received resource request amount to a currently unallocated resource amount is greater than or equal to a limit ratio.

The sending module 702 is configured to send a computing task to a client that sends a resource request, so that the client executes the computing task, when a ratio of the received resource request amount to the currently unallocated resource amount is greater than or equal to a limit ratio.

The receiving module 703 is configured to receive a calculation result sent by the client, where the calculation result is obtained after the client executes a calculation task.

The verification module 704 is configured to verify whether the calculation result sent by the client is correct.

The first allocating module 705 is configured to, in a case that the calculation result is correct, allocate a resource to the client that sends the correct calculation result.

According to an embodiment of the present disclosure, the request responding apparatus 700 further includes a second determining module and a transmitting module.

The second determining module is used for determining the calculation difficulty of the calculation task to be sent according to the ratio of the received resource request amount to the currently unallocated resource amount before sending the calculation task to the client sending the resource request.

The sending module is used for sending the computing task matched with the computing difficulty to the client side sending the resource request.

According to an embodiment of the disclosure, the sending module is configured to send the computation difficulty value, the puzzle seed, and the current timestamp to a client sending the resource request, so that the client performs:

taking the calculation difficulty value, the difficulty seed, the current timestamp, the network address of the client, the random number and the initial value of the calculation task as calculation parameters to carry out Hash operation;

transforming the initial value of one or more times of calculation tasks, and continuing to perform Hash operation based on the transformed initial value until the result obtained by the Hash operation meets the preset condition;

and under the condition that the result obtained by the Hash operation meets the preset condition, sending the calculation parameters participating in the Hash operation to the server for allocating resources so that the server for allocating resources can verify the calculation parameters participating in the Hash operation.

According to an embodiment of the present disclosure, the request responding apparatus 700 further includes a caching module and a second allocating module.

The caching module is used for caching the received resource requests in a request queue before sending the computing tasks to the client side sending the resource requests.

The second distribution module is used for distributing the calculation difficulty value, the puzzle seed and the current timestamp of the calculation task to be sent for each resource request in the request queue.

According to the embodiment of the present disclosure, the request responding apparatus 700 further includes a feedback module, configured to return, to the client that sends the wrong calculation result, a prompt message for rejecting resource allocation in case that the calculation result is wrong.

According to the embodiment of the present disclosure, the request responding apparatus 700 further includes a second allocating module, configured to allocate resources to all clients sending resource requests, when a ratio of the received resource request amount to the currently unallocated resource amount is smaller than a limit ratio.

Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.

For example, any plurality of the first determining module 701, the sending module 702, the receiving module 703, the verifying module 704 and the first allocating module 705 may be combined and implemented in one module/unit/sub-unit, or any one of the modules/units/sub-units may be split into a plurality of modules/units/sub-units. Alternatively, at least part of the functionality of one or more of these modules/units/sub-units may be combined with at least part of the functionality of other modules/units/sub-units and implemented in one module/unit/sub-unit. According to an embodiment of the present disclosure, at least one of the first determining module 701, the sending module 702, the receiving module 703, the verifying module 704 and the first allocating module 705 may be at least partially implemented as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or the same hardware in any other reasonable manner of integrating or packaging a circuit, or implemented in any one of three implementations of software, hardware and firmware, or in a suitable combination of any several of them. Alternatively, at least one of the first determining module 701, the sending module 702, the receiving module 703, the verifying module 704 and the first allocating module 705 may be at least partly implemented as a computer program module, which when executed may perform a corresponding function.

It should be noted that the request response device portion in the embodiment of the present disclosure corresponds to the request response method portion in the embodiment of the present disclosure, and the description of the request response device portion specifically refers to the request response method portion, which is not described herein again.

The present disclosure also provides an electronic device, including: one or more processors; memory to store one or more instructions that, when executed by the one or more processors, cause the one or more processors to implement a request response method as described above.

FIG. 8 schematically illustrates a block diagram of a computer system suitable for implementing the above-described method, according to an embodiment of the present disclosure. The computer system illustrated in FIG. 8 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure.

As shown in fig. 8, a computer system 800 according to an embodiment of the present disclosure includes a processor 801 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. The processor 801 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 801 may also include onboard memory for caching purposes. The processor 801 may include a single processing unit or multiple processing units for performing different actions of the method flows according to embodiments of the present disclosure.

In the RAM 803, various programs and data necessary for the operation of the system 800 are stored. The processor 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. The processor 801 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 802 and/or RAM 803. Note that the programs may also be stored in one or more memories other than the ROM 802 and RAM 803. The processor 801 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.

System 800 may also include an input/output (I/O) interface 805, also connected to bus 804, according to an embodiment of the disclosure. The system 800 may also include one or more of the following components connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.

According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program, when executed by the processor 801, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.

According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. Examples may include, but are not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 802 and/or RAM 803 described above and/or one or more memories other than the ROM 802 and RAM 803.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.

The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims

1. A request response method, comprising:

monitoring the received resource request quantity, and determining whether the ratio of the received resource request quantity to the currently unallocated resource quantity is greater than or equal to a limit ratio;

under the condition that the ratio of the received resource request amount to the currently unallocated resource amount is greater than or equal to the limit ratio, sending a computing task to a client sending a resource request so that the client can execute the computing task;

receiving a calculation result sent by the client, wherein the calculation result is obtained after the client executes the calculation task;

verifying whether the calculation result sent by the client is correct or not; and

and under the condition that the calculation result is correct, allocating resources to the client sending the correct calculation result.

2. The method of claim 1, further comprising:

before sending a computing task to a client side sending a resource request, determining the computing difficulty of the computing task to be sent according to the ratio of the received resource request amount to the currently unallocated resource amount; and

3. The method of claim 2, wherein sending the computing task matching the computing difficulty to the client sending the resource request comprises:

sending the calculation difficulty value, the puzzle seed and the current timestamp to the client sending the resource request so that the client can execute:

performing hash operation by taking the calculation difficulty value, the puzzle seed, the current timestamp, the network address of the client, the random number and the initial value of the calculation task as calculation parameters;

4. The method of claim 3, further comprising:

caching the received resource request in a request queue before sending a computing task to a client sending the resource request; and

and distributing the calculation difficulty value, the puzzle seed and the current timestamp of the calculation task to be sent for each resource request in the request queue.

5. The method of claim 1, further comprising:

and under the condition that the calculation result is wrong, returning prompt information for refusing to allocate the resources to the client side which sends the wrong calculation result.

6. The method of claim 1, further comprising:

and under the condition that the ratio of the received resource request amount to the currently unallocated resource amount is smaller than the limit ratio, allocating resources to all clients sending resource requests.

7. A request response device comprising:

the first determining module is used for monitoring the received resource request quantity and determining whether the ratio of the received resource request quantity to the current unallocated resource quantity is greater than or equal to a limit ratio;

a sending module, configured to send a computing task to a client that sends a resource request when a ratio of the received resource request amount to a currently unallocated resource amount is greater than or equal to the limit ratio, so that the client executes the computing task;

the receiving module is used for receiving a calculation result sent by the client, wherein the calculation result is obtained after the client executes the calculation task;

the verification module is used for verifying whether the calculation result sent by the client is correct or not; and

and the first allocation module is used for allocating resources to the client sending the correct calculation result under the condition that the calculation result is correct.

8. The apparatus of claim 7, further comprising:

the second determining module is used for determining the calculation difficulty of the calculation task to be sent according to the ratio of the received resource request amount to the currently unallocated resource amount before sending the calculation task to the client side sending the resource request; and

and the sending module is used for sending the computing task matched with the computing difficulty to the client side sending the resource request.

9. The apparatus of claim 8, wherein the means for transmitting is configured to:

10. The apparatus of claim 9, further comprising:

the cache module is used for caching the received resource requests in a request queue before sending the computing tasks to a client side sending the resource requests; and

and the second distribution module is used for distributing the calculation difficulty value, the puzzle seed and the current timestamp of the calculation task to be sent for each resource request in the request queue.

11. The apparatus of claim 7, further comprising:

and the feedback module is used for returning prompt information for refusing to allocate resources to the client side which sends the wrong calculation result under the condition that the calculation result is wrong.

12. The apparatus of claim 7, further comprising:

13. An electronic device, comprising:

one or more processors;

a memory to store one or more instructions that,

wherein the one or more instructions, when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.

14. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to carry out the method of any one of claims 1 to 6.