CS73 - Networks and Networking

Spring 1999 Assignments

• Class 1) Read chapter 1 of Stallings.
  Re-read Eric Raymond's CatB.
  Subscribe to cs73@cs.earlham.edu

• Class 2) Read chapter 2 of Stallings. Don't focus too long on the more detailed math on this reading.

• Assignment 1 (due January 28) - 2.1, 2.3, 2.12 (just from text), 3.1, 4.4

  Describe and diagram Earlham's campus-wide physical network. Include the connections between buildings and at least one local distribution location. Be sure to describe the type of media in use, it's transmission characteristics, and the various media converters and such in use. This will grow to include other facilities within the county and more depth about each component as the semester progresses.

• Class 3) Read chapter 3 of Stallings through page 84.

  Read chapter 4 of Stallings through page 107.

• Class 4) Read chapter 6 through page 171.

• Project 1 (due February 18)

  Diagram and describe the physical networking facilities in use by Earlham and infocom within Wayne County. Physical components which should be included:

  • Telco circuits - termination points, type, capacity, etc.
  • RP&L fiber - termination points, type, capacity, etc.
  • Distribution facilities - location, type, architecture, etc.
  • Active components - what, type, interfaces, etc. (light for this round)

  This document should be structured in such a way as to facilitate describing a multi-dimensional structure composed of repeating elements. Think of them kind of like Lego pieces, a bunch of standard things connected in a variety of ways.

  Principal features of the document should include:

  • a map of the area, taking into account the different scales needed to describe both a lab and facilities downtown and elsewhere in Wayne County.
  • Diagrams of each facility
  • Descriptions of the media types
  • Descriptions of the circuit types
  • Descriptions of the active components

  Be creative, use color, read _The Visual Display of Quantitative Information_ by Edward R. Tufte. Be careful not to waste your time on fluff, focus on content.

  If you can't find something send email to me or ask me before speaking directly to the folks at the Computing Center, RP&L, or infocom. It's unfair to ask any of them to provide support to individuals for this project.

• Class 5) Catch-up on reading. Read the project description and bring any questions, etc. to class on Monday.

• Assignment 2 (due February 11) - 6.1, 6.6, 7.3, 7.17, 8.2

• Class 6) Read chapter 6 in Stallings, page 171 through the end of the chapter.

• Class 7) Read chapter 7 in Stallings.

• Class 8) Read chapter 8 in Stallings.

• Class 10) Read chapter 9 in Stallings.

• Class 13) Read chapter 10 in Stallings.

• Assignment 3 (due March 4th) - 9.1, 9.17, 10.1 (note the revision)

• Class 14) Continue reading chapter 10 in Stallings.

  Implement Djikstra's least cost algorithm, preferably in C, working in your project groups. Specifications for the program can be found here. Due March 4th.

  My solution and the analysis can be found here.

• Class 15) Continue reading chapter 10 in Stallings.

• Class 17) Read chapter 12 in Stallings before class on Monday March 22nd.

  Analyze your implementation of Dijkstra's algorithm in the same way I did. If you find improvements you could make in your program do so. Turn-in (after break) a write-up of your analysis along with a description of any changes you made to your code. If you'd like me to review the new version of the program turn that in as well.

Last updated March 11, 1999