Microsoft Technology Licensing, LLC

Raphael Renous

Alexander Dadiomov

Doron Juster

Ilan Gabriel Caron

James Simpson

Erez Haba

Uri Habusha

Yifat Peled

Local queue creation security is disclosed. In one embodiment, for a message transaction system being implemented in conjunction with an operating system provide user-level security only, local machine- or local-level security is provided for by a service running on a client. In one embodiment, a method includes sending a first request to create a local queue, by an application of a client from a function of the client to a server. If the server determines that the user under which the application is running has permission to create local queues, the local queue is created. Otherwise, a second request to create the local queue is sent from the function to a service having permission to create local queues. If the service determines that the second request originated locally, then the service calls the server to create the local queue.

Local queue creation security

Automatic message-based module invocation within a transactional message system is described. The modules can be software components, executable program files, etc. In one embodiment, a system includes one or more queues, a trigger store, and a trigger service. Each queue is capable of receiving messages. The trigger store includes one or more triggers, where each trigger is associated with a queue, and has associated therewith one or more rules, where each rule has a condition and an action. The trigger service is designed to, upon receipt of a message in a queue, check the condition of each rule of each trigger associated with the queue, to determine if the message satisfies the rule's condition. If such satisfaction occurs, then the action of the rule is performed, which can include invocation of a module. The rules may be short-circuit rules, non-destructive rules, and/or destructive rules, and may be checked in either a concurrent or serial manner.

Automatic message-based module invocation

The identification of transactional boundaries among the messages sent and received within a transactional message system is disclosed. In one embodiment, a system includes a first computer and a second computer. The first computer is designed to set transactional boundaries among messages. The second computer is designed to determine the transactional boundaries thereamong&mdash;specifically such that it can determine whether at least a proper first and last message of a particular transaction has been received. In one embodiment, transactional boundaries are set among messages by tagging the first message of a transaction with a first-message identifier, and the last message with a last-message identifier. All the messages of the transaction can also be tagged with an identifier particular to the transaction.

Identification of transactional boundaries

A method and system for coordinating distributed transactions provides atomic processing of distributed transactions on computers in a network with asynchronous message delivery. In a distributed transaction, an application on a first computer initiates a first operation and sends a request message for a second operation to a second application on a remote computer. The first operation and the sending of the request message are performed in a local committed transaction on the first computer. The request message is delivered exactly once and in order to the remote computer and is read by the second application. The performance of the second operation and the sending of an acknowledgment to the first application are performed in a local committed transaction by the second computer. The sending computer and the receiving computer of the request message may be on two different message queuing systems bridged by a connector computer which translates a message from one message queuing system and forwards the message to the destination queue in the other message queuing system.

Growing community of inventors

Haifa, Israel

Raphael Renous