____ is advantageous when a copy of a packet needs to get to all nodes.
A) Flooding
B) Dijkstra's least-cost
C) Dijkstra's shortest-path
D) Dijkstra's maximum-cost

Question

Quizplus · Accepted Answer

Flooding is the most suitable choice when a copy of a packet needs to reach all nodes in the network. Flooding involves broadcasting a packet to all nodes in the network, ensuring that all nodes receive the packet. Although this may result in some redundancy, it is an efficient way to distribute information to all the nodes. On the other hand, Dijkstra's algorithms are used to find the shortest or least-cost path through a network, which is not relevant to distributing packets to all nodes.

____ Is Advantageous When a Copy of a Packet Needs