CMPSCI 453/591
Computer Networking
Professor Jim Kurose
Written Homework 3
(covering lectures 11-15 [approximately])
Assigned: 11/08/05
Due: 11/15/05
Off campus: Postmarked seven days after viewing lecture 17 or receiving this
(whichever is later)
Note: Problem numbers below refer to the 3rd edition of the text.. In all written assignmens, please show as muchof your work as you can. Even if you get a wrong answer, you can get partial credit if you show your work. If you make a mistake, it will also help the grader show you where you made a mistake.
Problem 1. (10 points) Page 405, problem 8.
Problem 2. (15 points) Page 406 problem 10
Problem 3. (15 points) Page 407, problem 15.
Problem 4. (15 points) Page 408, problem 22d (note: part d only)
Problem 5. (15 points) Page 408, problem 23. However, rather than showing the distance table in node z, show the distance table in node y. Note that you do not have to compute the table using the distance vector algorithm. You only need show the final distance table computed in node y.
Problem 6. (15 points) Page 410, problem 29.
Problem 7. (15 points) Page 411, problem 33. However, rather than assuming that E is the broadcast source, assume that F is the broadcast source