# US 2013/0254318 A1 · Dynamic message retrieval

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0254318 A1
- Document ID: US20130254318A1
- Status: Published application
- Kind: A1
- Application number: 13/906,102
- Filed: 2013-05-30
- Published: 2013-09-26
- Earliest claimed: 2012-03-20
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Gerald D. Colar; Melanie R. Diggs; Terrence E. White; Charles K. Young
- Web page: https://patentgrep.com/patent/US20130254318A1

## CPC

- H04L 47/622: {Queue service order}
- H04L 47/6235: {Variable service order}
- H04L 51/42: Mailbox-related aspects, e.g. synchronisation of mailboxes
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Exemplary embodiments provide methods and systems for dynamically changing a message retrieval scheme during runtime. 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

### Claim 1

A method 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 method comprising:
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.

### Claim 2 (depends on 1)

The method of claim 1 wherein accessing messaging business rules further comprises accessing a calendar entry value and at least one of a quantity limit value and a time limit value.

### Claim 3 (depends on 2)

The method of claim 2 wherein the message retrieval component uses the calendar entry value to set different retrieval schemes based on calendar dates for multiple time periods.

### Claim 4 (depends on 2)

The method of claim 2 wherein the message retrieval component uses the quantity limit value along with the primary and secondary retrieval schemes to set different retrieval schemes based a number of messages received.

### Claim 5 (depends on 2)

The method of claim 2 wherein the message retrieval component uses 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.

### Claim 6 (depends on 1)

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

### Claim 7 (depends on 1)

The method of claim 1 further comprising: accessing by the message retrieval component, a current date timestamp of the server upon startup.

### Claim 8 (depends on 7)

The method of claim 7 further comprising: retrieving by the message retrieval component, a calendar entry from the messaging business rules that is valid for the current date timestamp.

### Claim 9 (depends on 7)

The method of claim 7 further comprising: in response to determining that a value for the secondary retrieval scheme is not available, instructing the messaging system to retrieve messages from the message queue according to the value set for the primary retrieval scheme.

### Claim 10 (depends on 1)

The method of claim 1 further comprising: periodically accessing the messaging business rules to check for updated values.
