Which of the following statement are true for link state routing A. Link state Routing is suffer from count-to-infinity problem. B. Link state Routing uses flooding in the network to distribute link state packets. C. Each router creates its own link state packet. D. Every router has exactly the same link state database. E. Each router finds its own shortest paths to the other routers by using distance vector routing.
This question asks to identify the true statements regarding link-state routing protocols.
Based on the evaluation, statements B, C, and D are true for link-state routing.
Therefore, the correct option is the one that includes only B, C, and D.
| (i) | Parallel computing | (a) | Group of computers and devices are linked together to form a huge computer |
| (ii) | Grid computing | (b) | All the different processors have access to shared memory |
| (iii) | Cloud computing | (c) | Gets computational power just like electricity through wall sockets |
| (iv) | Cluster computing | (d) | Uses internet and remote servers to maintain data and applications |