Article in Proceedings INPROC-2009-03

BibliographyTariq, Adnan; Koldehofe, Boris; Koch, Gerald; Rothermel, Kurt: Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems.
In: Proceedings of the 16th ITG/GI Conference on Kommunikation in Verteilten Systemen 2009 (KiVS 2009).
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology.
english.
Kassel, Germany: Springer, January 2009.
DOI: 10.1007/978-3-540-92666-5_13.
Article in Proceedings (Conference Paper).
CR-SchemaC.2.4 (Distributed Systems)
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.

Full text and
other links
PDF (179552 Bytes)
The original publication is available at www.springerlink.com
Copyright Springer-Verlag 2009. This work is subject to copyright. All right are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitations, broadcastings, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German copyright Law of September 9, 1965, in its current version, and permission of use must always be obtained from Springer-Verlag. Violations are liable for prosecution under the German Copyright Law.
Department(s)University of Stuttgart, Institute of Parallel and Distributed Systems, Distributed Systems
Project(s)SpoVNet
Entry dateNovember 7, 2008
   Publ. Department   Publ. Institute   Publ. Computer Science