Computer Networ...

If the value of MF is 1 and fragment offset is 0, what can be said about the type of fragment?

Which of the following is/are not true about the IP based router functionality

1. It is necessary for a router to implement either RIP or OSPF routing algorithm 

2. A router reassembles the IP packet in some special scenarios. 

Consider and IP packet arrived at a router of size 1850 bytes. If the header length field in IPv4 header is 1010 and the packet is sent to a router whose Maximum transmission unit is 160 bytes then what is the number of fragments that the IP packet will be divided?

The maximum number of IPv4 router addresses that can be listed in the record route (RR) option field of an IPv4 header is _____.

Which of the following statement is/are incorrect about the Routing Information Protocol (RIP) protocol and Open Shortest Path First (OSPF) protocol?

(P) RIP packets are sent using TCP.

(Q) OSPF packets are sent using TCP.

(R) OSPF packets are sent using UDP.

Consider the store and forward packet switched network in which bandwidth of each link is 2 × 10⁶ bytes/sec. A user on host A sends a file of size 5000 bytes to host B through routers R1, R2, and R3 in three different ways. In the first case a single packet containing the complete file is transmitted from A to B. In the second case, the file is split into 20 equal parts, and these packets are transmitted from A to B. In the third case, the file is split into 40 equal parts and these packets are sent from A to B. Each packet contains 100 bytes of header information along with the user data. Consider only transmission time and ignore processing, queuing and propagation delays. Also assume that there are no errors during transmission. Let T1, T2 and T3 be the times taken to transmit the file in the first, second and third case respectively. Which one of the following is CORRECT?

Consider two systems P and Q connected via a router R with the bandwidth of 2 Gbps. The length of the packet is 1000 bytes. The propagation delay between P and Q is 200 microseconds. The distance between the P and R is 10 km while the distance between R and Q is 5 km. The propagation speed in meter per second if each link is having the same propagation speed is _____ 10³ km/s?

Consider the following statements:

S₁: Distance vector routing is based on Dijkstra’s algorithm.

S₂: In Link State Routing, if a packet with a sequence number is higher than the highest one seen so far ever arrives, then it is rejected.

S₃: The age field in Link State packets is used to make sure no packet can get lost and live for an indefinite period of time.

S₄: Flooding technique is used in Distance Vector Routing.

S₅: Distance Vector Routing is a non-adaptive routing algorithm.

Which of the above statement(s) is/are true?