Caching in content-based publish/subscribe systems

  • Authors:
  • Vasilis Sourlas;Georgios S. Paschos;Paris Flegkas;Leandros Tassiulas

  • Affiliations:
  • Department of Computer & Communication Engineering, University of Thessaly, Greece;CERTH-ITI;Department of Computer & Communication Engineering, University of Thessaly, Greece;Department of Computer & Communication Engineering, University of Thessaly, Greece

  • Venue:
  • GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a publish/subscribe network, message delivery is guaranteed for all active subscribers at publish time. However, in a dynamic scenario where users join and leave the network, a user may be interested in content published before the subscription time. In this paper, we introduce mechanisms that enable caching in such networks, while maintaining the main principle of loose-coupled and asynchronous communication. Furthermore we investigate two caching policies; caching in all candidate brokers (basic caching) which yields high survivability and low delay and caching in leaf brokers (leaf caching) which maintains low overhead and querying complexity. The comparison is performed via simulations and testbed measurements and insights are given for future work.