International Business Machines Corporation

Gidon Gershinsky

Konstantin Shagin

Nir Naaman

Liane Lewin-Eytan

Avraham Harpaz

Eliezer Dekel

Alexander Krits

Cornell G Wright, Jr

Foluso Olaiya Okunseinde

Julian Satran

Han Chen

Hilary A Pike

Boaz Carmeli

John J Duigenan

John Justin Duigenan

Hao Yang

Hui Lei

Minkyong Kim

Liangzhao Zeng

Elad Yom-Tov

Daniel Nikolaus Bauer

Nicholas David Butler

Kenneth Wayne Borgendale

Benjamin Mandler

Yossi Richter

Kristijan Dragicevic

Marc-Thomas H Schmidt

David Rushall

Stephen James Todd

Michael D Elder

Graham Derek Wallis

Yoav Tock

Benny Rochwerger

Idan Zach

Adnan M Agbaria

Joseph Naor

Miriam Allalouf

Haim Nelken

Harel Paz

Danny Bickson

Cornell Wright

Hilary Alison Pike

Michael Damein Elder

Cornell Wright Jr

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.

Declarative service domain federation

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.

Data forecasting in a multi-node system

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.

Adaptive traffic management via analytics based volume reduction

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.

Data reduction in a multi-node system

Methods, apparatus, and products are disclosed for synchronizing an active feed adapter and a backup feed adapter in a high speed, low latency data communications environment that include brokering, by a stream administration server, establishment of an active message stream to a subscribing client device from an active feed adapter, the active message stream capable of communicating active application messages; brokering, by the server, establishment of a backup message stream to the client device from a backup feed adapter, the backup message stream capable of communicating backup application messages; receiving an active feed adapter state in backup messaging middleware of the backup adapter from active messaging middleware of the active adapter; determining, by the backup feed adapter, whether a backup feed adapter state is synchronized with the active feed adapter state; and administering, by the backup feed adapter, operation of the backup adapter in dependence upon the determining.

Synchronizing an active feed adapter and a backup feed adapter in a high speed, low latency data communications environment

A method of adaptive differential propagation of Simple Object Access Protocol (SOAP) messages is provided herein. The method includes the following stages: classifying incoming SOAP messages according to at least one of: structure, content, and context thereof; selecting a corresponding template out of a plurality of templates for each classified SOAP message such that the selected template minimized a specified diff function applied to the classified SOAP message and the selected template; applying the specified diff function to the SOAP message and the selected template to yield a respective delta; and encapsulating a template identifier with the respective delta, wherein the template identifier is uniquely associated with the selected template, to yield an outgoing SOAP message.

Adaptive differential propagation of soap messages

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.

Reliable messaging using redundant message streams in a high speed, low latency data communications environment

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.

Applying quality aware volume reduction to communication networks

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.

Achieving distributed flow control via data conflation

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.

Group communication system achieving efficient total order and state synchronization in a multi-tier environment

A multicast host for communicating information published about any one of a set of topics to one or more authorised subscribers to those topics, the set of topics being partitioned into one or more partition elements, each partition element having a partition element encryption key associated therewith, wherein each of the one or more partition elements is a disjoint proper subset of the set of topics, the host comprising: means for receiving information relating to a topic; means for determining a partition element for the topic; means for retrieving a partition element encryption key associated with the partition element; means for encrypting the information with the retrieved partition element encryption key; and means for communicating the information to the one or more authorised subscribers.

Access control over multicast

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.

System, method and computer program product for transmitting data entities

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.

Synchronization of message stream in a multi-tier 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.

Efficient buffer utilization in a computer network-based messaging system

Growing community of inventors

Haifa, Israel

Gidon Gershinsky