This technical report presents an algorithm that solves consensus among
three processes under restricted omissive link failures. The problem
was posed by Schmid and Weiss (TR110), who distinguished two types of systems,
R-type resp. S-type, which are characterized by the fact that out of
the three processes, in each round one may fail to receive (R-type)
resp.\ send (S-type) values from resp. to its peers. In both systems,
there is one process which never fails, but the processes do not know
which one. Whereas one can give an impossibility proof for the R-type
system, it turns out that the S-type system has a solution which even
works in a slightly weaker link failure setting. This report presents
an algorithm that solves the consensus problem in the S-type system
and proves that the algorithm does indeed achieve consensus.