CN112714187B - Message pushing control method, electronic device, computer equipment and storage medium - Google Patents

Message pushing control method, electronic device, computer equipment and storage medium Download PDF

Info

Publication number
CN112714187B
CN112714187B CN202011621275.9A CN202011621275A CN112714187B CN 112714187 B CN112714187 B CN 112714187B CN 202011621275 A CN202011621275 A CN 202011621275A CN 112714187 B CN112714187 B CN 112714187B
Authority
CN
China
Prior art keywords
pushing
message
balance
task
request
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
Application number
CN202011621275.9A
Other languages
Chinese (zh)
Other versions
CN112714187A (en
Inventor
林才夫
刘金宝
王慧丰
王飞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Bank Co Ltd
Original Assignee
Ping An Bank Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ping An Bank Co Ltd filed Critical Ping An Bank Co Ltd
Priority to CN202011621275.9A priority Critical patent/CN112714187B/en
Publication of CN112714187A publication Critical patent/CN112714187A/en
Application granted granted Critical
Publication of CN112714187B publication Critical patent/CN112714187B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/55Push-based network services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/14Charging, metering or billing arrangements for data wireline or wireless communications
    • H04L12/141Indication of costs
    • H04L12/1421Indication of expected costs

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a message pushing control method, an electronic device, computer equipment and a storage medium, and belongs to the technical field of resource control. The management and control method comprises the following steps: determining an attribution queue of a user according to a request of a message pushing task sent by the user; acquiring a corresponding balance according to the home queue; executing the message pushing task when the balance is determined to meet the request; and updating the balance of the home queue according to the execution result. The invention checks the pushing request of each department by formulating the virtual pushing charging standard and quota so as to remind each department of using the message pushing quota cautiously, thereby realizing the aim of balancing marketing resources.

Description

Message pushing control method, electronic device, computer equipment and storage medium
Technical Field
The invention relates to the technical field of resource management and control, in particular to a management and control method for message pushing, an electronic device, computer equipment and a storage medium.
Background
The message push is a low-cost means for maintaining users, is well known due to accurate putting and low cost, plays an important role in improving the activity of products, the utilization rate of functional modules, the viscosity of users and the retention rate of users, and is a key channel for product operation, and modern enterprises have greater and greater requirements. The message types can be generally classified into marketing type, functional type, and content type. Marketing type messages are marketing type messages actively pushed by enterprises and are generally pushed to a whole number of users, and the marketing type messages mainly comprise messages such as preferential red envelope, limited-time rush purchase, activity promotion and the like. The functional message is a push message triggered based on the user behavior, and mainly comprises a dynamic account notification message, a service application success feedback message and the like. The content type message is personalized pushing of content which may be interested by a user based on analysis of client interests and behaviors.
Marketing message pushing is an important means for each company to achieve the purposes of product promotion, customer promotion and the like. However, the marketing message pushing is also a double-edged sword, and excessive uncontrolled message pushing can cause the discomfort of the customer, thereby influencing the satisfaction degree of the customer. In addition, in a company, many business departments have related KPI indexes which may need to be realized by means of push messages, and how to balance marketing resources among the business departments is a problem to be solved urgently.
Disclosure of Invention
The technical problem to be solved by the invention is to overcome the problem that marketing resources cannot be balanced among business departments in the prior art, and provide a message pushing control method, an electronic device, computer equipment and a storage medium.
The invention solves the technical problems through the following technical scheme:
a management and control method for message pushing comprises the following steps:
determining an attribution queue of a user according to a request of a message pushing task sent by the user;
acquiring a corresponding balance according to the home queue;
executing the message pushing task when the balance is determined to meet the request;
and updating the balance of the home queue according to the execution result.
In the technical scheme, the home queue is used as an accounting unit to account the message pushing task initiated by the user, and the message pushing task is executed only when the balance is enough, so that the function of controlling the message pushing quantity is achieved.
Preferably, the step of determining the home queue of the user according to the request of the message push task sent by the user includes the following sub-steps:
receiving a request message of a message pushing task sent by a user, wherein the request message contains identification information, and the identification information comprises a user identification;
intercepting the user identification in the request message;
and acquiring a queue corresponding to the user identifier as an attribution queue of the user according to the user identifier and a preset user-queue corresponding relation.
In the technical scheme, the home queue of the user initiating the request can be quickly positioned by intercepting the user identifier in the message.
Preferably, the step of calling the balance of the corresponding quota according to the home queue includes the following sub-steps:
acquiring a preset push charging standard;
calling the accumulated pushing amount and quota of the home queue according to the home queue;
and determining the balance of the attribution queue according to the pushing charging standard, the accumulated pushing amount and the quota.
In the technical scheme, the virtual push charging standard and quota are formulated, the push requests of all queues are checked, and the method is simple and clear.
Preferably, the request further includes task information, and the task information includes message pushing amount, message receiving group, and budget amount;
before the step of determining when the balance satisfies the request, further comprising the steps of:
calculating the actual cost of the message pushing task according to the pushing charging standard, the accumulated pushing amount and the message pushing amount;
comparing the actual cost with the budget amount, and determining whether the balance satisfies the request when the actual cost is less than or greater than the budget amount.
According to the technical scheme, before accounting is carried out on the pushing requests of each queue according to the pushing charging standard and quota, the actual cost and the budget amount of the requests are checked, so that the actual cost of a single message pushing task does not exceed the budget amount.
Preferably, before the step of calculating the actual cost of the message pushing task, the method further comprises the following steps:
checking whether the number of the receivers contained in the message receiving group is consistent with the message pushing amount;
when the information pushing task is consistent with the information pushing task, the verification is passed, and the actual cost of the information pushing task is directly calculated;
and when the message pushing quantity is inconsistent with the message pushing quantity, the message pushing quantity is updated to the number of the receivers contained in the message receiving group, which means that the verification is not passed.
In the technical scheme, before the actual expense and the budget amount are checked, the consistency of the number of the receivers and the message pushing amount is checked to ensure that the pushing amount filled by the user is correct.
Preferably, the method further comprises the steps of:
when the balance is determined not to meet the request, calculating the residual pushing amount according to the balance and the pushing charging standard;
executing the message pushing task according to the residual pushing amount;
calculating the unexecuted pushing amount according to the residual pushing amount and the message pushing amount;
and feeding back an execution result to the user, wherein the execution result comprises information used for representing the unexecuted pushing quantity.
According to the technical scheme, when the balance can not meet the pushing amount, pushing is carried out according to the balance amount, the result is fed back to the user, and the execution mode is high in flexibility.
Preferably, the method further comprises the steps of:
refusing to execute the message pushing task when the balance does not satisfy the request;
calculating the residual pushing amount according to the balance and the pushing charging standard;
and feeding back the execution result and the information representing the residual pushing amount to the user.
In the technical scheme, when the balance cannot meet the pushing amount, the residual pushing amount is fed back to the user, and the user selects to change the message pushing amount and then executes or abandons the execution so as to remind each department of cautious use of the message pushing amount.
The invention also discloses a message pushing control device, which comprises:
the request analysis module is used for determining the home queue of the user according to a request of a message pushing task sent by the user;
a balance acquisition module, configured to acquire a corresponding balance according to the home queue;
the task execution module is used for executing the message pushing task when the balance is determined to meet the request;
and the balance updating module is used for updating the balance of the attribution queue according to the execution result.
In the technical scheme, the home queue is used as an accounting unit to account the message pushing task initiated by the user, and the message pushing task is executed only when the balance is enough, so that the function of controlling the message pushing quantity is achieved.
The invention also discloses a computer device, which comprises a memory and a processor, wherein the memory stores a computer program, and the computer program realizes the steps of the message pushing management and control method according to any one of the above technical schemes when being executed by the processor.
The invention further discloses a computer-readable storage medium, in which a computer program is stored, where the computer program can be executed by at least one processor to implement the steps of the message pushing management and control method according to any one of the foregoing technical solutions.
The positive progress effects of the invention are as follows: by formulating virtual push charging standards and quotas, the push requests of all departments are accounted so as to remind all departments of carefully using message push quotas, thereby achieving the purpose of balancing marketing resources.
Drawings
Fig. 1 shows a flowchart of a first embodiment of a method for managing message pushing according to the present invention;
FIG. 2 shows a flowchart related to step 1 in the first embodiment;
FIG. 3 shows a flow chart related to step 2 in the first embodiment;
fig. 4 shows a flowchart of a second embodiment of the message pushing management and control method of the present invention;
fig. 5 shows a flowchart of a third embodiment of a method for managing and controlling message pushing in the present invention;
fig. 6 shows a flowchart of a fourth embodiment of the method for managing and controlling message pushing in the present invention;
fig. 7 is a block diagram showing a first embodiment of a message pushing managing apparatus according to the present invention;
fig. 8 shows a hardware architecture diagram of an embodiment of the computer apparatus of the present invention.
Detailed Description
The invention is further illustrated by the following examples, which are not intended to limit the scope of the invention.
Firstly, the invention provides a message pushing control method.
In a first embodiment, as shown in fig. 1, the method for managing and controlling message pushing includes the following steps:
step 1: and determining the home queue of the user according to a request of a message pushing task sent by the user.
The request can be specifically initiated on a control platform, the control platform allocates a unique login account and corresponding authority to each user, the user can be a marketing person, and the marketing message pushing is specific to a team or a department in an enterprise, so that each account needs to be divided on the control platform, specifically, the marketing message pushing can be divided according to control groups, and a group is defined as a queue. For example, the division is performed by department, and when an account is allocated, the account needs to be associated with the department; the method can be realized by presetting a department-account corresponding table in the background, and specifically comprises the steps of allocating a department account to each department, and adding the department account in a fixed field of a login account according to an account allocation rule when the login account of a personal user is reallocated. Therefore, when a user sends a request of a message pushing task on the management and control platform, a login account of the user can be directly contained in a request message, and a department account part in the login account can be used as a user identifier; of course, the login account may also be converted into an identifier according to a preset rule and then added to the request message for use.
Thus, as shown in fig. 2, the present step 1 can be realized by the following steps:
step 11: receiving a request message of a message pushing task sent by a user, wherein the request message contains identification information, and the identification information comprises a user identification.
The request message comprises a plurality of characters, the characters are generated according to a preset message rule, the message can be divided into a plurality of segments, each segment comprises at least one character, each segment of the message is used for representing one piece of information, and the user identification is one segment of characters in the request message.
Step 12: intercepting the user identification in the request message.
According to the message rule, a segment of characters representing the user identification is intercepted from a string of characters of the request message.
Step 13: and acquiring a queue corresponding to the user identifier as an attribution queue of the user according to the user identifier and a preset user-queue corresponding relation.
As described above, when the management and control platform allocates the login account to the individual user, a department account (i.e., a queue account) is added to a fixed field of the login account, and the user identifier is generated according to the login account, and naturally includes an identifier for distinguishing the queue.
The user-queue correspondence here, like the identifier and queue correspondence table, can conveniently determine the queue corresponding to the identifier, i.e. the home queue of the user, from the correspondence table according to the identifier for distinguishing the queue contained in the user identifier.
Step 2: and acquiring a corresponding balance according to the home queue.
A virtual push charging standard is configured on the management and control platform and used for defining the cost of each push message; in addition, a virtual quota corresponding to each queue is configured to limit the maximum message sending amount of each queue. When a queue does not send push messages, the balance of the queue is equal to the quota, after a certain number of push messages are sent, the sent push amount needs to be subtracted, and the remaining balance of the queue on the management and control platform is the balance. The balance will change with the push amount and will therefore be constantly updated.
To remind each department to use the message push amount carefully, it is preferable here that the push charging standard is not a simple unit price but a staircase charging standard configured according to an increase in the push amount. To facilitate subsequent requests for balance fulfillment, the balance is not recorded directly, but rather as an accumulated push volume. Thus, as shown in fig. 3, the present step 2 includes the following substeps:
step 21: and acquiring a preset push charging standard.
Step 22: and calling the accumulated pushing amount and quota of the home queue according to the home queue.
Step 23: and determining the balance of the attribution queue according to the pushing charging standard, the accumulated pushing amount and the quota.
Step 2 is further explained below by taking an example that the quota of the marketing department is 3500 yuan and the cumulative pushed amount is 80 ten thousand. The preset push charging criteria are shown in the following table:
push group volume Basic charge standard
Y is less than or equal to 50 ten thousand Y*0.002
Y is more than 50 ten thousand and less than or equal to 100 ten thousand Y*0.003
Y is more than 100 ten thousand and less than or equal to 150 ten thousand Y*0.004
Y is more than 150 ten thousand and less than or equal to 250 ten thousand Y*0.005
Y is more than 250 ten thousand 12500+(Y-2500000)*0.01
Based on the above conditions, the balance of the marketing department is 3500 to 500000 × 0.002- (800000 to 500000) × 0.003=1600 yuan.
And step 3: and executing the message pushing task when the balance is determined to meet the request.
The task information also comprises message pushing amount, the cost required by the message pushing task is calculated according to the message pushing amount and the pushing charging standard, and when the balance is larger than or equal to the cost, the balance meets the request of the current time, so the message pushing task can be directly executed.
In the above example, taking the current message pushing amount as 20 ten thousand as an example, the calculation cost is 200000 × 0.003=600 yuan, and the balance is 1600 yuan, which is larger than the cost required by the current message pushing task, so that the execution can be performed.
Further, in order to alleviate the single push pressure of the message push system, a maximum push amount per day and a maximum push amount per month may be configured at the quota (the maximum push amount per month is equivalent to the aforementioned quota). Based on this, when determining whether the balance meets the request, the single-day balance and the single-month balance need to be considered at the same time, and only when the two meet the request at the same time, the balance meets the request, so that the message pushing task can be executed.
And 4, step 4: and updating the balance of the home queue according to the execution result.
As described above, after the message pushing task is executed, the balance of the home queue needs to be updated in time, so as to manage and control in time. Specifically, the updated balance is obtained by subtracting the cost required by the message pushing task from the obtained balance. Naturally, after the execution is completed, the execution result is fed back to the user.
In the above example, the cost required for the message pushing task is 600 yuan according to the balance of 1600 yuan, so the updated balance is 1600-600=1000 yuan.
In this embodiment, the home queue is used as an accounting unit to account the message pushing task initiated by the user, and the message pushing task is executed only when the balance is sufficient, so as to play a role in controlling the message pushing quantity.
In the second embodiment, based on the first embodiment, the message pushing control method includes the following steps:
steps 1 to 4 are the same as those in the first embodiment, and are not described herein again.
The difference is that, as shown in fig. 4, between step 2 and step 3, the following steps are added:
step 2-1: checking whether the number of the receivers contained in the message receiving group is consistent with the message pushing amount; if the two are consistent, the verification is passed, and the step 2-3 is executed; and if the two are inconsistent, the verification is not passed, and step 2-21 or step 2-22 is executed.
Generally speaking, the task information includes message pushing amount, message receiving group and budget amount; these information are all filled in by the user when initiating the message pushing task, and there is a possibility of errors, especially the message pushing amount, which directly determines the cost required by the message pushing task, so it is particularly important to check the accuracy of the message pushing amount first when determining whether the balance meets the request in order to avoid human misplacement as much as possible.
Specifically, the filled message pushing amount is compared with the number of recipients contained in the message receiving group, so as to judge the accuracy of filling the message pushing amount. Based on the basis that both are erroneous and equal in number with a low probability, it is generally considered that the message pushed amount is filled without errors when both are consistent, and the following amount verification step can be directly performed.
Step 2-21: and updating the message pushing amount to the number of the receivers contained in the message receiving group.
When the message pushing amount is inconsistent with the number of the recipients in the message receiving group, the message pushing platform sends the message according to the recipients in the message receiving group, so that the message pushing amount can be directly updated to the number of the recipients in the message receiving group, and the actual pushing amount is ensured to be consistent with the pushing amount recorded on the control platform.
2-22; refusing to execute the message pushing task.
When the message pushing amount is inconsistent with the receiving people amount contained in the message receiving group, because one of the message pushing amount and the receiving people amount cannot be determined to be wrong, the message pushing task can be directly refused to be executed, and the result is fed back to the user and then the user self-checks the result to correct the error.
The steps 2-21 and 2-22 can be selected to be performed according to the requirement.
And 2-3, calculating the actual cost of the message pushing task according to the pushing charging standard, the accumulated pushing amount and the message pushing amount.
Since a queue contains a plurality of team members, in practice, a department may contain a plurality of employees, and each employee may send a message pushing request, but the overall message pushing situation of the department is not clear, and especially when the pushing charging standard is progressive charging, the message pushing quota is used cautiously. However, when filling in the message pushing amount, it is likely that the cost required by the message pushing is not very clear, so the task information further includes the budget amount, so that the control platform performs amount verification.
Here, the calculation of the actual cost refers to the calculation of the cost required by the current message pushing task in the first embodiment, and is not described herein again.
And 2-4, comparing the actual cost with the budget amount, and determining whether the balance meets the request or not when the actual cost is less than or greater than the budget amount.
Through actual cost and budget amount, the use of message pushing is further controlled, so that all departments can comprehensively consider the pushing quantity and the required cost.
In the second embodiment, on the basis of the first embodiment, verification of the pushing amount and the cost is added, and each department can be helped to better control the pushing amount.
In the third embodiment, based on the second embodiment, the message pushing control method includes the following steps:
step 1 to step 4 are the same as the second embodiment, and are not described herein again.
The difference is that, as shown in fig. 5, before step 4, the following steps are added:
step 3-11: and when the balance is determined not to meet the request, calculating the residual pushing amount according to the balance and the pushing charging standard.
The balance unsatisfied request is determined according to the comparison between the balance and the cost required by the message pushing task, and the specific calculation method of the balance and the cost is described in the first embodiment and is not described herein again. When the balance is less than the fee, it means that the balance does not satisfy the request, but in order to improve the flexibility of execution, the remaining push amount may be calculated based on the balance and the push charging criteria.
Step 3-12: and executing the message pushing task according to the residual pushing amount.
The message pushing task is then executed according to the remaining pushing amount, specifically, the pushing may be in the order of the recipients in the message receiving group contained in the task information, but the message pushing amount is the remaining pushing amount, or may be randomly pushed.
Specifically, it is assumed that the requested message push amount is 1000, but since the remaining push amount is only 800, only 800 are transmitted at this time, and the receiver is determined in the aforementioned sequential or random manner.
Step 3-13: and calculating the unexecuted pushing amount according to the residual pushing amount and the message pushing amount.
After the information is sent according to the remaining push amount, the information needs to be fed back to the user so that the user can know the actual push situation, and therefore the unexecuted push amount needs to be calculated in a calculation manner of message push amount-remaining push amount = unexecuted push amount.
Step 3-14: and feeding back an execution result to the user, wherein the execution result comprises information used for representing the unexecuted pushing quantity.
And finally, feeding back the execution result to the user, wherein the unexecuted pushing amount is used as important information and is contained in the execution result to be fed back together.
In the fourth embodiment, based on the second embodiment, the message pushing control method includes the following steps:
steps 1-4 are the same as those in the second embodiment, and are not repeated herein.
In addition, as shown in fig. 6, before step 4, the following steps may be added:
step 3-21: and refusing to execute the message pushing task when the balance does not meet the request.
The biggest difference between the fourth embodiment and the third embodiment is that when the balance does not satisfy the request, the execution of the message pushing task is directly refused, instead of the execution of the part as described in the third embodiment.
Step 3-22: and calculating the residual pushing amount according to the balance and the pushing charging standard.
This step is the same as step 3-13 in the third embodiment, and is not repeated here.
Step 3-23: and feeding back the execution result and the information representing the residual pushing amount to the user.
The execution result is to refuse execution, but at the same time, the remaining push amount needs to be fed back to the user together to inform the user of the maximum available push amount, so that the user can modify the request information in time.
Secondly, the present invention provides a message pushing management device, and the device 20 may be divided into one or more modules.
For example, fig. 7 shows a structure diagram of a first embodiment of the message pushing management device 20, in which the device 20 may be divided into a request parsing module 201, a balance obtaining module 202, a task executing module 203, and a balance updating module 204. The following description will specifically introduce specific functions of the modules 201-205.
The request parsing module 201 is configured to determine a home queue of a user according to a request of a message push task sent by the user.
The balance obtaining module 202 is configured to obtain a corresponding balance according to the home queue.
The task execution module 203 is configured to execute the message pushing task when it is determined that the balance satisfies the request.
Here, the task execution module 203 is further configured to calculate a remaining push amount according to the balance and the push charging standard when it is determined that the balance does not satisfy the request; executing the message pushing task according to the residual pushing amount; calculating the unexecuted pushing amount according to the residual pushing amount and the message pushing amount; and feeding back an execution result to the user, wherein the execution result comprises information used for representing the unexecuted pushing quantity.
Or the task execution module 203 is further configured to refuse to execute the message push task when it is determined that the balance does not satisfy the request; calculating the residual pushing amount according to the balance and the pushing charging standard; and feeding back an execution result and information representing the residual pushing amount to the user.
The balance updating module 204 is configured to update the balance of the home queue according to an execution result.
In this embodiment, the home queue is used as an accounting unit to account the message pushing task initiated by the user, and whether to execute the message pushing task is determined according to the balance, so that the message pushing quantity can be controlled to remind each department of carefully using the message pushing amount, thereby achieving the purpose of balancing marketing resources.
The invention further provides computer equipment.
Fig. 8 is a schematic diagram of a hardware architecture of an embodiment of the computer device according to the present invention. In the present embodiment, the computer device 2 is a device capable of automatically performing numerical calculation and/or information processing in accordance with a preset or stored instruction. For example, the server may be a smart phone, a tablet computer, a notebook computer, a desktop computer, a rack server, a blade server, a tower server, or a rack server (including an independent server or a server cluster composed of a plurality of servers). As shown, the computer device 2 includes, but is not limited to, at least a memory 21, a processor 22, and a network interface 23 communicatively coupled to each other via a system bus. Wherein:
the memory 21 includes at least one type of computer-readable storage medium including flash memory, hard disks, multimedia cards, card-type memory (e.g., SD or DX memory, etc.), random Access Memory (RAM), static Random Access Memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disks, optical disks, etc. In some embodiments, the memory 21 may be an internal storage unit of the computer device 2, such as a hard disk or a memory of the computer device 2. In other embodiments, the memory 21 may also be an external storage device of the computer device 2, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the computer device 2. Of course, the memory 21 may also comprise both an internal storage unit of the computer device 2 and an external storage device thereof. In this embodiment, the memory 21 is generally used for storing an operating system and various application software installed in the computer device 2, such as a computer program for implementing the message pushing management and control method. Further, the memory 21 may also be used to temporarily store various types of data that have been output or are to be output.
The processor 22 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor 22 is generally configured to control the overall operation of the computer device 2, such as performing control and processing related to data interaction or communication with the computer device 2. In this embodiment, the processor 22 is configured to run a program code stored in the memory 21 or process data, for example, run a computer program for implementing the management and control method of message pushing.
The network interface 23 may comprise a wireless network interface or a wired network interface, and the network interface 23 is generally used for establishing a communication connection between the computer device 2 and other computer devices. For example, the network interface 23 is used to connect the computer device 2 to an external terminal through a network, establish a data transmission channel and a communication connection between the computer device 2 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a Global System of Mobile communication (GSM), wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, bluetooth (Bluetooth), wi-Fi, and the like.
It is noted that fig. 8 only shows the computer device 2 with components 21-23, 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.
In this embodiment, the computer program stored in the memory 21 for implementing the message pushing management and control method may be executed by one or more processors (in this embodiment, the processor 22) to perform the following steps:
step 1: and determining the home queue of the user according to a request of a message pushing task sent by the user.
Step 2: and acquiring a corresponding balance according to the home queue.
And step 3: and executing the message pushing task when the balance is determined to meet the request.
And 4, step 4: and updating the balance of the home queue according to the execution result.
In addition, the present invention relates to a computer-readable storage medium, which is a non-volatile readable storage medium and stores therein a computer program, where the computer program is executable by at least one processor to implement the operation of the method or apparatus for managing and controlling message pushing.
The computer-readable storage medium includes, among others, a 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, and the like. In some embodiments, the computer readable storage medium may be an internal storage unit of the computer device, such as a hard disk or a memory of the computer device. In other embodiments, the computer readable storage medium may be an external storage device of the computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), etc. provided on the computer device. Of course, the computer-readable storage medium may also include both internal and external storage devices of the computer device. In this embodiment, the computer-readable storage medium is generally used for storing an operating system and various types of application software installed in the computer device, for example, the aforementioned computer program for implementing the message pushing management and control method, and the like. Further, the computer-readable storage medium may also be used to temporarily store various types of data that have been output or are to be output.
While specific embodiments of the invention have been described above, it will be appreciated by those skilled in the art that this is by way of example only, and that the scope of the invention is defined by the appended claims. Various changes and modifications to these embodiments may be made by those skilled in the art without departing from the spirit and scope of the invention, and these changes and modifications are within the scope of the invention.

