Patent application number | Description | Published |
20080244017 | Filtering application messages in a high speed, low latency data communications environment - Methods, systems, and products are disclosed for filtering application messages in a high speed, low latency data communications environment that include: receiving an application message in a transport engine of a message receiving device from a message transmitting device, the application message having a message contents label and a collision indicator, the message contents label representing contents of the application message, the collision indicator specifying whether the message contents label represents different contents in at least one other application message; determining, by the transport engine, whether contents of the application message satisfy a transport layer constraint in dependence upon the message contents label; providing, by the transport engine, the application message and the collision indicator to messaging middleware of the message receiving device if the contents of the application message satisfy the transport layer constraint; and administering the application message, by the messaging middleware, in dependence upon the collision indicator. | 10-02-2008 |
20080310423 | Synchronization of Message Stream in a Multi-tier Messaging System - A group communication service is adapted for multi-point to multi-point communication. Identical message streams are received by a tier of processing servers from a tier of sources. The processing servers deliver the message streams to a tier of destinations. The group communication service enables the processing servers to deal with newly added message streams and deleted message streams while preserving total ordering. | 12-18-2008 |
20080310444 | Group Communication System Achieving Efficient Total Order and State Synchronization in a Multi-tier Environment - A group communication service maintains synchronization limiting the group to the processing entities that receive a plurality of source message streams from sources outside the group and transmit delivery message streams to destinations that are outside the group. Synchronization of message ordering and other state synchronization directives are communicated from a leader exclusively to other group members. Once having declared themselves to be synchronized and active by a reply protocol message, which is an opaque object and is interpreted by an application layer, the processing entities independently process the source message streams in accordance with the order specified in the directives, without requiring additional sequencing information from another processing entity. | 12-18-2008 |
20090052318 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR TRANSMITTING DATA ENTITIES - A method, system and computer program product for transmitting data entities, the method includes: receiving data entities to be transmitted over multiple channels; and preventing a transmission of data entities that are to be transmitted over congested channels while transmitting data entities that are to be are to be transmitted over non-congested channels | 02-26-2009 |
20100054195 | Efficient Deallocation of Network Resources Based on Network Node Location Extrapolation - Deallocating resources allocated to a network communications session, including extrapolating an expected location of a selected node that belongs to a communications path of a network communications session, determining if the extrapolated location is beyond a predefined range from a neighboring node that belongs to the communications path of the network communications session and that immediately neighbors the selected node along the communications path, and deallocating any resources allocated to the network communications session if the extrapolated location is beyond the range. | 03-04-2010 |
20100088424 | Efficient Buffer Utilization in a Computer Network-Based Messaging System - Buffering messages by receiving a message from a messaging client, writing the message to a logically-contiguous write-available region of a message buffer starting at a logically next write-available location within the write-available region, updating a head index to indicate a head boundary between a logically last message in the message buffer and a logically next write-available location in the message buffer, defining a packet including the message within the message buffer, transmitting a packet that includes a logically first message in the message buffer, and updating a tail index to indicate a tail boundary between a new logically last write-available location in the message buffer and a new logically first message in the message buffer. | 04-08-2010 |
20110078291 | DISTRIBUTED PERFORMANCE MONITORING IN SOFT REAL-TIME DISTRIBUTED SYSTEMS - A novel and useful framework, system and method of monitoring one or more performance parameters (e.g., distributed system performance), filtering the performance parameters data collected and identifying one or more performance parameters that affect one or more target performance measures. This can be achieved in the case of a delay parameter, for example, by determining the root-cause of the increased delay and taking corrective actions in order to avoid violation of the timeliness constraints. The present invention is a statistical based performance monitoring mechanism that uses statistical signal processing techniques and is applicable, for example, in soft real-time distributed systems. The monitoring framework efficiently and distributively characterizes the behavior of the varying network conditions as a stochastic process and performs root-cause analysis to detecting the parameters which affect one or more target performance measures, e.g., latency. Once the affecting parameters are determined, corrective action is optionally taken. | 03-31-2011 |
20110176418 | ADAPTIVE TRAFFIC MANAGEMENT VIA ANALYTICS BASED VOLUME REDUCTION - A method of managing traffic over a communication link between a transmitting node and a receiving node is provided herein. The method includes: determining momentary traffic shaping constraints; accumulating incoming messages at the transmitting node into a data queue, based on the momentary traffic shaping constraints; transmitting the messages from the data queue to the receiving node over the communication link based on the momentary traffic shaping constraints; estimating a desired amount of data that needs to be discarded from messages in the data queue, based on: (a) the size of the data queue and (b) the momentary traffic shaping constraints; sorting data in the data queue by an order of importance, based on analytic objects; discarding, based on the analytic objects, the desired amount of data from the messages in the queued data, such that the discarded data is ranked lowest by the order of importance. | 07-21-2011 |
20110181437 | DATA REDUCTION IN A MULTI-NODE SYSTEM - An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and relay a subset of the data that is not according to an expected value. The expected value may be determined based on a forecasting function computed based on past data. The expected value may be a spatial shape in an n-dimension space. A data not within the spatial shape may be considered not in accordance with the expected value. In some case, the spatial shape is defined by a centroid and a radius. The spatial shape may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of spatial shapes of each group over time. | 07-28-2011 |
20110184676 | DATA REDUCTION IN A MULTI-NODE SYSTEM - An advanced metering infrastructure comprises intermediate nodes. The intermediate nodes receive data from child nodes and aggregate the data according to groups of child nodes. The aggregation provides for a reduced version of the data. The reduction is performed based on groups determined by clustering. The reduced version of the data comprises data describing a group of measurements over time, such as a centroid in an n-dimension space, number of customers in the group, radius of the group and the like. The centroid may shift over time based on a consumption profile, such as low consumption at noon, and high consumption at evening. The consumption profiles may be determined in a learning phase, as well as shifting of centroids of each group over time. | 07-28-2011 |
20110185079 | ACHIEVING DISTRIBUTED FLOW CONTROL VIA DATA CONFLATION - A distributed method that combines both flow control and smart volume reduction means in a communication network is provided herein. The stages of the method are applied by each node in the network in a distributed way, which adapts to the evolving state of the system. The operations performed by each node in the network are adapted dynamically in a way that adjusts itself to the changes that occur in various parameters of the network. Such parameters include both local node state and also the state of different nodes in the distributed infrastructure. The state of the nodes is characterized by parameters such as transmission rates, available buffer space and the state of data in buffer. The stages are carried out in parallel by the nodes and ordered such that the equality of the data flowing in the network, in terms of delay and specified attributes, is maximized. | 07-28-2011 |
20120110372 | RELIABLE MESSAGING USING REDUNDANT MESSAGE STREAMS IN A HIGH SPEED, LOW LATENCY DATA COMMUNICATIONS ENVIRONMENT - A method includes receiving active application messages that are part of an active message stream in a subscribing client device from an active feed adapter. Each active application message is characterized by an active source stream identifier, an active source stream sequence number, and an active message sequence number. The method includes receiving, in response to a failover from the active feed adapter to a backup feed adapter, backup application messages in the subscribing client device from the backup feed adapter. Each backup application message is characterized by a backup source stream identifier, a backup source stream sequence number, and a backup message sequence number. The method includes administering, by the subscribing client device, the backup application messages in dependence upon the active stream source identifier, the active stream source sequence number, the backup stream source identifier, and the backup stream source sequence number. | 05-03-2012 |
20120233295 | Declarative Service Domain Federation - A mechanism for declarative service domain federation uses a declarative approach to both the visibility aspect and the management aspect of service domain federation. Instead of manually exporting services, that is, selecting individual services from source domains to be visible in the target domain, using the present system, a federation architect uses a federation console to specify federation intent. The federation intent may include federation rule, query-based service group, and quality-of-service (QoS) policy. Based on the declared federation intent, a planning engine resolves the individual services based on the group query, generates the service visibility configuration, and creates the necessary service proxies and/or mediation objects to satisfy the goal. At runtime, a service monitor collects the performance metrics of federated services and dynamically adjusts the mediation/proxy configurations to maintain the QoS objectives specified by the federation architect. | 09-13-2012 |
20120300627 | APPLYING QUALITY AWARE VOLUME REDUCTION TO COMMUNICATION NETWORKS - A method of applying a quality-aware volume reduction to communication networks is provided herein. The method includes the following stages: deriving, from the network: a bandwidth capacity limit of the links of the network, and an initial flow rate for each flow transmitted via nodes through the network; obtaining from each one of the nodes, a gain value which corresponds to a quantitative data demand requested by the node and given in terms of data quality; and calculating, for each one of the nodes, a data reduction ratio, that achieves: (i) a maximal overall revenue associated with the network, wherein the revenue for a node is calculated with respect to the quality of the data that arrives to the node, and (ii) an optimal bandwidth allocation over the links with respect to the gains and the data quality at each node, and to the limited bandwidth capacity of the links. | 11-29-2012 |