×

Dynamic and evolutionary placement in an event-driven component-oriented network data processing system

  • US 7,979,578 B2
  • Filed: 09/02/2009
  • Issued: 07/12/2011
  • Est. Priority Date: 09/02/2009
  • Status: Expired due to Fees
First Claim
Patent Images

1. A computer implemented method for dynamic and evolutionary component placement in an event processing system that has at least one producer, at least one consumer, a plurality of nodes and a plurality of links between the at least one producer and the at least one consumer, and a flow graph that represents a plurality of operator components to be executed between the at least one producer and the at least one consumer, the computer implemented method running, in a decentralized manner without requiring any global state or centralized controller, on the plurality of nodes of the event processing system, comprising:

  • receiving a description of at least one change to the event processing system;

    identifying, at each node of the plurality of nodes, a plurality of next-hop neighbor nodes for each at least one consumer;

    assigning a routing value to each of the identified plurality of next-hop neighbor nodes for each at least one consumer to form routing values, and the routing values are updated according to an update rule where the update rule is adaptively selected in response to current network conditions from among a plurality of update rules available at the consumer, and the probability of selecting an update rule depends on the success of the update rule in allowing routing probes to create many different and efficient routes;

    estimating, using the routing values in a context of the at least one change to the event processing system, a performance cost of the event processing system based on at least one hypothetical changed placement of the operator components of the flow graph at nodes along at least one path from a producer to a consumer through the next-hop neighbor nodes for each at least one consumer;

    autonomously orchestrating, from each producer, hypothetical placement and evaluating the performance cost of the at least one hypothetical changed placement and on the basis of the evaluation autonomously evolving at least one parameter with respect to the at least one hypothetical placement in response to changes in the data, network or other characteristics to improve the performance cost of the at least one hypothetical placement; and

    responsive to the autonomously orchestrating and evaluating hypothetical placement, selecting a changed placement of the operator components of the flow graph that minimizes the performance cost of the event processing system relative to the at least one hypothetical changed placement.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×