Message processing method and apparatus, electronic device, storage medium, and program product
US-2024388548-A1 · Nov 21, 2024 · US
US9608943B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9608943-B2 |
| Application number | US-201414192771-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 27, 2014 |
| Priority date | Feb 27, 2014 |
| Publication date | Mar 28, 2017 |
| Grant date | Mar 28, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Example methods, apparatuses, and/or articles of manufacture are disclosed that may be implemented, in whole or in part, using one or more computing devices to implement a queuing system with an adjustable scalability/reliability level.
Opening claim text (preview).
What is claimed is: 1. A method comprising: determining whether to replicate signal packets across a total number of database instances based, at least in part, on a message threshold size; and adjusting in real-time a scalability/reliability level of a queuing system based, at least in part, on the determination. 2. The method of claim 1 , wherein the adjusting the scalability/reliability level of the queuing system comprising adjusting one or more settings associated with a reliable persistent queue (RPQ). 3. The method of claim 2 , further comprising adding or removing a database instance node to or from the queuing system, respectively, in real-time in response to the adjustments of the one or more settings. 4. The method of claim 1 , further comprising replicating one or more columns of a database instance of the total number of database instances separately across a plurality of devices. 5. The method of claim 1 , wherein the queuing system implements at-least-once semantics so that signal packets in the queuing system are consumed at least once before being deleted. 6. The method of claim 1 , wherein the queuing system implements starvation avoidance. 7. The method of claim 6 , further comprising comparing a time stamp of a low priority message with a time threshold, and responsive to determining that the time threshold has been exceeded, moving the low priority message to a high priority status. 8. The method of claim 7 , further comprising adjusting the time threshold responsive to the adjustments of the one or more settings. 9. The method of claim 1 further comprising replicating one or more signal packets on less than the total number of database instances based, at least in part, on the message threshold size. 10. The method of claim 9 , wherein one or more remaining database instances receives a pointer, handle, or link to a stored version of the one or more signal packets. 11. An apparatus comprising: at least one computing device to: determine whether to replicate signal packets across a total number of database instances to be based, at least in part, on a message threshold size; and implement a queuing system having a capability to adjust in real-time a scalability/reliability level of the queuing system to be based, at least in part, on the determination. 12. The apparatus of claim 11 , wherein the at least one computing device comprises a reliable persistent queue (RPQ). 13. The apparatus of claim 12 , wherein the RPQ comprises a web server, a messaging component, a distributed system coordination component, and multiple database instances. 14. The apparatus of claim 12 , wherein the multiple database instances comprise column-oriented databases. 15. An article comprising: a non-transitory storage medium having stored thereon instructions executable by a computing device to: determine whether to replicate signal packets across a total number of database instances to be based, at least in part, on a message threshold size; and adjust in real-time a scalability/reliability level of a queuing system to be based, at least in part, on the determination. 16. The article of claim 15 , wherein the instructions are further executable to adjust one or more settings associated with a reliable persistent queue (RPQ). 17. The article of claim 15 , wherein the instructions are further executable to replicate one or more columns of a database instance of the total number of database instances separately across at least a second computing device. 18. The article of claim 15 , wherein the instructions are further executable to add or remove a database instance node to or from the queuing system, respectively, in real-time in response to the adjustments of the one or more settings. 19. The article of claim 15 , wherein the instructions are further executable to implement at-least-once semantics for the queuing system so that signal packets in the queuing system are consumed at least once before being deleted. 20. The article of claim 15 , wherein the instructions are further executable to implement starvation avoidance for the queuing system.
Real-time or near real-time messaging, e.g. instant messaging [IM] · CPC title
Electricity · mapped topic
Electricity · mapped topic
for tracking messages · CPC title
for supporting social networking services · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.