Tal Anker and
In the 5th International Conference On Principles Of
DIstributed Systems (OPODIS), pages 143-162, Paris, France, December, 2000.
Technical Report MIT-LCS-TR-796 Massachusetts Institute of
Technology, Laboratory for Computer Science, January 2000.
This paper presents an algorithm for totally ordered multicast which
preserves Quality of Service (QoS) guarantees. The paper assumes a
QoS reservation model in which the network allows for reservation of
variable bandwidth, specified by the average transmission rate and the
maximum burst. As long as the application sends at the reserved rate,
the network guarantees to deliver messages with bounded delays. For
this model, the paper presents a totally ordered multicast algorithm
that preserves the bandwidth and latency reserved by the application
within certain additive constants that do not depend on the number of
processes participating. This is an improvement over previous work, which
gave latency bounds proportional to the number of processes.
Furthermore, the presented algorithm allows for dynamic joining and
leaving of processes while still preserving the QoS guarantees.
Download OPODIS paper:
Download technical report:
Israel mirror site:
Last modified: Mon Jul 1 14:35:59 EDT 2002