6.829: Computer Networks, Fall 2017

Instructors: Dina Katabi and Fadel Adib

TAs: Chen-Yu Hsu, Mingmin Zhao

Lectures: Tue/Thr 1:00-2:30pm at 32-144

Office Hours:

  • Dina and Fadel: By appointment

  • Chen-Yu: Tue 2:30-3:30pm at 32-268

  • Mingmin: Thu 4:00-5:00pm at 32-268

Course Overview

6.829 is a graduate-level introduction to classic and advanced topics in wireless and wired networks. It counts towards the TQE in Systems for CS and EE PhD students, and will also be appropriate for MEng and undergraduate students with the prerequisite background.

Topics include the principles, practices, and emerging applications in:

  • Internet of things

  • Ubiquitous sensing

  • Data center networking

  • Protocols for wireless and wired communications

  • Network security

  • Machine learning in networking


  • Please signup for lecture scribe.

  • The first lecture will be on Thursday, September 7.

About the Course


12 (3-0-9). Requirements satisfied: TQE, AUS, Grad-H subject.


6.033 or 6.02 (or equivalent). This requirement may be waived for students with strong undergraduate-level background in networked systems, with the instructor's permission. Experience with at least one programming language, such as Python or C (ideally both).

Grading policy

The class will be graded as follows:

  • Reading Questions, PSet and Scribing: 25%

  • Quiz: 25%

  • Project: 50%


Each lecture will have one assigned paper reading. All students are expected to thoroughly read the paper, and answer a few questions about the assigned paper before each lecture. This is essential to get the most out of the class!

The questions for each lecture will be posted on the Calendar page. Please submit answers using the Answer submission page. The answers are due by 12am (midnight) the night before the lecture.


We expect you to attend all lectures, unless there are pressing or unforeseen conflicts. Conflicts that are persistent (e.g., registering for another class at the same time and “splitting” attendance between them) are not excused.

Problem Sets

There will be three PSets posted on this website (see sidebar) throughout the semester. The PSets will include theory problems and a programming task (in Python or C++) that involves exploring concepts from the class. Each PSet is due on the date specified; usually this will be about 2 weeks after the PSet is published.

Late policy: You may use up to five extension days (in total) over the course of the semester for the three PSets, apportioned in any way. To claim an extension day, contact the TA. For any other late PSet, your score will be multiplied by 0.5; moreover, you must submit it within 7 days of the original due date to get any credit. If you have a note from Student Support Services, please contact the instructors. For all other circumstances (interview trips, sporting events, performances, overwork, etc.) you may use your extensions. If these days are not enough, please contact the instructors.

Collaboration policy: The PSets must be done individually. You may get help from the course staff and other students on the underlying material in the PSets, but the work you hand in must be your own. In particular, you must not copy another person's solution, code, or other work. Someone telling you the solution to a problem is also not acceptable. Copying another person's work or allowing your work to be copied by others is a serious academic offense and will be treated as such.


There will be one quiz, in-class, on Tuesday, November 14.


The term project is a key part of the class. Students will propose and conduct the project in groups of 3. The project milestones and rough timeline are as follows:

  • Proposal (1-2 pages): October 9

  • Final Presentation: December 12-13