Claims (9)

1. A message pushing control method is characterized by comprising the following steps:
determining an attribution queue of a user according to a request of a message pushing task sent by the user;
acquiring a corresponding balance according to the home queue; the method specifically comprises the following steps:
acquiring a preset push charging standard;
calling the accumulated pushing amount and quota of the home queue according to the home queue; the quota comprises the maximum pushing amount per day and the maximum pushing amount per month;
determining the balance of the attribution queue according to the pushing charging standard, the accumulated pushing amount and the quota; wherein the push charging standard is an incremental step charging standard configured according to an increase in push volume;
executing the message pushing task when the balance, the maximum pushing amount per day and the maximum pushing amount per month are determined to meet the request;
and updating the balance of the home queue according to the execution result.
2. The method for managing and controlling message pushing according to claim 1, wherein the step of determining the home queue of the user according to the request of the message pushing task sent by the user includes the following sub-steps:
receiving a request message of a message pushing task sent by a user, wherein the request message contains identification information, and the identification information comprises a user identification;
intercepting the user identification in the request message;
and acquiring a queue corresponding to the user identifier as an attribution queue of the user according to the user identifier and a preset user-queue corresponding relation.
3. The method for managing and controlling message pushing according to claim 2, wherein the request further includes task information, and the task information includes message pushing amount, message receiving group, and budget amount;
before the step of determining when the balance satisfies the request, further comprising the steps of:
calculating the actual cost of the message pushing task according to the pushing charging standard, the accumulated pushing amount and the message pushing amount;
comparing the actual cost with the budget amount, and determining whether the balance satisfies the request when the actual cost is less than or greater than the budget amount.
4. The method for managing message pushing according to claim 3, further comprising, before the step of calculating the actual cost of the message pushing task, the steps of:
checking whether the number of the receivers contained in the message receiving group is consistent with the message pushing amount;
when the information pushing task is consistent with the information pushing task, the verification is passed, and the actual cost of the information pushing task is directly calculated;
when the message pushing quantity is inconsistent with the message pushing quantity, the message pushing quantity is updated to the number of the receivers contained in the message receiving group; or refusing to execute the message pushing task.
5. The method for managing message pushing according to claim 4, further comprising the steps of:
when the balance is determined not to meet the request, calculating the residual pushing amount according to the balance and the pushing charging standard;
executing the message pushing task according to the residual pushing amount;
calculating the unexecuted pushing amount according to the residual pushing amount and the message pushing amount;
and feeding back an execution result to the user, wherein the execution result comprises information used for representing the unexecuted pushing quantity.
6. The method for managing message pushing according to claim 4, further comprising the steps of:
refusing to execute the message pushing task when the balance does not satisfy the request;
calculating the residual pushing amount according to the balance and the pushing charging standard;
and feeding back the execution result and the information representing the residual pushing amount to the user.
7. A management and control device for message pushing is characterized by comprising:
the request analysis module is used for determining the home queue of the user according to a request of a message pushing task sent by the user;
a balance acquisition module, configured to acquire a corresponding balance according to the home queue; the method specifically comprises the following steps: acquiring a preset push charging standard; calling the accumulated pushing amount and quota of the home queue according to the home queue; the quota comprises the maximum pushing amount per day and the maximum pushing amount per month; determining the balance of the attribution queue according to the pushing charging standard, the accumulated pushing amount and the quota; wherein the push charging standard is an incremental step charging standard configured according to an increase in push volume;
the task execution module is used for executing the message pushing task when determining that the balance, the maximum pushing amount per day and the maximum pushing amount per month all meet the request;
and the balance updating module is used for updating the balance of the attribution queue according to the execution result.
8. A computer device comprising a memory and a processor, characterized in that the memory has stored thereon a computer program which, when executed by the processor, implements the steps of a method of governing the pushing of messages according to any one of claims 1 to 6.
9. A computer-readable storage medium, having stored thereon a computer program, the computer program being executable by at least one processor to implement the steps of a method of governing message pushing according to any one of claims 1-6.
CN202011621275.9A 2020-12-31 2020-12-31 Message pushing control method, electronic device, computer equipment and storage medium Active CN112714187B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011621275.9A CN112714187B (en) 2020-12-31 2020-12-31 Message pushing control method, electronic device, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011621275.9A CN112714187B (en) 2020-12-31 2020-12-31 Message pushing control method, electronic device, computer equipment and storage medium

