Patent application number | Description | Published |
20090132671 | MESSAGE STATE MAINTENANCE AT A CURSOR - The present invention extends to methods, systems, and computer program products for maintaining message state at a cursor. A message consumer requests messages from a cursor. The cursor can maintain state information for the message consumers separately from a message log that stores messages. Any of a variety of message delivery assurances can be used when delivering a message to a message consumer. | 05-21-2009 |
20090132868 | MESSAGE STATE MAINTENANCE AT A MESSAGE LOG - The present invention extends to methods, systems, and computer program products for maintaining message state at a message log. Messages are accumulated at a message log in accordance with a message retention policy. Any of a variety of message capture assurances can be used when capturing a message from a message producer within a message log. A message becomes visible to message consumers after the outcome of writing the message is known (either failure or success). Messages are requested using (e.g., monotonically increasing) sequence numbers. Messages are also dropped from the message log in accordance with the message retention policy. | 05-21-2009 |
20090133038 | DISTRIBUTED MESSAGING SYSTEM WITH CONFIGURABLE ASSURANCES - The present invention extends to methods, systems, and computer program products for configuring assurances within distributed messaging systems. A defined set of message log and cursor components are configurably activatable and deactivatable to compose a variety of different capture assurances, transfer assurances, and delivery assurances within a distributed messaging system. A composition of a capture assurance, a transfer assurance, and a delivery assurance can provide an end-to-end assurance for a messaging system. End-to-end assurances can include one of best effort, at-most-once, at-least-once, and exactly once and can include one of: durable or non-durable. Using a defined set of activatable and deactivatable message log and cursor components facilities more efficient transitions between desired assurances. In some embodiments, a composition of a capture assurance, a transfer assurance, and a delivery assurance provides durable exactly-once message delivery. | 05-21-2009 |
20090133039 | DURABLE EXACTLY ONCE MESSAGE DELIVERY AT SCALE - The present invention extends to methods, systems, and computer program products for durable exactly once message delivery at scale. A message capture system uses a synchronous capture channel and transactions to provide durable exactly once message capture. Messages are sent from the message capture system to a message delivery system over a network using an at least once transfer protocol. The message delivery system implements a durable at most once messaging behavior, the combination of which results in durable exactly once transfer of messages from the message capture system to the message delivery system. The message delivery system uses a synchronous delivery channel and transactions to provide durable exactly once message delivery. Cursors maintaining message consumer state are collocated with message consumers, freeing up message log resources to process increased volumes of messages, such as, for example, in a queued or pub/sub environment. | 05-21-2009 |
20100268808 | DISTRIBUTED AGGREGATION ON AN OVERLAY NETWORK - The present invention extends to methods, systems, and computer program products for distributed aggregation on an overlay network. Embodiments of the invention utilize tiers of nodes that are cascaded in a layered system. Each tier reduces the size of data by orders of magnitude through pre-aggregation. Thus, high volume streams of messages can be reduced to lower volume streams at large scales, such as, for example, the Internet. No central coordination is used; thus there is no central point of failure or bottleneck. When a node fails, other nodes in the same tier as the failing node automatically take over the responsibilities of the failed node. | 10-21-2010 |
Patent application number | Description | Published |
20090024622 | IMPLEMENTATION OF STREAM ALGEBRA OVER CLASS INSTANCES - Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query. | 01-22-2009 |
20100131543 | IMPLEMENTATION OF STREAM ALGEBRA OVER CLASS INSTANCES - Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query. | 05-27-2010 |
20110185338 | DESIGN-TIME BUSINESS PROCESS VALIDATIONS WITHIN DATA CONTEXT - Validating executable data for interactions among a plurality of process artifacts at design time. A data context is created to include the plurality of process artifacts. The data context carries interaction rules among the plurality of process artifacts. The executable data from a data source is associated with the plurality of process artifacts in the created data context. A subset of the interaction rules is selected corresponding to at least one of the plurality of process artifacts. The associated executable data is validated when the associated executable data is in accordance with the selected subset of the interaction rules. | 07-28-2011 |
20130014094 | IMPLEMENTATION OF STREAM ALGEBRA OVER CLASS INSTANCES - Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query. | 01-10-2013 |
Patent application number | Description | Published |
20090055838 | MONITORING DISTRIBUTED APPLICATIONS - The present invention extends to methods, systems, and computer program products for monitoring distributed applications. Declarative application models are used. Operational data for a deployed application can be compared to an application intent expressed in a corresponding declarative application to provide more effective monitoring of application behavior. Application components can subscribe to an event fabric to receive configurations that indicate what events the application is to emit (i.e., publish into the event fabric) for monitoring. Thus, applications essentially subscribe to produce information (as opposed to subscribing to receive information). Monitoring can be dynamically adjusted in response to environment changes. | 02-26-2009 |
20090307533 | Activity Identifier Based Tracing and Troubleshooting - To trace an activity through multiple components or applications that may be involved in the performance of the activity, an activity identifier can be generated and utilized by the various components or applications. Each can generate its own activity identifier to minimize changes to existing interfaces. When logging of events has been activated, each application or component can provide, to an event store, an indication of the activity identifier it is using for a given activity. If a preceding or subsequent component utilizes a different activity identifier for aspects of the same activity, a link between the two activity identifiers can be communicated to the event store. Subsequently, examination of the event store can filter out irrelevant entries based on the activity identifiers. A graph linking the various related activity identifiers can be created and only those events associated with activity identifiers not in the graph can be filtered out. | 12-10-2009 |
20100223446 | CONTEXTUAL TRACING - A method of tracking execution of activities in a computing environment in which events in an activity are recorded along with an activity identifier uniquely identifying the activity and tying the events to the activity. To track interactions between activities, a correlation identifier may be generated and transferred between the interacting activities as part of the interaction. For each of the activities participating in the interaction, information on an event relating to the interaction is recorded along with the correlation identifier. The correlation identifier thus allows uniquely identifying each interaction which may be used to synchronize streams of events within the activities at points of their interaction. Activities may interact across any boundary, including a network. | 09-02-2010 |
20120323941 | Processing Queries for Event Data in a Foreign Representation - The subject disclosure is directed towards processing a query corresponding to event data in a foreign representation. In order to produce results for the query, an event structure is defined for each requested event type. Information is automatically generated for configuring adapters to identify attribute data associated with the each requested event type and return the attribute data according to the event structure. These adapters search historical event data or real-time event data for the event-related data. | 12-20-2012 |