Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup ReuseShen, Zhenhui and Tirthapura, Srikanta (2006) Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup Reuse. Publisher UNSPECIFIED. Full text available as:
AbstractEvent forwarding in a distributed content-based publish-subscribe system is an expensive task due to the need to match an event's content against a large set of registered subscriptions at every router. We introduce lookup reuse, a new approach to improve the efficiency of event forwarding. Lookup reuse enables faster event forwarding through reusing matching results computed by upstream routers in making forwarding decisions at downstream routers. In many cases, this lets downstream routers replace an expensive content-match operation with a much cheaper hash-table lookup. We investigate the integration of lookup reuse into existing content-based event forwarding algorithms. Our simulations show that when used with two popular content-based event forwarding algorithms, the k-d tree and the counting algorithm, lookup reuse results in an average reduction in event processing overhead of 40 percent and 55 percent respectively.
Archive Staff Only: edit this record |
