Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Looking into the past: enhancing mobile publish/subscribe middleware
Proceedings of the 2nd international workshop on Distributed event-based systems
Historic data access in publish/subscribe
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Controlling historical information dissemination in publish/subscribe
Proceedings of the 2008 workshop on Middleware security
The evolution of publish/subscribe communication systems
Future directions in distributed computing
Caching in content-based publish/subscribe systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
From content delivery today to information centric networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
This paper considers cache dimensioning in the context of publish/subscribe (pub/sub) systems. We assume that each broker is equipped with a limited capacity cache and it decides upon a policy for caching and prioritizing messages. By using a request mechanism defined on top of the native pub/sub communication, a client may also request earlier published information. To study the survival time of published messages, a Markovian system model capturing the essential dynamics is defined. The model has a modular generic form which admits a variety of different policies and thus enables the calculation of their performance. For systems without message replication between the caching brokers, the distribution of message survival time is found using matrix analytic methods for solving absorbing Markov chains. For the general problem with messages copied from caches, we propose a heuristic approximation based on estimating the mean rate of copies. The approximate model is evaluated by a discrete event simulator and it is shown that for a wide set of parameters, the approximation provides a good basis for dimensioning the caches in the content-based pub/sub systems.