ABSTRACT
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.
- http://peersim.sourceforge.net.Google Scholar
- A. Carzaniga and C. P. Hall. Content-Based Communication: a Research Agenda. In In Proc. of Software Engineering and Middleware Workshop (SEM), November 2006. Google ScholarDigital Library
- A. Carzaniga, A. J. Rembert, and A. L. Wolf. Understanding Content-Based Routing Schemes. Technical Report 2006-05, University of Lugano, September 2006.Google Scholar
- A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and Evaluation of a Wide-Area Event Notification Service. ACM Trans. on Computer Systems, 19(3):332--383, 2001. Google ScholarDigital Library
- A. Carzaniga, M. Rutherford, and A. Wolf. A routing scheme for content-based networking. In Proc. of INFOCOM, 2004.Google ScholarCross Ref
- P. Costa and G. P. Picco. Semi-probabilistic content-based publish-subscribe. In Proc. of the 25th Int. Conf. on Distributed Computing Systems (ICDCS), June 2005. Google ScholarDigital Library
- G. Cugola, E. Di Nitto, and A. Fuggetta. The JEDI Event-Based Infrastructure and its Application to the Development of the OPSS WFMS. IEEE Trans. on Software Engineering, 27(9):827--850, September 2001. Google ScholarDigital Library
- A. Gupta, O. Sahin, D. Agrawal, and A. El Abbadi. Meghdoot: content-based publish/subscribe over P2P networks. In Proc. of the 5th Int. Conf. on Middleware, 2004. Google ScholarDigital Library
- M. Jaeger and G. Mühl. Stochastic Analysis and Comparison of Self-Stabilizing Routing Algorithms for Publish/Subscribe Systems. In Proc. of the 13th IEEE Int. Symp. on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), 2005. Google ScholarDigital Library
- G. Mühl, L. Fiege, and P. R. Pietzuch. Distributed Event-Based Systems. Springer, August 2006. Google ScholarDigital Library
- P. Pietzuch and J. Bacon. Hermes: A Distributed Event-Based Middleware Architecture. In Proc. of the 2nd Int. Workshop on Distributed Event-Based Systems, 2002. Google ScholarDigital Library
Index Terms
- Modeling the communication costs of content-based routing: the case of subscription forwarding
Recommendations
A Redundant Multipath Routing for Mobile Ad Hoc Networks
IMSCCS '08: Proceedings of the 2008 International Multi-symposiums on Computer and Computational SciencesMultipath routing provides more advantages for mobile ad hoc networks. We address the issue of enhancing route survivability and fault tolerance for packet reliable transmission, and propose the k-redundant multipath model which constructs multiple ...
Hypercube Communication Delay with Wormhole Routing
We present an analytical model for the performance evaluation of hypercube computers. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second generation hypercube systems. Probability of blocking and average ...
Analytical performance modeling of de Bruijn inspired mesh-based network-on-chips
This paper proposes and evaluates a de Bruijn inspired topology as an efficient alternative to the popular mesh topology for Network-on-Chips (NoCs). The proposed topology (1) provides logarithmic diameter for NoC, (2) offers better performance under ...
Comments