Abstract: A method for sharing window-based joins includes slicing window states of a join operator into smaller window slices, forming a chain of sliced window joins from the smaller window slices, and reducing by pipelining a number of the sliced window joins. The method further includes pushing selections down into chain of sliced window joins for computation sharing among queries with different window sizes. The chain buildup of the sliced window joins includes finding a chain of the sliced window joins with respect to one of memory usage or processing usage.

Abstract: In an infrastructure solution for content-based forwarding, filter pipelining enables handling of the high-rate message streams. Documents are distributed in the network by forwarding from publisher proxy servers to attribute trees associated with particular attributes in the message. The trees filter the messages based on attribute values, and deliver the messages to subscriber proxy servers for predicate-based distribution to subscribers. To maximize throughput, the attribute trees utilize the concept of weak filtering, wherein a message may be delivered to a node in the attribute tree that is associated with a range of attribute values that does not include the attribute value of the message.

Abstract: A scalable broker publish/subscribe broker network using a suite of active load balancing schemes is disclosed. In a Distributed Hashing Table (DHT) network, a workload management mechanism, consisting of two load balancing schemes on events and subscriptions respectively and one load-balancing scheduling scheme, is implemented over an aggregation tree rooted on a data sink when the data has a uniform distribution over all nodes in the network. An active load balancing method and one of two alternative DHT node joining/leaving schemes are employed to achieve the uniform traffic distribution for any potential aggregation tree and any potential input traffic distribution in the network.

Abstract: Disclosed is a method and apparatus for delivering information of interests from content providers to clients via a data network. A network architecture includes two types of edge servers, referred to as forward proxy servers and reverse proxy servers. The forward proxy servers are assigned to serve particular clients with respect to particular information and the reverse proxy servers are assigned to serve particular forward proxy servers with respect to particular information. Each of the forward proxy servers stores information identifiers associated with information for which the forward proxy server is assigned to serve to at least one client. Each of the reverse proxy servers stores information identifiers and the associated forward proxy servers that the reverse proxy server is assigned to serve with respect to information associated with the information identifiers.

Abstract: A system and method are herein disclosed for parallel streaming of stored media from multiple sources. The architecture utilizes the notion of indirect streaming and provides a local proxy streaming server which is responsible for interacting with the multiple servers and scheduling downloads of media blocks and for dealing with possible rate fluctuations and server failures.

Abstract: Disclosed is a content based router, system and method of operation. Upon receipt of a data packet at in ingress router, the ingress router matches the content of the data packet against stored user subscriptions. In one embodiment, the content is described using XML data and the user subscriptions are defined by XML queries. The router assigns a routing label to the data packet based on the matching, and transmits the data packet to a second network router. Intermediate routers along the packets path then use the assigned label in combination with stored routing tables in order to determine next hop routing. Upon receipt at an egress router, the content of the message is matched against user subscriptions for those users serviced by the egress router, and the egress router provides the data packet to those end users whose subscriptions match the content. The assigned routing labels may define routing paths or routing trees.