03000CS306052002

PART D
Answer any two full questions, each carries 9 marks.

12 a) Build the routing table for node C in the given network using Link State

13

14

15

16

17

a)

b)
௦)

Algorithm. Show step wise progress of the table’s tentative and confirmed list

with explanation.

Enumerate the additional features added by OSPF to the basic link state
algorithm.
Compare datagram network with virtual circuit network.
Specify the significance along with the size of the following fields in an IP
packet header: DF, MF, Fragment offset, Time-to-live.
How does Random Early Detection work?
Illustrate the working of leaky bucket algorithm with the help of diagram.
PART E
Answer any four full questions, each carries10 marks.
Give the significance of RARP.
Compare the working of BOOTP and DHCP.
Draw the IPv6 header. Explain the purpose of the fields flow label and hop
limit.
How is the issue of very large IPv6 packets resolved at routers?
Is there any checksum field included in the packet header of IPv6? Justify
your answer.
List the additional issues that an external gateway routing protocol has to deal
with.
Describe stub networks, multi-connected networks and transit networks.
BGP easily solves count-to-infinity problem. Justify the statement by

explaining the working of BGP with the help of an example.

Page 2 of 3

(6)

(3)

(3)
(6)

(3)
(6)

(4)
(6)
(6)

(2)
(2)

(2)

(3)
(5)