Instructor: Guevara Noubir, email: noubir@ccs.neu.edu, phone: (617) 373 5205, office: 219 Cullinane Hall.

Office Hours: Wed 1:00-3:00 PM.

Teaching Assistant: TBD

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

Course Home Page. http://www.ccs.neu.edu/home/noubir/Courses/CSG150/F03. Interested students can also look at previous course notes:  http://www.ccs.neu.edu/home/noubir/Courses/COM3510/F02, http://www.ccs.neu.edu/home/noubir/Courses/COM3510/W01 or Professor Rajaraman's lecture notes: http://www.ccs.neu.edu/home/rraj/Courses/3510/F00/.

Prerequisites: An undergraduate course in probability theory (or equivalent).

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

Grading: The course grade will be based on 6 problem sets (total 30%), a midterm (25%), and a final exam (45%).

Problem sets:  PS1 [Word, PDF], [Word, PDF], [Word, PDF], [Word, PDF], [Word, PDF], [Word, PDF].

Solutions sketch: PS1 [Word], PS2 [Word], PS3 [Word], PS4 [Word], PS5 [Word], PS6 [Word].

Problem sets are due at the beginning of class. As a general rule the penalty on a homework turned in upto a week late will be 20% and no homework will be accepted beyond 1 week past its due date. Students may discuss the problem sets with one another, but solutions should be written up separately. If a key idea is obtained from another person (other than the TA or the instructor) or from another book or paper (other than the course textbook), then the source of that idea should be cited. Solutions should be presented in a clear and concise manner.

Midterm Exam: will take place on November 3rd.

Final Exam: The final exam will take place during finals week.