Abstract:
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.
Abstract:
The multiple driver occupied passenger vehicles transporter system (Autobus) provides a way to efficiently, economically and safely increase the highway vehicle flow rate of cars per lane per hour. Autobus employs a vehicle transporter, terminal, sensors and systems that provide a way to quickly load and unload driver occupied passenger vehicles on and off of the vehicle transporter. Autobus provides a way to safely transport multiple driver occupied passenger vehicles, including cars, sport utility vehicles (SUVs) and light trucks.
Abstract:
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.
Abstract:
A method and system of controlling access to a destination (17, 23, 24) in a data processing network where the destination is limited to a fixed number of requesters responds to a new request (50) for access from a given requestor (20) by determining whether the fixed number would be exceeded. If the fixed number would not be exceeded (51), the new request is granted by connecting (52) 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 (55). If the liveness test succeeds, the new request is rejected but if the liveness test fails, the new request is granted (52).
Abstract:
In a client/server network, a client may be able to use any of several servers in accomplishing a particular task but may still have preferences as to which server should, if available, be used. If the preferred server is not available, the client will be connected to an alternate server. If a server having a higher preference than the alternate server becomes available, state information associated with the client session with the alternate server is used in order to decide when the client may be switched to the preferred server without compromising work currently being done.
Abstract:
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.
Abstract:
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. Using either a push model or a pull model, a marooned message is redistributed from the holding queue partition to a queue partition local to a messaging server that does have at least one consumer interested in consuming the message.
Abstract:
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.
Abstract:
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.
Abstract:
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 and discard at least one message when an age of the message exceeds an expiration time.