Abstract
In large-scale distributed applications, a loosely-coupled event-based style of communication as in publish-subscribe systems eases the integration of autonomous, heterogeneous components. In a publish-subscribe system, content-based routing - where routing is based on the content of the messages - is an alternative to address-based delivery. In this paper we provide a time-dependent analysis of the identity-based routing scheme. Our analytical approach is based on continuous-time Markov chains and extends the steady-state approach by Jaeger and Mühl [7] to systems with time-fluctuating parameters. For m-ary trees with k levels, with a single publisher at the root and subscribers at the leaves, we obtain explicit closed form solutions for the time-dependent distribution of the traffic rates in the network. The results allow us to investigate, for example, the impact of time-fluctuating request rates versus time-independent request rates, and the switching point between optimality of flooding and identity-based routing.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baldoni, R., Beraldi, R., Tucci Piergiovanni, S., Virgillito, A.: On the modelling of publish/subscribe communication systems. Concurrency Computat.: Pract. Exper. 17, 1471–1495 (2005)
Boucherie, R.J., Taylor, P.G.: Transient Product Form Distributions in Queuing networks. Discrete Event Dynamic Systems: Theory and Applications 3, 375–396 (1993)
Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and Evaluation of a Wide-Area Event Notification Service. ACM Transactions on Computer Systems 19(3), 332–383 (2001)
Cugola, G., Di Nitto, E.: On adopting Content-Based Routing in service-oriented architectures. Information and Software Technology (50), 22–35 (2008)
van Dijk, N.M.: Queueing Networks and Product Forms: a system’s approach. Wiley, New York (1993)
Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.: The Many Faces of Publish/Subscribe. ACM Computing Surveys 35(2), 114–131 (2003)
Jaeger, M.A., Mühl, G.: Stochastic analysis and comparison of self-stabilizing routing algorithms for publish/subscribe systems. In: The 13th IEEE/ACM International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2005), Atlanta, Georgia, pp. 471–479. IEEE Press, Los Alamitos (2005)
Kurose, J.F., Ross, K.W.: Computer Networking: A Top-Down Approach Featuring the Internet, 2nd edn. Addison-Wesley, Reading (2003)
Massey, W.A., Whitt, W.: Networks of infinite-server queues with non-stationairy Poisson input. Queueuing Systems 13, 183–250 (1993)
Mühl, G.: Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology (2002)
Mühl, G., Fiege, L., Gärtner, F.C., Buchmann, A.: Evaluating Advanced Routing Algorithms for Content-Based Publish/Subscribe Systems. In: The 10th IEEE/ACM International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2002), pp. 167–176. IEEE Press, Los Alamitos (2002)
Mühl, G., Jaeger, M.A., Herrmann, K., Weis, T., Fiege, L., Ulbrich, A.: Self-stabilizing publish/subscribe systems: Algorithms and evaluation. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 664–674. Springer, Heidelberg (2005)
Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling Churn in a DHT. In: Proceedings of the annual conference on USENIX, Boston (2004)
Segall, B., Arnold, D.: Elvin has left the building: A publish/subscribe notification service with quenching. In: Proceedings of the Australian UNIX and Open System User Group Conference (AUUG 1997), Brisbane, Australia (1997)
Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM conference on Internet Measurement, Rio de Janeiro, pp. 189–202 (2006)
Tarkoma, S., Kangasharju, J.: On the cost and safety of handoffs in content-based routing systems. Computer Networks 51, 1459–1482 (2007)
Tarkoma, S.: Dynamic filter merging and mergeability detection for publish/subscribe. Pervasive and Mobile Computing 4(5), 681–696 (2008)
van Vliet, F., Boucherie, R.J., de Graaf, M.: Content based routing in networks with time-fluctuating request rates. Memorandum 1888, Department of Applied Mathematics, University of Twente, Enschede, ISSN 1874-4850, http://www.math.utwente.nl/publications
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Vliet, F., Boucherie, R.J., de Graaf, M. (2009). Content-Based Routing in Networks with Time-Fluctuating Request Rates. In: Núñez-Queija, R., Resing, J. (eds) Network Control and Optimization. NET-COOP 2009. Lecture Notes in Computer Science, vol 5894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10406-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-10406-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10405-3
Online ISBN: 978-3-642-10406-0
eBook Packages: Computer ScienceComputer Science (R0)