Secure message delivery to a transient recipient in a routed network

• US 9,432,218 B2
• Filed: 07/28/2011
• Issued: 08/30/2016
• Est. Priority Date: 07/28/2011
• Status: Active Grant

• Current Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Original Assignee: Red Hat, Inc. (International Business Machines Corporation)
• Inventors: Ross, Theodore L.
• Primary Examiner(s): Katsikis, Kostas
• Application Number:
  US13/193,015
• Publication Number:
  US 20130031186A1
• Time in Patent Office: 1,860 Days
• Field of Search: 709/206, 709/230, 709/232
• US Class Current: 1/1
• CPC Class Codes: H04L 12/6418 Hybrid transport

Abstract

Systems and methods are provided that route messages for a message consumer to a predicted future connection point of the consumer to a messaging network, while the consumer is not connected to the messaging network. In various embodiments, the network predicts or projects the future connection point based on the consumer'"'"'s last connection, an itinerary or schedule for the consumer, the consumer'"'"'s past connection behavior, and/or connection patterns of the consumer and/or a group of message consumers that are similar to the consumer.

Claims

1. A method comprising:

receiving a message associated with a group comprising a plurality of message consumers, wherein the message identifies a message consumer among the plurality of message consumers in the group subscribed to a holding queue at a time in which the message consumer among the plurality of message consumers in the group is connected to a messaging network;

determining, by a processor, that the message consumer among the plurality of message consumers in the group is disconnected from the messaging network at a first time;

calculating, by the processor, a likely future point of connection to the messaging network at a second time for the message consumer among the plurality of message consumers in the group that is disconnected from the messaging network at the first time in view of a pattern of a plurality of points of connections of each of the plurality of message consumers associated with tracking information, wherein the second time occurs after the first time;

establishing, by the processor, the holding queue proximal to the likely future point of connection, wherein the message is placed on the holding queue; and

sending, by the processor, the message directly to the likely future point of connection before the message consumer reconnects to the messaging network at the second time.

2. The method of claim 1, wherein calculating the likely future point of connection comprises:

accessing an identity of a point of connection among the plurality of points of connections to which the message consumer was previously connected; and

setting the likely future point of connection to be the identity of the point of connection to which the message consumer was previously connected.

3. The method of claim 1, wherein calculating the likely future point of connection comprises:

accessing an itinerary of the message consumer;

accessing a current date;

determining a geographic location for the message consumer according to the itinerary and the current date;

determining an identity of a point of connection among the plurality of points of connections that is associated with the geographic location; and

setting the likely future point of connection to be the identity of the point of connection that is associated with the geographic location.

4. The method of claim 1 further comprising tracking data associated with each of the plurality of message consumers in the group, wherein the data comprise one of a date of point of connection to the messaging network, a time of the point of connection to the messaging network, a duration of the connection to the messaging network or a mechanism for connection to the messaging network.

5. The method of claim 1, wherein the pattern is a geographical location pattern.

6. The method of claim 1, wherein calculating the likely future point of connection comprises:

tracking the plurality of points of connection of each of the plurality of message consumers;

projecting a next connection point for a message consumer among the plurality of message consumers in view of the pattern of the plurality of points of connection;

determining an identity of a point of connection that is associated with the next connection point that is projected; and

setting the likely future point of connection to be the identity of the point of connection that is associated with the next connection point that is projected.

7. The method of claim 1, further comprising:

determining, by the processor, that the message consumer is currently connected to the messaging network; and

sending the message to a current connection point of the message consumer.

8. A system comprising:

a memory; and

a processor, operatively connected to the memory, to;

receive a message, associated with a group comprising a plurality of message consumers, wherein the message is to identify a message consumer among the plurality of message consumers in the group subscribed to a holding queue at a time in which the message consumer among the plurality of message consumers in the group is connected to a messaging network;

determine that the message consumer among the plurality of message consumers in the group is disconnected from the messaging network at a first time;

calculate a likely future point of connection to the messaging network at a second time for the message consumer among the plurality of message consumers in the group that is disconnected from the messaging network at the first time in view of a pattern of a plurality of points of connections of each of the plurality of message consumers associated with tracking information, wherein the second time occurs after the first time;

