Dynamic queue re-prioritization

A method, comprising:

• switching, by a system comprising at least one processor, from a first policy to a second policy with respect to a group of priority queues for messages, wherein respective existing messages in the respective priority queues are assigned to respective priority queues of the group of priority queues based on the first policy;
• based on switching to the second policy,
• assigning, by the system, respective new messages to the respective priority queues based on the second policy, and
• re-ordering, by the system, the respective existing messages of the respective priority queues from respective rears of the respective priority queues to respective fronts of the respective priority queues;
• and
• delivering, by the system, at least some of the respective existing messages and at least some of the respective new messages from the respective priority queues.

A non-transitory computer-readable medium comprising instructions that, in response to execution, cause a system comprising at least one processor to perform operations, comprising:

• based on switching from a first policy to a second policy with respect to a group of priority queues for messages, wherein respective existing messages in the respective priority queues are assigned to respective priority queues of the group of priority queues based on a first policy,
• assigning respective new messages to the respective priority queues based on the second policy, and
• re-ordering the respective existing messages of the respective priority queues from respective tails of the respective priority queues to respective heads of the respective priority queues;
• and
• delivering at least some of the respective existing messages and at least some of the respective new messages from the respective priority queues.