Abstract
In this paper we present a generic formal framework for filter merging in content-based routers. The proposed mechanism is independent of the used filtering language and routing data structure. We assume that the routing structure computes the minimal cover set. It supports merging of filters from local clients, hierarchical routing, and peer-to-peer routing. The mechanism is also transparent and does not require modifications in other routers in the distributed system to achieve benefits. In addition to content-based routers, the system may also be used in firewalls and auditing gateways. We present and analyze experimental results for the system.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Betz, K.: A scalable stock web service. In: Proceedings of the 2000 International Conference on Parallel Processing, Workshop on Scalable Web Services, Toronto, Canada, pp. 145–150. IEEE Computer Society Press, Los Alamitos (2000)
Bharambe, A.R., Rao, S., Seshan, S.: Mercury: A scalable publish-subscribe system for Internet games. In: Proceedings of the 1st Workshop on Network and System Support for Games, Braunschweig, Germany, pp. 3–9. ACM Press, New York (2002)
Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems 19, 332–383 (2001)
Tarkoma, S., Kangasharju, J.: A data structure for content-based routing. In: Hamza, M.H. (ed.) Ninth IASTED International Conference on Internet and Multimedia Systems and Applications, pp. 95–100. ACTA Press (2005)
Mühl, G., Fiege, L., Gärtner, F.C., Buchmann, A.P.: Evaluating advanced routing algorithms for content-based publish/subscribe systems. In: Boukerche, A., Das, S.K., Majumdar, S. (eds.) The Tenth IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2002), Fort Worth, TX, USA, October 2002, pp. 167–176. IEEE Computer Society Press, Los Alamitos (2002)
Mühl, G.: Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology (2002)
Carzaniga, A., Rutherford, M.J., Wolf, A.L.: A routing scheme for content-based networking. In: Proceedings of IEEE INFOCOM 2004, Hong Kong, China. IEEE, Los Alamitos (2004)
Böhm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33, 322–373 (2001)
Crespo, A., Buyukkokten, O., Garcia-Molina, H.: Query merging: Improving query subscription processing in a multicast environment. IEEE Trans. on Knowledge and Data Engineering, 174–191 (2003)
Wang, Y.M., Qiu, L., Achlioptas, D., Das, G., Larson, P., Wang, H.J.: Subscription partitioning and routing in content-based publish/subscribe networks. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508. Springer, Heidelberg (2002)
Wang, Y.M., Qiu, L., Verbowski, C., Achlioptas, D., Das, G., Larson, P.: Summary-based routing for content-based event distribution networks. SIGCOMM Comput. Commun. Rev. 34, 59–74 (2004)
Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 422–426 (1970)
Triantafillou, P., Economides, A.: Subscription summaries for scalability and efficiency in publish/subscribe systems. In: Bacon, J., Fiege, L., Guerraoui, R., Jacobsen, A., Mühl, G. (eds.) Proceedings of the 1st International Workshop on Distributed Event-Based Systems, DEBS 2002 (2002)
Triantafillou, P., Economides, A.A.: Subscription summarization: A new paradigm for efficient publish/subscribe systems. In: ICDCS, pp. 562–571. IEEE Computer Society, Los Alamitos (2004)
Department of Computer Science, University of Colorado: Siena Java language API and server code (2005)
Antollini, J., Antollini, M., Guerrero, P., Cilia, M.: Extending Rebeca to support concept-based addressing. In: First Argentine Symposium on Information Systems, ASIS 2004 (2004)
Mühl, G.: Generic constraints for content-based publish/subscribe systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 211–225. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tarkoma, S., Kangasharju, J. (2005). Filter Merging for Efficient Information Dissemination. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE. OTM 2005. Lecture Notes in Computer Science, vol 3760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575771_19
Download citation
DOI: https://doi.org/10.1007/11575771_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29736-9
Online ISBN: 978-3-540-32116-3
eBook Packages: Computer ScienceComputer Science (R0)