Week 7: Routing
Summary: We consider the problem of finding paths through an Internet and develop protocols to solve it.
Goals:
- Understand the problem of routing as distinct from forwarding.
- Understand the representation of the network as a graph.
- Consider the two major classes of shortest-path routing protocols: distance vector and link state routing.
- Consider the two major routing protocols: RIP and OSPF.
Monday, March 2: Distance vector routing & router implementation
Read:
- P&D 4.2.0 - 4.2.2 (p. 266 - 277)
- P&D 4.2.6 (p. 294 - 297)
Briefly answer
the following questions. Send your answers in the body of
an email to me (davisjan@cs.grinnell.edu)
by 11 a.m. Please use "CSC-364 03-02"
as the
subject line of your email. For problems, write a one-line answer. You
need not present your entire approach.
- P&D exercise 4.16
- P&D exercise 4.19
- P&D exercise 4.35
- What is the most important thing that you learned from the
reading?
- What's a question you still have about the reading?
- About how long did you spend on the reading and problems?
Tuesday, March 3, 5:30 p.m.: Abstract 6 due
Submit an abstract
on either
- RFCs 3439 and 3724, on simplicity and the future of the end-to-end argument, OR
- a pair of articles from the Internet Protocol Journal on IPv4 address space depletion,
Wednesday, March 4: Link state routing & routing metrics
Read:
- P&D 4.2.3 - 4.2.4 (p. 277 - 289)
- "Monitoring Routing Behavior" (box p. 289 - 290)
There are no WarmUp exercises. Come to class prepared to discuss the midterm.
Friday, March 6: Midterm out
Due:
Assigned:
- Midterm exam. You
should obtain the exam from Doug or Stephanie in the Science Division
Office between X a.m. and Y p.m. today. It is a 3-hour, timed,
closed-book, take-home exam. It will be due at 1:15 p.m. next Friday.
This and other rules are on the front of the exam.
Janet
Davis (davisjan@cs.grinnell.edu)
Created February 28, 2009
Last revised March 2, 2009