Question: Create a table as in 6.3.1 Simple fixed-window-size analysis for a network AR1R2R3B. The AR1 link is infinitely fast. The R1R2 and R3B links have
Create a table as in 6.3.1 Simple fixed-window-size analysis for a network AR1R2R3B. The AR1 link is infinitely fast. The R1R2 and R3B links have a bandwidth delay of 1 packet/second with no additional propagation delay. The R2R3 link has a bandwidth delay of 1 packet / 2 seconds, and no propagation delay. The reverse BA direction (for ACKs) is infinitely fast. Assume winsize = 6. (http://intronetworks.cs.luc.edu/current/html/slidingwindows.html#fixed-window-size)
(a). Carry out the table for 10 seconds. Note that you will need to show the queue for both R1 and R2.
(b). Carry out the pattern at least partially until T=18, in sufficient detail that you can verify that RTTactual for packet 8 is as calculated in exercise 5.0. To do this you will need more than 10 packets, but fewer than 16; the use of hex labels A, B, C for packets 10, 11, 12 is a convenient notation.
Hint: The column for R2 sends (or, more accurately, R2 is in the process of sending) should look like this:
| T | R2 sends |
|---|---|
| 0 | |
| 1 | 1 |
| 2 | 1 |
| 3 | 2 |
| 4 | 2 |
| 5 | 3 |
| 6 | 3 |
| ... | ... |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
