Skip to Main Content
This paper examines an approach to guarantee service integrity in insecure publish/subscribe systems using overlay multicast. The proposed mechanism constructs a delivery tree laid over both the underlying network and the predicate (subscription) graph. It uses message replication and voting to simulate a secure delivery tree in an insecure environment. We provide an algorithm to construct a minimum-cost delivery tree, analyse its performance, develop a formal model to estimate the cost of delivery of a single message, and propose heuristics to lower the computational complexity of our basic algorithm.