Rutgers CS 352 Fall 2009

 

Announcements

Overview

Important Dates

Lecture Notes

Homework

Projects

Old Exams

Instructor:

Richard Martin rmartin@cs.rutgers.edu    Office Hours: Tuesday, 3-4PM @ CoRE 304.

 
TAs:

All sections:                 Robert Moore:       romoore@cs.rutgers.edu    Office Hours: Wednesdays, 11:00am-12:00noon @ CoRE 335

 

Announcements                                     

  1. (11/19/2009) Mid-term 2 topics will be: IP Addressing, Routing, Link Layer and Security.

  2. (11/11/2009) Mid-term 2 has been re-scheduled for Monday, 11/23.

  3. (11/11/2009) The deadline for project 2 has been extended to 11:59pm on Friday, Nov. 13, 2009. See the sakai page for details.

  4. (11/04/2009) The deadline for project 2 has been extended to 11:59pm on Wednesday, Nov. 11, 2009. See the sakai page for details.

  5. (10/22/2009) Code review schedule is posted on the Sakai site.

  6. (10/10/2009) Mid-term 1 will cover all topics up to and including TCP congestion control; the mid-term will not cover AIMD.

  7. (10/07/2009) The old exams have been made available on the Sakai resources page, some of them are here, here, here and here. See the sakai resources page for additional exams. The TA will cover some of the exam questions during recitation.

  8. (10/04/2009) The first Midterm has been moved from Oct. 7th to Monday, Oct. 12th.

  9. (09/21/2009) Assignment 1 posted. Check the sakai page.

  10. (09/21/2009) The sakai page is up. This page contains project announcements and a discussion board.

  11. (09/09/2009) The room for recitation has been moved to SEC 206; the time is still Wed 12:15-1:10.

  12. (09/03/2009) No recitation the first week of classes.

Overview

  • Course Objectives

This course will provide students with a thorough understanding of the basic principles of computer networks, the design philosophy of the Internet, and the details of Internet protocols, and the engineering and scientific principles needed to understand computer networks. Students who complete this course will be able to describe in detail the operations of Internet protocols and develop their own Internet applications. Students will also develop an understanding of the design and construction of network programs via a semester long class project. At the end of the course, you should be capable of network programming.

  • Prerequisites

The prerequisite for CS 352 is Computer Architecture (CS 211), because of number representation, as well as Introduction to Discrete Structures II (CS 206), because students are expected to know basic probability. Students are expect to know how to program in Java and use simple data structures such as hash tables and arrays. Students are also expected to understand the department's facilities and how to use the ilab cluster, the FAS gradebook. and the Rutgers sakai courseware site.

  • Textbook

James F. Kurose and Keith W. Ross, Computer Networking, 5th edition. Note: The 4th edition is OK too.

  • Expected Work

Students are expected to attend all lectures and perform all reading assignments prior to lecture. Students are also expected to attend all recitation section meetings. Students will be evaluated according to their performance on a semester long programming project, 2 mid-term examinations, and the final examination.

  • Project

WARING: This is a project course, which means that this course should give you more than a passing knowledge of what writing working network programs entails. The project will be a major undertaking. If you complete the projects, you will have learned a lot. However, assess your commitment to this course realistically. If you don't have the time or the inclination to work hard on the project, you would be better off not taking the course. Fortunately, the project will be programmed in Java, so you will not have to learn a new programming language. You will have to learn how to build and debug a reasonably size Java program and make it robust to outside errors. You will also have to describe how your program work in both a written document as well as an oral exam.

This one large project will be assigned, as three sub-projects. Up to 2 students can work as a group for each sub-project and you can change group members for each project . Students are required to complete the parts by the scheduled deadlines. Failure to turn in the project by the deadline using the electronic handin website will result in a zero for all team members. No exceptions!

  • Working Together and Academic Honesty

    Cheating on projects and exams will not be tolerated. We want to protect the fairness and integrity of the class, so we run code similarity detectors on the projects and scrutinize exams for copying. Both parties in the exchange are liable; e.g. if you give away solutions to friends, you're putting yourself at risk too. If you get caught, it's a nasty process--- just don't go there! You're better off asking for help, or at worst, dropping the course and trying it again.

