International Business Machines Corporation

Sumeer K Bhola

Mark C Astley

Yuanyuan Zhao

Daniel Charles Sturman

Srinivas Prasad Doddapaneni

Cristian Lumezanu

Robert Evan Strom

Marc Adam Kaplan

Joshua S Auerbach

Bodhi Mukherjee

Todd Eric Kaplinger

Ignacio Silva-Lepe

Michael James Ward

David Ware

Michael Steiner

Keeranoor G Kumar

Marc Hubert Willebeek-LeMair

Andrew D J Banks

Bodhistattwa Mukherjee

A system and method for latency assignment in a system having shared resources for performing jobs including computing a new resource price at each resource based on latencies in a previous iteration. The new resource price is sent to a task controller that has at least one subtask running at the resource. Each subtask has an initial deadline. New deadlines for the subtasks in a task are determined based on the new resource prices at the task controller. The new deadlines are sent to the resources where at least one subtask in the task is running to improve system performance.

Distributed online optimization for latency assignment and slicing

A system and method for latency assignment in a system having shared resources for performing jobs including computing a new resource price at each resource and sending the new resource price to a task controller in a task path that has at least one job running in the task path. A path price is computed for each task path of the task controller, if there is a critical time specified for the task. New deadlines are determined for the resources in a task path based on the resource price and the path price. The new deadlines are sent to the resources where the at least one job is running to improve system performance.

Improved access control techniques for distributed messaging systems such as content-based publish/subscribe systems are disclosed. For example, a method for providing access control in a content-based publish/subscribe system, wherein messages are delivered from publishing clients to subscribing clients via a plurality of brokers, includes the following steps/operations. One or more changes to an access control policy are specified. An access control version identifier is associated to the one or more changes. The one or more changes are sent to one or more brokers of the plurality of brokers that have a publishing client or a subscribing client associated therewith that is affected by the one or more changes. The access control version identifier associated with the one or more changes is sent to each of the plurality of brokers.

Dynamic access control in a content-based publish/subscribe system with delivery guarantees

The present invention is directed to a publish/subscribe system containing a plurality of brokers, a plurality of subscribers and plurality of brokers including publisher connecting brokers, intermediate brokers and subscriber connecting brokers. Subscriptions are introduced into the system by the subscribers through associated subscription brokers. New subscriptions are aggregated, assigned a virtual start time and propagated through the system toward the publishers. Each broker maintains subscription information in the form of a directed acyclic graph and a broker vector. Messages are published through the system by the publishers through their associated publisher connecting brokers. Each message is assigned a message vector associating subscriptions to that message. The published messages are routed through the brokers toward the subscribers in accordance with comparisons of message brokers and vector brokers conducted at each broker.

Subscription propagation in a high performance highly available content-based publish/subscribe system

Computer implemented methods () for protecting web based applications () from Cross Site Request Forgery (CSRF) attacks. The methods involve () classifying each resource offered by a web server application as a CSRF-protected resource or a not-CSRF-protected resource. The methods also involve () performing a user authentication, () initializing an authentication-token, and () initializing a CSRF protection secret that is used to validate CSRF protection parameters contained in resource identifiers for the resources. The methods further involve () performing a server-side rewriting process () to add the CSRF protection parameter to the resource identifiers for the resources and/or () performing a client-side rewriting process to add the CSRF protection parameter to a resource identifier for a second resource (e.g., a resource created at a client computer ()).

Systems and methods for protecting web based applications from cross site request forgery attacks

A system and method which integrates a greedy allocation for consumer admission control with a Lagrangian allocation to compute flow rates and which links the results of the two approaches to allow a tradeoff between consumer admission control and flow rates. The Lagrangian Rates, Greedy Populations (hereinafter, 'LRGP') solution is a scalable and efficient distributed solution for maximizing the total utility in an event-driven distributed infrastructure. The greedy population, consumer portion generates prices used in the LaGrangian rate flow approach. The method is iterative including a regular exchange of information for ongoing optimization, dynamically adjusting producer rates in response to changes to consumer service and dynamically adjusting the service to consumer populations in response to changes in the producer rates.

System and method for distributed utility optimization in a messaging infrastructure

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

A content-based publish/subscribe system for providing gapless message delivery from a publishing client to a subscribing client is disclosed. The system includes a plurality of brokers operatively coupled to one another via a network. Each of the brokers include at least one processor and are configured as a publisher-hosting broker, a subscriber-hosting broker or an intermediate broker. The subscriber-hosting broker may be operatively coupled to the publisher-hosting broker via the network through the intermediate broker. At least a portion of the plurality of brokers are configured so as to eliminate a need for persistent storage of messages at the intermediate broker and to substantially guarantee a gapless delivery of one or more messages transmitted by the publishing client to the subscribing client, even in the presence of a failure in the publish/subscribe system.

