Written Exercise #1
This assignment is meant to help you review materials in the link layer,
network layer, and transport 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. 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 (sixth or fifth edition). Note that we are talking
about end-of-chapter Problems, not Review Questions.
- Chapter 5 Problem 5 (in sixth/fifth edition), note that the problem states the
wrong bit number for the generator.
- Chapter 5 Problem 8 (in sixth/fifth edition).
- Chapter 5 Problem 13 (in sixth/fifth edition).
- Chapter 5 Problem 18 (in sixth/fifth edition).
- List at least two practical scenarios in which link-layer broadcast (e.g.,
Ethernet broadcast) is needed.
- Chapter 4 Problem 26 (in sixth edition); or Chapter 4 Problem 24 (in fifth edition).
- Chapter 4 Problem 28 (in sixth edition); or Chapter 4 Problem 26 (in fifth edition).
- Chapter 4 Problem 29 (in sixth edition); or Chapter 4 Problem 27 (in fifth 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.
- Chapter 3 Problem 3 (in sixth/fifth edition).
- Chapter 3 Problem 5 (in sixth/fifth edition).
- Chapter 3 Problem 15 (in sixth edition); or Chapter 3 Problem 14 (in fifth edition).
- Chapter 3 Problem 25 (in sixth edition); or Chapter 3 Problem 23 (in fifth edition).
- Chapter 3 Problem 41 (in sixth edition); or Chapter 3 Problem 38 (in fifth edition).
- A cumulative acknowledgment of packet X tells the sender that all data up to
packet X has been received without error. A selective acknowledgment of
packet X only indicates that packet X has been received without error.
- Describe a situation that selective acknowledgment can lead to higher network
efficiency than cumulative acknowledgment does.
- Describe a situation that cumulative acknowledgment can lead to higher network
efficiency than selective acknowledgment does.