Abstract: Systems and methods for data casting in an interest aware peer network are provided. The method comprises determining whether a set of interests associated with a node in a network is updated, wherein the set of interests comprises one or more topics IDs, wherein each topic ID corresponds to a topic of interest associated with said node; distributing the set of interests associated with the node to one or more neighboring nodes by way of a first distribution scheme until N nodes in the network are aware of the updated set of interests for the node; providing each node in the network with a mechanism to determine value of a topic of interest in a set of interests received in association with a node based on a topic ID included in the set of interests for the node.

Abstract: A communications network with a structured overlay in which client nodes are interlinked to define a ring uses an interest-aware membership service to identify which client nodes are subscribed to a topic. One of the client nodes in a segment of the ring is designated to be a content-provider node, and a message concerning the topic is communicated to the node. The segment is divided into subsegments. At least one subsegment is redefined by using the interest-aware membership service to assign an outermost subscribing client node to serve as the respective terminal node of the subsegment. The message is broadcast from the content-provider node to the terminal node of the redefined subsegment. The steps of designating, communicating, dividing, redefining and broadcasting are recursively performed, using the subsegment as the segment.

Abstract: A publish/subscribe system includes a publisher and multiple subscribers. The published includes a packet generator to generate a packet with at least one of: a fixed length flow label labeling a message or a message bundle and a fixed length node label labeling at least one message bundle and indicating at least one of the nodes of a topic tree to which the flow label belongs. Each received includes a user selection data holder and a message selector. The data holder stores a selection of topics of interest to a user from the topic tree. The message selector receives a packet having a header and data, determines which flow and/or node labels are incorporated in the header and accepts the data if the user selection data holder indicates that the labels within the header are of interest to the user.

Abstract: A communications network with a structured overlay in which client nodes are interlinked to define a ring uses an interest-aware membership service to identify which client nodes are subscribed to a topic. One of the client nodes in a segment of the ring is designated to be a content-provider node, and a message concerning the topic is communicated to the node. The segment is divided into subsegments. At least one subsegment is redefined by using the interest-aware membership service to assign an outermost subscribing client node to serve as the respective terminal node of the subsegment. The message is broadcast from the content-provider node to the terminal node of the redefined subsegment. The steps of designating, communicating, dividing, redefining and broadcasting are recursively performed, using the subsegment as the segment.

Abstract: A method and system for constructing a single topic-connected overlay network are disclosed. A link contribution array, which stores sets of edges in an order according contribution values, is provided. A highest contribution index indicates a highest element in the link contribution array. The method includes performing, at every iteration, a Greedy Merge (GM) algorithm for selecting an edge from the highest element in the link contribution array, removing the selected edge from the link contribution array, and adding the selected edge to a set of overlay edges. After the selected edge is added to the set of overlay edges, contribution values of other edges are updated. The GM algorithm terminates when all elements in the link contribution array become empty. As an output, the GM algorithm generates a single topic-connected overlay network for all topics. A Greedy Join (GJ) and Greedy Leave (GL) functions are also disclosed.

Abstract: Systems and methods for managing connections among nodes in a communication network are provided. The method comprises determining one or more topics of interest for a first node in the network, selecting a second node in the network that shares at least a first topic of interest with the first node, establishing a connection between the first node and the second node so that the second node covers at least the first topic of interest, and establishing additional connections between the first node and at least a third node in the network that covers at least the first topic of interest, in response to determining that the first node is not covered by a total of K nodes with respect to the first topic of interest. Preferably, the communication network is a publish/subscribe network.

Abstract: Methods, apparatus, and products are disclosed for reliable messaging using message streams in a high speed, low latency data communications environment that include: receiving, in a transport engine of a message receiving device from an active message sending device, active transport packets on an active message stream established from the active message sending device to the message receiving device, the active message sending device encapsulating active application messages in the active transport packets; identifying, by the transport engine, a missing active application message from the active message sending device; and requesting, by the transport engine from a backup message sending device, transmission of a backup application message that corresponds to the missing active application message, the backup message sending device encapsulating backup application messages in backup transport packets for transmission on a backup message stream, each backup application message representing a duplicate of a

Abstract: A method for migrating data transmitted from a transmitter to a receiver over a first stream to a second stream in a reliable multicast system is provided. The method comprises transmitting a first message from the transmitter to the receiver over the first stream to notify the receiver that a first data flow transmitted on the first stream will be transmitted on the second stream. The transmitter transmits a second message to the receiver over the second stream after a second threshold has expired. The receiver tunes to the second stream based on the second message. The transmitter transmits a third message to the receiver over the first stream after a third threshold has expired to notify the receiver that transmission of the first data flow over the first stream will be terminated. The transmitter then transmits a fourth message from the transmitter to the receiver over the second stream after a fourth threshold has expired.

Abstract: Selecting application messages from redundant feed adapters for application-level data processing in a high speed, low latency data communications environment, including brokering establishment of an active message stream to a subscribing client device from an active feed adapter; brokering establishment of a backup message stream to the subscribing client device from a backup feed adapter; receiving active transport packets in a transport engine of the subscribing client device from the active feed adapter; receiving and buffering backup transport packets; identifying a missing active transport packet; determining whether a corresponding backup transport packet for the missing active transport packet has been received from the backup transport adapter; and replacing the missing active transport packet with the corresponding backup transport packet for further data processing if the corresponding backup transport packet for the missing active transport packet has been received.

Abstract: Methods, apparatus, and products are disclosed for reliable messaging using a message stream 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; receiving, in a transport engine of the subscribing client device from the active feed adapter on an active message stream, active application messages encapsulated in active transport packets; receiving, by the transport engine from the active feed adapter, an active transport packet containing an active mapping; identifying, by the transport engine in dependence upon active sequence numbers, a missing active transport packet; identifying, by the transport engine, missing active application messages of the missing active transport packet in dependence upon the active mapping; and requesting, by the transport engine, transmission of the missing active application messages from the active feed adapter

Abstract: A publish/subscribe system includes a publisher and multiple subscribers. The published includes a packet generator to generate a packet with at least one of: a fixed length flow label labeling a message or a message bundle and a fixed length node label labeling at least one message bundle and indicating at least one of the nodes of a topic tree to which the flow label belongs. Each received includes a user selection data holder and a message selector. The data holder stores a selection of topics of interest to a user from the topic tree. The message selector receives a packet having a header and data, determines which flow and/or node labels are incorporated in the header and accepts the data if the user selection data holder indicates that the labels within the header are of interest to the user.