Assume that routing tables are updated after each topological change in such a way that they are cycle-free even during updates. Does this guarantee that packets are always delivered even when the network is subject to a possibly infinite number of topological changes?
Prove that no routing algorithm can guarantee delivery of packets under continuing topological changes.
Text Book: Introduction to Distributed Algorithms By Gerard Tel.