Middleware Systems Research Group, University of Toronto, August 2011.
Working Technical Report.
Despite suffering from inefficiency and flexibility limitations, the filter-based routing (FBR) algorithm is widely used in content-based publish/subscribe (pub/sub) systems. To address these limitations, we propose a dynamic destination-based routing algorithm called DDBR, which decomposes pub/sub into two independent parts: Content-based matching and destination-based multicasting. DDBR exhibits low event matching cost and high efficiency, flexibility, and robustness for event routing for overlays with up to hundreds of brokers. We further extend DDBR to a novel routing algorithm called MERC for overlays with larger number of brokers. MERC divides the overlay into interconnected clusters and applies FBR and DDBR to route events inter- and intra-cluster, respectively. We implemented all algorithms in the PADRES pub/sub system. Experimental results show that our algorithms outperform FBR in terms of improving event dissemination throughput by up to 700% and reducing the end-to-end latency by up to 55%.