Adaptive content-based routing in general overlay topologies

29Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper develops content-based publish/subscribe algorithms to support general overlay topologies, as opposed to traditional acyclic or tree-based topologies. Among other benefits, publication routes can adapt to dynamic conditions by choosing among alternate routing paths, and composite events can be detected at optimal points in the network. The algorithms are implemented in the PADRES publish/ subscribe system and evaluated in a controlled local environment and a wide-area PlanetLab deployment. Atomic subscription notification delivery time improves by 20% in a well connected network, and composite subscriptions can be processed with 80% less network traffic and notifications delivered with about half the end to end delay. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, G., Muthusamy, V., & Jacobsen, H. A. (2008). Adaptive content-based routing in general overlay topologies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5346 LNCS, pp. 1–21). https://doi.org/10.1007/978-3-540-89856-6_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free