CS 337 Assignments
Things to hand in
- Assignment 1: The Finger User Information Protocol
- Assigned 1/9, due 1/16. Submit via HSP.
Write a client and a server implementing the MFTP
protocol. You should test your client and server separately by
seeing whether they work with other people's clients and servers.
Let me know if you detect any ambiguities in the protocol.
See the main course page for information on sockets and some
client/server code examples.
- Assigned 1/21, due 1/26.
Some problems. Submit on paper.
- 2/4/98. Try out the following cnet exercise.
Bring questions to class on 2/6. Don't hand anything in.
- Assigned 2/6/98, due 2/13/98. Implement the "Go-back-n" protocol
(Tanenbaum pp. 210-211) in cnet. (You'll need to add an ack timer,
since Tanenbaum left it out for pedagogical reasons but the
protocol doesn't really work without it.) Once you have working
code, collect a table of statistics on the efficiency, delivery
rate, and average delivery time as you modify two parameters: the
sender's window size and the "probframecorrupt" link parameter.
Hand in your documented code via HSP, and your statistics and
your analysis of those statistics on paper.
- Assigned 2/23/98, due 3/4/98. Implement
neighbor discovery and link state packet flooding
in cnet.
Readings
Don't let the suggestions here limit you. If one of these readings
points you to another reference that sounds like it might answer
your questions or lead you into an interesting area, by all means
go get the new reference and read it. If you find something useful or
interesting, please alert the rest of the class via the global mail
alias cs337@mathcs.carleton.edu or the course Caucus conference.
If you print out any of the on-line resources below, please
print 2-up. For a lot of this technical stuff, I go with 4-up, but
I don't have much trouble reading tiny type.
- For Wednesday, 1/7/98.
- For Friday, 1/9/98.
- For Friday, 1/16/98. Section 3.2 (Error Detection and Correction)
of Tanenbaum.
- For Monday, 1/19/98. Section 7.1 (Network Security)
of Tanenbaum.
- For Wednesday, 1/21/98.
- Section 7.7.3 (Data Compression) of Tanenbaum.
-
Question 70 from the comp.compression newsgroup Frequently Asked Questions.
The answer to this question includes a nice introduction to Lempel-Ziv Welch compression.
- Around 1/28/98. Read Chapter 2 of Tanenbaum.
- Around 1/30/98. Read Chapter 3 of Tanenbaum.
- During the week of 2/23/98. Read RFC 1058 on RIP, RFC 826 on ARP,
and section 7 of RFC 2178 to get an idea of how neighbor discovery
is handled in OSPF, a real-life link state protocol.
Jeff Ondich,
Department of Mathematics and Computer Science,
Carleton College, Northfield, MN
55057,
(507) 646-4364,
jondich@carleton.edu