Distributed network protocols for changing topologies: a counterexample

A number of distributed network protocols for reliable data transmission. connectivity test, shortest path, and topology broadcast have been proposed with claims that they operate correctly in the face of changing topology, without the need for unbounded numbers to identify different runs of the algorithms. It is shown that the protocols do not possess all the claimed properties and that they may not terminate, because they all share a basic flaw.<
>