RESCUE

Design of fast and scalable content-based publish/subscribe (pub/sub) systems has been a challenging task. Content dissemination time among subscribers is the main issue in many applications. In this paper, we propose HiPub, a new approach for fast content-based pub/sub. Our approach exploits available links in the pub/sub overlay network to disseminate content among subscribers through the shortest path. We introduce two content routing techniques based on this approach. We also propose a novel representation of event space which exploits subscription covering and merging to reduce subscription storage size in nodes and speed up content matching. Simulation results show the proposed content routing approach has considerably less dissemination time. Our results also show we can achieve significant reduction in the subscription storage size and high performance matching.

PDF (pdf)