Computer-Networks
October 9, 2023
Heap-Tree
October 9, 2023
Computer-Networks
October 9, 2023
Heap-Tree
October 9, 2023

Computer-Networks

Question 31

Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 5 packets each. Data packets (sent only from A to B) are all 1000 bytes long and the transmission time for such a packet is 50 µs. Acknowledgement packets (sent only from B to A) are very small and require negligible transmission time. The propagation delay over the link is 200 µs. What is the maximum achievable throughput in this communication?

A
7.69 × 106 bps
B
11.11 × 106 bps
C
12.33 × 106 bps
D
15.00 × 106 bps
Question 31 Explanation: 
Given, Tt = 50 μs, Tp = 200 μs, L = 1000 bytes, N = 5,
Transmission rate , Tt = L / B.W

Therefore, B.W. = L / Tt = 1000 bytes/ 50 μs = 8000 bits / 50 μs=160 Mbps
Efficiency = N / 1 + 2a, where a = Tp / Tt
Efficiency = 5 * 50 / (50+400) = 250/450 = 5/9
Maximum achievable throughput = Efficiency * B.W = (5/9)*160 Mbps = 88.88 Mbps =
= 11.11 x 106 bytes per second
*Actual option should be in bytes per second.
Correct Answer: B
Question 31 Explanation: 
Given, Tt = 50 μs, Tp = 200 μs, L = 1000 bytes, N = 5,
Transmission rate , Tt = L / B.W

Therefore, B.W. = L / Tt = 1000 bytes/ 50 μs = 8000 bits / 50 μs=160 Mbps
Efficiency = N / 1 + 2a, where a = Tp / Tt
Efficiency = 5 * 50 / (50+400) = 250/450 = 5/9
Maximum achievable throughput = Efficiency * B.W = (5/9)*160 Mbps = 88.88 Mbps =
= 11.11 x 106 bytes per second
*Actual option should be in bytes per second.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!