establish, by the processor, the holding queue proximal to the likely future point of connection, wherein the message is placed on the holding queue; and

send the message directly to the likely future point of connection before the message consumer reconnects to the messaging network at the second time.

9. The system of claim 8, wherein the processor is to:

track data associated with each of the plurality of message consumers in the group, wherein the data comprise one of a date of point of connection to the messaging network, a time of the point of connection to the messaging network, a duration of the connection to the messaging network or a mechanism for connection to the messaging network.

10. The system of claim 8, wherein to calculate the likely future point of connection, the processor is to:

access an identity of a point of connection among the plurality of points of connections to which the message consumer was previously connected; and

set the likely future point of connection to be the identity of the point of connection to which the message consumer was previously connected.

11. The system of claim 8, wherein to calculate the likely future point of connection, the processor is to:

access an itinerary of the message consumer;

access a current date;

determine a geographic location for the message consumer according to the itinerary and the current date;

determine an identity of a point of connection among the plurality of points of connections that is associated with the geographic location; and

set the likely future point of connection to be the identity of the point of connection that is associated with the geographic location.

12. The system of claim 8, where the processor is further to:

determine that the message consumer is currently connected to the messaging network; and

send the message to a current connection point of the message consumer.

13. The system of claim 8, wherein the pattern is a geographical location pattern.

14. The system of claim 8, wherein to calculate the likely future point of connection, the processor is to:

track the plurality of points of connection of each of the plurality of message consumers;

project a next connection point for a message consumer among the plurality of message consumers in view of the pattern of the plurality of points of connection;

determine an identity of a point of connection that is associated with the next connection point that is projected; and

set the likely future point of connection to be the identity of the point of connection that is associated with the next connection point that is projected.

15. A non-transitory computer-readable medium comprising instructions to cause a processor to:

receive a message associated with a group comprising a plurality of message consumers, wherein the message identifies a message consumer among the plurality of message consumers in the group subscribed to a holding queue at a time in which the message consumer among the plurality of message consumers in the group is connected to a messaging network;

determine, by the processor, that the message consumer among the plurality of message consumers in the group is disconnected from the messaging network at a first time;

calculate, by the processor, a likely future point of connection to the messaging network at a second time for the message consumer among the plurality of message consumers in the group that is disconnected from the messaging network at the first time in view of a pattern of a plurality of points of connections of each of the plurality of message consumers associated with tracking information, wherein the second time occurs after the first time;

establish, by the processor, the holding queue proximal to the likely future point of connection, wherein the message is placed on the holding queue; and

send, by the processor, the message directly to the likely future point of connection before the message consumer reconnects to the messaging network at the second time.

16. The non-transitory computer-readable medium of claim 15, wherein the pattern is a geographical location pattern.

17. The non-transitory computer-readable medium of claim 15, wherein the processor is to:

track data associated with each of the plurality of message consumers in the group, wherein the data comprise one of a date of point of connection to the messaging network, a time of the point of connection to the messaging network, a duration of the connection to the messaging network or a mechanism for connection to the messaging network.

18. The non-transitory computer-readable medium of claim 15, wherein to calculate the likely future point of connection, the processor is to:

access an identity of a point of connection among the plurality of points of connections to which the message consumer was previously connected; and

set the likely future point of connection to be the identity of the point of connection to which the message consumer was previously connected.

19. The non-transitory computer-readable medium of claim 15, wherein to calculate the likely future point of connection, the processor is to:

access an itinerary of the message consumer;

access a current date;

determine a geographic location for the message consumer according to the itinerary and the current date;

determine an identity of a point of connection among the plurality of points of connections that is associated with the geographic location; and

set the likely future point of connection to be the identity of the point of connection that is associated with the geographic location.

20. The non-transitory computer-readable medium of claim 15, wherein to calculate the likely future point of connection, the processor is to:

track the plurality of points of connection of each of the plurality of message consumers;

project a next connection point for a message consumer among the plurality of message consumers in view of the pattern of the plurality of points of connection;

determine an identity of a point of connection that is associated with the next connection point that is projected; and

set the likely future point of connection to be the identity of the point of connection that is associated with the next connection point that is projected.