Performance modelling of Event-Condition-Action rules in P2P networks

This paper develops an analytical model for exploring the performance of processing Event-Condition-Action (ECA) rules in P2P environments, adopting as the main performance criterion the mean time required to complete all rule processing resulting from a top-level update submitted to one of the peers in the network. We examine the analytical modelʼs predictions of how this time varies with the network topology, number of peers, number of rules and degree of data replication between peers. We also describe a simulation of such a P2P ECA rule processing system, and the experiments with this show good agreement with the analytical predictions. The main contributions of this paper are the analytical model itself, and the results of the performance study undertaken using the model, which have been confirmed by the results from the simulator.