Publications (2)

Publication Number Publication Date
CN112714187A CN112714187A (en) 2021-04-27
CN112714187B true CN112714187B (en) 2023-03-24

Family

ID=75547579

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011621275.9A Active CN112714187B (en) 2020-12-31 2020-12-31 Message pushing control method, electronic device, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN112714187B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116431335B (en) * 2023-03-21 2024-06-07 哈尔滨工业大学 Control group-based container message queue resource quota control method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102783195A (en) * 2010-03-30 2012-11-14 阿尔卡特朗讯 Local roaming charging in LTE/EPC networks

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8311041B1 (en) * 2012-06-22 2012-11-13 Google Inc. Systems and methods for automatically adjusting messaging quota
CN104579912B (en) * 2013-10-29 2020-04-07 深圳市腾讯计算机系统有限公司 Data pushing method and device
CN109885410B (en) * 2019-01-09 2021-04-13 广州视源电子科技股份有限公司 Message sending method, device, computer equipment and storage medium
CN110838971B (en) * 2019-11-07 2022-07-22 北京奇艺世纪科技有限公司 Message sending method and device, electronic equipment and storage medium

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102783195A (en) * 2010-03-30 2012-11-14 阿尔卡特朗讯 Local roaming charging in LTE/EPC networks

Also Published As

