Hypercube Event for Efficient Filtering in Content-Based Routing
Lists
Only you see this
Abstract
Future network environments will be pervasive and distributed over a multitude of devices that are dynamically networked. The data collected by pervasive devices (e.g. traffic data, CO 2 values) provide important information for applications that use such contexts actively. Future applications of this type will form a grid over the Internet to offer various services and such a grid requires more selective and precise data dissemination mechanisms based on the content of data. Thus, a smart data/event structure is important. This paper introduces a novel event representation structure, called eCube, for efficient indexing, filtering and matching events. We show experimental results that demonstrate the powerful multidimensional structure and applicability of eCube over an event broker grid formed in peer-to-peer networks.
BibTeX
@inproceedings{yoneki2007hypercube,
author = {Eiko Yoneki and Jean Bacon},
title = {{Hypercube Event for Efficient Filtering in Content-Based Routing}},
booktitle = {OTM Conferences},
year = {2007},
url = {https://openreview.net/forum?id=ISK33Kzwjj},
}Loading related content...