COM 3510: Computer Networks: Theory, Modeling, and Analysis

Fall 2000

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

Class meeting times/location: Th 6:00-9:00, 7 Snell Library

Office Hours: Tu 5:00-6:00 and Th 2:00-3:00

Prerequisites

Course Description

Textbook

Grading

Handouts (in postscript)

Course information               Problem Set 1                       Lecture 1
Tentative schedule               Problem Set 2                       Lecture 2
Books for reference              Sample Solution to PS1         Lecture 3
Questionnaire                        Solution to PS1:7-8                Lecture 4
                                             Sample Solution to PS2         Lecture 5
                                              Practice Problems                  Lecture 7
                                             Hints for Practice Problems    Lecture 8
                                             Problem Set 3                        Lecture 9
                                              Problem Set 4
                                             Sample Solution to PS3
                                             Problem Set 5
                                             Sample Solution to PS4
                                             Practice Problems for Final
                                             Sample Solution to PS5
                                            Solution to Problem 5 of PS4 (in pdf)
                                            Sample solution to Midterm
                                            Hints for Final practice problems

Prerequisites

The official prerequisite is an undergraduate course in probability theory (or equivalent). Furthermore, you are expected to have some degree of mathematical sophistication and to be comfortable with calculus, mathematical arguments, and proofs. If you do not satisfy the prerequisite, you need to get approval from the instructor to enroll for the course.

Course Description

This course provides a graduate-level introduction to the theory, modeling, and analysis of computer networks. Topics covered will include the following.

Introduction to the 7-layer OSI architecture.

Error detection, retransmissions, and framing: Link layer protocols such as HDLC and PPP.

Introduction to Markov chains and queueing theory.

Packet-level scheduling: Generalized Processor Sharing and Weighted Fair Queueing.

Multiple access schemes: MAC layer protocols Aloha, Ethernet, token rings, and wireless networks.

Routing algorithms: Dijkstra's and Bellman-Ford algorithms; Network layer protocols RIP and OSPF.

Flow control: Sliding window and leaky bucket protocols; TCP congestion control.

Required Textbook

Data Networks, by D. Bertsekas and R. Gallager, Prentice-Hall 1992.

Grading

The course grade will be based on four problem sets (total 30%), a midterm (25%), and a final exam (45%). Problem sets are due at the beginning of class. As a general rule, any problem set turned in up to 1 week late will be penalized 20%, and no homework will be accepted beyond 1 week past its due date.

Exams

The midterm will take place on Thursday, November 2, 7:00-9:00 PM in class. The final exam will take place on Thursday, December 14, during finals week.