Rutgers CS 352 Spring 2006

 


Announcements

Overview

Important Dates

Lecture Notes

Homework

Projects

Old Exams

Instructors: 

 

Section 01: Richard Martin rmartin@cs.rutgers.edu    Office Hours: Monday 4-5PM
Section 05:  Xiaoyan Li      xili@cs.rutgers.edu      Office Hours:  Thursday 5:00 - 6:00 PM @ Core 340   (Please include "CS352" in your email subject line if you need to contact me.)

 

                      
TAs:

 

Section 01:                 Tuan Phan:       tphan@cs.rutgers.edu    Office Hours: Tue 5pm-6pm Hill 367
Section 05:                 Lu Han:           luhan@cs.rutgers.edu    Office Hours: Tue 5pm - 6pm, Hill 410
Section 01/05 Projects: Robert Moore:   romoore@eden.rutgers.edu  Office Hours: W 5-6pm Hill 488

 

Announcements                                     


  1. (5/08/2006) Ave. Median, Min, Max and Total points of Midterms and Final for each section have been listed below.

    Section 01
            Midterm 1: Ave. = 49.63636; Median = 47; Max = 73; Min = 26; Total = 86
            Midterm 2: Ave. = 65.66667; Median = 65; Max = 92; Min = 35; Total = 100
            Final: Ave. = 117.4444; Median = 114; Max = 153; Min = 77; Total = 170
            Project 1: Ave. = 66.4; Median = 71.5; Max = 100; Min = 10.5; Total = 100
            Project 2: Ave. = 59.0; Median = 54.5; Max = 97.5; Min = 12; Total = 100
            Project 3: Ave. = 75.79; Median = 80.5; Max = 87.5; Min = 32; Total = 100

    Section 05
            Midterm 1: Ave. = 51.08333; Median = 58; Max = 77; Min = 37; Total = 86
            Midterm 2: Ave. = 69.8; Median = 68.25; Max = 92; Min = 38; Total = 100
            Final: Ave. = 119.9444; Median = 127.5; Max = 145; Min = 81; Total = 170
            Project 1: Ave. = 69.48; Median = 63.25; Max = 100; Min = 25; Total = 100
            Project 2: Ave. = 60.08; Median = 57.63; Max = 100; Min = 22; Total = 100
            Project 3: Ave. = 71.28; Median = 84; Max = 98; Min = 20; Total = 100
     
  2. (4/26/2006) A list of topics for final exams. For the final exam, we will select 12 - 14 of the below topics.

    Layering
    HTTP
    DNS
    Switching
    Sockets
    ABP
    go-back-N
    TCP
    TCP AIMD (Additive Increase Multiplicative Decrease) schemes
    Traceroute
    CIDR
    ARP
    Routing
    ethernet back-off
    Hamming Code
    Public/Private key
    Digital signature
    Leaky bucket, Token bucket
    Queuing theory
    Kendall Notation
    Projects related
     
  3. 04/20/2006) Xiaoyan Li's office hour will move to Thursday 5:00 - 6:00 PM at Core 340.
  4. (04/17/2006) The final exam will be held on May 1, 2006 (Monday) during 6:40 - 9:40 PM in SEC 117. Makeup for the final exam will be on May 2, 2006 in the morning. Students who need to take the makeup exam should send an email to their instructor by April 23, 2006. 
  5. (04/05/2006)  A list of topics for Midterm 2 are posted here.
  6. (03/30/2006)  Project 3 posted.
  7. (03/28/2006)  Midterm 2 has been rescheduled to be on April 10, 2006 (Monday) for section 05 and April 11, 2006 (Tuesday) for section 01.
  8. (03/20/2006) Sample problems (ungraded homework 1) are posted here.
  9. 03/13/2006) Code review from Project 1 will take place on Monday, March 20 for Section 05, and Tuesday March 21 for Section 01. Code review will be during the normal lecture/recitation periods. The grades for Project 1 have been posted to gradebook.rutgers.edu.
  10. (03/07/2006) Project 2 Posted.
  11. (02/10/2006) Project 1 Posted.
  12. (01/31/2006) Midterm dates and project deadlines are posted.
  13. (01/17/2006) 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 cereal cluster, handin, and the FAS gradebook.

  • Textbook

James F. Kurose and Keith W. Ross, Computer Networking, 3rd edition.

  • 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 3 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 "handin" program 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 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

Section 01

Section 05

Mid-term 1

February 21, 2006

February 20, 2006

No electronic devices or notes allowed. No cheat sheets allowed

Project 1

March 5, 2006   5:00 PM

 

Project 2

March 26, 2006

 

Mid-term 2

April 11, 2006

April 10, 2006

No electronic devices or notes allowed. No cheat sheets allowed

Project 3

April 23, 2006

 

Final

May 1, 2006

You must send the instructor email by April 23, 2006 if you need to take the makeup!

 

Lecture Notes


Dates

Theme

Topics

Readings from Kurose

Notes

Week 01 (1/16-1/20)

Fundamentals

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

1.1-1.9

PPT    PDF

Week 02 (1/23-1/27)

Application Layer Protocols

Basic Messaging, HTTP, FTP, SMTP, DNS

2.1-2.5

PPT    PDF

Week 03

Network Programming

Sockets, Threads

2.7-2.9

PPT    PDF

Week 03/04

Reliable Data Transfer Algorithms

ABP, Go-Back-N, Selective-Repeat

3.1-3.4

PPT    PDF

Week

Transport Protocols

UDP, TCP (flow control, congestion control)

3.5-3.7

PPT    PDF

Week

IP Address

IP addresses, Routers, ICMP

4.1-4.4

PPT    PDF

Week 03/07

Routing

Routing algorithms, routing protocols

4.5-4.6

PPT    PDF

Week 03/20

Link Layer

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

5.1-5.6

PPT    PDF
PPT    PDF

 

Security

Cryptography, Authentication, Digital Signature, Firewall

8.1-8.8

PPT    PDF

 

Wireless Networks

802.11 MAC 

6.1, 6.3

PPT    PDF

 

Queue management

Leaky Bucket, Token Bucket, Fair Queuing

7.7

PPT    PDF

 

Queuing Theory

Definition, Kendall Notation, M/M/1 analysis

 

PPT    PDF

 

P2P networks

 

 

PPT    PDF 

 

review

 

 

PPT   PDF

 

 

 

 

 

 

Homework


Sample Questions 1

Sample Questions 2

 

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