Assume that routing tables are updated after each topolugical change in such a way that they are cycle-frec even durng updates. Does thas guarantee that packets are always delvered 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 topologrcal changes.