Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup ReuseEvent

Authors:
Zhenhui Shen;Srikanta Tirthapura
Affiliations:
Iowa State University, USA;Iowa State University, USA
Venue:
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Year:
2006

Citing 0
Cited 5

Prefix forwarding for publish/subscribe

Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Bloom filter based routing for content-based publish/subscribe

Proceedings of the second international conference on Distributed event-based systems
Design of Content-Based Publish/Subscribe Systems over Structured Overlay Networks

IEICE - Transactions on Information and Systems
A dynamic and fast event matching algorithm for a content-based publish/subscribe information dissemination system in Sensor-Grid

The Journal of Supercomputing
Avoiding mobility-related message flooding in content-based publish/subscribe

Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Event forwarding in a content-based publish-subscribe system is an expensive task due to the need to match an event's content against registered subscriptions at every router. We introduce lookup reuse, a novel 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 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 lookup reuse reduces the event processing overhead on average by 40 to 55 percent, when used with existing content-based event forwarding algorithms.