Introduction to Networking

Homework 3

Handed out: Th., February 9, 2006

Due back: Wed., Feb. 22^nd, 11:59pm (by email timestamp).

Submission: Electronic submission to the grader (not TA!) at d-feng@northwestern.edu.

Send your write-up as an attachment with your name on it.

Word preferred so that you can input formula/symbols with superscript and subscript. The grader will add comments and grade to your file directly.

Notes: To be done individually.

1. True and false questions:
1. In reverse path forwarding, a node will receive multiple copies of the same packet.
2. In reverse path forwarding, a node may forward multiple copies of a packet over the same outgoing link.
2. Textbook review question 4-15
3. Textbook problem 4-1

Note that connection-oriented architecture is virtual circuit, while connectionless architecture is the datagram. Both are on the network layer.

4. Textbook problem 4-22 (b), (d), (e)
5. Textbook problem 4-23
6. Textbook problem 4-24
7. Textbook problem 4-25
8. Textbook problem 4-26
9. Textbook problem 4-28
10. Textbook problem 4-31
11. Textbook problem 4-24

I include figure 4.43 which is used in the last question. You can directly add arrows/links on the graph.