Patent Application
20140289740
This Application is a counterpart of and claims the benefit of priority to United Kingdom Patent Office Application Serial No. GB 1305110.7, filed on Mar. 20, 2013, the contents of which are hereby incorporated by reference.
1. Field
This invention relates to the field of publish/subscribe messaging. In particular, the invention relates to durable subscriptions in publish/subscribe messaging.
2. Description of the Related Art
In a messaging system that uses publish and subscribe, it is well established that subscribers can make durable or non-durable subscriptions. A non-durable subscription is one that is active only while the subscribing application is connected to the publish/subscribe engine. However, a durable subscription persists even if the subscribing application disconnects from the publish/subscribe engine for a time.
Publish/subscribe implementations that offer durable subscriptions are required to retain all the published messages that are destined for the durable subscription until the subscribing application re-connects. At that point the engine must supply to the re-connected application all the messages that were published to its durable subscription while it was disconnected. In this way, an application is assured that it will never miss a message, although it may receive some messages some time after they were originally published.
The main disadvantage of this arrangement is that it obliges the publish/subscribe engine to store a sequence of messages as they are published until the consuming application reconnects. If the application remains disconnected for a long time, or if the publication rate is extremely high, then the engine may find that it simply cannot store any more messages. At this point it has two options; it either discards messages or it notifies the publishing applications to stop sending messages. The former violates the assurance that clients will never lose a message and the latter penalises the publishing applications and other subscribers.
Therefore, there is a need in the art to address the aforementioned problems.
According to a first aspect of the present invention there is provided a method for durable subscriptions in publish/subscribe messaging, comprising: receiving a durable subscription for a subscribing application, wherein the durable subscription includes a parameter defining persistence for which the subscription is to be durable; detecting if the subscribing application is disconnected and, if disconnected, applying a filter to the messages to determine if a message meets a defined persistence requirement; and retaining only persistent messages for delivery once the subscribing application is reconnected.
The method may include: detecting that the subscribing application is reconnected; and delivering the retained persistent messages.
The parameter defining persistence may be in the form of a property attached to a message. The parameter defining persistence may provide a range of persistence values determining how the message is to be treated by a durable subscription.
In one embodiment, the parameter defining persistence may be a quality of service value. The defined persistence requirement may be one or more quality of service values.
According to a system for durable subscriptions in publish/subscribe messaging, comprising: a matching engine having a durable subscription component for receiving a durable subscription for a subscribing application, wherein the durable subscription includes a parameter defining persistence for which the subscription is to be durable; the durable subscription component including: a connection monitoring component for detecting if the subscribing application is disconnected; a persistence filter component for filtering subscription messages to determine if a message meets a defined persistence requirement; and a message store for retaining only persistent messages for delivery once the subscribing application is reconnected.
The connection monitoring component may include detecting that the subscribing application is reconnected; and the durable subscription component delivering the retained persistent messages when the subscribing application is reconnected.
The parameter defining persistence may be in the form of a property attached to a message. The parameter defining persistence may provide a range of persistence values determining how the message is to be treated by a durable subscription.
In one embodiment, the parameter defining persistence may be a quality of service value. The defined persistence requirement may be one or more quality of service values.
According to a third aspect of the present invention there is provided a computer program product for durable subscriptions in publish/subscribe messaging, the computer program product comprising: a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method according to the first aspect of the present invention.
According to a fourth aspect of the present invention there is provided a computer program stored on a computer readable medium and loadable into the internal memory of a digital computer, comprising software code portions, when said program is run on a computer, for performing the method of the first aspect of the present invention.
According to a fifth aspect of the present invention there is provided a method substantially as described with reference to the figures.
According to a sixth aspect of the present invention there is provided a system substantially as described with reference to the figures.
The described aspects of the invention provide the advantage of postponing the time when the publish/subscribe engine must choose between refusing publications and discarding messages.
The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings.
Preferred embodiments of the present invention will now be described, by way of example only, with reference to the following drawings in which:
It will be appreciated that for simplicity and clarity of illustration, elements shown in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numbers may be repeated among the figures to indicate corresponding or analogous features.
In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, and components have not been described in detail so as not to obscure the present invention.
A publish/subscribe method and system are described for managing a durable subscription and improving the quality of service. In the described method, a persistent (quality of service) parameter is defined for the durable subscription. Only persistent messages are retained while a subscriber with the durable subscription is disconnected and the persistent messages are delivered when the subscriber re-connects.
This is done by adding a filter to the particular case of a durable subscription, whose consuming application is not currently connected, the filter allows for any message that fails to meet the persistence requirement specified by the subscription will not be sent to that particular subscriber.
Messaging systems normally attach to each message a property that defines whether it is permissible to discard this message and the circumstances in which this might occur. In the simplest case, this property will be called something like “persistence” and each message will be either persistent or non-persistent. A persistent message must never be discarded. However, a non-persistent message might be discarded, for example, when one computer in a messaging system crashes.
Even for non-persistent messages, message loss should be uncommon Non-persistent messages can typically be delivered more quickly and are particularly suitable for messages that deliver frequent updates. Therefore, if one message is lost, it will quickly be superseded by a following message.
Another term often used for this characteristic of a message is “Quality of Service”, which usually has more than two possible states.
The presence of this type of characteristic means that the subscribe operation may be modified so that a durable subscription includes a parameter defining the persistence (or quality of service) for which the subscription is to be durable.
In the case of a simple model where messages are either persistent or non-persistent, the subscriber would have the following options:
retain no messages if the subscriber disconnects (this is a conventional non-durable subscription);
retain all messages while a subscriber is disconnected and deliver them when the subscriber re-connects (this is a conventional durable subscription);
retain only persistent messages while a subscriber is disconnected and deliver them when the subscriber re-connects;
in principle, there might be a fourth option to retain non-persistent messages and discard persistent but this is contrary to the intended behaviour of both persistent and non-persistent messages.
The third option above allows the subscriber finer grained control over which messages will be retained and which discarded.
This option provides two clear benefits:
Since only a subset of published messages are being retained, the publish/subscribe engine will take longer to reach the limit of its ability to store messages.
The subscribing application might genuinely not want to see the non-persistent messages. If the messages represent frequent updates to some value (for example, an exchange rate, or stock price), it may well be that the application only wants to know the most recent value. Excluding these messages from the durable set ensures that the application has fewer messages to process as part of reconnecting.
Any publish/subscribe engine will already implement an algorithm to efficiently decide which published messages must be copied to which subscribers. In the particular case of a durable subscription whose consuming application is not currently connected, an additional filter is added to the algorithm so that any message that fails to meet the persistence requirement specified by the subscription will not be sent to that particular subscriber.
Referring to
A publish/subscribe system 100 may have multiple publishing applications 111, 112, and 113 and multiple subscribing applications 121, 122, and 123 with a publish/subscribe broker 130 which controls the delivery of messages from publishing applications 111-113 to subscribing applications 121-123. A publishing application 111-113 may also be a subscribing application 121-123.
The publish/subscribe broker 130 may have an input component 131 for receiving published messages from publishing applications 111-113 and an output component 132 for sending messages to subscribing applications 121-123.
The publish/subscribe broker 130 may include a matching engine 140 for applying an algorithm to determine which published messages should be sent to which subscribing applications 121-123. The matching engine 140 may use subscriptions based on topics, content, specific publishing applications, etc.
The matching engine 140 may include a durable subscription component 141 which enables durable subscriptions. Durable subscriptions continue to exist when the subscribing application 121-123 is disconnected from the publish/subscribe broker 130.
The durable subscription component 141 may include a connection monitoring component 144 to detect when a subscribing application 121-123 is not connected. The matching engine 140 may retain all the published messages that are destined for a durable subscription for a subscribing application 121-123 that is not connected until the subscribing application 121-123 re-connects. At that point the matching engine 140 may supply to the re-connected application all the messages that were published to its durable subscription while it was disconnected. The durable subscription component 141 may include a message store 143 for storing messages for a disconnected durable subscription.
The durable subscription component 141 may include a persistence filter component 142. The persistence filter component 142 may filter published messages destined for a durable subscription of a disconnected subscribing application. Published messages may include a persistence parameter defined for a durable subscription and the filter component 142 may discard any published messages which do not meet the persistence requirement for the durable subscription.
Referring to
The memory elements may include system memory 202 in the form of read only memory (ROM) 204 and random access memory (RAM) 205. A basic input/output system (BIOS) 206 may be stored in ROM 204. System software 207 may be stored in RAM 205 including operating system software 209. Software applications 210 may also be stored in RAM 205.
The system 200 may also include a primary storage means 211 such as a magnetic hard disk drive and secondary storage means 212 such as a magnetic disc drive and an optical disc drive. The drives and their associated computer-readable media provide non-volatile storage of computer-executable instructions, data structures, program modules and other data for the system 200. Software applications may be stored on the primary and secondary storage means 211, 212 as well as the system memory 202.
The computing system 200 may operate in a networked environment using logical connections to one or more remote computers via a network adapter 216.
Input/output devices 213 may be coupled to the system either directly or through intervening I/O controllers. A user may enter commands and information into the system 200 through input devices such as a keyboard, pointing device, or other input devices (for example, microphone, joy stick, game pad, satellite dish, scanner, or the like). Output devices may include speakers, printers, etc. A display device 214 is also connected to system bus 203 via an interface, such as video adapter 215.
Referring to
A durable subscription may be started 301 and a persistent parameter may be defined 302 for the durable subscription. When a subscribing application creates a durable subscription it has to provide some parameters describing the messages it wants to receive. As a minimum, it may give a topic string which tells the publish/subscribe engine which publications should be routed to this subscription. In the described method, the parameters may include an extra option as a persistent parameter, such as RETAIN=ALL or RETAIN=PERSISTENT-ONLY.
It may be determined 303 if the subscribing application is disconnected. If it is not disconnected, then all messages may be delivered 304. However, if the subscribing application is disconnected, a persistence filter may be applied 305 to determine if the message meets defined persistence requirements for the durable subscription.
Persistence requirements may include “quality of service” (QoS) which may typically have three values, 0, 1, 2. QoS 0 means non-persistent, QoS 2 means persistent. The odd one is QoS 1 which means that the message will definitely be delivered (as with QoS 2) but it may be delivered more than once. This extra piece of freedom makes life easier and quicker for the message passing software, but the price is that the receiving application has to be able to recognize (and consequently ignore) duplicate messages.
In the described method, QoS may be used as a form of persistence requirement and a subscriber making a durable subscription may include a parameter such as RETAIN=QoS1 meaning the subscription must keep QoS 1 and 2 messages for a disconnected application, but may discard QoS 0 messages.
If it is determined 306 that the message is persistent, it may be stored 308 awaiting the reconnection of the subscribing application. If the message is not persistent, it may be discarded 307.
It may then be determined 309 if the subscribing application is reconnected. If it is not yet reconnected, then a next message may be considered 310 for persistence. If the subscribing application is reconnected, the stored messages may be sent 311 to the subscribing application. The method may then loop to determine if the subscribing application is again disconnected 303.
The described method and system push the concept that non-persistent messages would be lost in the event of a system restart/failure, and provides a configurable mechanism to assert that when a durable subscriber is not currently attached that the non-persistent messages may simply be discarded at time of publication, which would have the same characteristics when a. subscribing application does not re-attach until after a. system restart.
The described method and system exploit a current understanding of non-persistent behavior by providing a configuration point to make these messages more volatile.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method, computer program product or computer program. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc. or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java®, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). Java and all Java-based trademarks and logos are trademarks or registered trademarks of Oracle and/or its affiliates.
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
For the avoidance of doubt, the term “comprising”, as used herein throughout the description and claims is not to be construed as meaning “consisting only of”.
Improvements and modifications can be made to the foregoing without departing from the scope of the present invention.
| Number | Date | Country | Kind |
|---|---|---|---|
| 1305110.7 | Mar 2013 | GB | national |
