Titre
A Gambling Approach to Scalable Resource-Aware Streaming
Type
article de conférence/colloque
Institution
UNIL/CHUV/Unisanté + institutions partenaires
Auteur(s)
Allani, M.
Auteure/Auteur
Garbinato, B.
Auteure/Auteur
Pedone, F.
Auteure/Auteur
Stamenkovic, M.
Auteure/Auteur
Liens vers les personnes
Liens vers les unités
Maison d’édition
IEEE Computer Society
Titre du livre ou conférence/colloque
Proceedings of the 26th IEEE Symposium on Reliable Distributed Systems (SRDS'07)
Statut éditorial
Publié
Date de publication
2007-10
Première page
288
Dernière page/numéro d’article
300
Peer-reviewed
Oui
Langue
anglais
Résumé
In this paper we propose a resource-aware solution to achieving reliable and scalable stream diffusion in a probabilistic model, i.e., where communication links and processes are subject to message losses and crashes, respectively. Our solution is resource-aware in the sense that it limits the memory consumption, by strictly scoping the knowledge each process has about the system, and the bandwidth available to each process, by assigning a fixed quota of messages to each process. We describe our approach as gambling in the sense that it consists in accepting to give up on a few processes sometimes, in the hope to better serve all processes most of the time. That is, our solution deliberately takes the risk not to reach some processes in some executions, in order to reach every process in most executions. The underlying stream diffusion algorithm is based on a tree-construction technique that dynamically distributes the load of forwarding stream packets among processes, based on their respective available bandwidths. Simulations show that this approach pays off when compared to traditional gossiping, when the latterfaces identical bandwidth constraints.
PID Serval
serval:BIB_0B0657FA7758
URL éditeur
Date de création
2007-11-19T08:28:17.723Z
Date de création dans IRIS
2025-05-20T17:05:46Z