Handling unavailable destinations in a messaging network

Patent metadata

Field	Value
Publication number	US-9407583-B2
Application number	US-201313839371-A
Country	US
Kind code	B2
Filing date	Mar 15, 2013
Priority date	Mar 15, 2013
Publication date	Aug 2, 2016
Grant date	Aug 2, 2016

Abstract

The subject matter of this specification can be implemented in, among other things, a method that includes establishing first federation links between a message broker system and neighbors of the message broker system. The method further includes distributing information describing the first federation links to other message broker systems. The method further includes receiving information describing second federation links between each of the other message broker systems and neighbors of each of the other message broker system. The method further includes identifying shortest paths between the message broker system and each of the other message broker systems. The method further includes receiving a request to send a message from a source message broker system to a destination message broker system. The method further includes determining that none of the shortest paths to the destination message broker system are available and, in response, taking corrective action.

First claim

What is claimed is:

1. A method comprising:
identifying, by a processor of a message broker system among multiple message broker systems in a message bus, shortest paths through the message bus between the message broker system and others of the message broker systems in view of first federation links between the message broker system and ones of the other of the message broker systems that neighbor the message broker system and in view of second federation links between each of the others of the message broker systems and ones of the message broker systems that neighbor each of the others of the message broker systems;
receiving, at the message broker system, a request to send a message from a source message broker system among the message broker systems through the message bus to a destination message broker system among the message broker systems;
determining, by the processor of the message broker system, that none of the shortest paths to the destination message broker system are available; and
initiating, by the processor of the message broker system, corrective action in view of determining that none of the shortest paths to the destination message broker system are available.

2. The method of claim 1 , wherein initiating the corrective action comprises:
queuing the message at the message broker system in response to determining that none of the shortest paths to the destination message broker system are available;
determining that one of the shortest paths to the destination message broker system has become available; and
delivering the queued message to the destination message broker system in response to determining that the one of the shortest paths to the destination message broker system has become available.

3. The method of claim 2 , wherein initiating the corrective action comprises determining that the one of the shortest paths to the destination message broker system is scheduled to be available, and wherein queuing the message is further in response to determining that the one of the shortest paths to the destination message broker system is scheduled to be available.

4. The method of claim 2 , wherein queuing the message comprises queuing the message for a predetermined amount of time.

5. The method of claim 1 , wherein initiating the corrective action comprises:
identifying a next message broker system that is available along one of the shortest paths to the destination message broker system; and
delivering the message to the next message broker system in response to identifying the next message broker system.

6. The method of claim 5 , wherein initiating the corrective action comprises determining that the one of the shortest paths to the destination message broker system is scheduled to be available, and wherein identifying the next message broker system is in response to determining that the one of the shortest paths to the destination message broker system is scheduled to be available.

7. A non-transitory computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to:
identify, by the processor of a message broker system among multiple message broker systems in a message bus, shortest paths through the message bus between the message broker system and others of the message broker systems in view of first federation links between the message broker system and ones of the others of the message broker systems that neighbor the message broker system and in view of second federation links between each of the others of the message broker systems and ones of the message broker systems that neighbor each of the others of the message broker systems;
receive, at the message broker system, a request to send a message from a source message broker system among the message broker systems through the message bus to a destination message broker system among the message broker systems;
determine, by the processor of the message broker system, that none of the shortest paths to the destination message broker system are available; and
initiate, by the processor of the message broker system, corrective action in view of the determination that none of the shortest paths to the destination message broker system are available.

8. The computer-readable medium of claim 7 , wherein, to initiate the corrective action, the processor is further to:
queue the message at the message broker system in response to the determination that none of the shortest paths to the destination message broker system are available;
determine that one of the shortest paths to the destination message broker system has become available; and
deliver the queued message to the destination message broker system in response to the determination that the one of the shortest paths to the destination message broker system has become available.

9. The computer-readable medium of claim 8 , wherein, to initiate the corrective action, the processor is further to determine that the one of the shortest paths to the destination message broker system is scheduled to be available, and wherein the processor is to queue the message further in response to the determination that the one of the shortest paths to the destination message broker system is scheduled to be available.

10. The computer-readable medium of claim 8 , wherein, to queue the message, the processor is to queue the message for a predetermined amount of time.

11. The computer-readable medium of claim 7 , wherein, to initiate the corrective action, the processor is further to:
identify, at the message broker system, a next message broker system that is available along one of the shortest paths to the destination message broker system; and
deliver the message to the next message broker system in response to the identification of the next message broker system.

12. The computer-readable medium of claim 11 , wherein, to initiate the corrective action, the processor is further to determine that the one of the shortest paths to the destination message broker system is scheduled to be available, and wherein the processor is to identify the next message broker system in response to the determination that the one of the shortest paths to the destination message broker system is scheduled to be available.

13. A system comprising:
an interface, of a message broker system among multiple message broker systems in a message bus, to receive a request to send a message from a source message broker system among the message broker systems through the message bus to a destination message broker system among the message broker systems; and
a processor, of the message broker system, to identify shortest paths through the message bus between the message broker system and others of the message broker systems in view of first federation links between the message broker system and ones of the others of the message broker systems that neighbor the message broker system and in view of second federation links, between each of the others of the message broker systems and ones of the message broker systems that neighbor each of the others of the message broker systems, to determine that none of the shortest paths to the destination message broker system are available, and to initiate corrective action in view of the determination that none of the shortest paths to the destination message broker system are available.

14. The system of claim 13 , wherein, to initiate the corrective action, the processor is further to:
queue the message at the message broker system in response to the determination that none of the shortest paths to the destination message broker system are avail

Assignees

• Red Hat Inc

Inventors

• Ross Theodore Langston

Classifications

• H04L51/04 Primary

  Real-time or near real-time messaging, e.g. instant messaging [IM] · CPC title

• H04L45/12 Primary

  Shortest path evaluation · CPC title