Course OverviewThis course introduces students to the basic principles of computer networks. Although current technologies will be discussed, the emphasis is on understanding the important concepts in modern computer networks and issues that affect design and implementation. The programming assignments require a good background in programming in C or C++ and will involve UNIX system calls. Some of the material covered in a systems programming class, as well as knowledge of operating systems (CS 502) will be assumed.
Course InformationLectures: FL-320, Mondays, 6:00pm - 8.50pm
Instructor: Prof. Emmanuel Agu, FL-139, 508-831-5568, firstname.lastname@example.org
Office Hours: Mondays 4.30 - 5.30PM. Others by appointment
Text: Required: Computer Networks (fourth edition) by A.S. Tanenbaum
Recommended: TCP/IP Sockets in C: Practical Guide for Programmers, Michael J Donahoo and Kenneth Calvert Morgan Kaufmann Publishers 2001
Academic Honesty: Cheating or plagiarism will not be tolerated and will result in an NR grade for the course. Discussing assignments and approaches to solving them is permitted, but the expectation is that programs turned in are work of that programming team. It is fine to find algorithms or code from publicly available sources such as a textbook or a public website. However, you must document the source clearly in your code and in your program documentation. Failure to do this will be treated as plagiarism.
Class Websites: The class website is at http://www.cs.wpi.edu/~emmanuel/courses/cs513/S10/. A myWPI class website has also been set up. The discussion board should be used for asking questions to avoid excessive emails and so that everyone can benefit from answers given. Emails should be used only for specific questions which are unique to you.
Class email: You have automatically been added to the class email list: email@example.com. I will use this mailing list to send information to the class. Since everyone receives email sent to this alias, judicious and courteous use of this alias is expected. It is expected that you should already be comfortable with programming in C, be able to pick up necessary systems programming constructs. I will answer questions about understanding covered concepts, policy issues and will generally not debug students' code.
- Reading is mandatory, working ahead is encouraged.
- Exams are based on lectures, readings and assignments so class attendance is strongly encouraged.
Grade Policy: 40% exams (2 exams), 45% programming assignments (3), and 15% written homeworks (3)
Programming AssignmentsThe programming assignments may be done in teams of two or you can choose to do your assignments alone. In order to form a team, both partners must consent to working together. Both partners should send me email by class time on Monday, February 1, 2010. If your partner drops the class or you would like to request a partner change, try to see me as soon as possible to avoid glitches and late assignments.
http://www.cs.wpi.edu/Help/documentation-standard.html specifies the CS Department Documentation standards. Please follow these guidelines in all your documentation. Every function or subroutine must include the author of the function. This is critical to grading team projects.
All assignments should be submitted using the turnin facility (For more info on turnin, see http://www.cs.wpi.edu/Help/turnin.html). Please include a README file with each assignment to provide information to assist the TAs in grading your programs.
All programs turned in must compile and execute on one of the WPI Unix platforms. You are encouraged to develop your programs on WPI Unix machines because historically students have had difficulties porting their programs from other operating systems and because you may be given test files that work only on the CCC machines. Turned in programs that do not compile will not be graded and will receive a grade of 0. Points will also be deducted for programs without comments.
Late Assignment CreditLate programming assignments (turned in after the start of class on the due date) will be penalized 15 percent per day. Assignments will not be accepted after the start of class on the Friday following the due date. Since solutions to written homeworks will be handed out on the due date, written homeworks will not be accepted after the due date.
Introduction (1 day) Topics: Introduction, uses and overview of networks (hardware and software) and reference models Reading: Chapter 1: 1.1 - 1.4 Physical Layer (1 days) Topics: Transmission media, public telephone network, mobile telephones and cable TV Reading: Chapter 2: 2.1 - 2.7 Data Link Layer (2 days) Topics: Data link protocols, error detection and correction Reading: Chapter 3: 3.1 - 3.4, 3.6 Medium Access Control Sublayer (1 days) Topics: Multiple access protocols, ethernet, wireless LANs, bluetooth and data link switching Reading: Chapter 4: 4.1-4.4, 4.6-4.6.2, 4.7 - 4.7.1 Network Layer (2 days) Topics: Network layer design issues, routing algorithms, congestion control Reading: Chapter 5: 5.1-5.3 Midterm Exam: April 5 (tentative) Transport Layer (2 days) Topics: transport service, sockets, internet transport protocols Reading: Chapter 6: 6.1 - 6.2, 6.4 Application Layer (2 days) Topics: email, web, Reading: Chapter 7: 7.1 - 7.3 Final Exam: May 3 Plus one "floating" day
TimelinePlease note that the following timeline is tentative. Look at the assignment write-up when handed out in order to confirm the due date.
- Feb 1, Email me indicating your programming partner
- Feb 8, Written HW 1 due
- Mar 1, programming assignment 1 due
- Mar 8, Written HW 2 due
- March 22, Programming assignment 2 due
- March 29, midterm exam review
- April 5, midterm exam
- April 12, Written HW 3 due
- April 26, programming assignment 3 due
- April 26, final exam review
- May 3, Final exam
- Admin stuff [ pdf slides ]
- Intro (Part I) [ pdf slides ]
- Intro (Part II) [ pdf slides ]
- Intro (Part III) [ pdf slides ]
- Physical layer (Part I) [ pdf slides ]
- Physical layer (Part II) [ pdf slides ]
- Sockets [ pdf slides ]
- Data Link Layer (Part I) [ pdf slides ]
- Data Link Layer (Part II) [ pdf slides ]
- Media Access Sub-Layer (Part I) [ pdf slides ]
- Media Access Sub-Layer (Part II) [ pdf slides ]
- Media Access Sub-Layer (Part III) [ pdf slides ]
- Network Layer (Part I) [ pdf slides ]
- Network Layer (Part II) [ pdf slides ]
- Midterm Exam review [ pdf slides ]
- Transport Layer (Part I) [ pdf slides ]
- Transport Layer (Part II) [ pdf slides ]
- Transport Layer (Part III) [ pdf slides ]
- Application Layer (Part I) [ pdf slides ]
- Application Layer (Part II) [ pdf slides ]
- Application Layer (Part III) [ pdf slides ]
- Application Layer (Part IV) [ pdf slides ]
- Final Exam review [ pdf slides ]
- Programming Assignment 1 pdf file
Test Video files for Programming Assignment 2
Files required for Programming Assignment 3
- An informal network programming guide that has helped some students in the past.
- NIST Net is a network emulation package that runs on Linux. NIST Net allows a single Linux PC set up as a router to emulate a wide variety of network conditions.
A collection of traceroute sites on the web.
X Traceroute for 3-d maps.