Chapter 11 Exercises

Chapter 11 Exercises - c Continuous flow control with a...

This preview shows pages 1–4. Sign up to view the full content.

1 Chapter 11 Exercises Exercise 1 Consider a half duplex point to point link using a stop and wait scheme, in which a series of messages is sent. With each message segmented into a number of frames. Ignore errors and frame overhead. a) What is the effect on line utilization of increasing the message size so that fewer messages will be required? Other factors main constant remain constant. b) What is the effect on line utilization of increasing the number of frames for a constant message size? hat is the effect on line utilization of increasing frame size? c) What is the effect on line utilization of increasing frame size?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Chapter 11 Exercises Exercise 2 A channel has a data rate of 4 kbps and a propagation delay of 20 ms. For what range of frame sizes does stop and wait give an efficiency of at least 50%?
3 Chapter 11 Exercises Exercise 3 Consider the use of 1000 bit frames on a 1 Mbps satellite channel with a 270 ms delay. What is the maximum link utilization for: a) Stop And Wait protocol? b) Continuous flow control with a window size of 7?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: c) Continuous flow control with a window size of 127? ) ontinuous flow control with a window size of 255? d) Continuous flow control with a window size of 255? 4 Chapter 11 ‐ Exercises Exercise 4 In figure 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 the buffers of node B are not flooded, based on the following : ± The data rate between A and B is 100kbps. ± The propagation delay is 5 μ s/km for both lines. ± There are full duplex lines between the nodes. ll data frames are 1000 bits long; ACK frames are separate frames of ± 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 sed. used. ± Between B and C stop ‐ and ‐ wait is used. ± There are no errors. 000 km 000 km A B C 4000 km 1000 km...
View Full Document

{[ snackBarMessage ]}

Page1 / 4

Chapter 11 Exercises - c Continuous flow control with a...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online