Abstract
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Nevertheless, many applications can yield better performance if such bounds hold with a given probability. In this paper we show how probabilistic latency bounds can be applied in the context of publish/subscribe. We present an algorithm for maintaining individual probabilistic latency bounds in a highly dynamic environment for a large number of subscribers. The algorithm consists of an adaptive dissemination algorithm as well as a cluster partitioning scheme. Together they ensure i) adaptation to the individual latency requirements of subscribers under dynamically changing system properties, and ii) scalability by determining appropriate clusters according to available publishers in the system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Anceaume, A. K. Datta, M. Gradinariu, G. Simon, and A. Virgillito. Dps: Self-* dynamic reliable content-based publish/subscribe system. Technical report, IRISA, France, 2004.
Roberto Baldoni, Roberto Beraldi, Leonardo Querzoni, and Antonino Virgillito. Efficient publish/subscribe through a self-organizing broker overlay and its application to SIENA. The Computer Journal, 50:444–459, 2007.
Jorge A. Briones, Boris Koldehofe, and Kurt Rothermel. SPINE: Publish/subscribe for Wireless Mesh Networks through self-managed intersecting paths. In International Conference on Innovative Internet Community Systems. IEEE Computer Society, June 2008.
Fengyun Cao and Jaswinder Pal Singh. Efficient event routing in content-based publish-subscribe service networks. In INFOCOM, 2004.
Nuno Carvalho, Filipe Araujo, and Luis Rodrigues. Scalable QoS-based event routing in publish-subscribe systems. In Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications. IEEE Computer Society, 2005.
Antonio Carzaniga, David S. Rosenblum, and Alexander L. Wolf. Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems, 2001.
Raphaël Chand and Pascal Felber. Semantic peer-to-peer overlays for publish/subscribe networks. In Euro-Par, pages 1194–1204, 2005.
A Corlett, D.I. Pullin, and S. Sargood. Statistics of one-way internet packet delays. Presentation at 53rd IETF, March 2002.
Ludger Fiege, Mariano Cilia, Gero Mühl, and Alejandro Buchmann. Publish-subscribe grows up: Support for management, visibility control, and heterogeneity. IEEE Internet Computing, 10:48–55, 2006.
Krishna P. Gummadi, Stefan Saroiu, and Steven D. Gribble. King: estimating latency between arbitrary internet end hosts. 2002.
Abhishek Gupta, Ozgur D. Sahin, Divyakant Agrawal, and Amr El Abbadi. Meghdoot: Content-based publish/subscribe over p2p networks. In Intl. Middleware Conference, 2004.
Márk Jelasity, Alberto Montresor, Gian Paolo Jesi, and Spyros Voulgaris. Peersim: A peer-to-peer simulator. http://peersim.sourceforge.net/.
David C. Luckham. The Power of Events: An Introduction to Complex Event Processing in Distributed Enterprise Systems. Addison-Wesley Longman Publishing Co., Inc., 2001.
Ariel Orda and Er Sprintson. QoS Routing: the precomputation perspective. In Infocom, 2000.
The SpoVNet Consortium. Spontaneous Virtual Networks: On the road towards the Internet’s Next Generation, — Information Technology, 50(6), December 2008.
Spyros Voulgaris, Daniela Gavidia, and Maarten van Steen. Cyclon: Inexpensive membership management for unstructured P2P overlays. J. Network Syst. Manage., 2005.
Jinling Wang, Jiannong Cao, Jing Li, and Jie Wu. Achieving bounded delay on message delivery in publish/subscribe systems. In International Conference on Parallel Processing, 2006.
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
Tariq, M.A., Koldehofe, B., Koch, G.G., Rothermel, K. (2009). Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems. In: David, K., Geihs, K. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92666-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-92666-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92665-8
Online ISBN: 978-3-540-92666-5
eBook Packages: Computer Science and Engineering (German Language)