André Schiper, Xavier Défago
Algorithms for solving agreement problems can be classified in two categories: (1) those relying on failure detectors that we call \emph{FD-based}, and (2) those that rely on a Group Membership Service that we call ``GMS-based''. The paper discusses the ad ...
IEEE Computer Society2001