Authors:
Ziv Bar-Joseph,
Idit Keidar,
Tal Anker and
Nancy Lynch.
In the 5th International Conference On Principles Of DIstributed Systems (OPODIS), pages 143-162, Paris, France, December, 2000.
Previous version: Technical Report MIT-LCS-TR-796 Massachusetts Institute of Technology, Laboratory for Computer Science, January 2000.
Abstract:
This paper studies the Quality of Service (QoS) guarantees of totally
ordered multicast algorithms. The paper
shows that totally ordered multicast can
coexist with guaranteed predictable delays in certain network
models. The paper considers two reservation models: constant bit rate
(CBR) and variable bit rate (VBR). For these models, the paper
presents totally ordered multicast algorithms that preserve the
bandwidth and latency reserved by the application within certain
additive constants. Furthermore, the paper presents an algorithm that
tolerates message loss (in which case, there can be gaps in the total
order) and allows for dynamic joining and leaving of processes while
still preserving the QoS guarantees.
Download paper (technical report):
ps,
ps.gz,
pdf.
MIT (USA) mirror site:
ps,
pdf,
ps.gz.
anker@cs.huji.ac.il
Last modified: Mon Feb 21 18:59:01 EST 2000