Message Processing Using Dynamic Load Balancing Queues in a Messaging System

• US 20150271256A1
• Filed: 03/19/2014
• Published: 09/24/2015
• Est. Priority Date: 03/19/2014
• Status: Active Grant

• Current Assignee: Dell Products LP (Dell Technologies Inc.)
• Original Assignee: Dell Products LP (Dell Technologies Inc.)
• Inventors: Pathak, Anshuman, Srinivasan, Balasubramanian, Nagabushana, Gautham Devanga
• Granted Patent: US 9,807,015 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering
• CPC Class Codes: H04L 47/30 in combination with information about buffer occupancy at either end or at transit nodes
• CPC Class Codes: H04L 47/6225 Fixed service order, e.g. Round Robin

Abstract

A system, method, and computer-readable medium are disclosed for dynamically managing message queues to balance processing loads in a message-oriented middleware environment. A first source message associated with a first target is received, followed by generating a first dynamic load balancing message queue when a first message queue associated with the first target is determined to not be optimal. The first dynamic load balancing message queue is then associated with the first target, followed by enqueueing the first source message to the first dynamic load balancing message queue for processing by the first target.

Claims

1. A computer-implementable method for dynamically managing message queues in a message-oriented middleware environment, comprising:

receiving a first source message associated with a first target;

generating a first dynamic load balancing message queue when a first message queue is determined not to be optimal, the first message queue associated with the first target;

associating the first dynamic load balancing message queue with the first target; and

enqueueing the first source message to the first dynamic load balancing message queue for processing by the first target.

2. The method of claim 1, further comprising:

receiving a second source message associated with a second target;

generating a second dynamic load balancing message queue when a second message queue is determined not to be optimal, the second message queue associated with the second target;

associating the second dynamic load balancing message queue with the second target; and

enqueueing the second source message to the second dynamic load balancing message queue for processing by the second target.

3. The method of claim 2, further comprising:

receiving a third source message associated with the first target;

generating a third dynamic load balancing message queue when the first message queue and the first dynamic load balancing message queue are determined to not be optimal;

associating the third dynamic load balancing message queue with the first target; and

enqueueing the third source message to the third dynamic load balancing message queue for processing by the first target.

4. The method of claim 3, further comprising:

receiving a fourth source message associated with the second target;

generating a fourth dynamic load balancing message queue when the second message queue and the second dynamic load balancing message queue are determined to not be optimal;

associating the fourth dynamic load balancing message queue with the second target; and

enqueueing the fourth source message to the fourth dynamic load balancing message queue for processing by the second target.

5. The method of claim 4;

further comprising;

associating the third dynamic load balancing message queue with the second target when the third dynamic load balancing message queue is determined to be more optimal than the second message queue, the second dynamic load balancing message queue, and the fourth dynamic load balancing message queue; and

enqueueing the fourth source message to the third dynamic load balancing message queue for processing by the second target.

6. The method of claim 5, further comprising:

associating the fourth dynamic load balancing message queue with the first target when the fourth dynamic load balancing message queue is determined to be more optimal than the first message queue, the first dynamic load balancing message queue, and the third dynamic load balancing message queue; and

enqueueing the third source message to the fourth dynamic load balancing message queue for processing by the first target.

7. A system comprising:

a processor;

a data bus coupled to the processor; and

a non-transitory, computer-readable storage medium embodying computer program code, the non-transitory, computer-readable storage medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations for dynamically managing message queues in a message-oriented middleware environment and comprising instructions executable by the processor and configured for;

receiving a first source message associated with a first target;

generating a first dynamic load balancing message queue when a first message queue is determined not to be optimal, the first message queue associated with the first target;

associating the first dynamic load balancing message queue with the first target; and

enqueueing the first source message to the first dynamic load balancing message queue for processing by the first target.

8. The system of claim 7, further comprising:

receiving a second source message associated with a second target;

generating a second dynamic load balancing message queue when a second message queue is determined not to be optimal, the second message queue associated with the second target;

associating the second dynamic load balancing message queue with the second target; and

enqueueing the second source message to the second dynamic load balancing message queue for processing by the second target.

9. The system of claim 8, further comprising:

receiving a third source message associated with the first target;

generating a third dynamic load balancing message queue when the first message queue and the first dynamic load balancing message queue are determined to not be optimal;

associating the third dynamic load balancing message queue with the first target; and

enqueueing the third source message to the third dynamic load balancing message queue for processing by the first target.

10. The system of claim 9, further comprising:

receiving a fourth source message associated with the second target;

generating a fourth dynamic load balancing message queue when the second message queue and the second dynamic load balancing message queue are determined to not be optimal;

associating the fourth dynamic load balancing message queue with the second target; and

enqueueing the fourth source message to the fourth dynamic load balancing message queue for processing by the second target.

11. The system of claim 10, further comprising:

associating the third dynamic load balancing message queue with the second target when the third dynamic load balancing message queue is determined to be more optimal than the second message queue, the second dynamic load balancing message queue, and the fourth dynamic load balancing message queue; and

enqueueing the fourth source message to the third dynamic load balancing message queue for processing by the second target.

12. The system of claim 11, further comprising:

associating the fourth dynamic load balancing message queue with the first target when the fourth dynamic load balancing message queue is determined to be more optimal than the first message queue, the first dynamic load balancing message queue, and the third dynamic load balancing message queue; and

enqueueing the third source message to the fourth dynamic load balancing message queue for processing by the first target.

13. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:

receiving a first source message associated with a first target;

generating a first dynamic load balancing message queue when a first message queue is determined not to be optimal, the first message queue associated with the first target;

associating the first dynamic load balancing message queue with the first target; and

enqueueing the first source message to the first dynamic load balancing message queue for processing by the first target.

14. The non-transitory, computer-readable storage medium of claim 13, further comprising:

receiving a second source message associated with a second target;

generating a second dynamic load balancing message queue when a second message queue is determined not to be optimal, the second message queue associated with the second target;

associating the second dynamic load balancing message queue with the second target; and

enqueueing the second source message to the second dynamic load balancing message queue for processing by the second target.

15. The non-transitory, computer-readable storage medium of claim 14, further comprising:

receiving a third source message associated with the first target;

generating a third dynamic load balancing message queue when the first message queue and the first dynamic load balancing message queue are determined to not be optimal;

associating the third dynamic load balancing message queue with the first target; and

enqueueing the third source message to the third dynamic load balancing message queue for processing by the first target.

16. The non-transitory, computer-readable storage medium of claim 15, further comprising:

receiving a fourth source message associated with the second target;

generating a fourth dynamic load balancing message queue when the second message queue and the second dynamic load balancing message queue are determined to not be optimal;

associating the fourth dynamic load balancing message queue with the second target; and

enqueueing the fourth source message to the fourth dynamic load balancing message queue for processing by the second target.

17. The non-transitory, computer-readable storage medium of claim 16, further comprising:

associating the third dynamic load balancing message queue with the second target when the third dynamic load balancing message queue is determined to be more optimal than the second message queue, the second dynamic load balancing message queue, and the fourth dynamic load balancing message queue; and

enqueueing the fourth source message to the third dynamic load balancing message queue for processing by the second target.

18. The non-transitory, computer-readable storage medium of claim 17, further comprising:

associating the fourth dynamic load balancing message queue with the first target when the fourth dynamic load balancing message queue is determined to be more optimal than the first message queue, the first dynamic load balancing message queue, and the third dynamic load balancing message queue; and

enqueueing the third source message to the fourth dynamic load balancing message queue for processing by the first target.