International Business Machines Corporation

David Ware

Andrew Ian Hickson

Graham Derek Wallis

Andrew D J Banks

Brian Clive Homewood

John Michael Knapman

Steven William Bolam

Michael Joseph Spreitzer

Srinivas Hasti

Adrian James Preston

Malcolm David Ayres

Andrew M Leonard

Richard Scott Maxwell

Andrew J Whitfield

Brian Keith Martin

Ignacio Silva-Lepe

Michael James Ward

Sumeer K Bhola

Peter David Niblett

Mark C Astley

Neil G S Young

Christopher Wilkinson

Timothy Steven Raff

Tom Evans

Neil George Stanley Young

Disclosed is a method for administering messages. In response to a determination that one or more consuming applications have failed to process the same message on a queue a predetermined number of times, the message is made unavailable to consuming applications. Responsive to determining that a predetermined number of messages have been made unavailable to consuming applications, one or more consuming applications are prevented from consuming messages from the queue.

Method, apparatus and computer program for administering messages which a consuming application fails to process

A system for managing inbound messages in a server complex including one or more message consumers. The system includes a server configured to receive the inbound messages from a first peripheral device and to transmit messages to one or more of the plurality of message consumers. The system also includes an inbound message queue coupled to the server, the inbound message queue configured to store inbound message until an age of any message stored on the inbound message queue exceeds a predetermined threshold.

Inbound message rate limit based on maximum queue times

A method of performing message operations includes receiving a message operation request identifying a queue, retrieving a list of the subset of partitions associated with the alias received in the request, and selecting at least one of the partitions within the retrieved subset. According to the method, the queue includes a plurality of partitions, the request identifies the queue with an alias, and the alias having a subset of the plurality of partitions associated therewith.

Scoping an alias to a subset of queue partitions

Access to a device is controlled in a data processing network by receiving a first request from a client to connect to a device where the device is limited to a fixed number of client connections and connecting the client to an available client connection of the device if the fixed number of client connections on the device would not be exceeded by connecting the client. Access is further controlled by testing liveness of a current client connection on the device if the fixed number of client connections on the device would be exceeded by connecting the client and dropping the current client connection if the liveness testing indicates that the current client connection is not live.

Controlling access to a destination in a data processing network

There is disclosed a source messaging system having a queue for receiving messages. The source messaging system has means for determining whether a message should be permitted to become INDOUBT. This is done by retrieving a value denoting the maximum number of messages that may be permitted to become INDOUBT at any one time; determining whether the message falls within the range denoted by the value; and responsive to determining that the message falls within the range, permitting the message to become INDOUBT.

Data transfer in a messaging system

There is disclosed a method, apparatus and computer program for an application instance to request attachment to a queue partition on a messaging server within a plurality of messaging servers, each messaging server holding at least one queue partition, the set of queue partitions together forming a single queue. An application instance requests attachment to a queue partition, the request requesting exclusivity with regard to other application instances having a common identifier. Responsive to an indicating that the request has been successful, the application instance interacts with the queue partition.

Method for attaching to a partitioned queue spread across a plurality of messaging servers

A method of routing messages to multiple consumers comprises determining a probability function defining message classification probabilities for each of a plurality of consumer sets, receiving a plurality of messages, classifying each message, storing each message in a queue, receiving notification of a consumer available to process a message, ascertaining the consumer set to which the available consumer belongs, accessing the probabilities for the ascertained consumer set, selecting a message classification according to the accessed probabilities, and transmitting a message, of the selected classification, to the available consumer.

Method of routing messages to multiple consumers

Messages are redistributed in a clustered messaging environment including messaging servers and consuming applications. Each messaging server has a queue partition operable to contain messages. Each consuming application can connect to a messaging server in to consume one or more messages from a queue partition local to that messaging server. A message on a holding queue partition local to a messaging server without at least one consumer interested in consuming that message is said to be marooned. A marooned message is redistributed from the holding queue partition to a messaging server that does have at least one consumer interested in consuming the message. The redistribution involves identifying a group of servers, each of which has one or more consumers interesting in consuming the message, selecting a server from the group and forwarding the message to the selected server.

Redistributing messages in a clustered messaging environment

A method and system of controlling access to a destination () in a data processing network where the destination is limited to a fixed number of requesters responds to a new request () for access from a given requestor () by determining whether the fixed number would be exceeded. If the fixed number would not be exceeded (), the new request is granted by connecting () the given requester to the destination. If the fixed number would be exceeded, the liveness of the or each current connection to a respective requester is tested (). If the liveness test succeeds, the new request is rejected but if the liveness test fails, the new request is granted ().

A method, system, and computer program for delivering messages and data to competing consumers. One aspect of the invention includes a message delivery system including a destination messaging engine, one or more receiver messaging engines, and a message pool. The destination messaging engine is configured to distribute data from one or more producers. The receiver messaging engines are configured to request data from the destination messaging engine and transmit the data to one or more consumers. The message pool is configured to store data from the producers, with the destination messaging engine arbitrating data in the message pool among the receiver messaging engines.

Mechanism for delivering messages to competing consumers in a point-to-point system

Requests from a client to put messages into an input queue are intercepted before reaching the input queue. The intercepted requests which refer to a message destined for the server application are established. Information associated with the server application indicates that the server application will process such a message according to a predetermined manner. A request associated with the server application for retrieving such a message is transactional, and the server application uses a one-phase commit for retrieving such a message. Such a message can then be matched with the server application's request such that the server application can retrieve the message. In this way, such messages by-pass the input queue, and are, therefore, not logged, resulting in a reduction of I/O.

Method, apparatus, system and computer program for reducing I/O in a messaging environment

A method and computer program product is provided for sending a persistent message in a transaction-enabled messaging and queuing system. A message queue manager is responsible for transferring messages from a sender program to a receiving program via a message queue. A message is sent from the sender program to the message queue manager. The message is defined to permit the message queue manager to select whether to treat the message transactionally or non-transactionally.

Persistent messaging in a transaction processing environment

The invention relates to a method, apparatus and computer program for reducing the number of data elements checkpointed in a system having at least one data store where operations on said at least one data store are recorded in a log. A point in the log is recorded. The oldest data element in each of the least one data store is determined and it is then determined for each of the at least one data store whether a logged representation of the data store's oldest data element is more recent than the point recorded. Responsive to determining that a data store's logged representation is more recent than the point recorded, it is realised that it is not necessary to force data elements from that data store to disk if the point recorded is made the point of restart for that data store.

Growing community of inventors

Downton, United Kingdom

David Ware