Home

Schedule/Notes

Readings

HW, exams

TA info

Policies

Special note: the first day of class will be Tuesday September 11. (Class will not meet on 9/4 or 9/6). We'll make up these missed classes later in the month.
 

Overview: This course covers advanced fundamental principles of computer networks, studying foundational material in the field. Topics include protocol mechanisms, advanced network architecture, network algorithmics, network control, network simulation, and performance analysis and measurement. The goal of this course is to teach networking fundamentals/techniques that will have a long half life (that is, whenever today's hot topic is no longer hot, the principles covered in this course will still be relevant and important).

Prerequisites: introductory (undergraduate level) courses in computer networks (e.g., CMPSCI 453), and algorithms (e.g., CMPSCI 311). Some familiarity with probability and with optimization theory will be helpful.

Instructor: Professor Jim Kurose
       Department of Computer Science
       kurose at cs . umass . edu

Class meeting time: Tu/Th 9:30 - 10:45. Some make up classes will need to be scheduled
Office hours: Tu, Th: 11:00 - 12:00 or by appointment

Class WWW site: http://www-net.cs.umass.edu/653.  We will make extensive use of the class WWW site.  You should check the WWW page on a near daily basis for updates

Class email list: There is a broadcast email list that will be used for the course: cs653_2007 at cs. umass . edu. Send email to the instructor to be added to this list. You can send broadcast email to this list simply by sending your email to this address.

Teaching Assistant: Info on our TA is here..

Textbook: There is no textbook for the course. Reading material will be posted online whenever possible. In all other cases, material will be placed on reserve.

Topics:

  • Protocols: Mechanisms. What protocol mechanisms/techniques are commonly found in networks (particularly Internet) protocols and why are they used? signaling, randomization, indirection, multiplexing, virtualization, scalability.
  • Network architecture: the big picture. Lessons from the Internet, ATM, and telephony. Circuit switching versus packet switching revisited.
  • Protocols: Network algorithmics. Self stabilization (routing examples), broadcast/controlled flooding (link state broadcast, ad hoc routing), routing and congestion control: an optimization viewpoint.
  • Simulation. Principles of discrete event simulation, analysis of simulation output, simulation pitfalls. Case study: the ns simulator.
  • Performance analysis. (time permitting) Intro to queueing: M/M/1; closed loop system models; packet versus fluid models.
Student Workload:  Material will be presented by the instructor but we are hoping for lots of lively and thoughtful class discussion. Approximately 5 written assignments and one programming assignment, a midterm exam, and a final exam.