Gate Exam

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.
option
(A) 8 MSS
(B) 14 MSS
(C) 7 MSS
(D) 12 MSS

Read Solution (Total 0)

Gate Other Question
Consider a source computer (S) transmitting a file of size 10^6 bits to a destination computer (D)
over a network of two routers (R1 and R2) and three links (L1, L2, and L3). L1 connects S to R1; L2 connects R1 to R2; and L3 connects R2 to D. Let each link be of length 100 km. Assume signals travel over each link at a speed of 10^8 meters per second. Assume that the link bandwidth on each link is 1Mbps. Let the file be broken down into 1000 packets each of size 1000 bits. Find the total sum of transmission and propagation delays in transmitting the file from S to D?
option
(A) 1005 ms
(B) 1010 ms
(C) 3000 ms
(D) 3003 ms
The cost function for a product in a firm is given by 5q^2, where q is the amount of production. The firm can sell the product at a market price of 50 per unit. The number of units to be produced by the firm such that the profit is maximized is
option
(A) 5
(B) 10
(C) 15
(D) 25