Tasks - Read the entire Chapter 4 in the textbook.

1. (1 pt) Review Question R3
2. (1 pt) Review Question R4
3. (1 pt) Review Question R12
4. (1 pt) Review Question R16
5. (1 pt) Review Question R17
6. (1 pt) Review Question R24
7. (1 pt) Problem P1
8. (1 pt) Problem P4
9. (1 pt) Problem P10
10. (1 pt) Problem P11
11. (1 pt) Problem P12
12. (1 pt) Problem P13
13. (1 pt) Problem P14
14. (1 pt) Problem P19
15. (2 pts) Problem P26
• Before answering this problem, practice with the Dijkstra's Link State Algorithm interactive exercise.
16. (2 pts) Problem P28
17. (2 pts) Problem P30
• some info is purposefully not provided
18. (Grads-Required; Undergrads-Extra Credit) (2 pts) Problem P55
• also calculate the minimum N such that prob[at least 2 of N multicast groups randomly pick the same address] > .9
• you are encouraged to use a symbolic computation package such as matlab to solve this question.
• Note: This problem is related to the well-known "Birthday Paradox" problem in probability - Estimate the probability that at least 2 people in a class of 50 students share the same birthday? To most people, the answer is unexpected.

Notes

1. Students are expected to work in groups of 2; special permission is required to work individually.
2. Students may get assistance from the Professor and/or the TA, and published resources such as other networking textbooks.
3. Students may NOT get assistance from other students in or not in the class.  In particular, students in different groups may NOT compare answers prior to submission.   Getting unapproved outside assistance, such as answers off the web, or comparing answers with other groups prior to submitting the assignment is considered cheating.  Once an assignment is submitted, students are permitted, and in fact encouraged, to discuss the answers with anyone they wish.
4. Answers must be legible and include work   Illegible answers and answers without work will be returned without grading or simply given little to no credit.