Sunday, February 27, 14:15-15:15
at 14:00
Schreiber Building, Room 309
The new membership service was designed specifically for WANs; it is
not an extension of a LAN based service. The algorithm attains low
overhead by running in a single communication round on average.
Experimental results show that the membership service is scalable.
The service also supplies the hooks needed to provide clients with
full virtual synchrony semantics.
In the second part of the talk I will show that totally ordered
multicast can coexist with guaranteed predictable delays in certain
network models. I will discuss two QoS reservation models: constant
bit rate (CBR) and variable bit rate (VBR). For these models,
I
present totally ordered multicast algorithms that preserve the
bandwidth and latency reserved by the application within certain
additive constants. In particular, message loss, process failures
and
dynamic joining of processes are tolerated while still preserving the
QoS guarantees.
The first part of the talk is based on joint work with Jeremy Sussman,
Keith Marzullo and Danny Dolev. The second part is joint work with
Ziv Bar-Joseph, Tal Anker and Nancy Lynch.
For colloquium schedule, see http://www.math.tau.ac.il/~zwick/colloq.html