The department academic integrity policy can be found at http://www.cs.rutgers.edu/policies/academicintegrity/. You now need to click explicitly on a link when first login to our computing facilities, use handin, etc., that says you acknowledge being aware of the policy (which you can read through the login screen). If you fail to do the click-through by the end of September, your access to our facilities will cease October 1. 

  • The Gilligan's Island Rule

That said, we do encourage you to talk to your classmates, provided you follow the Gilligan's Island Rule. After a joint discussion of an assignment or problem, each student should discard all written material and then go do something mind-numbing for half an hour. For example, go watch an episode of Gilligan's Island (or Reality TV in modern terms) , and then recreate the solutions. The idea of this policy is to ensure that you fully understand the solutions or ideas that the group came up with.

If you follow the Gilligan's island rule, often best route to follow to get a question answered is to ask, in order:

1.     A classmate smarter than you.

2.     Your TA.

3.     The professor.

  • Mid-terms and Exams

Two mid-term examinations are scheduled this semester, and both are held during regular lecture hours. A cumulative final examination will be held at the end of the semester.

  • Homeworks

Written homeworks are for your practice only, we won’t grade them. It will be up to you to do them and ask the TAs and instructors about problems that you don't understand. We highly suggest doing the homeworks before getting/looking at the solutions. This will be critical for the exams. We will also post previous year’s mid-terms and finals so you can get an idea about the kinds of questions that we might ask.

  • Grading

2 Midterms: 30 % (15 % each)

Final: 35 %

Project: 35% (Part 1: 10%, Part 2: 10% and Part 3: 15%)

The programming part of the projects are typically graded on how close they are to the functional requirements. The written portion is graded on how well the TAs can figure out how your project is constructed only from the written description. Exams are typically graded on a curve. As a rule of thumb, the mean is a "C'" and each standard deviation is one letter grade. This rule can be altered, however, if the class does exceptionally well or poorly. 

Important Dates

Event

Date or Deadline

Notes

Sections 01 and 02

Mid-term 1

Monday, October 12th Wed, October 7th

No electronic devices or notes allowed. No cheat sheets allowed

Project 1

Friday October 16th

 

Project 2

Friday, November 6th Nov 13th

 

Mid-term 2

Monday, November 16th November 23rd

No electronic devices or notes allowed. No cheat sheets allowed

Project 3

Friday, December 4th

 

Final

Friday, December 18th

You must send the instructor email at least 2 weeks before the final if you need to take the makeup!

 

Lecture Notes

Dates

Theme

Topics

Readings from Kurose

Notes

Week 1:

Fundamentals

Networks (Core vs. Edge), Switching schemes, Delay Analysis, Pipelining, Layering, Encapsulation

1.1-1.9



\

PPT   PDF 

Week 2:

Application Layer Protocols

Basic Messaging, HTTP, FTP, SMTP, DNS

2.1-2.5

PPT   PDF 

Week 3:

Network Programming

Sockets, Threads

2.7-2.9

PPT   PDF 

Week 4:

Peer to Peer (P2P)

Bitorrent, Distributed Hash Tables

2.6

PPT   PDF 

Week 5:

Reliable Data Transfer Algorithms

ABP, Go-Back-N, Selective-Repeat

3.1-3.4

PPT   PDF 

Week 6:

Transport Protocols

UDP, TCP (flow control, congestion control)

3.5-3.7

PPT   PDF

Week 7:

IP Addressing

IP addresses, Routers, ICMP

4.1-4.4

  PDF

Week 8:

Routing

Routing algorithms, routing protocols

4.5-4.6

PPT   PDF

Week 9:

Link Layer

Error detection & correction, MAC sub-layer, Ethernet LANs, token-ring

5.1-5.6

PPT   PDF

 Week 10:

Security

Cryptography, Firewalls

8.1-8.8

PPT   PDF 

 Week 11:

Wireless Networks

802.11 MAC 

6.1, 6.3

   

 Week 12:

Queue management

Leaky Bucket, Token Bucket, Fair Queuing

7.7

   

Week 13: 

Queuing Theory

Definition, Kendall Notation, M/M/1 analysis

 

  

Week 14:

Web Services

 Web 2.0

 

   



 

 

  

 

 

 

 

 

 

Homework

Homework 1

Homework 2

Homework 3

Projects


Project 1


Project 2


Project 3


Old Exams

Mid-term 1

Mid-term 2

Final

Fall 2003

Fall 2002,   Spring 2004

Fall 2000,   Fall 2001,   Spring 2004