Dynamic priority-based scheduling in a message queuing system
First Claim
1. In a computing environment connected to a network, computer readable code readable by a computer system in said environment, for implementing a scheduling system that allows a sender and a receiver to change priorities of queued messages, comprising:
- a subprocess operating at said sender for creating a plurality of data objects by a sending application for sending to a receiving application operating at said receiver, wherein each of said data objects comprises one or more messages;
a subprocess for queuing said messages created by said sending application in a first persistent message store at said sender, prior to sending said messages to said receiver over said network;
a subprocess for receiving said sent messages and queuing said received messages in a second persistent message store at said receiver, prior to delivering said queued messages to said receiving application;
a subprocess for requesting a change from an existing priority of a specified data object to a new priority, wherein said specified data object may be represented by one or more of said queued messages in said first message store or in said second message store or in both of said message stores;
a subprocess for locating any of said queued messages representing said specified data object;
a subprocess for determining if said existing priority of said data object will be changed to said new priority; and
a subprocess for modifying an order of delivery of said located messages when said subprocess for determining has a positive response.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, system, and computer-readable code with which a scheduling system can be implemented that allows a sender and a receiver to change priorities of queued messages. A technique is also defined for providing a receiver with an advance notice of intended message priority, enabling the receiver to request a priority change before transmission begins. These techniques provide the flexibility to respond to changes in dynamic, volatile network environments, as well as changes in user'"'"'s wishes or requirements. A ranking technique is defined, whereby requests to change priority may be accepted or denied through a ranking algorithm that resolves potential conflicts in desired transmission priority using proposals exchanged by the parties (e.g. during connection establishment).
-
Citations
22 Claims
-
1. In a computing environment connected to a network, computer readable code readable by a computer system in said environment, for implementing a scheduling system that allows a sender and a receiver to change priorities of queued messages, comprising:
-
a subprocess operating at said sender for creating a plurality of data objects by a sending application for sending to a receiving application operating at said receiver, wherein each of said data objects comprises one or more messages;
a subprocess for queuing said messages created by said sending application in a first persistent message store at said sender, prior to sending said messages to said receiver over said network;
a subprocess for receiving said sent messages and queuing said received messages in a second persistent message store at said receiver, prior to delivering said queued messages to said receiving application;
a subprocess for requesting a change from an existing priority of a specified data object to a new priority, wherein said specified data object may be represented by one or more of said queued messages in said first message store or in said second message store or in both of said message stores;
a subprocess for locating any of said queued messages representing said specified data object;
a subprocess for determining if said existing priority of said data object will be changed to said new priority; and
a subprocess for modifying an order of delivery of said located messages when said subprocess for determining has a positive response. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system for implementing a scheduling system that allows a sender and a receiver to change priorities of queued messages using dynamic environmental factors in a computing environment connected to a network, comprising:
-
a sending application operating at said sender;
a receiving application operating at said receiver;
means for creating a plurality of data objects by said sending application for sending to said receiving application, wherein each of said data objects comprises one or more messages;
means for queuing said messages created by said sending application in a first persistent message store at said sender, prior to sending said messages to said receiver over said network;
means for receiving said sent messages and queuing said received messages in a second message store at said receiver, prior to delivering said queued messages to said receiving application;
means for requesting a change from an existing priority of a specified data object to a new priority, wherein said specified data object may be represented by one or more of said queued messages in said first message store or in said second message store or in both of said message stores;
means for locating any of said queued messages representing said specified data object;
means for determining if said existing priority of said data object will be changed to said new priority; and
means for modifying an order of delivery of said located messages when said means for determining has a positive response. - View Dependent Claims (9, 10, 11, 12, 13, 14)
-
-
15. A method for implementing a scheduling system that allows a sender and a receiver to change priorities of queued messages in a computing environment connected to a network, comprising the steps of:
-
operating a sending application at said sender;
operating a receiving application at said receiver;
creating a plurality of data objects by said sending application for sending to said receiving application, wherein each of said data objects comprises one or more messages;
queuing said messages created by said sending application in a first persistent message store at said sender, prior to sending said messages to said receiver over said network;
receiving said sent messages and queuing said received messages in a second persistent message store at said receiver, prior to delivering said queued messages to said receiving application;
requesting a change from an existing priority of a specified data object to a new priority, wherein said specified data object may be represented by one or more of said queued messages in said first message store or in said second message store or in both of said message stores;
locating any of said queued messages representing said specified data object;
determining if said existing priority of said data object will be changed to said new priority; and
modifying an order of delivery of said located messages when said determining step has a positive response. - View Dependent Claims (16, 17, 18, 19, 20, 21)
-
-
22. A method of dynamically changing priority of in-transit messages communicated over a network from a sender to a receiver in a computing environment, comprising the steps of:
-
queuing messages for sending from the sender to the receiver over the network, and queuing the messages upon receiving them over the network at the receiver, wherein each of the queued messages has an associated priority;
selecting to modify the priority associated with a particular message, whether one or more segments of the particular message are queued in a first message store used for queuing messages at the sender, a second message store used for queuing messages at the receiver, or both the first and the second message stores; and
delivering the segments of the particular message to the receiver using the modified priority.
-
Specification