Question 2
Question 3
Question 4
Question 5
Question 6
Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram:
All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry for each neighbour with the weight of the respective connecting link. After all the routing tables stabilize, how many links in the network will never be used for carrying any data?
Question 7
For which one of the following reasons does Internet Protocol (IP) use the timeto- live (TTL) field in the IP datagram header
Question 8
[S1] The computational overhead in link state protocols is higher than in distance vector protocols. [S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol. [S3] After a topology change, a link state protocol will converge faster than a distance vector protocol.Which one of the following is correct about S1, S2, and S3 ?
Question 9
Question 10
Q—R1—R2—R3—HH acts as an HTTP server, and Q connects to H via HTTP and downloads a file. Session layer encryption is used, with DES as the shared key encryption protocol. Consider the following four pieces of information:
[I1] The URL of the file downloaded by Q [I2] The TCP port numbers at Q and H [I3] The IP addresses of Q and H [I4] The link layer addresses of Q and HWhich of I1, I2, I3, and I4 can an intruder learn through sniffing at R2 alone?
There are 88 questions to complete.