Data Rate Between B & C for Node Flood Prevention

[bos1234]

This is a question from a past exam paper I have.

In a communication system the distance between Node A and Node B is 400 km. The distance between Node B and Node C is 1000 km. Frames are generated at Node A and sent to Node C through Node B. Determine the minimum data rate required between Nodes B and C so that buffers of Node B are not flooded, based on the following: The data rate between A and B is 1000 kb/s. The propagation delay is
5μs/km for both lines. There are full-duplex lines between the nodes. All data frames are 1000 bits long. ACK frames are separate frames of negligible length. Between A and B, a sliding window protocol with a window size of 3 is used. Between B and C, stop-and-wait is used. There are no errors. Hint. In order not to flood the buffers of B, the average number of frames entering and leaving B must be the same over a long interval.

 

[berkeman]

This is a question from a past exam paper I have.

In a communication system the distance between Node A and Node B is 400 km. The distance between Node B and Node C is 1000 km. Frames are generated at Node A and sent to Node C through Node B. Determine the minimum data rate required between Nodes B and C so that buffers of Node B are not flooded, based on the following: The data rate between A and B is 1000 kb/s. The propagation delay is
5μs/km for both lines. There are full-duplex lines between the nodes. All data frames are 1000 bits long. ACK frames are separate frames of negligible length. Between A and B, a sliding window protocol with a window size of 3 is used. Between B and C, stop-and-wait is used. There are no errors. Hint. In order not to flood the buffers of B, the average number of frames entering and leaving B must be the same over a long interval.

How would you approach the problem? Remember, you are required to do the bulk of the work on your question...