We consider here a large network of $n$ nodes which supports only the following unreliable basic communication primitive: when a node requests communication then this request {\em may fail}, independently of other requests, with probability $f<1$. Even if it succeeds, the request is answered by returning a stable link to ... more >>>