26 votes

For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors, $A$, $E$, $D$ and $G$ as $8$, $10$, $12$ and $6$ msecs respectively and updates its routing table using distance vector routing technique.

$$\overset{\textbf{Routing Table of A}}{\begin{array}{|c|r|}\hline

\text{A}&0\\ \hline

\text{B}&40\\ \hline

\text{C}&14\\ \hline

\text{D}&17\\ \hline

\text{E}&21\\ \hline

\text{F}&9\\ \hline

\text{G}&24\\ \hline

\end{array}}\qquad

\overset{\textbf{Routing Table of D}}{\begin{array}{|c|r|}\hline

\text{A}&20\\ \hline

\text{B}&8\\ \hline

\text{C}&30\\ \hline

\text{D}&0\\ \hline

\text{E}&14\\ \hline

\text{F}&7\\ \hline

\text{G}&22\\ \hline

\end{array}} \qquad

\overset{\textbf{Routing Table of E}}{\begin{array}{|c|r|}\hline

\text{A}&24\\ \hline

\text{B}&27\\ \hline

\text{C}&7\\ \hline

\text{D}&20\\ \hline

\text{E}&0\\ \hline

\text{F}&11\\ \hline

\text{G}&22\\ \hline

\end{array}}\qquad

\overset{\textbf{Routing Table of G}}{\begin{array}{|c|r|}\hline

\text{A}&21\\ \hline

\text{B}&24\\ \hline

\text{C}&22\\ \hline

\text{D}&19\\ \hline

\text{E}&22\\ \hline

\text{F}&10\\ \hline

\text{G}&0\\ \hline

\end{array}}

$$

32 votes

Best answer

35 votes

4

@vishalshrm539 I found your comment very rude and distasteful. Everyone has varying comprehensible capabilities, and if you can genuinely help, please do so, otherwise, let others help and refrain from making unnecessary remarks.

1

@vishar Consider all distances as edge weights in a bidirectional graph. D to F being $7$ does not necessarily mean that F to D will be $7$ as well. In fact, F to D is given as $12$ in the question.

0

@Puja Mishra Just take any 1 option and verify others. In above question he took example of option A, considered its neighbour and verified for other nodes. Hope it helps.