CN107948271B - Method for determining message to be pushed, server and computing node - Google Patents
Method for determining message to be pushed, server and computing node Download PDFInfo
- Publication number
- CN107948271B CN107948271B CN201711148908.7A CN201711148908A CN107948271B CN 107948271 B CN107948271 B CN 107948271B CN 201711148908 A CN201711148908 A CN 201711148908A CN 107948271 B CN107948271 B CN 107948271B
- Authority
- CN
- China
- Prior art keywords
- service data
- computing node
- preset
- server
- data group
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 85
- 238000012545 processing Methods 0.000 claims description 42
- 238000004364 calculation method Methods 0.000 claims description 10
- 238000004806 packaging method and process Methods 0.000 claims 2
- 230000015654 memory Effects 0.000 description 34
- 238000004891 communication Methods 0.000 description 25
- 230000006870 function Effects 0.000 description 15
- 238000010586 diagram Methods 0.000 description 9
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000005538 encapsulation Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000010295 mobile communication Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 235000019800 disodium phosphate Nutrition 0.000 description 2
- 239000007787 solid Substances 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000036962 time dependent Effects 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
- Computer And Data Communications (AREA)
Abstract
The application provides a method for determining a message to be pushed, a server and a computing node, relates to the technical field of message pushing, and can accelerate the process of determining the message to be pushed and shorten the time delay of message pushing. The method comprises the following steps: the server receives service data sent by the terminal; the server divides the service data to obtain at least one service data group, wherein each service data group comprises at least one service data; the server respectively sends an instruction to at least one computing node, the instruction carries a preset service data group, and the instruction is used for instructing the computing node to process the preset service data group to obtain a push message corresponding to each service data in the preset service data group.
Description
Technical Field
The present application relates to the field of message pushing technologies, and in particular, to a method, a server, and a computing node for determining a message to be pushed.
Background
Message pushing is a technology for World Wide Web (Web) application development, and refers to a server sending information carrying specific content to a client. The technology is mainly used for improving user experience and avoiding the situation that a user obtains data from a server side in a mode of continuously refreshing a page. For example, when a user uses a Web mail, a mail item just received automatically appears in a Web mailbox to prevent the user from obtaining the mail item just received by manually refreshing a page, and for example, a Web instant messaging system automatically prompts a new message to the user.
Currently, the method for determining a message to be pushed is as follows: each message push service provider sets a server specially used for message push, receives communication data sent by the terminal, and calculates the message to be pushed based on the communication data.
However, as the network rapidly develops, the number of communication terminals increases, and for the server, if the server needs to process massive communication data according to the existing method for determining the message to be pushed, that is, the processing load of the server is heavy, so that the data processing speed of the server is likely to be slowed down, and the user receives the push message of the server about a specific area after leaving the specific area, thereby reducing the timeliness of the push message.
Disclosure of Invention
The application provides a method, a server and a computing node for determining a message to be pushed, which can shorten the time for determining the message to be pushed when the message is pushed, thereby improving the timeliness of message pushing.
In order to achieve the purpose, the technical scheme is as follows:
in a first aspect, the present application provides a method for determining a message to be pushed, where the method may include:
the method comprises the steps that a server receives service data of a terminal, the server divides the service data to obtain at least one service data group, each service data group comprises at least one service data, the server sends an instruction to at least one computing node respectively, the instruction carries a preset service data group, and the instruction is used for instructing the computing node to process the preset service data group to obtain a push message corresponding to each service data in the preset service data group.
In a second aspect, the present application provides a server comprising: the device comprises a receiving module, a sending module and a dividing module. The receiving module is used for receiving service data of the terminal; the dividing module is used for dividing the service data to obtain at least one service data group, and each service data group comprises at least one service data;
the sending module is used for respectively sending instructions to at least one computing node, the instructions carry preset service data groups, and the instructions are used for instructing the computing nodes to process the preset service data groups to obtain push messages corresponding to each service data in the preset service data groups.
In a third aspect, the present application provides a server, comprising: a processor, a transceiver, and a memory. Wherein the memory is configured to store one or more programs, and the one or more programs include instructions, and when the server runs, the processor executes the instructions stored in the memory to enable the server to execute the method for determining a message to be pushed according to any one of the first aspect and various optional implementations thereof.
In a fourth aspect, the present application provides a computer-readable storage medium, where computer-executable instructions are stored in the computer-readable storage medium, and when a server executes the computer-executable instructions, the server executes the method for determining a message to be pushed according to any one of the first aspect and various optional implementations of the first aspect.
In a fifth aspect, the present application further provides a method for determining a message to be pushed, where the method includes:
a computing node receives an instruction sent by a server, wherein the instruction carries a preset service data group corresponding to the computing node, and the preset service data group is obtained by dividing service data sent by a terminal by the server; and the computing node processes the preset service data group to obtain a push message corresponding to each service data in the service data group.
In a sixth aspect, the present application provides a computing node, comprising: a processor, a transceiver, and a memory. Wherein the memory is configured to store one or more programs, the one or more programs including instructions, and the processor executes the instructions stored in the memory to cause the computing node to perform the method for determining a message to be pushed according to any one of the first aspect and various optional implementations thereof.
In a seventh aspect, the present application provides a computing node, including: the receiving module is used for receiving an instruction sent by a server, wherein the instruction carries a preset service data group corresponding to the computing node, and the preset service data group is obtained by dividing service data sent by a terminal by the server; and the processing module is used for processing the preset service data group to obtain a push message corresponding to each service data in the preset service data group.
In an eighth aspect, the present application provides a computer-readable storage medium, where a computer-executable instruction is stored in the computer-readable storage medium, and when the computer-executable instruction is executed by a computing node, the computing node executes the method for determining a message to be pushed according to any one of the first aspect and various optional implementations thereof.
Compared with the prior art that a server processes a large amount of communication data in a unified manner, so that the performance of the server becomes a bottleneck of a message pushing system, and the message pushing generates time delay, the method, the server and the computing node for determining the message to be pushed provided by the application are characterized in that the server receives service data sent by a terminal, divides at least one service data to obtain at least one service data group, and then respectively sends an instruction to the at least one computing node, wherein the instruction carries a preset service data group to instruct the computing node to process the preset service data group to obtain a push message corresponding to each service data in the preset service data group. The method comprises the steps of dividing a large amount of communication data into a plurality of service data groups, distributing each service data group to each computing node for computing, and further avoiding the problem that the server is heavier in burden due to the fact that the server processes a large amount of data in a centralized mode.
Drawings
Fig. 1 is a schematic structural diagram of a communication network according to an embodiment of the present application;
fig. 2 is a flowchart of a method for determining a message to be pushed according to an embodiment of the present application;
fig. 3 is a flowchart of another method for determining a message to be pushed according to an embodiment of the present application;
fig. 4 is a first schematic structural diagram of a server according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a server according to an embodiment of the present application;
fig. 6 is a first schematic structural diagram of a compute node according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a computing node according to an embodiment of the present application.
Detailed Description
The method, the server, and the computing node for determining a message to be pushed provided by the embodiment of the present application are described in detail below with reference to the accompanying drawings.
The term "and/or" herein is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone.
Furthermore, the terms "including" and "having," and any variations thereof, as referred to in the description of the present application, 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 but may alternatively include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be noted that in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
In the description of the present application, the meaning of "a plurality" means two or more unless otherwise specified.
The method for determining a to-be-pushed message provided in the embodiment of the present application may be applied to the communication network shown in fig. 1, where the communication network may be a fifth generation (5th generation, 5G) mobile communication network, and may also be a fourth generation (4th generation, 4G) (e.g., an Evolved Packet System (EPS) mobile communication network, and may also be other actual mobile communication networks, and the present application is not limited thereto.
As shown in fig. 1, the communication network may comprise: terminal, base station, server, computational node. The terminal in fig. 1 may be configured to connect to an access network device deployed by a service provider through a wireless air interface, and then access to a service provider network as in fig. 1; the base station is mainly used for realizing wireless physical layer functions, resource scheduling and wireless resource management, wireless access control and mobility management functions; the server network comprises servers and computing nodes, each server can manage at least one computing node, only one server in the server network and 2 computing nodes managed by the server are exemplarily shown in the figure, and the server network is mainly used for providing a message push service for the terminal. It should be noted that fig. 1 is only an exemplary architecture diagram, and the network architecture may include other functional units besides the functional units shown in fig. 1, which is not limited in this application.
The terminal may be a User Equipment (UE), such as: cell phones, computers, and may also be cellular phones, cordless phones, Session Initiation Protocol (SIP) phones, smart phones, Wireless Local Loop (WLL) stations, Personal Digital Assistants (PDAs), laptop computers, handheld communication devices, handheld computing devices, satellite radios, wireless modem cards, Set Top Boxes (STBs), Customer Premises Equipment (CPE), and/or other devices used to communicate over a wireless system.
An embodiment of the present application provides a method for determining a message to be pushed, and as shown in fig. 2, the method may include S201 to S204:
s201, the server receives service data sent by the terminal.
Before S201, the terminal sends service data to the base station, and after receiving the service data, the base station sends the service data to the server. For example, the terminal 1, the terminal 2, and the terminal 3 use their respective browsers to browse a web page, the service data transmitted by the terminal 1 to the base station is the web page data input by the user 1, and the base station transmits the web page data of the terminal 1 to the server after receiving the web page data of the terminal 1. The service data sent by the terminal 2 to the base station is the webpage data input by the user 2, and the base station sends the webpage data of the terminal 2 to the server after receiving the webpage data of the terminal 2. The service data sent by the terminal 3 to the base station is the webpage data input by the user 3, and the base station sends the webpage data of the terminal 3 to the server after receiving the webpage data of the terminal 3.
S202, the server divides the service data to obtain at least one service data group, and each service data group comprises at least one service data.
Before executing S202, the server performs a standardization process on the at least one service data, so that formats of the at least one service data are consistent with each other, and a format of a single service data includes an encapsulation format of a network protocol corresponding to the single service data.
For example, if the terminal 1 is a terminal of a 2G network protocol, the terminal 2 is a terminal of a 4G network protocol, and the terminal 3 is a terminal of a 5G network protocol, the server unifies formats of service data of the terminals after receiving the service data corresponding to the terminals sent by the base station. Specifically, the server unifies the encapsulation formats corresponding to the service data. For example, the service data of the terminal 1 includes a field 1 and a field 2, the service data of the terminal 2 includes a field 1, a field 2 and a field 3, and the service data of the terminal 3 includes a field 1, a field 2, a field 3 and a field 4, then according to the format requirement, the server repackages the service data 1 of the terminal 1 and adds the field 3 and the field 4 to the service data 1, wherein the contents of the newly added field 3 and the field 4 are null, the server repackages the service data 2 of the terminal 2 and adds the field 4 to the service data 2, and the contents of the newly added field 4 are null.
The formats of the heterogeneous service data from different terminals are unified, so that the computing node can process the service data with the consistent format, processing errors generated when the computing node processes the service data with the inconsistent format are avoided, meanwhile, because the computing node does not need to carry out standardized processing on the heterogeneous service data, the computing node can apply most of self resources to the calculation of the push message, and the computing performance of the computing node is further optimized.
For example, in S102, the server divides the service data of the terminal 1 and the service data of the terminal 2 into a service data group 1, and divides the service data of the terminal 3 into a service data group 2.
S203, the server sends an instruction to at least one computing node respectively, and the instruction carries a preset service data group.
Specifically, the at least one computing node comprises a first computing node and a second computing node;
the server respectively sends instructions to at least one computing node, and the instructions comprise: the server sends a first instruction to the first computing node, wherein the first instruction carries a first preset service data group; the server sends a second instruction to the second computing node, wherein the second instruction carries a second preset service data group; the first computing node is different from the second computing node, and the first preset service data group is different from the second preset service data group.
As shown in fig. 2, the server sends an instruction 1 to the computing node 1, where the instruction carries a preset service data group 1 corresponding to the computing node 1, the service data group 1 includes service data 1 of the terminal 1 and service data 2 of the terminal 2, and the server sends an instruction 2 to the computing node 2, where the instruction carries a preset service data group 2 corresponding to the computing node 2, and the service data group 2 includes service data 3 of the terminal 3.
S204, the computing node processes the corresponding preset service data group to obtain a push message corresponding to each service data in the preset service data group.
With the above example, the computing node 1 processes the service data of the terminal 1 and the terminal 2 to obtain the push messages corresponding to the terminal 1 and the terminal 2, and the computing node 2 processes the service data of the terminal 3 to obtain the push message corresponding to the terminal 3.
Specifically, the computing node processes a preset service data set according to a preset computing model.
For a single compute node, the preset compute model is:
wherein,
i, m is the number of service data corresponding to a single computing node,
as a result of the standardized processing of the service data i, uiIs the validation factor, u, of the service data iiIn relation to time, piA preset message push condition for the service data i,
is shown in
Under the condition of (1) to
As a result of the calculation, the result of the calculation,
the Stream Operator (SO) represents a manner in which a single node processes a preset service data set. The method for processing the preset service data group by a single node may be processing a single data in the preset service data group in real time, and may also be processing a plurality of data in the preset service data group in batch, which is not limited in the embodiment of the present application.
Alternatively, uiMay be a time-dependent variable, e.g. uiMay be a preset time period for pushing messages.
The following describes a manner of determining a message to be pushed by taking the computing node 1 as an example, and with reference to the above example, the computing node 1 needs to process the service data 1 of the terminal 1 and the service data 2 of the terminal 2. That is, the service data corresponding to the computing node 1 is the service data 1 (i.e. the service data 1)
Where i ═ 1) and traffic data 2 (i.e., traffic data
Where i is 2), the value of m is 2. For the service data 1 of the terminal 1, it is assumed that the service data 1 (i.e., the web page data browsed by the user 1 through the browser) contains contents indicating that the user 1 browses contents on the story novel through the browser, uiFor a preset push message time period, assume that it is set to send push messages to terminal 1 every 6 hours, piArranged to push messages relating to a novel, resulting
Comprises the following steps: sending a message about the novel to the terminal every 6 hours, then performing SO (stream operator) operation processing to obtain a final message to be pushed, and assuming that the finally determined message to be pushed is the message about the novel to the terminal every 6 hours, the computing node can push the message to the terminal 1 according to the determined message to be pushed.
It is noted that, in the embodiment of the present application, after S204, as shown in fig. 3, S301 may also be performed.
S301, the server determines the time delay of the message to be pushed
The more complex the algorithm is, the more accurate the finally determined push message is; c is the data volume of the service data, rho is the performance index value of a single computing node, and N is the number of the computing nodes.
Optionally, in this embodiment of the present application, the time delay of the push message may be reduced by improving the performance of a single computing node and/or increasing the number of computing nodes.
Compared with the prior art that a server processes a large amount of communication data in a unified manner, so that the performance of the server becomes a bottleneck of a message pushing system, and the message pushing generates time delay, the method for determining the message to be pushed provided by the application includes that the server receives service data sent by a terminal, divides at least one service data to obtain at least one service data group, and then sends an instruction to at least one computing node respectively, wherein the instruction carries a preset service data group to instruct the computing node to process the preset service data group to obtain a push message corresponding to each service data in the preset service data group. The method comprises the steps of dividing a large amount of communication data into a plurality of service data groups, distributing each service data group to each computing node for computing, and further avoiding the problem that the server is heavier in burden due to the fact that the server processes a large amount of data in a centralized mode.
The scheme provided by the embodiment of the application is mainly introduced from the perspective of the server. It is understood that the server includes hardware structures and/or software modules for performing the respective functions in order to implement the above-described functions. Those of skill in the art will readily appreciate that the present application is capable of being implemented as hardware or a combination of hardware and computer software for performing the exemplary servers and algorithm steps described in connection with the embodiments disclosed herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the embodiment of the present application, the server may be divided into the functional modules or the functional units according to the above method examples, for example, each functional module or functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module may be implemented in a form of hardware, or may be implemented in a form of a software functional module or a functional unit. The division of the modules or units in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
It should be noted that the execution subject of the method flow is not limited to the server, and other network devices with similar functions may be used instead of the server to execute the method of the embodiment of the present application.
In the case that the function modules are divided according to the functions, fig. 4 shows a possible structural diagram of the server in the foregoing embodiment. The server includes a receiving module 401, a processing module 402, a dividing module 403, a sending module 404, and a determining module 405.
The receiving module 401 is configured to receive service data of a terminal;
a dividing module 403, configured to divide the service data to obtain at least one service data group, where each service data group includes at least one service data;
a sending module 404, configured to send an instruction to at least one computing node, where the instruction carries a preset service data group, and the instruction is used to instruct the computing node to process the preset service data group, so as to obtain a push message corresponding to each service data in the preset service data group.
In another implementation manner of the embodiment of the present application, the processing module 402 is configured to perform standardized processing on the service data received by the receiving module 401, so that formats of the service data are consistent with each other, where a format of a single service data includes an encapsulation format of a network protocol corresponding to the single service data.
In another implementation manner of the embodiment of the present application, the determining module 405 is configured to determine a delay of a message to be pushed
And the method comprises the following steps of calculating the performance index value of each calculation node, wherein theta is preset algorithm complexity, C is the data volume of service data, rho is the performance index value of each calculation node, and N is the number of the calculation nodes.
Fig. 5 shows a possible structural diagram of the server involved in the above-described embodiment, in the case of an integrated unit. The server includes: a processing unit 502 and a communication unit 503. The processing unit 502 is used to control and manage the actions of the servers, e.g., to perform the steps performed by the processing module 402, the partitioning module 403, and/or other processes for performing the techniques described herein. The communication unit 503 is configured to support communication between the server and other network entities, for example, perform the steps performed by the receiving module 401. The server may further comprise a storage unit 501 and a bus 504, the storage unit 501 being used for storing program codes and data of the server.
The processing unit 502 may be, for example, a processor or a controller in a server, which may implement or execute various exemplary logical blocks, modules, and circuits described in connection with the disclosure. The processor or controller may be a central processing unit, general purpose processor, digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, DSPs, and microprocessors, among others.
The communication unit 503 may be a transceiver, a transceiving circuit, a communication interface, or the like in the server.
The storage unit 501 may be a memory in a server or the like, and the memory may include a volatile memory such as a random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, a hard disk, or a solid state disk; the memory may also comprise a combination of memories of the kind described above.
The bus 504 may be an Extended Industry Standard Architecture (EISA) bus or the like. The bus 504 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 5, but this is not intended to represent only one bus or type of bus.
An embodiment of the present application provides a computing node, as shown in fig. 6, where the computing node includes a receiving module 601 and a processing module 602:
the receiving module 601 is configured to receive an instruction sent by a server, where the instruction carries a preset service data group corresponding to the computing node, where the preset service data group is obtained by dividing service data sent by a terminal by the server.
The instruction is specifically used for instructing the computing node to process the service data group according to a preset computing model.
For a single compute node, the preset compute model is:
wherein,
i is the service data corresponding to the single computing node, m is the number of the service data corresponding to the single computing node,
is the result of the standardized processing of the service data i, uiIs the effective factor of the service data i, the uiIn relation to time, piA preset message push condition for the service data i,
is shown in
Under the condition of (1) to
Treated ofAs a result of which,
the stream operator symbol represents the mode of processing the preset service data group by a single node. Wherein, the flow rate of the water is controlled by the control unit.
The processing module 602 is configured to process a preset service data group, and obtain a push message corresponding to each service data in the preset service data group.
Fig. 7 shows a possible structural diagram of the computing node involved in the above-described embodiment, in the case of an integrated unit. The computing node includes: a processing unit 702 and a communication unit 703. Processing unit 702 is used to control and manage the actions of the compute node, e.g., to perform the steps performed by processing module 602 described above, and/or to perform other processes for the techniques described herein. The communication unit 703 is configured to support communication between the computing node and other network entities, for example, perform the steps performed by the receiving module 601. The compute node may also include a memory unit 701 and a bus 704, the memory unit 701 being used to store program codes and data for the compute node.
The processing unit 702 can be, among other things, a processor or controller in a computing node that can implement or execute the various illustrative logical blocks, modules, and circuits described in connection with the disclosure herein. The processor or controller may be a central processing unit, general purpose processor, digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, DSPs, and microprocessors, among others.
The communication unit 703 may be a transceiver, a transceiving circuit or a communication interface in the computing node, etc.
The storage unit 701 may be a memory or the like in the computing node, which may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, a hard disk, or a solid state disk; the memory may also comprise a combination of memories of the kind described above.
The bus 704 may be an Extended Industry Standard Architecture (EISA) bus or the like. The bus 704 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 7, but this is not intended to represent only one bus or type of bus.
Through the above description of the embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions. For the specific working processes of the system, the apparatus and the unit described above, reference may be made to the corresponding processes in the foregoing method embodiments, and details are not described here again.
The present invention also provides a computer-readable storage medium, where one or more programs are stored in the computer-readable storage medium, where the one or more programs include instructions, and when the processor of the server executes the instructions, the server executes the steps performed by the server in the method flow shown in the foregoing method embodiment.
The present invention further provides a computer-readable storage medium, where one or more programs are stored in the computer-readable storage medium, where the one or more programs include instructions, and when the processor of the computing node executes the instructions, the computing node executes the steps performed by the computing node in the method flow shown in the foregoing method embodiment.
The computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a Read-Only Memory (ROM), an Erasable Programmable Read-Only Memory (EPROM), an optical fiber, a portable Compact Disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In embodiments of the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The steps of a method or algorithm described in connection with the disclosure herein may be embodied in hardware or in software instructions executed by a processor. The software instructions may consist of corresponding software modules that may be stored in RAM, flash memory, ROM, Erasable Programmable Read Only Memory (EPROM), Electrically Erasable Programmable Read Only Memory (EEPROM), registers, a hard disk, a removable hard disk, a compact disc read only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an ASIC.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) or a processor to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: flash memory, removable hard drive, read only memory, random access memory, magnetic or optical disk, and the like.
The above description is only an embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions within the technical scope of the present disclosure should be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (6)
1. A method for determining a message to be pushed, the method comprising:
the server receives service data sent by the terminal;
the server divides the service data to obtain at least one service data group, wherein each service data group comprises at least one service data;
the server respectively sends instructions to at least one computing node, wherein the instructions carry preset service data groups, and the instructions are used for instructing the computing nodes to process the preset service data groups to obtain push messages corresponding to each service data in the preset service data groups;
the processing of the preset service data group by the computing node comprises: the computing node processes the preset service data group according to a preset computing model;
for a single compute node, the preset compute model is:
wherein,
i is the service data corresponding to the single computing node, m is the number of the service data corresponding to the single computing node,
is the result of the standardized processing of the service data i, uiIs the effective factor of the service data i, the uiIn relation to time, piA preset message push condition for the service data i,
is shown in
Under the condition of (1) to
As a result of the processing, the result of the processing,
and the flow operator symbol represents the mode of processing the preset service data group by the single node.
2. The method of determining messages to be pushed as claimed in claim 1, the at least one computing node comprising a first computing node and a second computing node;
the server respectively sends instructions to at least one computing node, including:
the server sends a first instruction to a first computing node, wherein the first instruction carries a first preset service data group;
the server sends a second instruction to a second computing node, wherein the second instruction carries a second preset service data group;
the first computing node is different from the second computing node, and the first preset service data group is different from the second preset service data group.
3. The method for determining the message to be pushed according to claim 2, wherein after the server receives the service data sent by the terminal, the method further comprises:
the server carries out standardization processing on the service data so that the formats of the service data are consistent with each other, and the format of single service data comprises the packaging format of a network protocol corresponding to the single service data.
4. The method of determining messages to be pushed according to claim 3, wherein after the server sends instructions to at least one computing node, respectively, the method further comprises:
the server determines the delay of a message to be pushed
And the theta is preset algorithm complexity, the C is the data volume of the service data, the rho is a performance index value of a single calculation node, and the N is the number of the calculation nodes.
5. A server, characterized in that the server comprises:
the receiving module is used for receiving the service data sent by the terminal;
the dividing module is used for dividing the service data to obtain at least one service data group, and each service data group comprises at least one service data;
the sending module is used for respectively sending instructions to at least one computing node, wherein the instructions carry preset service data groups, and the instructions are used for instructing the computing nodes to process the preset service data groups to obtain push messages corresponding to each service data in the preset service data groups;
the instruction is specifically used for instructing the computing node to process the service data group according to a preset computing model;
for a single compute node, the preset compute model is:
wherein,
i is the service data corresponding to the single computing node, m is the number of the service data corresponding to the single computing node,
is the result of the standardized processing of the service data i, uiTo the industry ofValidation factor of transaction data i, said uiIn relation to time, piA preset message push condition for the service data i,
is shown in
Under the condition of (1) to
As a result of the processing, the result of the processing,
and the flow operator symbol represents the mode of processing the preset service data group by the single node.
6. The server according to claim 5, further comprising:
the processing module is used for carrying out standardized processing on the service data so as to enable the formats of the service data to be consistent with each other, and the format of single service data comprises the packaging format of a network protocol corresponding to the single service data;
a determining module for determining the time delay of the message to be pushed
And the theta is preset algorithm complexity, the C is the data volume of the service data, the rho is a performance index value of a single calculation node, and the N is the number of the calculation nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711148908.7A CN107948271B (en) | 2017-11-17 | 2017-11-17 | Method for determining message to be pushed, server and computing node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711148908.7A CN107948271B (en) | 2017-11-17 | 2017-11-17 | Method for determining message to be pushed, server and computing node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107948271A CN107948271A (en) | 2018-04-20 |
| CN107948271B true CN107948271B (en) | 2021-04-13 |
Family
ID=61932917
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711148908.7A Active CN107948271B (en) | 2017-11-17 | 2017-11-17 | Method for determining message to be pushed, server and computing node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107948271B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108764354A (en) * | 2018-05-31 | 2018-11-06 | 北京百度网讯科技有限公司 | Method and device for handling information |
| CN111382046B (en) * | 2018-12-28 | 2023-03-28 | 中国电信股份有限公司 | Test system, method and device for distributed software system |
| CN109982295B (en) * | 2019-03-21 | 2021-10-15 | 中国联合网络通信集团有限公司 | Business template push method and business template pusher |
| CN112752296B (en) * | 2019-10-30 | 2022-06-10 | 中移(苏州)软件技术有限公司 | Data transmission method and device and electronic equipment |
| CN111858041B (en) * | 2020-07-10 | 2023-06-30 | 中国联合网络通信集团有限公司 | A data processing method and server |
| CN113271328B (en) * | 2020-09-23 | 2022-07-19 | 苏州市中拓互联信息科技有限公司 | Cloud server information management method and system |
| CN113207151B (en) * | 2021-07-05 | 2021-10-26 | 中兴通讯股份有限公司 | Data flow control method, system, server and service management node |
| CN113779400B (en) * | 2021-09-14 | 2023-05-23 | 中国联合网络通信集团有限公司 | Message pushing method, device, equipment and computer readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106339507A (en) * | 2016-10-31 | 2017-01-18 | 腾讯科技（深圳）有限公司 | Method and device for pushing streaming media message |
| CN106484325A (en) * | 2016-09-14 | 2017-03-08 | 广东欧珀移动通信有限公司 | A data migration method and mobile terminal |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6728848B2 (en) * | 2001-06-11 | 2004-04-27 | Hitachi, Ltd. | Method and system for backing up storage system data |
| CN102255908A (en) * | 2011-07-08 | 2011-11-23 | 北京邮电大学 | Internet of things gateway protocol consistency realization method |
| CN103914528B (en) * | 2014-03-28 | 2017-02-15 | 南京邮电大学 | Parallelizing method of association analytical algorithm |
| US9632811B2 (en) * | 2015-03-25 | 2017-04-25 | Ca, Inc. | Virtualization of purpose-built devices |
| CN105843685A (en) * | 2016-03-17 | 2016-08-10 | 哈尔滨理工大学 | Mobile terminal calculation unloading method based on task distribution |
-
2017
- 2017-11-17 CN CN201711148908.7A patent/CN107948271B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106484325A (en) * | 2016-09-14 | 2017-03-08 | 广东欧珀移动通信有限公司 | A data migration method and mobile terminal |
| CN106339507A (en) * | 2016-10-31 | 2017-01-18 | 腾讯科技（深圳）有限公司 | Method and device for pushing streaming media message |
Non-Patent Citations (1)
| Title |
|---|
| 智能推送平台的设计与实现;张斌;《中国优秀硕士学位论文全文数据库（电子期刊）》;20170331;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107948271A (en) | 2018-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107948271B (en) | Method for determining message to be pushed, server and computing node | |
| CN110267327B (en) | Service transmission method and device | |
| CN110809295B (en) | Data transmission method and related device | |
| EP3573367B1 (en) | Resource allocation for ran slicing | |
| CN109845303B (en) | Management method and management unit for network slices | |
| CN114271016B (en) | Priority-based session admission control method and device | |
| US9546870B2 (en) | Dynamic route mapping between mobile devices | |
| EP3860259A1 (en) | Harq process id determination method and apparatus, terminal, and medium | |
| JPWO2015141337A1 (en) | Received packet distribution method, queue selector, packet processing device, program, and network interface card | |
| CN107645715B (en) | Method and equipment for formulating user package | |
| US12260127B2 (en) | Technologies for storage and processing for distributed file systems | |
| CN112188548A (en) | Service processing method and device | |
| CN116471276A (en) | A service access method, system and related equipment | |
| CN115396063A (en) | Frame structure configuration method, device, storage medium and equipment | |
| CN111031519A (en) | A terminal access authentication method and device based on edge computing | |
| EP4296922A1 (en) | Method and apparatus for determining logistics product, and electronic device and computer-readable medium | |
| CN114125936B (en) | A resource scheduling method, device and storage medium | |
| CN107465538B (en) | Internet of things terminal migration method and gateway | |
| US10469617B1 (en) | System and method for efficient network usage | |
| CN103746844B (en) | A kind of distribution method and device of terminal online | |
| CN109548000B (en) | A system, method and computer equipment for sharing and purchasing communication services | |
| CN113938992A (en) | A kind of threshold determination method and device | |
| CN117130775A (en) | Task allocation method, system, storage medium and electronic device | |
| CN102891888B (en) | Data access method and related equipment and system | |
| WO2012123625A1 (en) | Method and apparatus for recommending content based on content provision models associated with spatial regions |
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 |