$74$

$(5$ marks$)$

$($c$)($i$)$ Define a routing algorithm in data networks.

$($ii$)$ Describe each of the following routing algorithms:

$($I$)$ isolated; Q

$($II$)$ distributed. purty $($hin s ufank $(5$ marks$)$

$($d$)$ Figure $3$ shows routing paths followed by a packet to its destination. The weighting metrics proportional to each path delay is indicated.

Determine the:

$A+B+F+G=4$

$A+C+G=7$

$A+D+C+G=9$

$A+D+C+E+G=11$

$A+C+E+G=8$

$($i$)$ delay for each of the alternate path;

$($ii$)$ shortest path from source to destination.

$A+B+F+G$

$(7$ marks$)$