Gapless delivery and durable subscriptions in a content-based publish/subscribe system

A content-based publish/subscribe system for providing gapless message delivery from a publishing client to a subscribing client, the system includes a plurality of brokers operatively coupled to one another via a network. Each of the brokers include at least one processor and are configured as a publisher-hosting broker, a subscriber-hosting broker or an intermediate broker. The subscriber-hosting broker is operatively coupled to the publisher-hosting broker via the network through the intermediate broker. At least a portion of the plurality of brokers are configured so as to eliminate a need for persistent storage of messages at the intermediate broker and to substantially guarantee a gapless delivery of one or more messages transmitted by the publishing client to the subscribing client, even in the presence of a failure in the publish/subscribe system.

A system and method for temporal synchronization of media streams in multimedia collaborative applications (i.e., a multi-user distributed applications used for interaction, both in the synchronous and asynchronous fashion among a group of users) in a wide-area distributed environment. The invention presents two abstractions; event streams and collaboration space, that together provide for coarse-grained temporal synchronization by using separate streams for different media and synchronizing the streams at the client location. VCR-like controls are also provided on groups of components in a collaborative application. The event stream provides many services such as replication, persistence, buffering, reading, and writing to archive. By implementing simple interfaces, existing collaborative applications, media players, and encoders become components that can be used to build complex multimedia collaborative applications. To efficiently implement a seeking function on a data component, the present invention introduces a framework for application-specific updates to a component state.

System and method for data streaming and synchronization in multimedia groupware applications

A system, method and computer program storage device providing event and/or state sharing support e.g., for building object-oriented interactive groupware in wide-area distributed environments (such as the Internet). For collaborative applications programmed using events, mechanisms are provided for sharing application-specific events. For example: an event based programming model allows applications to post an event and triggers corresponding ERUs (Event Reaction Unit) in reaction to a received event; preconditions for control activation of ERUs; and event consistency policy objects implement application specified event consistency model. Some policy examples are: a policy in which event order is not guaranteed, but all events are guaranteed to be sent to the ERUs eventually; and a policy that first triggers local ERUs and then posts the event to the server. An out-of-order event is detected using the event notification from the server; and an automatic detection of out-of-order events seen by ERUs in the local workstation in this optimistic event execution model. For applications requiring support for state sharing, an asynchronous model for updating replicated state, which supports atomicity of updates across multiple shared objects is described. Coupled with a flexible marshaling framework, this allows existing application data-structure classes to be easily extended and made shareable, while providing support for context-sensitive state marshaling applications. To solve the problem of replica consistency, a novel combination of three mechanisms is used: global locks; detection of incorrect update ordering; and cloning a subset of the shared objects for state re-initialization. To reduce network load due to fine-grained user interaction, a framework for application specified event batching, called Late Event Modification (LEM), enhances the event interface to allow applications to modify the event objects after posting them to the set.

Flexible event sharing, batching, and state consistency mechanisms for interactive applications

A system, method and computer program storage device providing event and/or state sharing support e.g., for building object-oriented interactive groupware in wide-area distributed environments (such as the Internet). For collaborative applications programmed using events, mechanisms are provided for sharing application-specific events. For example: an event based programming model allows applications to post an event and triggers corresponding ERUs (Event Reaction Unit) in reaction to a received event; preconditions for control activation of ERUs; and event consistency policy objects implement application specified event consistency model. Some policy examples are: a policy in which event order is not guaranteed, but all events are guaranteed to be sent to the ERUs eventually; and a policy that first triggers local ERUs and then posts the event to the server. An out-of-order event is detected using the event notification from the server; and an automatic detection of out-of-order events seen by ERUs in the local workstation in this optimistic event execution model. For applications requiring support for state sharing, an asynchronous model for updating replicated state, which supports atomicity of updates across multiple shared objects is described. Coupled with a flexible marshaling framework, this allows existing application data-structure classes to be easily extended and made shareable. To solve the problem of replica consistency, a novel combination of three mechanisms is used: global locks; detection of incorrect update ordering; and cloning a subset of the shared objects for state re-initialization. To reduce network load due to fine-grained user interaction, a framework for application specified event batching, called Late Event Modification (LEM), enhances the event interface to allow applications to modify the event objects after posting them to the set.

Growing community of inventors

New York, NY, United States of America

Sumeer K Bhola