Dynamic message retrieval by subdividing a message queue into sub-queues

• US 9,065,778 B2
• Filed: 03/20/2012
• Issued: 06/23/2015
• Est. Priority Date: 03/20/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Colar, Gerald D., Diggs, Melanie R., White, Terrence E., Young, Charles K.
• Primary Examiner(s): Barry, Lance L
• Application Number:
  US13/425,279
• Publication Number:
  US 20130254275A1
• Time in Patent Office: 1,190 Days
• Field of Search: 709213-215, 710 52- 57
• US Class Current: 1/1
• CPC Class Codes: H04L 47/622 Queue service order
• CPC Class Codes: H04L 47/6235 Variable service order
• CPC Class Codes: H04L 51/42 Mailbox-related aspects, e.g. synchronisation of mailboxes

Abstract

Exemplary embodiments provide methods and systems for dynamically changing a message retrieval scheme during runtime in a client/server electronic messaging system in which the server executes a message retrieval component and incoming messages received from the client is stored in a message queue. Aspects of the exemplary embodiment include accessing messaging business rules from a memory by a message retrieval component at runtime, wherein the messaging business rules define a primary retrieval scheme and a secondary retrieval scheme, and wherein a value provided for each of the primary retrieval scheme and the secondary retrieval scheme are selected from a combination of different message retrieval types including: First In First Out (FIFO), Last In First Out (LIFO), and random. The message retrieval component subdivides the message queue into sub-queues based on at least one of a message quantity limit and a message received time limit specified in the business rules. Each of the sub-queues is then accessed using the value of the secondary retrieval scheme; and messages from each of the sub-queues are retrieved using the value of the primary retrieval scheme.

Claims

1. A system, comprising:

a memory that stores a message queue and business rules, wherein the messaging business rules define a primary retrieval scheme and a secondary retrieval scheme, and wherein a value set for each of the primary retrieval scheme and the secondary retrieval scheme are selected from a combination of different message retrieval types including;

First In First Out (FIFO) message retrieval, Last In First Out (LIFO) message retrieval, and random message retrieval,

a processor coupled to the memory; and

a software component executed by the processor that is configured to;

subdivide the message queue into sub-queues based on at least one of a message quantity limit and a message received time limit specified in the messaging business rules;

access each of the sub-queues using the value of the secondary retrieval scheme; and

retrieve messages from each of the sub-queues using the value of the primary retrieval scheme.

2. The system of claim 1 wherein the software component is further configured to access from the messaging business rules a calendar entry value and at least one of a quantity limit value and a time limit value.

3. The system of claim 2 wherein the software component is further configured to use the calendar entry value to set different retrieval schemes based on calendar dates for multiple time periods.

4. The system of claim 2 wherein the software component is further configured to use the primary and secondary retrieval schemes to set different retrieval schemes based a number of messages received.

5. The system of claim 2 wherein the software component is further configured to use the time limit along with the primary and secondary retrieval schemes to set different retrieval schemes based a number of messages received in a given amount of time.

6. The system of claim 1 wherein possible values for the secondary retrieval scheme include the FIFO, the LIFO, the random message retrieval types, and NONE.

7. The system of claim 1 wherein the software component is further configured to access a current date timestamp of a server upon startup.

8. The system of claim 7 wherein the software component is further configured to retrieve a calendar entry from the messaging business rules that is valid for the current date timestamp.

9. The system of claim 7 wherein the software component is responsive to a determination that a value for the secondary retrieval scheme is not available, to instruct the messaging system to retrieve messages from the message queue according to the value set for the primary retrieval scheme.

10. The system of claim 1 wherein the software component is further configured to periodically access the messaging business rules to check for updated values.

11. An executable software product stored on a non-transitory computer-readable medium containing program instructions for dynamically changing a message retrieval scheme during runtime in a client/server electronic messaging system in which the server executes a message retrieval component and incoming messages received from the client is stored in a message queue, the program instructions for:

accessing messaging business rules from a memory by the message retrieval component at runtime, wherein the messaging business rules define a primary retrieval scheme and a secondary retrieval scheme, and wherein a value provided for each of the primary retrieval scheme and the secondary retrieval scheme are selected from a combination of different message retrieval types including;

First In First Out (FIFO), Last In First Out (LIFO), and random;

subdividing the message queue into sub-queues based on at least one of a message quantity limit and a message received time limit specified in the messaging business rules;

accessing each of the sub-queues using the value of the secondary retrieval scheme; and

retrieving messages from each of the sub-queues using the value of the primary retrieval scheme.