@Ruturaj Mohanty What is M?

Dark Mode

1,154 views

1 vote

Let $N$ be the number of nodes and $M$ be the number of edges. For Link state routing how many message exchanges (roughly, explained as a function of the above parameters) need to be exchanged to build the topology at each and every node in the network?

- $\text{Min } (N+M, N*M)$
- $\text{Max } (N+M, N*M)$
- $N*M$
- $N+M$

0 votes

Is it like that each node builds a link state packet for each link and floods this to all nodes in the network.?

Since, for M edges, M link state packets generated and flooded among N nodes, so total $M \times N$ message exchanges.

Is it like that?

Since, for M edges, M link state packets generated and flooded among N nodes, so total $M \times N$ message exchanges.

Is it like that?