Modeling the communication costs of content-based routing: the case of subscription forwarding

Content-based routing (CBR) provides the core distribution support of several middleware paradigms, most notably content-based publish-subscribe. Despite its popularity, however, the performance of CBR protocols is typically evaluated through simulation, and analytical models are extremely rare in the literature. Analytical models capture formally the characteristic of the analyzed system, and are therefore worth pursuing on their own. However, they also provide very practical advantages in that they allow one to evaluate tradeoffs extensively (i.e., across many parameter combinations and across all the interesting values) without the lengthy computation times required by simulations. These benefits are particularly welcome when large-scale networks are considered. In this paper, we provide an analytical model for subscription forwarding [4], arguably the most common CBR protocol in use today and one that is often used as a baseline against which to compare new approaches. We provide closed analytical expressions for the overall network traffic required to disseminate subscriptions and propagate notifications, as well as for the message forwarding load on individual nodes. The analytical model we present is validated through simulation for networks with more than 100,000 nodes and against several combinations of the relevant parameters. Results show that our model remains within 3% of the simulated traffic (and in most scenarios well below 1%), therefore indicating that our model can effectively replace simulations. The paper is completed by some examples of how our analytical model can be used in practice, including a precise characterization of the tradeoffs between subscription forwarding and event forwarding.

[1]  Divyakant Agrawal,et al.  Meghdoot: Content-Based Publish/Subscribe over P2P Networks , 2004, Middleware.

[2]  Alexander L. Wolf,et al.  A routing scheme for content-based networking , 2004, IEEE INFOCOM 2004.

[3]  Peter R. Pietzuch,et al.  Distributed event-based systems , 2006 .

[4]  Paolo Costa,et al.  Semi-Probabilistic Content-Based Publish-Subscribe , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[5]  Alfonso Fuggetta,et al.  The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS , 2001, IEEE Trans. Software Eng..

[6]  Alexander L. Wolf,et al.  Understanding Content-Based Routing Schemes , 2006 .

[7]  Peter R. Pietzuch,et al.  Hermes: a distributed event-based middleware architecture , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[8]  Antonio Carzaniga,et al.  Content-based communication: a research agenda , 2006, SEM '06.

[9]  Gero Mühl,et al.  Stochastic analysis and comparison of self-stabilizing routing algorithms for publish/subscribe systems , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[10]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.