CN110808922A - Message processing method and device, storage medium and electronic equipment - Google Patents
Message processing method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN110808922A CN110808922A CN201911038305.0A CN201911038305A CN110808922A CN 110808922 A CN110808922 A CN 110808922A CN 201911038305 A CN201911038305 A CN 201911038305A CN 110808922 A CN110808922 A CN 110808922A
- Authority
- CN
- China
- Prior art keywords
- service
- message
- message queue
- party
- messages
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the application discloses a message processing method, a message processing device, a storage medium and electronic equipment, wherein the method comprises the following steps: monitoring the service messages corresponding to at least one service party in a first message queue within a preset time length, calculating the number of the service messages corresponding to the at least one service party, determining the service messages to be transferred corresponding to the target service party indicated by the first number when the first number is larger than a set threshold value, and transferring the service messages to be transferred from the first message queue to a second message queue. By adopting the embodiment of the application, the loss of the service message can be avoided, and the service message requested by the service party is ensured to be processed.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a message processing method and apparatus, a storage medium, and an electronic device.
Background
Currently, message processing devices are widely used, for example, servers for message processing and the like, a message processing device refers to an intermediate layer supporting and guaranteeing service messages (data) sent and received between distributed applications, a service party can issue a requested service message of a related message topic (topic) in the message processing device, the message processing device usually writes the service message of the same message topic (topic) requested by each service party into a message queue, and the service message in the message queue is subjected to service processing.
In the process that the message processing device writes the service messages of the same message topic (topic) requested by each service party into the message queue, when the service message volume requested by a certain service party in unit time exceeds the consumption speed of the service party, the service message backlog is caused to influence other service parties with normal request volume.
In order to avoid backlog of service messages, currently, a current limiting or discarding method is usually adopted for new service messages of the same message topic sent by the service party, however, this method may cause loss of service messages, and when the lost service messages are more important, the service party may not find problems in time, which may result in serious consequences.
Disclosure of Invention
The embodiment of the application provides a message processing method, a message processing device, a storage medium and electronic equipment, which can avoid loss of service messages and ensure that the service messages requested by a service party are processed. The technical scheme is as follows:
in a first aspect, an embodiment of the present application provides a message processing method, where the method includes:
monitoring the service messages corresponding to at least one service party in a preset time length in a first message queue, and calculating the number of the service messages corresponding to the at least one service party;
when a first quantity which is larger than a set threshold value exists in the quantities, determining a business message to be transferred corresponding to a target business party indicated by the first quantity;
and transferring the service message to be transferred from the first message queue to a second message queue.
In a second aspect, an embodiment of the present application provides a message processing apparatus, where the apparatus includes:
the message quantity acquisition module is used for monitoring the service messages corresponding to at least one service party in a preset time length in the first message queue and calculating the quantity of the service messages corresponding to the at least one service party;
a transfer message determining module, configured to determine, when a first number greater than a set threshold exists in the numbers, a to-be-transferred service message corresponding to a target service party indicated by the first number;
and the service message transfer module is used for transferring the service message to be transferred from the first message queue to the second message queue.
In a third aspect, embodiments of the present application provide a computer storage medium storing a plurality of instructions adapted to be loaded by a processor and to perform the above-mentioned method steps.
In a fourth aspect, an embodiment of the present application provides an electronic device, which may include: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the above-mentioned method steps.
The beneficial effects brought by the technical scheme provided by some embodiments of the application at least comprise:
in one or more embodiments of the present application, a message server monitors service messages corresponding to at least one service party in a first message queue within a preset time duration, calculates the number of the service messages corresponding to the at least one service party, determines a to-be-transferred service message corresponding to a target service party indicated by a first number when the number is greater than the first number of a set threshold, and transfers the to-be-transferred service message from the first message queue to a second message queue. The business message to be transferred of the target business party which is larger than the set threshold value is determined in the first message queue, and the business message to be transferred is transferred to the second message queue, so that the business message requested by the business party is prevented from being lost on the premise of not influencing other business parties with normal request quantity, and the business message requested by the business party is ensured to be processed.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic view of a scenario architecture of message processing provided in an embodiment of the present application;
fig. 2 is a schematic flowchart of a message processing method according to an embodiment of the present application;
fig. 3 is a schematic flowchart of another message processing method provided in an embodiment of the present application;
fig. 4 is a schematic structural diagram of a message processing apparatus according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a service processing module according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of another message processing apparatus according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In the description of the present application, it is to be understood that the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. In the description of the present application, it is noted that, unless explicitly stated or limited otherwise, "including" and "having" and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus. The specific meaning of the above terms in the present application can be understood in a specific case by those of ordinary skill in the art. Further, in the description of the present application, "a plurality" means two or more unless otherwise specified. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
The present application will be described in detail with reference to specific examples.
Please refer to fig. 1, which is a schematic view of a scenario of a message processing system according to an embodiment of the present application. As shown in fig. 1, the message processing system may include a message server 100 and a business party cluster. The service party cluster may include a plurality of service parties, as shown in fig. 1, specifically including a service party 1, a service party 2, …, and a service party n, where n is an integer greater than 0
The message server 100 may be a separate server device, such as: rack, blade, tower or cabinet type server equipment, or hardware equipment with stronger computing power such as a workstation and a large computer; the server cluster can also be a server cluster formed by a plurality of servers, each server in the service cluster can be formed in a symmetrical mode, wherein each server has equivalent functions and equivalent positions in a service link, each server can provide services for the outside independently, and the independent service can be understood as the assistance without other servers.
Each service party in the service party cluster may be an electronic device having a service message sending function, and the electronic device includes but is not limited to: wearable devices, handheld devices, personal computers, tablet computers, in-vehicle devices, computing devices or other processing devices connected to a wireless modem, and the like. The first terminal and the second terminal in different networks may be called different names, for example: user equipment, access terminal, subscriber unit, subscriber station, mobile station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user equipment, cellular telephone, cordless telephone, Personal Digital Assistant (PDA), electronic device in a 5G network or future evolution network, and the like.
Each service party in the service party cluster communicates with the message server 100 through a network, which may be a wireless network including but not limited to a cellular network, a wireless local area network, an infrared network, or a bluetooth network, or a wired network including but not limited to an ethernet, a Universal Serial Bus (USB), or a controller area network.
Each of the service parties in the service party cluster sends the requested service message to the message server 100 via the network.
After receiving at least one service message requested by each service party, the message server 100 writes the service message, which is the same message topic, in the at least one service message into the first message queue.
The first message queue stores business messages with the same message theme requested by all business parties, the business messages are request messages of corresponding message themes (types) generated by all business parties based on business requirements, and the message themes include but are not limited to an early warning theme, an instant messaging theme, a data request theme, a service connection theme, an order theme and the like.
The message server 100 obtains the service messages requested by each service party within a preset time length from the first message queue, and obtains the number of the service messages requested by each service party.
In this embodiment, the message server has a service load monitoring mechanism, and monitors a service message requested by each service party in the first message queue in real time in a unit time period, and when it is monitored that a service message load of a certain service party in the unit time period exceeds the service processing capability of the message server, the message server can perform load processing on the service party.
When the first quantity of the quantities is greater than the set threshold, the message server 100 determines the service message to be transferred corresponding to the target service party indicated by the first quantity.
The first number may be understood as a target number, which is greater than a set threshold, of the number of the service messages requested by each service party, obtained by the message server.
The message server 100 transfers the traffic message to be transferred from the message queue to a second message queue. The second message queue can be understood as a message queue having the same message topic as the first message queue, and the second message queue and the first message queue can be in a master-slave relationship or a parallel relationship.
When receiving a new service message sent by the target service party, the message server 100 writes the new service message into the second message queue.
The message server 100 performs service processing on the service messages in the first message queue and the service messages in the second message queue, respectively.
Specifically, the message server 100 obtains a service processing rate corresponding to the first message queue, where the service processing rate may be understood as a rate at which the message server processes service messages, and the message server 100 determines a first weight of the first message queue and a second weight of the second message queue based on the first number and the service processing rate. The first weight represents the relative importance of the first message queue, and the second weight represents the relative importance of the second message queue, and in practical application, the first and second weights are represented in numerical form, for example, the first weight is 0.9, the second weight is 0.1, and the first weight is generally higher than the second weight. The message server 100 allocates a first computing resource corresponding to the first weight in the computing resources to the first message queue, allocates a second computing resource corresponding to the second weight in the computing resources to the second message queue, processes the service message in the first message queue using the first computing resource, and performs service processing on the service message in the second message queue using the second computing resource.
In a possible implementation manner, the message server 100 obtains a first priority corresponding to the first message queue, and obtains a second priority corresponding to the second message queue. And acquiring a first weight indicated by the first priority and a second weight indicated by the second priority, wherein the first priority is greater than the second priority. Allocating a first computing resource corresponding to the first priority in the computing resources to the first message queue, allocating a second computing resource corresponding to the second priority in the computing resources to the second message queue by the message server 100, processing the service messages in the first message queue by using the first computing resource, and performing service processing on the service messages in the second message queue by using the second computing resource.
In the embodiment of the application, a message server monitors service messages corresponding to at least one service party in a first message queue within a preset time length, calculates the number of the service messages corresponding to the at least one service party, determines a to-be-transferred service message corresponding to a target service party indicated by a first number when the first number is larger than a set threshold value, and transfers the to-be-transferred service message from the first message queue to a second message queue. The business message to be transferred of the target business party which is larger than the set threshold value is determined in the first message queue, and the business message to be transferred is transferred to the second message queue, so that the business message requested by the business party is prevented from being lost on the premise of not influencing other business parties with normal request quantity, and the business message requested by the business party is ensured to be processed.
In one embodiment, as shown in fig. 2, a message processing method is specifically proposed, which can be implemented by means of a computer program and can be run on a message processing device based on the von neumann architecture. The computer program may be integrated into the application or may run as a separate tool-like application.
Specifically, the message processing method includes:
step 101: monitoring the service messages corresponding to at least one service party in a preset time length in the first message queue, and calculating the number of the service messages corresponding to the at least one service party.
Message queues are often used for exchanging service messages between distributed applications, and a message queue is a container used for storing a service message during transmission of the service message, and mainly aims to provide routing and guarantee delivery of the service message, and if a receiver is unavailable when the service message is sent, the message queue can retain the service message until the service message can be successfully delivered.
The message server with the message queue service generally writes the service messages of the same topic requested by each service party in at least one service party into the message queue of the same message topic, the message consumer applies for subscribing the related message topic with the identity of the message consumer based on the message service, and the message server performs the next processing on the service messages in the message queue based on the message topic subscribed by the message consumer, for example, the service messages are distributed to the next-level message consumer, the service messages are stored in the message database, and the like.
In this embodiment, the first message queue stores service messages having the same message topic and requested by each service party, where the service messages are request messages of corresponding message topics (types) generated by each service party based on service requirements, and the message topics include, but are not limited to, an early warning topic, an instant messaging topic, a data request topic, a service connection topic, an order topic, and the like.
In this embodiment, the message server has a service load monitoring mechanism, and monitors a service message requested by each service party in the first message queue in real time in a unit time period, and when it is monitored that a service message load of a certain service party in the unit time period exceeds the service processing capability of the message server, the message server can perform load processing on the service party.
Specifically, the message server receives service messages requested by each service party, starts a service load monitoring mechanism, and writes service messages requested by each service party and having the same message theme into the first message queue when receiving the service messages requested by each service party in at least one service party. Meanwhile, the message server acquires the service messages requested by the service parties within a preset time length, and calls a local cancellation thread to calculate the number of the service messages requested by the service parties.
In a specific implementation scenario, the first message queue stores service messages of early warning subjects requested by 4 service parties, where the 4 service parties are respectively: business party 1, business party 2, business party 3, and business party 4. The message server acquires service messages of early warning subjects requested by 4 service parties in a preset time length (within 3 minutes) from the first message queue, and simultaneously calculates the acquired service messages and calculates the number of the service messages respectively requested by the service party 1, the service party 2, the service party 3 and the service party 4 in the preset time length (within 3 minutes).
Step 102: and when a first quantity which is larger than a set threshold value exists in the quantities, determining the service message to be transferred corresponding to the target service party indicated by the first quantity.
The first quantity may be understood as a target quantity, which is a first quantity, of the quantities that are greater than a set threshold after the message server obtains the quantities of the service messages requested by the service parties, for example, there are 4 service parties in the first message queue, and the quantities of the service messages requested by the service parties in a preset time period are: the service party 1: 500. business side 2:600, business side 3:700, business side 4: 800, setting the target number of thresholds as: 750, comparing, the number of the service parties 4 greater than the target number of the set threshold is: 750, at which point the first number is 750.
It should be noted that, in practical applications, the first number may be multiple, for example, when a plurality of target numbers in the number is greater than a set threshold, the first number is multiple.
The target service party may be understood as a service party whose number of service messages requested within a preset time duration in the first message queue is greater than that indicated by the set threshold, that is, a service party indicated by the first number.
Specifically, after obtaining the number of the service messages requested by each service party in the at least one service party, the message server determines whether the number of the service messages requested by each service party is greater than a set threshold, determines the target number of the service messages requested by each service party, which is greater than the set threshold, as a first number, and determines the service party corresponding to the first number as a target service party, and the message server determines the service message to be transferred of the target service party based on a preset message transfer rule.
Alternatively, the message server may set different set thresholds for different service parties based on a threshold determination rule, where the threshold determination rule may be based on the priority of each service party, set a corresponding set threshold based on the priority level, take a probability value as the set threshold based on the number of service messages requested by each service party over a period of time, where the probability value may be determined by a statistical method, such as an average value, a median value, a variance, a regression value, etc., determine the service message processing efficiency of a single service party based on the message server, and so on.
Optionally, the message server determines the service message to be transferred of the target service party based on a preset message transfer rule. The preset message transfer rule can be that the service message of the target service party exceeding the set threshold value is taken as the service message to be transferred; the number of the service messages to be transferred can be determined based on a preset algorithm to be transferred, for example, the algorithm to be transferred can be a weight distribution algorithm, a transfer coefficient is preset to be 0.2, and a service party priority coefficient is preset to be 1.2, so that the number of the service messages to be transferred is the product of the total number of the service messages of the target service party and the transfer coefficient and the service party priority coefficient, and then the service messages to be transferred are determined based on the time sequence of receiving the service messages of the target service party; all the corresponding service messages of the target service party can be used as the service messages to be transferred, and the like.
Step 103: and transferring the service message to be transferred from the message queue to a second message queue.
The second message queue can be understood as a message queue having the same message topic as the first message queue, and the second message queue and the first message queue can be master-slave queues, that is, the first message queue is a master queue, the second message queue is a slave queue, and the second message queue and the first message queue can also be peer queues, that is, the second message queue and the first message queue have the same priority.
The second message queue may be created in advance, for example, the message server creates the first message queue and the second message queue at the same time, or the second message queue created by the message server after the message server monitors that the number of service messages requested by a certain service party is greater than a set threshold.
Specifically, after determining the to-be-transferred service message corresponding to the target service party indicated by the first quantity, the message server transfers the to-be-transferred service message from the first message queue to the second message queue, so that the backlogged to-be-transferred service message flows out from the first message queue.
In the embodiment of the application, a message server monitors service messages corresponding to at least one service party in a first message queue within a preset time length, calculates the number of the service messages corresponding to the at least one service party, determines a to-be-transferred service message corresponding to a target service party indicated by a first number when the first number is larger than a set threshold value, and transfers the to-be-transferred service message from the first message queue to a second message queue. The business message to be transferred of the target business party which is larger than the set threshold value is determined in the first message queue, and the business message to be transferred is transferred to the second message queue, so that the business message requested by the business party is prevented from being lost on the premise of not influencing other business parties with normal request quantity, and the business message requested by the business party is ensured to be processed.
Referring to fig. 3, fig. 3 is a flowchart illustrating a message processing method according to another embodiment of the present application. Specifically, the method comprises the following steps:
step 201: monitoring the service messages corresponding to at least one service party in a preset time length in the first message queue, and calculating the number of the service messages corresponding to the at least one service party.
Specifically, refer to step 101, which is not described herein again.
Step 202: and when the first quantity is larger than a first quantity of a set threshold value, determining the service messages which are corresponding to the target service party indicated by the first quantity and exceed the set threshold value.
The first number may be understood as a target number, which is a first number, of the number that is greater than a set threshold after the message server obtains the number of the service messages requested by each service party.
In a specific implementation scenario, there are 5 service messages requested by service parties in the first message queue, and the number of the service messages requested by each service party in a preset time period is: the service party 1: 300. business side 2:400, business side 3:500, business side 4: 800. and the service party 5: 1000, the target number of thresholds is set as: 700, by comparison, the target number of the service parties 4 greater than the set threshold is: 700. the target number of the service parties 5 greater than the set threshold is: 700, at this point the first number is 800 and 1000. The message server now determines that the target service party indicated by the first number is the service party 4 indicated by the number 800 and the service party 5 indicated by the number 1000.
Specifically, the message server takes 100 service messages which are corresponding to the service party 4 and exceed the set threshold 700 as target service messages to be transferred, wherein, the target service message may be the request time of the service message corresponding to the service party 4 in the first message queue, the first 100 service messages with earlier request time are determined as the target service message from the 800 service messages corresponding to the service party 4 based on the sequence of the request time, and similarly, the message server takes the 300 service messages exceeding the set threshold 700 corresponding to the service party 5 as the target service messages to be transferred, the target service message may be the request time of the service message corresponding to the service party 5 in the first message queue, and the first 200 service messages with earlier request time are determined as the target service message from the 1000 service messages corresponding to the service party 5 based on the sequence of the request time.
Optionally, the message server determines the target service messages exceeding the set threshold corresponding to the target service parties indicated by the first quantity, where the target service messages exceeding the set threshold may be target service messages randomly selected from the service messages indicated by the first quantity, for example, the number of the service messages indicated by the first quantity is 1000, the set threshold is 800, and the number of the target service messages exceeding the set threshold is 200, where at this time, the message server may randomly determine 200 marked service messages exceeding the set threshold from the 1000 service messages indicated by the first quantity; the target service message with higher priority level than the set threshold value can be selected according to the priority level order of all the service messages indicated by the first quantity, and the like.
Step 203: and transferring the service message exceeding the set threshold value from the first message queue to a second message queue.
The detailed definitions of the second message queue can be found in step 103.
Specifically, after determining the target service messages exceeding the set threshold value and corresponding to the target service parties indicated by the first number, the message server transfers the target service messages from the first message queue to the second message queue, so that the backlogged target service messages are transferred from the first message queue.
Step 204: and when a first quantity larger than a set threshold exists in the quantities, determining all service messages corresponding to the target service party indicated by the first quantity.
In a specific implementation scenario, there are 5 service messages requested by service parties in the first message queue, and the number of the service messages requested by each service party in a preset time period is: the service party 1: 300. business side 2:400, business side 3:500, business side 4: 800. and the service party 5: 1000, the target number of thresholds is set as: 850, comparing, the number of the service parties 5 greater than the target number of the set threshold is: 850 this time the first number is 800 and 1000. The message server now determines that the target service party indicated by said first number is the service party 5 indicated by said number 1000.
At this time, the message server determines all the service messages-1000 service messages corresponding to the service party 5 as the service messages to be transferred, that is, all the service messages-1000 service messages corresponding to the service party 5 are transferred, and the first message queue is removed.
Step 205: transferring the entire traffic message from the first message queue to a second message queue.
The detailed definitions of the second message queue can be found in step 103.
Specifically, after determining all the service messages corresponding to the target service parties indicated by the first quantity, the message server transfers all the service messages corresponding to the target service parties indicated by the first quantity from the first message queue to the second message queue, so that the backlogged target service messages are transferred from the first message queue.
Step 206: and when receiving a new service message sent by the target service party, writing the new service message into a second message queue.
The new service message may be understood as a service message of the same message topic corresponding to the first message queue, which is sent by the target service party after the current time point.
Specifically, after determining the target service party indicated by the first number, the message server creates a second message queue, and configures the second message queue, where the configuring includes setting a message topic of the second message queue as a message topic corresponding to the first message queue, configuring a service party corresponding to the second message queue as the target service party, and the like, and when receiving a new service message sent by the target service party, the message server writes the new service message into the second message queue.
In a possible implementation manner, after determining the target service party indicated by the first number, the message server sends a request for switching a message queue to the target service party, where the request for switching the message queue is used for sending a new service message sent by the target service party directly to send the new service message to a second message queue.
Step 207: and acquiring the service processing rate corresponding to the first message queue.
The service processing rate may be understood as a rate at which the message server processes the service messages, and the message server has a service processing rate calculation function, and may calculate the number of the service messages processed in the first message queue in a unit time to calculate the service processing rate corresponding to the first message queue. Typically, the traffic processing rate is a ratio of a preset calculation time to a total amount of traffic messages processed within the preset calculation time.
Step 208: determining a first weight of the first message queue and a second weight of the second message queue based on the first number and the traffic processing rate, the first weight being greater than the second weight.
The weight generally refers to the importance of a factor or index relative to a fact, which is different from the general weight, and represents not only the percentage of the factor or index, but also the relative importance of the factor or index, which tends to contribute to the importance. In this embodiment, the first weight may be understood as an importance degree of the first message queue relative to a service message processing link on a message server, and is usually expressed as a percentage or a value. I.e. the first weight characterizes the relative importance of the first message queue and the second weight characterizes the relative importance of the second message queue, in practical applications the first and second weights are represented in numerical form, e.g. the first weight is 0.9 and the second weight is 0.1, typically the first weight is higher than the second weight.
Specifically, after acquiring the first number and the service processing rate, the message server calculates the first number and the service processing efficiency by using a preset weight calculation algorithm to obtain a calculated first weight of the first message queue and a calculated second weight of the second message queue.
Optionally, the weight calculation algorithm may be a dynamic bandwidth allocation algorithm based on a service message topic, a queuing network message allocation algorithm based on a game theory, a time slot allocation algorithm based on message quantity prediction, a weight algorithm based on a random number, a cross-layer resource allocation algorithm based on message priority, or the like.
It should be noted that there are many kinds of weight calculation algorithms, and the weight calculation algorithm may be a fit of one or more kinds of the above, and is not limited in detail here.
In a possible implementation manner, after obtaining the first number and the traffic processing rate, the message server inputs the first number and the traffic processing rate as inputs into a weight calculation model, and outputs a first weight of the first message queue and a second weight of the second message queue.
Optionally, the weight calculation model may be trained by using a large number of test samples, for example, the weight calculation model may be implemented based on at least one of a Convolutional Neural Network (CNN) model, a Deep Neural Network (DNN) model, a Recurrent Neural Network (RNN), a model, an embedding (embedding) model, a Gradient Boosting Decision Tree (GBDT) model, and a Logistic Regression (LR) model, and the weight calculation model is trained based on labeled sample data, so that a trained weight calculation model may be obtained.
Step 209: and allocating a first computing resource to the first message queue and a second computing resource to the second message queue according to the first weight and the second weight, and processing the service messages in the first message queue by the first computing resource and processing the service messages in the second message queue by the second computing resource.
The computing resource may be understood as a CPU resource, a memory resource, a hard disk resource, a network resource, a thread resource, and the like, which are required for the message server to process the service message, the first computing resource may be understood as a computing resource corresponding to the message server for processing the service message in the first message queue, and the second computing resource may be understood as a computing resource corresponding to the message server for processing the service message in the second message queue.
Specifically, after determining a first weight of the first message queue and a second weight of the second message queue, the message server allocates a first computing resource corresponding to the first weight in the computing resources to the first message queue, allocates a second computing resource corresponding to the second weight in the computing resources to the second message queue, and processes the service messages in the first message queue using the first computing resource and processes the service messages in the second message queue using the second computing resource.
Step 210: and acquiring a first priority corresponding to the first message queue and a second priority corresponding to the second message queue.
Specifically, the message server has a service load monitoring mechanism, which monitors the service messages requested by each service party in the first message queue in real time within a unit time length, and when the service message load of a certain service party in the unit time length is monitored and exceeds the service processing capacity of the message server, creates a second message queue, and the message server can transfer the service messages of the service party. Before the message server performs the transfer processing, a first priority corresponding to the first message queue and a second priority corresponding to the second message queue are preset. When the message server needs to allocate computing resources to the first message queue and the second message queue, a first priority corresponding to the first message queue and a second priority corresponding to the second message queue, which are preset, can be locally obtained. For example: when the message server creates the second message queue, that is, the first priority corresponding to the first message queue is determined as the first level, and the second priority corresponding to the second message queue is determined as the third level, before the message server processes the service message, the message server can locally acquire the first priority corresponding to the first message queue and the second priority corresponding to the second message queue, and the computing resources are allocated to the first message queue and the second message queue based on the first priority and the second priority.
Step 211: a first weight of the first priority indication and a second weight of the second priority indication are calculated.
The weight generally refers to the importance of a factor or index relative to a fact, which is different from the general weight, and represents not only the percentage of the factor or index, but also the relative importance of the factor or index, which tends to contribute to the importance. In this embodiment, the first weight indicated by the first priority is a value or percentage of the computing resource occupied by the first priority, and the second weight indicated by the second priority is a value or percentage of the computing resource occupied by the second priority.
Specifically, the message server calculates a first priority corresponding to the first message queue and a second priority corresponding to the second message queue. Based on the first priority and the second priority, a first weight corresponding to the first priority and a second weight corresponding to the second priority are searched in a preset weight priority comparison table.
In a specific implementation scenario, a weight priority comparison table is pre-stored in the message server, where the weight priority comparison table includes preset weights corresponding to the priorities, and the weights are used to allocate the matched computing resources. For example, the weight priority comparison table can be found in table one:
| Priority level | Preset weight |
| First stage | 0.8 |
| Second stage | 0.6 |
| Third stage | 0.1 |
| ....... | ........ |
Taking the above-mentioned message server determining that the first priority corresponding to the first message queue is the first level and the second priority corresponding to the second message queue is the third level as an example, the message server searches, in the preset weight priority comparison table, that the first weight corresponding to the first priority is 0.8 and that the second weight corresponding to the second priority is 0.1.
Step 212: and allocating a first computing resource to the first message queue and a second computing resource to the second message queue according to the first weight and the second weight, and processing the service messages in the first message queue by the first computing resource and processing the service messages in the second message queue by the second computing resource.
The computing resource may be understood as a CPU resource, a memory resource, a hard disk resource, a network resource, a thread resource, and the like, which are required for the message server to process the service message, the first computing resource may be understood as a computing resource corresponding to the message server for processing the service message in the first message queue, and the second computing resource may be understood as a computing resource corresponding to the message server for processing the service message in the second message queue.
Specifically, after acquiring a first weight indicated by the first priority and a second weight indicated by the second priority, the message server allocates a first computing resource corresponding to the first priority in the computing resources to the first message queue, allocates a second computing resource corresponding to the second priority in the computing resources to the second message queue, processes the service messages in the first message queue using the first computing resource, and performs service processing on the service messages in the second message queue using the second computing resource.
In the embodiment of the application, a message server monitors service messages corresponding to at least one service party in a first message queue within a preset time length, calculates the number of the service messages corresponding to the at least one service party, determines a to-be-transferred service message corresponding to a target service party indicated by a first number when the first number is larger than a set threshold value, and transfers the to-be-transferred service message from the first message queue to a second message queue. The business message to be transferred of the target business party which is larger than the set threshold value is determined in the first message queue, and the business message to be transferred is transferred to the second message queue, so that the business message requested by the business party is prevented from being lost on the premise of not influencing other business parties with normal request quantity, and the business message requested by the business party is ensured to be processed.
The following are embodiments of the apparatus of the present application that may be used to perform embodiments of the method of the present application. For details which are not disclosed in the embodiments of the apparatus of the present application, reference is made to the embodiments of the method of the present application.
Referring to fig. 4, a schematic structural diagram of a message processing apparatus according to an exemplary embodiment of the present application is shown. The message processing means may be implemented as all or part of a device in software, hardware or a combination of both. The device 1 comprises a message quantity acquisition module 11, a message quantity acquisition module 11 and a service message transfer module 13.
A message quantity obtaining module 11, configured to monitor a service message corresponding to at least one service party in a first message queue within a preset time duration, and calculate a quantity of the service message corresponding to the at least one service party;
a transfer message determining module 12, configured to determine, when a first number greater than a set threshold exists in the numbers, a to-be-transferred service message corresponding to a target service party indicated by the first number;
and a service message transfer module 13, configured to transfer the service message to be transferred from the first message queue to a second message queue.
Optionally, the service message to be transferred is a service message that exceeds the set threshold and corresponds to the target service party.
Optionally, the service message to be transferred is all service messages corresponding to the target service party.
Optionally, as shown in fig. 6, the apparatus 1 further includes:
and a new message writing module 14, configured to write the new service message into a second message queue when receiving the new service message sent by the target service party.
Optionally, as shown in fig. 6, the apparatus 1 further includes:
and the service processing module 15 is configured to perform service processing on the service messages in the first message queue and the service messages in the second message queue respectively.
Optionally, as shown in fig. 5, the service processing module 15 includes:
a rate obtaining unit 151, configured to obtain a service processing rate corresponding to the first message queue;
a weight determining unit 152, configured to determine a first weight of the first message queue and a second weight of the second message queue based on the first number and the traffic processing rate, where the first weight is greater than the second weight;
a service processing unit 153, configured to allocate a first computing resource to the first message queue and a second computing resource to the second message queue according to the first weight and the second weight, process the service message in the first message queue by the first computing resource, and process the service message in the second message queue by the second computing resource.
Optionally, as shown in fig. 5, the service processing module 15 includes:
a priority acquiring unit 154, configured to acquire a first priority corresponding to the first message queue and a second priority corresponding to the second message queue;
the weight determining unit 152 is configured to calculate a first weight of the first priority indication and a second weight of the second priority indication;
the service processing unit 153 is configured to allocate a first computing resource to the first message queue and a second computing resource to the second message queue according to the first weight and the second weight, process the service message in the first message queue by the first computing resource, and process the service message in the second message queue by the second computing resource.
It should be noted that, when the message processing apparatus provided in the foregoing embodiment executes the message processing method, only the division of the functional modules is illustrated, and in practical applications, the above functions may be distributed and completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules, so as to complete all or part of the functions described above. In addition, the message processing apparatus and the message processing method provided in the above embodiments belong to the same concept, and details of implementation processes thereof are referred to in the method embodiments and are not described herein again.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
In this embodiment, the message server monitors service messages corresponding to at least one service party in a first message queue within a preset time duration, calculates the number of the service messages corresponding to the at least one service party, determines a to-be-transferred service message corresponding to a target service party indicated by a first number when the number is greater than the first number of a set threshold, and transfers the to-be-transferred service message from the first message queue to a second message queue. The business message to be transferred of the target business party which is larger than the set threshold value is determined in the first message queue, and the business message to be transferred is transferred to the second message queue, so that the business message requested by the business party is prevented from being lost on the premise of not influencing other business parties with normal request quantity, and the business message requested by the business party is ensured to be processed.
An embodiment of the present application further provides a computer storage medium, where the computer storage medium may store a plurality of instructions, where the instructions are suitable for being loaded by a processor and executing the message processing method according to the embodiment shown in fig. 1 to fig. 3, and a specific execution process may refer to specific descriptions of the embodiment shown in fig. 1 to fig. 3, which is not described herein again.
The present application further provides a computer program product, where at least one instruction is stored, and the at least one instruction is loaded by the processor and executes the message processing method according to the embodiment shown in fig. 1 to fig. 3, where a specific execution process may refer to specific descriptions of the embodiment shown in fig. 1 to fig. 3, and is not described herein again.
Fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure. As shown in fig. 7, the electronic device 1000 may include: at least one processor 1001, at least one network interface 1004, a user interface 1003, memory 1005, at least one communication bus 1002.
Wherein a communication bus 1002 is used to enable connective communication between these components.
The user interface 1003 may include a Display screen (Display) and a Camera (Camera), and the optional user interface 1003 may also include a standard wired interface and a wireless interface.
The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface), among others.
The Memory 1005 may include a Random Access Memory (RAM) or a Read-Only Memory (Read-Only Memory). Optionally, the memory 1005 includes a non-transitory computer-readable medium. The memory 1005 may be used to store an instruction, a program, code, a set of codes, or a set of instructions. The memory 1005 may include a stored program area and a stored data area, wherein the stored program area may store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the various method embodiments described above, and the like; the storage data area may store data and the like referred to in the above respective method embodiments. The memory 1005 may optionally be at least one memory device located remotely from the processor 1001. As shown in fig. 7, a memory 1005, which is a type of computer storage medium, may include an operating system, a network communication module, a user interface module, and a message processing application program therein.
In the electronic device 1000 shown in fig. 7, the user interface 1003 is mainly used as an interface for providing input for a user, and acquiring data input by the user; and the processor 1001 may be configured to invoke a message processing application stored in the memory 1005 and specifically perform the following operations:
monitoring the service messages corresponding to at least one service party in a preset time length in a first message queue, and calculating the number of the service messages corresponding to the at least one service party;
when a first quantity which is larger than a set threshold value exists in the quantities, determining a business message to be transferred corresponding to a target business party indicated by the first quantity;
and transferring the service message to be transferred from the first message queue to a second message queue.
In an embodiment, the service message to be transferred is a service message that exceeds the set threshold and corresponds to the target service party.
In an embodiment, the service message to be transferred is all service messages corresponding to the target service party.
In one embodiment, the processor 1001 further performs the following operations:
and when receiving a new service message sent by the target service party, writing the new service message into a second message queue.
In one embodiment, the processor 1001 further performs the following operations:
and respectively carrying out service processing on the service messages in the first message queue and the service messages in the second message queue.
In an embodiment, when the processor 1001 performs the service processing on the service messages in the first message queue and the service messages in the second message queue, the following operations are specifically performed:
acquiring a service processing rate corresponding to the first message queue;
determining a first weight of the first message queue and a second weight of the second message queue based on the first number and the traffic processing rate, the first weight being greater than the second weight;
and allocating a first computing resource to the first message queue and a second computing resource to the second message queue according to the first weight and the second weight, and processing the service messages in the first message queue by the first computing resource and processing the service messages in the second message queue by the second computing resource.
In an embodiment, when the processor 1001 performs the service processing on the service messages in the first message queue and the service messages in the second message queue, the following operations are specifically performed:
acquiring a first priority corresponding to the first message queue and a second priority corresponding to the second message queue;
calculating a first weight of the first priority indication and a second weight of the second priority indication;
and allocating a first computing resource to the first message queue and a second computing resource to the second message queue according to the first weight and the second weight, and processing the service messages in the first message queue by the first computing resource and processing the service messages in the second message queue by the second computing resource.
In this embodiment, the message server monitors service messages corresponding to at least one service party in a first message queue within a preset time duration, calculates the number of the service messages corresponding to the at least one service party, determines a to-be-transferred service message corresponding to a target service party indicated by a first number when the number is greater than the first number of a set threshold, and transfers the to-be-transferred service message from the first message queue to a second message queue. The business message to be transferred of the target business party which is larger than the set threshold value is determined in the first message queue, and the business message to be transferred is transferred to the second message queue, so that the business message requested by the business party is prevented from being lost on the premise of not influencing other business parties with normal request quantity, and the business message requested by the business party is ensured to be processed.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a read-only memory or a random access memory.
The above disclosure is only for the purpose of illustrating the preferred embodiments of the present application and is not to be construed as limiting the scope of the present application, so that the present application is not limited thereto, and all equivalent variations and modifications can be made to the present application.
Claims (10)
1. A method of message processing, the method comprising:
monitoring the service messages corresponding to at least one service party in a preset time length in a first message queue, and calculating the number of the service messages corresponding to the at least one service party;
when a first quantity which is larger than a set threshold value exists in the quantities, determining a business message to be transferred corresponding to a target business party indicated by the first quantity;
and transferring the service message to be transferred from the first message queue to a second message queue.
2. The method according to claim 1, wherein the service message to be transferred is a service message corresponding to the target service party and exceeding the set threshold.
3. The method according to claim 1, wherein the service message to be transferred is all service messages corresponding to the target service party.
4. The method of claim 1, further comprising:
and when receiving a new service message sent by the target service party, writing the new service message into a second message queue.
5. The method of claim 1, further comprising:
and respectively carrying out service processing on the service messages in the first message queue and the service messages in the second message queue.
6. The method according to claim 5, wherein the performing service processing on the service messages in the first message queue and the service messages in the second message queue respectively comprises:
acquiring a service processing rate corresponding to the first message queue;
determining a first weight of the first message queue and a second weight of the second message queue based on the first number and the traffic processing rate, the first weight being greater than the second weight;
and allocating a first computing resource to the first message queue and a second computing resource to the second message queue according to the first weight and the second weight, and processing the service messages in the first message queue by the first computing resource and processing the service messages in the second message queue by the second computing resource.
7. The method according to claim 5, wherein the performing service processing on the service messages in the first message queue and the service messages in the second message queue respectively comprises:
acquiring a first priority corresponding to the first message queue and a second priority corresponding to the second message queue;
calculating a first weight of the first priority indication and a second weight of the second priority indication;
and allocating a first computing resource to the first message queue and a second computing resource to the second message queue according to the first weight and the second weight, and processing the service messages in the first message queue by the first computing resource and processing the service messages in the second message queue by the second computing resource.
8. A message processing apparatus, characterized in that the apparatus comprises:
the message quantity acquisition module is used for monitoring the service messages corresponding to at least one service party in a preset time length in the first message queue and calculating the quantity of the service messages corresponding to the at least one service party;
a transfer message determining module, configured to determine, when a first number greater than a set threshold exists in the numbers, a to-be-transferred service message corresponding to a target service party indicated by the first number;
and the service message transfer module is used for transferring the service message to be transferred from the first message queue to the second message queue.
9. A computer storage medium, characterized in that it stores a plurality of instructions adapted to be loaded by a processor and to carry out the method steps according to any one of claims 1 to 7.
10. An electronic device, comprising: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the method steps of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911038305.0A CN110808922B (en) | 2019-10-29 | 2019-10-29 | Message processing method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911038305.0A CN110808922B (en) | 2019-10-29 | 2019-10-29 | Message processing method and device, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110808922A true CN110808922A (en) | 2020-02-18 |
| CN110808922B CN110808922B (en) | 2023-06-06 |
Family
ID=69489474
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911038305.0A Active CN110808922B (en) | 2019-10-29 | 2019-10-29 | Message processing method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110808922B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111404838A (en) * | 2020-03-17 | 2020-07-10 | 上海云励科技有限公司 | Message processing method, device and equipment |
| CN111475313A (en) * | 2020-03-04 | 2020-07-31 | 江苏理工学院 | Message queue construction method and device suitable for convolutional neural network forward propagation |
| CN111782395A (en) * | 2020-06-30 | 2020-10-16 | 北京思特奇信息技术股份有限公司 | Message processing shunt control method and system |
| CN111930486A (en) * | 2020-07-30 | 2020-11-13 | 中国工商银行股份有限公司 | Task selection data processing method, device, equipment and storage medium |
| CN111935658A (en) * | 2020-07-16 | 2020-11-13 | 北京思特奇信息技术股份有限公司 | Method and system for solving congestion in message interaction |
| CN112015529A (en) * | 2020-08-05 | 2020-12-01 | 北京奇艺世纪科技有限公司 | Data task scheduling method, system, electronic device and storage medium |
| CN112527527A (en) * | 2020-12-16 | 2021-03-19 | 深圳市分期乐网络科技有限公司 | Consumption speed control method and device of message queue, electronic equipment and medium |
| CN113467969A (en) * | 2021-06-22 | 2021-10-01 | 上海星融汽车科技有限公司 | Method for processing message accumulation |
| CN113961334A (en) * | 2021-12-23 | 2022-01-21 | 联通智网科技股份有限公司 | Task processing method, device, equipment and storage medium |
| CN114885018A (en) * | 2022-06-22 | 2022-08-09 | 中国平安财产保险股份有限公司 | Message pushing method, device, equipment and storage medium based on double queues |
| CN116088714A (en) * | 2022-05-26 | 2023-05-09 | 荣耀终端有限公司 | Message prompt box processing method and related device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20020057190A (en) * | 2000-12-30 | 2002-07-11 | 박종섭 | Method for service data processing in intelligent network for mobile communication |
| US20070260732A1 (en) * | 2006-05-03 | 2007-11-08 | Bluetie, Inc. | User load balancing systems and methods thereof |
| CN101431558A (en) * | 2007-11-09 | 2009-05-13 | 中国移动通信集团公司 | Data control method for mobile terminal and mobile terminal thereof |
| CN102761832A (en) * | 2011-04-28 | 2012-10-31 | 中国移动通信集团河南有限公司 | Message distribution method and device |
| US20130246561A1 (en) * | 2012-03-14 | 2013-09-19 | Microsoft Corporation | High density hosting for messaging service |
| CN103369042A (en) * | 2013-07-10 | 2013-10-23 | 中国人民解放军国防科学技术大学 | Data processing method and data processing device |
| CN106470169A (en) * | 2015-08-19 | 2017-03-01 | 阿里巴巴集团控股有限公司 | A kind of service request method of adjustment and equipment |
| CN110333956A (en) * | 2019-05-23 | 2019-10-15 | 平安普惠企业管理有限公司 | Message storage method, device, medium and electronic equipment in message queue |
-
2019
- 2019-10-29 CN CN201911038305.0A patent/CN110808922B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20020057190A (en) * | 2000-12-30 | 2002-07-11 | 박종섭 | Method for service data processing in intelligent network for mobile communication |
| US20070260732A1 (en) * | 2006-05-03 | 2007-11-08 | Bluetie, Inc. | User load balancing systems and methods thereof |
| CN101431558A (en) * | 2007-11-09 | 2009-05-13 | 中国移动通信集团公司 | Data control method for mobile terminal and mobile terminal thereof |
| CN102761832A (en) * | 2011-04-28 | 2012-10-31 | 中国移动通信集团河南有限公司 | Message distribution method and device |
| US20130246561A1 (en) * | 2012-03-14 | 2013-09-19 | Microsoft Corporation | High density hosting for messaging service |
| CN103369042A (en) * | 2013-07-10 | 2013-10-23 | 中国人民解放军国防科学技术大学 | Data processing method and data processing device |
| CN106470169A (en) * | 2015-08-19 | 2017-03-01 | 阿里巴巴集团控股有限公司 | A kind of service request method of adjustment and equipment |
| CN110333956A (en) * | 2019-05-23 | 2019-10-15 | 平安普惠企业管理有限公司 | Message storage method, device, medium and electronic equipment in message queue |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111475313A (en) * | 2020-03-04 | 2020-07-31 | 江苏理工学院 | Message queue construction method and device suitable for convolutional neural network forward propagation |
| CN111404838A (en) * | 2020-03-17 | 2020-07-10 | 上海云励科技有限公司 | Message processing method, device and equipment |
| CN111782395A (en) * | 2020-06-30 | 2020-10-16 | 北京思特奇信息技术股份有限公司 | Message processing shunt control method and system |
| CN111782395B (en) * | 2020-06-30 | 2024-01-05 | 北京思特奇信息技术股份有限公司 | Shunting control method and system for message processing |
| CN111935658B (en) * | 2020-07-16 | 2022-01-18 | 北京思特奇信息技术股份有限公司 | Method and system for solving congestion in message interaction |
| CN111935658A (en) * | 2020-07-16 | 2020-11-13 | 北京思特奇信息技术股份有限公司 | Method and system for solving congestion in message interaction |
| CN111930486A (en) * | 2020-07-30 | 2020-11-13 | 中国工商银行股份有限公司 | Task selection data processing method, device, equipment and storage medium |
| CN111930486B (en) * | 2020-07-30 | 2023-11-17 | 中国工商银行股份有限公司 | Task selection data processing method, device, equipment and storage medium |
| CN112015529B (en) * | 2020-08-05 | 2023-09-01 | 北京奇艺世纪科技有限公司 | Data task scheduling method, system, electronic device and storage medium |
| CN112015529A (en) * | 2020-08-05 | 2020-12-01 | 北京奇艺世纪科技有限公司 | Data task scheduling method, system, electronic device and storage medium |
| CN112527527A (en) * | 2020-12-16 | 2021-03-19 | 深圳市分期乐网络科技有限公司 | Consumption speed control method and device of message queue, electronic equipment and medium |
| CN113467969A (en) * | 2021-06-22 | 2021-10-01 | 上海星融汽车科技有限公司 | Method for processing message accumulation |
| CN113467969B (en) * | 2021-06-22 | 2024-01-23 | 上海星融汽车科技有限公司 | Method for processing message accumulation |
| CN113961334A (en) * | 2021-12-23 | 2022-01-21 | 联通智网科技股份有限公司 | Task processing method, device, equipment and storage medium |
| CN113961334B (en) * | 2021-12-23 | 2022-05-31 | 联通智网科技股份有限公司 | Task processing method, device, equipment and storage medium |
| CN116088714A (en) * | 2022-05-26 | 2023-05-09 | 荣耀终端有限公司 | Message prompt box processing method and related device |
| CN116088714B (en) * | 2022-05-26 | 2024-05-28 | 荣耀终端有限公司 | Message prompt box processing method and related device |
| CN114885018A (en) * | 2022-06-22 | 2022-08-09 | 中国平安财产保险股份有限公司 | Message pushing method, device, equipment and storage medium based on double queues |
| CN114885018B (en) * | 2022-06-22 | 2023-08-29 | 中国平安财产保险股份有限公司 | Message pushing method, device, equipment and storage medium based on double queues |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110808922B (en) | 2023-06-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110808922B (en) | Message processing method and device, storage medium and electronic equipment | |
| CN107241281B (en) | Data processing method and device | |
| CN112363813A (en) | Resource scheduling method and device, electronic equipment and computer readable medium | |
| CN107819797B (en) | Access request processing method and device | |
| CN109766172B (en) | Asynchronous task scheduling method and device | |
| CN111221638B (en) | Concurrent task scheduling processing method, device, equipment and medium | |
| CN113285886B (en) | Bandwidth allocation method and device, electronic equipment and readable storage medium | |
| CN110290009A (en) | A kind of data dispatching method, device and computer readable storage medium | |
| CN114153609A (en) | Resource control method and device, electronic equipment and computer readable storage medium | |
| CN111597041B (en) | Calling method and device of distributed system, terminal equipment and server | |
| CN111249747B (en) | Information processing method and device in game | |
| CN112286930A (en) | Method, device, storage medium and electronic equipment for resource sharing of redis business side | |
| CN114402313A (en) | Label updating method and device, electronic equipment and storage medium | |
| CN114979282B (en) | Task scheduling method, device, storage medium and electronic equipment | |
| CN113342776B (en) | Transaction information migration method, device, equipment and medium based on intelligent contract | |
| CN115563160A (en) | Data processing method, data processing device, computer equipment and computer readable storage medium | |
| CN113127094A (en) | Application program running method and device, storage medium and terminal | |
| CN110209491B (en) | Resource management method, device, server and storage medium | |
| CN111988403A (en) | Request processing method and system of electronic equipment, storage medium and electronic equipment | |
| CN111538721A (en) | Account processing method and device, electronic equipment and computer readable storage medium | |
| CN115277557B (en) | Broadcast processing method, device, electronic equipment and storage medium | |
| CN113422877B (en) | Method and device for realizing number outbound based on service scene and electronic equipment | |
| CN116634432B (en) | Data transmission method and device | |
| CN115589391B (en) | Instant messaging processing method, device and equipment based on block chain and storage medium | |
| CN109510855A (en) | Event distribution system, method and device |
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 |