COM 1337/3501: Computer Communication Networks

Spring 2003

Instructor: Rajmohan Rajaraman

113 Cullinane Hall                                                                      Work: 617-373-2075
College of Computer Science                                                 Email: rraj@ccs.neu.edu
Northeastern University                                                           Home: 617-232-8298
Boston, MA 02115                                                                      Fax:    617-373-5121

Class meeting times/location: 110 KA, TTh 5:20-7:00

Office Hours: Tuesday 12:30-1:30, Thursday 11:00-12:00

Teaching Assistant: Lujun Jia (lujunjia@ccs.neu.edu), 264 Egan, 617-373-5878
Office hours: Wednesday 2:00-4:00

Course Description Textbook Grading Exams

Calendar (includes lecture slides) Resources

Acknowledgments

Handouts

Course information

Problem Set 1 (in pdf) out 4/3, due 4/15 Programming Assignment 1 out 4/10, due 4/28
Problem Set 2 (in pdf) out 4/22, due May 6 Lab Assignment 2 out 5/15, due 5/29
Sample solution to Problem Set 1 (in pdf)
Sample solution to Problem Set 2 (in pdf)
Problem Set 3 (in pdf) out 5/13, due 5/20
Problem Set 4 (in pdf) out 5/22, due 5/29
Sample solution to Problem Set 3 (in pdf)
Sample solution to Problem Set 4 (in pdf)

Practice Problems for the Midterm (in pdf)
Sample Solution to practice problems (in pdf)
Practice Exercises for the Final (in pdf)
Sample Solution to practice exercises (in pdf)

Honors Adjunct handouts

Homework 1 (due 5/5)

Homework 1 (due 5/20)

Announcements

April 9: Final exam to be held in classroom on Tuesday, June 3, 5:20-7:20.

April 15: Richard (our TA) will be holding lab hours this week and the next for the programming assignment. These hours are

April 17: Recitation sessions will be held every Monday 5:15 to 6:15 PM in 110 KA.

April 24: The midterm will be on Thursday, May 8, in class. It will be closed-book, closed-notes. You will be allowed to bring in one 8.5" x 11" crib sheet. You can write on both sides of the sheet.

May 27: The final will be closed-book, closed-notes. You will be allowed to bring in two 8.5" x 11" crib sheets. You can write on both sides of the sheets.

Course Description

Introduces the fundamental concepts of internetworking. Presents the different harmonizing functions needed for the interconnection of many heterogeneous computer networks. Internet protocols, such as TCP, IP, ARP, BGP and IGMP, are used as examples to demonstrate how internetworking is realized. Applications such as electronic mail and the WWW are studied. Topics include: internetwork architectures, protocol implementation, addressing and address mapping, intra- and inter-domain routing, multicasting, resource allocation, transport protocols, naming, client-server model, network programming interfaces (e.g., sockets), and applications. Includes programming assignments.

Textbook

Computer Networks: A Systems Approach, by L. Peterson and B. Davie, Morgan Kauffman, 2000, 2nd edition

Grading

The course grade will be based on 4 to 5 assignments (total 45%), a midterm (20%), and a final exam (35%). The break up for the problem sets and programming/lab assignments is the following:

Problem Set 1: 6%
Problem Set 2: 10%
Problem Set 3: 6%
Problem Set 4: 5%
Programming Assignment 1: 10%
Lab Assignment 2: 8%

Exams

The midterm exam will take place on Thursday, May 8. The final will take place on Tuesday, June 3, 5:20-7:20 PM.

Acknowledgments

The lecture slides are based on the slides prepared by Guevara Noubir when he taught this class earlier. They are essentially the same, with minor modifications. The first programming assignment is partly based on material provided by Ibrahim Matta (BU) and socket programming exercises of Gary Harkin (U. of Montana). The lab assignment is partly based on material created by Kamil Sarac (UT Dallas), Kevin Almeroth (UC Santa Barbara), and Douglas Comer (Purdue).