Explanation : Statement S1
The Distance Vector routing protocols rely on the
information from their directly connected
neighbours in order to calculate and accumulate
route information. Distance Vector routing
protocols require very little overhead as compared
to Link State routing protocols as measured by
memory and processor power while the Link
State routing protocols do not rely solely on the
information from the neighbours or adjacent
router in order to calculate route information.
I nstead, Link State routing protocols have a
system of databases that they use in order to
calculate the best route to destinations in the
network. This is TRUE
Statement S3
Distance Vector exchanges the routing updates
periodically whether the topology is change or
not, this will maximize the convergence time
which increases the chance of routing loops while
the Link State routing protocols send triggered
change based updates when there is a topology
change. After initial flood, pass small event based
triggered link state updates to all other routers.
This will minimize the convergence time that’s
why there is no chance of routing loops. This is
TRUE.
Explanation : Assume the source S & destination D are
connected through two intermediate routers
labled R. Determine how many times each packet
has to visit the network layer and data link layer
during a transmission from S to D.
Since, the router R1 contains TCP part numbers of Q and R2 contains the TCP part numbers of H at Data link layer, and with both routers contains IP addresses of Q and H at Network layer. So, only statement I2 and I3 will be true.