Written Exercise #1
This assignment is meant to help you review materials in the link layer and
network layer. It can also help you to prepare for the midterm exam, but
note that it does not contain all materials that you need to review for the
midterm. In particular, it does not contain any questions concerning the
transport layer. You don't have to turn in this assignment (and we will
not grade it even if you do). We will not post the solutions either.
However, you are welcome to come to meet with the TA or the instructor to
discuss your solutions and any questions you might have.
This assignment includes a number of end-of-chapter problems in the textbook
by Kurose and Ross (fifth or fourth edition). Note that we are talking
about end-of-chapter Problems, not Review Questions.
- Chapter 5 Problem 5 (in fifth edition), note that the problem states the
wrong bit number for the generator; or Chapter 5 Problem 5 (in fourth edition).
- Chapter 5 Problem 8 (in fifth edition); or Chapter 5 Problem 7 (in fourth edition).
- Chapter 5 Problem 13 (in fifth edition); or Chapter 5 Problem 11 (in fourth edition).
- Chapter 5 Problem 22 (in fifth edition); or Chapter 5 Problem 17 (in fourth edition),
we assume the signal propagates in the physical wire at the speed of 1.8 * 10^8 meters/second.
- List at least two practical scenarios in which link-layer broadcast (e.g.,
Ethernet broadcast) is needed.
- Chapter 4 Problem 24 (in fifth edition); or Chapter 4 Problem 22 (in fourth edition).
- Chapter 4 Problem 26 (in fifth edition); or Chapter 4 Problem 24 (in fourth edition).
- Chapter 4 Problem 27 (in fifth edition); or Chapter 4 Problem 25 (in fourth edition).
- Network latency triangular inequality.
- Consider a network that employs shortest-path routing (e.g., the routing
path between two nodes is the shortest-latency path between them). For three
machines A, B, and C, let lAB
be the network latency between A and B; let lBC
be the network latency between B and C; let lAC
be the network latency between A and C. Is it possible for
lAB + lBC < lAC?
Explain your answer.
- Consider the practical wide-area Internet routing. lAB,
lBC, and lAC are defined as in (a).
Is it possible for lAB + lBC < lAC?
Explain your answer.