Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup ReuseEvent
Authors:
- 8 August 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 77-84
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 algorithmsKeywords
This publication has 12 references indexed in Scilit:
- Efficient filtering in publish-subscribe systems using binary decision diagrams2005
- Analysis and Algorithms for Content-Based Event Matching2005
- A routing scheme for content-based networking2005
- On event routing in content-based publish/subscribe through dynamic networks *2004
- Subscription-driven self-organization in content-based publish/subscribe2004
- XNET: a reliable content-based publish/subscribe system2004
- Subscription summarization: a new paradigm for efficient publish/subscribe systems2004
- Forwarding in a content-based network2003
- Filtering algorithms and implementation for very fast publish/subscribe systems2001
- Matching events in a content-based subscription system1999