Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Kartik Paramasivam, Redmond US

Kartik Paramasivam, Redmond, WA US

Patent application numberDescriptionPublished
20090328054ADAPTING MESSAGE DELIVERY ASSIGNMENTS WITH HASHING AND MAPPING TECHNIQUES - A system for efficiently distributing messages to a server farm uses a hashing function and a map-based function, or combinations thereof, to distribute messages associated with a processing request. In one implementation, for example, the hashing function has inputs of an identifier for each message in a processing request, and a list of available servers. Upon identifying that any of the servers is unavailable, or will soon be unavailable, the load balancing server uses an alternate map-based assignment function for new requests, and inputs each assignment into a server map. The load balancing server can then use the map or the hashing function, as appropriate, to direct messages to an operating server. Upon receiving an updated list of available servers, the load balancing server can switch back to the hashing function after the map is depleted, and use the updated server list as an argument.12-31-2009
20100058451LOAD BALANCING FOR SERVICES - The present invention extends to methods, systems, and computer program products for load balancing for services. Embodiments of the invention facilitate load balancing between instances of a service based on affinitization of messages, based on content of the message. For example, messages in the same session can be dispatched to the same service instance. A sequence or series of related messages associated with long running and/or stateful services are more likely to be dispatched to the same instance of the service. Thus, if the service instance has persisted client state, there is an increased likely of utilizing the persisted client state and not having another service instance recreate the client state.03-04-2010
20100162264SERVICE VIRTUALIZATION CONTAINER - Service virtualization containers to aggregate service functionality from a plurality of services into an apparent service exhibiting the aggregated functionality. A plurality of service implementations is assigned to a service virtualization container. The container selects some of the service operations from the service implementations. One or more message characteristics are assigned to the service operations in one or more routing tables. A message is received at a service endpoint different from the service endpoints of any of the service implementations. A determination is made of one or more message characteristics. The one or more routing tables are consulted to select a determined service operation based on the message characteristics. The message is routed to the selected service implementation. Embodiments may also include functionality for aggregating metadata from service implementations and providing metadata based on the aggregated metadata to clients requesting metadata from a service virtualization container.06-24-2010
20100318654ROUTING OF POOLED MESSAGES VIA AN INTERMEDIARY - Message intermediation for multiple service instances, while allowing the service instance to control whether messages are processed under a transaction. The message intermediator chooses to dispatch messages among different backend service instances based on any routing rules. The message intermediator performs a peek-lock of message from a forward-end queue, and assigns the message to a service instance. The message is provided into a backward-end queue specific to the assigned service instance. The service instance may then process the message, perhaps under a transaction created at the service instance. Upon completion of processing, the message is deleted in the back-end queue, which causes the forward-end queue to delete the message under the same transaction created by the service instance. Whether or not this deletion at the forward-end is committed or rolled back depends on whether the transaction created at the service instance is committed or rolled back.12-16-2010
20100325642AUTOMATICALLY RE-STARTING SERVICES - The present invention extends to methods, systems, and computer program products for automatically re-starting services. Embodiments of the invention can be used to re-start a service when it is determined that the service stopped during the processing pending work. A container manager durably tracks a service's status (busy/idle and alive/dead) and tracks transitions between statuses. Accordingly, when a busy service is deemed dead (due to any event), the container manager can automatically re-start the service. Upon re-start the service can check for pending work and start executing its pending work.12-23-2010
20110161392MESSAGE REDIRECTION WITHIN A MESSAGING INFRASTRUCTURE - The present invention extends to methods, systems, and computer program products for redirecting client messages between hosts within a messaging infrastructure. When a host receives a client message, it can refer to lock information in a shared database to determine if it is the correct host to receive the client message. The lock information includes a redirect endpoint. The redirect endpoint identifies an endpoint where client messages can be sent for delivery to the appropriate workflow instance. The redirect endpoint can be included in a redirect fault message, that is returned to a host when a host attempts to process a client message that is already locked to another workflow instance. Using the redirect endpoint, a host receiving a redirect fault message can use the redirect endpoint to send a client message to the correct host.06-30-2011
20110179303PERSISTENT APPLICATION ACTIVATION AND TIMER NOTIFICATIONS - The present invention extends to methods, systems, and computer program products for persistent application activation and timer notifications. A durable instance manager, instance execution hosts, and an instance store interoperate to transition instances between executing and persisted states. System properties are associated with an instance. System properties can define re-activation conditions, that when satisfied, indicate that an instance is to be re-activated for execution. System properties can define timers as well as indications that instances are in a persisted but ready to run state.07-21-2011
20120030169APPLICATION INSTANCE AND QUERY STORES - An instance persistence command for an update to a state of an instance of an application can be issued. In response to the persistence command, a transaction with an instance store can be initiated. As part of the transaction, a first representation of the update can be stored in the instance store and a second representation of the update can be stored in a queue. The transaction can be committed after storing the first and second representations. After the transaction is committed, the second representation can be processed to store a third representation of the update in a query store. Application instance state information in the query store can be updated and queried without locking the instance store so that such operations in the query store can be performed asynchronously with operations in the instance store.02-02-2012

Patent applications by Kartik Paramasivam, Redmond, WA US