CN111327434B - Method for optimizing broadcast push and storage medium - Google Patents
Method for optimizing broadcast push and storage medium Download PDFInfo
- Publication number
- CN111327434B CN111327434B CN202010074993.2A CN202010074993A CN111327434B CN 111327434 B CN111327434 B CN 111327434B CN 202010074993 A CN202010074993 A CN 202010074993A CN 111327434 B CN111327434 B CN 111327434B
- Authority
- CN
- China
- Prior art keywords
- push
- broadcast
- message
- pushing
- user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1859—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast adapted to provide push services, e.g. data channels
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1886—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with traffic restrictions for efficiency improvement, e.g. involving subnets or subdomains
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a method and a storage medium for optimizing broadcast push, wherein the method comprises the following steps: presetting a registered user table and more than two push calculation modules, wherein the registered user table records application categories and regional codes corresponding to user IDs; after receiving the broadcast message of the designated broadcast group, judging whether the number of the target users reaches a preset base number according to the registered user table; and if so, distributing the target users to all the pushing calculation modules evenly to perform data pushing processing. The invention improves the broadcast push efficiency; and a specific broadcasting group can be locked for broadcasting through dynamic configuration, so that the method has higher practicability; furthermore, the method is combined with the old broadcasting mode, reasonable resource distribution is realized, and the system performance is improved.
Description
Technical Field
The invention relates to the field of information interaction of a client and a server, in particular to a method and a storage medium for optimizing broadcast push.
Background
Most systems or APPs require the use of message push functionality. Typically, the number of clients of an APP system reaches several tens of millions, and each client needs to maintain a long connection with a server, so that several tens of millions of long connections are connected to the server. Meanwhile, the APP client side with the established long connection needs to send heartbeat packets to the server at regular intervals, and the server side accordingly determines whether the APP client side is disconnected.
In the above situation, it is described that there are dozens of millions of client terminals to be pushed, and if one piece of broadcast information is sent to all terminals, a corresponding number of message details need to be generated. For example, a 100W user, needs to generate 100W message details. The broadcast push mode adopted by the old push system is as follows: an operator configures a broadcast message in the background, a background program inquires client information meeting the conditions, and generates a corresponding number of message details according to the client information; then, the program records the message details to a cache or a database; after the completion, the program executes different actions according to whether the client side is on line. Specifically, if the client is on line, the message is directly sent to the client; and if the client is not on line, not doing other actions, and after the client is on line again, pulling the broadcast message from the server.
The broadcast push mode causes that the broadcast message is very slow, occupies a large amount of resources of the server, and has low broadcast throughput.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the method and the storage medium for optimizing the broadcast push are provided, the broadcast push efficiency is improved, and the occupation of server resources is reduced.
In order to solve the technical problems, the invention adopts the technical scheme that:
a method of optimizing broadcast push, comprising:
presetting a registered user table and more than two push calculation modules, wherein the registered user table records application categories and regional codes corresponding to user IDs;
after receiving the broadcast message of the designated broadcast group, judging whether the number of the target users reaches a preset base number according to the registered user table;
and if so, distributing the target users to all the pushing calculation modules evenly to perform data pushing processing.
The invention provides another technical scheme as follows:
a computer-readable storage medium, having stored thereon a computer program, which, when being executed by a processor, is able to carry out the steps included in a method of optimizing broadcast push as described above.
The invention has the beneficial effects that: the invention determines whether to use the old single-node broadcast or the multi-node distributed broadcast push according to the total push amount, and can obviously improve the broadcast push efficiency.
Drawings
Fig. 1 is a flowchart illustrating a method for optimizing broadcast push according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a method for optimizing broadcast push according to an embodiment of the present invention.
Detailed Description
In order to explain technical contents, achieved objects, and effects of the present invention in detail, the following description is made with reference to the accompanying drawings in combination with the embodiments.
The most key concept of the invention is as follows: according to the total push amount, whether the old single-node broadcast is used or the multi-node distributed broadcast push is determined, and the broadcast push efficiency can be obviously improved.
The technical terms related to the invention are explained as follows:
referring to fig. 1, the present invention provides a method for optimizing broadcast push, including:
presetting a registered user table and more than two push calculation modules, wherein the registered user table records application categories and regional codes corresponding to user IDs;
after receiving the broadcast message of the designated broadcast group, judging whether the number of the target users reaches a preset base number according to the registered user table;
and if so, distributing the target users to all the pushing calculation modules evenly to perform data pushing processing.
From the above description, the beneficial effects of the present invention are: the push platform is modified based on the existing push framework. When broadcasting information, judging logic is carried out in advance: predicting the total pushing amount, and when the total pushing amount is lower than a threshold value, calculating by adopting a single node and executing a pushing operation; and if the total push amount exceeds the threshold value, disassembling the broadcast task in a distributed node mode. And the broadcast push logic is determined according to the push total amount, so that the broadcast push efficiency can be improved.
Further, still include:
each push calculation module acquires a user ID list corresponding to a user set distributed to the push calculation module;
each push calculation module sends the broadcast message ID and the record data of the push calculation module ID to a redis cache server or a database;
each pushing calculation module sends a broadcast notification to the message pushing module;
and the pushing module acquires a user ID list from a pushing calculation module corresponding to the ID of the pushing calculation module according to the recorded data stored in the redis cache server or the database to perform broadcast pushing of the corresponding broadcast message ID.
As can be seen from the above description, each push calculation module uniformly summarizes the broadcast data processing results of the target users assigned to itself to one place, and then uniformly executes the sending of the final message. Ensuring that the broadcast message push process is performed without error.
Further, a method of optimizing broadcast push as claimed in claim 1, further comprising:
if the registered user table judges that the number of the target users does not reach the preset base number, a user ID list corresponding to the target user set is inquired by a background, and message details of the corresponding number are generated;
uploading the message details to a redis cache server or a database;
and the background carries out broadcast push according to whether the client corresponding to the user ID list is online. As can be appreciated from the above description,
further, if the number of the target users does not reach the preset base number, the single-node broadcast push logic is directly adopted for execution, and the broadcast push task can be efficiently completed without occupying more resources.
As can be seen from the above description, the registered user table further records tags corresponding to the user IDs;
further, the method further comprises:
when the designated broadcast group is the user of the designated label, counting the number of the users of the designated label in the registered user table;
and distributing the target users to each push calculation module according to the statistical result to perform the processing of the push data.
According to the description, the dynamic setting of the user tags is supported, the broadcast push is realized according to the tags, the pertinence of the broadcast push is improved, and more requirements are met.
Further, the label includes gender, age, and occupation.
As can be seen from the above description, variability and customization of the tag fields is supported.
The invention provides another technical scheme as follows:
a computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, is able to carry out the steps of a method of optimizing broadcast push;
a method of optimizing broadcast push, comprising:
presetting a registered user table and more than two push calculation modules, wherein the registered user table records application categories and regional codes corresponding to user IDs;
after receiving the broadcast message of the designated broadcast group, judging whether the number of the target users reaches a preset base number according to the registered user table;
and if so, distributing the target users to all the pushing calculation modules evenly to perform data pushing processing.
Further, still include:
each push calculation module acquires a user ID list corresponding to a user set distributed to the push calculation module;
each push calculation module sends the broadcast message ID and the record data of the push calculation module ID to a redis cache server or a database;
each pushing calculation module sends a broadcast notification to the message pushing module;
and the pushing module acquires a user ID list from a pushing calculation module corresponding to the ID of the pushing calculation module according to the recorded data stored in the redis cache server or the database to perform broadcast pushing of the corresponding broadcast message ID.
Further, still include:
if the registered user table judges that the number of the target users does not reach the preset base number, a user ID list corresponding to the target user set is inquired by a background, and message details of the corresponding number are generated;
uploading the message details to a redis cache server or a database;
and the background carries out broadcast push according to whether the client corresponding to the user ID list is online.
Further, the registered user table also records tags corresponding to user IDs;
the method further comprises the following steps:
when the designated broadcast group is the user of the designated label, counting the number of the users of the designated label in the registered user table;
and distributing the target users to each push calculation module according to the statistical result to perform the processing of the push data.
Further, the label includes gender, age, and occupation.
Example one
Referring to fig. 2, the present embodiment provides a method for optimizing broadcast push, which is implemented by modifying an existing push architecture to significantly improve broadcast push efficiency, and the method includes:
s1: presetting a registered user table;
the registered user table record includes information such as each user ID and its corresponding application type, area code, and tag. Wherein, the user ID is also the device ID: device _ id, which can be understood as an account number successfully registered; application classes app _ type, such as application a, with app _ type being type _ a, application B, with app _ type being type _ B; the area _ code is numbered in area, if the account number belongs to Fujian area or Zhejiang area; and tag tags, such as personalized tags of gender, age, occupation and the like. Preferably, the tag supports dynamic setting, i.e., no index is set (i.e., the indexing function is not in effect)
The registered User table User _ info main fields are as follows:
User_id,app_type,area_code,tag,create_time,update_time。
s2: deploying more than two push computing modules;
s3: configuring a broadcast message of a designated broadcast group, and automatically generating a corresponding broadcast message ID;
the designated broadcast group at least includes three categories: a full member broadcast, a regional broadcast, and a designated tag broadcast. Of course, the extension of the broadcast group can also be realized by the extension of the registered user table.
Specifically, when a manager configures a broadcast message of a designated broadcast group in a background interface, the manager clicks and stores the broadcast message, and then automatically generates a corresponding broadcast message ID, and calls a background broadcast push API interface, which is sent to the message broadcast task splitting module.
S4: after receiving the broadcast task, the broadcast task splitting module firstly judges whether the total number of target users corresponding to the appointed broadcast group exceeds a preset cardinal number according to the registered user table; the cardinality can be a certain percentage of the total number of users of the registered user table, and the percentage value range can be 60-100%; the number can also be directly the number, such as above 600w, or even the calculation result of the preset calculation formula.
If the total number of the target users does not exceed the preset base number, adopting a single-node broadcast push logic to execute, namely the existing broadcast push logic; namely, executing S5;
if the total number of the target users exceeds the preset cardinal number, performing broadcast push by adopting a multi-node distributed broadcast push logic, namely performing S6;
s5: querying a user ID list (according to a specified broadcast group and a registered user list) corresponding to the target user set by a background, and generating message details with corresponding quantity; uploading the message details to a redis cache server or a database; and the background carries out broadcast push according to whether the client corresponding to the user ID list is online. The flow ends.
S6: and averagely distributing the target users to all the push calculation modules to perform the processing of push data.
S7: each push calculation module acquires a user ID list (a list formed by user IDs of all users distributed to the push calculation module) corresponding to a user set distributed to the push calculation module;
s8: each push computing module sends the broadcast message ID and the recorded data of the push computing module ID (such as the broadcast message ID _ push computing module ID) to a redis cache server or a database;
s9: each pushing calculation module sends a broadcast notification to the message pushing module;
s10: and the pushing module acquires a corresponding user ID list from the corresponding pushing calculation module according to the pushing calculation module ID in the recorded data stored by the redis cache server or the database, and then performs broadcast pushing of the corresponding broadcast message ID.
That is to say, the broadcast task splitting module splits a target user and then communicates the broadcast information ID to the push calculation module, the push calculation module calculates result information to be pushed and sends the result information to the message push module, and finally the message push module completes specific message push work.
Assuming that 10 push computing modules are provided, the business logic executed by each push computing module is the same; meanwhile, there is a registered user table, the number of which is 1000W, which is 300W for the area of Fujian province and 100W for the area of Zhejiang province (there is an area field in the table), and in addition, there is a label field in the table, and the label can be set dynamically. This assumes that there are 3 broadcast pushes: broadcast push by all people, broadcast push by region, and broadcast push by tag.
Example two
This embodiment provides a specific application scenario corresponding to the first embodiment:
assuming that 100W is a preset base number, namely, when the number of the base number exceeds the number of the base number, the broadcast push logic calculated by multiple nodes is used, and when the number of the base number does not reach the number of the base number, the broadcast push logic of a single node is adopted. (the order of magnitude of the setting needs to be based on the specific service and system capacity-of course the order of magnitude can also be set automatically, according to some fixed policy, such as some proportion of the number of registered users, etc. and dynamically changed).
Splitting strategy: aiming at the broadcast push of all the first personnel, when a program receives the broadcast message, the number of registered user tables is inquired in advance, and if the number of registered users reaches a preset base number at the moment, the broadcast task splitting module splits the tasks according to the number of the push calculation modules, namely the total number/the push calculation modules, so that the task quantity required to be processed by each push calculation module can be known. For example, the total number of registered users of 1000W is 10 push calculation modules, the splitting module will split into 10 messages and send the messages to each push calculation module, the processing tasks of 0-100W will be processed by the first push calculation module, the processing tasks of 100-200W will be processed by the second push calculation module, and so on.
And a message calculation process: and after the push calculation module receives the message of the splitting module, calculating the specific message detail. The received notification message content needing to be calculated comprises the following contents: the ID of the broadcast message, the range to be processed by the task and the query condition information are 3 fields. For example, if the content is full broadcast push, the first push calculation module will receive the message content as: and (4) carrying out inquiry on the number of the registered users by using the broadcast message ID and the processing range of 0-100W. The second and so on. If the region broadcast push is performed, the content of the message received by the first push computing module is as follows: broadcast message ID, 0-total number to be pushed/number of push calculation modules, and query condition information of a certain area.
And (3) pushing: after each push computing module finishes processing data, a user ID list corresponding to the push computing module is inquired; then, recording the calculated related result data pushed by the current station in a redis cache cluster, specifically recording the related result data in a SET data structure, wherein the key calculation mode is as follows: broadcast message id _ push calculation module id; and finally, sending the notification message to a pushing module, wherein the pushing module directly obtains the previous result data from the redis cache cluster and pushes the result data directly according to the result data. Of course, if the number of registered users does not reach the preset base number, only a message is pushed to one pushing calculation module, and others are similar.
The second broadcast push according to the area is similar to the foregoing broadcast push, namely, whether the total number of people in the area reaches a preset base number is identified in advance, if the total number reaches the preset base number, the broadcast push is calculated and pushed through multiple nodes, and if the total number does not reach the preset base number, the broadcast push is calculated and pushed through a single node.
In the third broadcast push according to the label, because the label is dynamically set and no index field exists, the total number of push cannot be known, so that the broadcast message of the type can be calculated and pushed only through multiple nodes. When the label is pushed, because the user who meets the label is uncertain, the calculation and the pushing are carried out by the multi-node by default. For example, 10 nodes, for a total of 1000W registered users, the first node queries 0-100W of data satisfying the label, the second node queries 100W-200W of label data, and so on.
By the method, when the number of broadcasts is small, the broadcast push function can be quickly and efficiently executed by adopting the old single node; when the number of the broadcasts is large, multiple nodes are started to carry out distributed broadcast push, the efficiency of the broadcast push is improved, and the broadcast push can be efficiently completed.
The broadcast push in the present invention is two concepts with the multimedia broadcast sharing in the prior art. The broadcast message pushing in this document refers to a broadcast pushing function implemented by long TCP links, which is a function of pushing a message to all or a part of users meeting a condition in a message pushing scenario. The multimedia broadcast sharing in the prior art refers to partial sharing performed through a specific way for the whole multimedia resource, wherein a client transmits a part of interested characteristics to a server, and the server returns the part of data stream to the client. And the function of acquiring data is directly realized through an http request. Accordingly, there are essential differences from the present invention, whether it be in concept, overall, and implementation.
EXAMPLE III
This embodiment corresponds to the first embodiment or the second embodiment, and provides a computer-readable storage medium, on which a computer program is stored, where the computer program is capable of implementing the steps included in the method for optimizing broadcast push described in the first embodiment or the second embodiment when the computer program is executed by a processor. The details of the steps are not repeated here, and please refer to the description of the first embodiment or the second embodiment for details.
In summary, the method and the storage medium for optimizing broadcast push provided by the invention improve the broadcast push efficiency; and a specific broadcasting group can be locked for broadcasting through dynamic configuration, so that the method has higher practicability; furthermore, the method is combined with the old broadcasting mode, reasonable resource distribution is realized, and the system performance is improved.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all equivalent changes made by using the contents of the present specification and the drawings, or applied directly or indirectly to the related technical fields, are included in the scope of the present invention.
Claims (5)
1. A method of optimizing broadcast push, comprising:
presetting a registered user table and more than two push calculation modules, wherein the registered user table records application categories and regional codes corresponding to user IDs;
after receiving the broadcast message of the designated broadcast group, judging whether the number of the target users reaches a preset base number according to the registered user table;
if yes, executing broadcast push by adopting a multi-node distributed broadcast push logic: distributing the target users to all the push calculation modules evenly to perform the processing of push data;
further comprising:
if the registered user table judges that the number of the target users does not reach the preset base number, adopting single-node broadcast push logic to execute: querying a user ID list corresponding to the target user set by a background, and generating message details with corresponding quantity;
uploading the message details to a redis cache server or a database;
and the background carries out broadcast push according to whether the client corresponding to the user ID list is online.
2. The method of claim 1, further comprising:
each push calculation module acquires a user ID list corresponding to a user set distributed to the push calculation module;
each push calculation module sends the broadcast message ID and the record data of the push calculation module ID to a redis cache server or a database;
each pushing calculation module sends a broadcast notification to the message pushing module;
and the message pushing module acquires a user ID list from a pushing calculation module corresponding to the ID of the pushing calculation module according to the recorded data stored in the redis cache server or the database to perform broadcast pushing of the corresponding broadcast message ID.
3. The method of claim 1, wherein the registered user table further records a label corresponding to each user ID;
the method further comprises the following steps:
when the designated broadcast group is the user of the designated label, counting the number of the users of the designated label in the registered user table;
and distributing the target users to each push calculation module according to the statistical result to perform the processing of the push data.
4. A method of optimizing broadcast push as claimed in claim 3, wherein said tags include gender, age and occupation.
5. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, is adapted to carry out the steps of a method for optimizing broadcast push according to any of the preceding claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010074993.2A CN111327434B (en) | 2020-01-22 | 2020-01-22 | Method for optimizing broadcast push and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010074993.2A CN111327434B (en) | 2020-01-22 | 2020-01-22 | Method for optimizing broadcast push and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111327434A CN111327434A (en) | 2020-06-23 |
| CN111327434B true CN111327434B (en) | 2022-04-01 |
Family
ID=71168799
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010074993.2A Active CN111327434B (en) | 2020-01-22 | 2020-01-22 | Method for optimizing broadcast push and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111327434B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106911486A (en) * | 2017-04-27 | 2017-06-30 | 努比亚技术有限公司 | A kind of message push processing method, apparatus and system |
| CN107203894A (en) * | 2016-03-18 | 2017-09-26 | 百度在线网络技术（北京）有限公司 | Information-pushing method and device |
| CN109145280A (en) * | 2017-06-15 | 2019-01-04 | 北京京东尚科信息技术有限公司 | The method and apparatus of information push |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20150099236A (en) * | 2014-02-21 | 2015-08-31 | 삼성전자주식회사 | Apparatus and method for providing push service based on location |
-
2020
- 2020-01-22 CN CN202010074993.2A patent/CN111327434B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107203894A (en) * | 2016-03-18 | 2017-09-26 | 百度在线网络技术（北京）有限公司 | Information-pushing method and device |
| CN106911486A (en) * | 2017-04-27 | 2017-06-30 | 努比亚技术有限公司 | A kind of message push processing method, apparatus and system |
| CN109145280A (en) * | 2017-06-15 | 2019-01-04 | 北京京东尚科信息技术有限公司 | The method and apparatus of information push |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111327434A (en) | 2020-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200057672A1 (en) | Dynamic tree determination for data processing | |
| CN108874558B (en) | Message subscription method of distributed transaction, electronic device and readable storage medium | |
| US8150889B1 (en) | Parallel processing framework | |
| EP3296870A1 (en) | Cdn-based content management system | |
| WO2019056640A1 (en) | Order processing method and device | |
| US8447757B1 (en) | Latency reduction techniques for partitioned processing | |
| US10133797B1 (en) | Distributed heterogeneous system for data warehouse management | |
| WO2020140614A1 (en) | Offline message distribution method, server and storage medium | |
| CN106059825A (en) | Distributed system and configuration method | |
| CN102859961B (en) | There is the distributed video transcoding system of adaptive file process | |
| CN111309550A (en) | Data acquisition method, system, equipment and storage medium of application program | |
| US10505863B1 (en) | Multi-framework distributed computation | |
| CN110071965B (en) | Data center management system based on cloud platform | |
| CN105677536A (en) | Implementing method for task messages and task system for implementing task messages | |
| WO2023159879A1 (en) | Message processing method and system, storage medium, and electronic device | |
| CN107342929B (en) | Method, device and system for sending new message notification | |
| CN104506893A (en) | Information updating method, cloud server and CRM (customer relation management) server | |
| CN111193789A (en) | Subscription information pushing method and device, computer equipment and readable storage medium | |
| CN113177179B (en) | Data request connection management method, device, equipment and storage medium | |
| US20170139808A1 (en) | Method and dispatcher node for server processing management | |
| CN111327434B (en) | Method for optimizing broadcast push and storage medium | |
| CN114443940A (en) | Message subscription method, device and equipment | |
| CN107045452B (en) | Virtual machine scheduling method and device | |
| CN110750362A (en) | Method and apparatus for analyzing biological information, and storage medium | |
| CN111010453A (en) | Service request processing method, system, electronic device and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |