Assignment #3 for Computer Networks (Fall 2003)
-----------------------------------------------


Problems #1 and #2 are THINKing problems.  For problem #3 you will
have to dust-off your calculator or favorite math package (Mathcad is
my favorite).  Problem #4 is an engineering-type problem with lots of
calculation.

Problem #1 - Solve problem #10 from Kurose and Ross (page 284).  Hint: THINK.

Problem #2 - Solve problem #11 from Kruose and Ross (page 284).  Hint: THINK.

Problem #3 - Solve problem #12 from Kruose and Ross (page 284).

Problem #4 - Assume three nodes A, B, and C.  Nodes A and B are connected
             with a 2000 mile full-duplex link.  Nodes B and C are connected
             with a 500 mile full-duplex link.  Determine the minimum
             transmission rate required between nodes B and C so that the
             buffers of B are not flooded.  The following are the parameters
             for the problem:
               * The transmission date between A and B is 100 kbps
               * The propagation is 10 microseconds per mile
               * All data frames are 1000 bits in length and ACK frames have
                 negligible length
               * Between A and B a sliding window protocol with window size 3
                 is used
               * Between B and C a stop-and-wait protocol is used
               * There are no errors.
             This problem comes from Stallings.  Hint: Define an effective
             rate Re = U * link transmission rate.  Re should be the same for
             A to B and B to C.

---