Publication number Publication date
CN112714187A (en) 2021-04-27

Similar Documents

Publication Publication Date Title
CN109104336B (en) Service request processing method and device, computer equipment and storage medium
US10728033B2 (en) Identity authentication method, apparatus, and storage medium
CN110505162B (en) Message transmission method and device and electronic equipment
CN112418673A (en) Case allocation method, device and medium
CN112714187B (en) Message pushing control method, electronic device, computer equipment and storage medium
CN114125050A (en) Message scheduling method, device, equipment and storage medium
CN101901421A (en) Service provider management device, service provider management program, and service provider management method
CN110827155A (en) Information processing method, information processing device, electronic equipment and storage medium
CN109656877A (en) A kind of method, apparatus and distributed file system of user file quota
WO2019019796A1 (en) New insurance policy checkup method, server, and storage medium
CN113761856A (en) Data processing method and device
WO2019223152A1 (en) Task assigning method, server and computer-readable storage medium
WO2019153545A1 (en) Return visit method and apparatus, and computer device and storage medium
CN111522843B (en) Control method, system, equipment and storage medium of data platform
CN108399031B (en) Method and device for determining interface layout mode
JP2019160130A (en) Usage fee determining program, usage fee determining method, and information processing device
CN112001595B (en) Resource splitting method and device
CN114528109A (en) Resource request method, device and system
CN114924937A (en) Batch task processing method and device, electronic equipment and computer readable medium
CN113869864A (en) Equipment scheduling method, device, equipment and storage medium
CN113129098A (en) Order allocation method and device
CN112862495A (en) Transaction data risk control method and device, computer equipment and storage medium
CN112465506A (en) Method and device for sending resource data set, computer equipment and storage medium
CN111062792A (en) Method, device, equipment and storage medium for regulating and controlling limit
CN111176588A (en) Business document issuing method, device, medium and electronic equipment

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