EECS 122 - COMMUNICATION NETWORKS

Spring 2005

---

 

Syllabus    

The syllabus page describes the topic of each lecture and has links to the lecture slides as well as to printable versions of these slides (6 per page).  We recommend that you print these versions one lecture at a time and take them along to the lectures to help you follow the material.  These printed pages are a good place for you to take notes. That page also indicates the reading material that corresponds to the lectures.

 

Announcements

*   The class newsgroup is "ucb.class.ee122" on "news.berkeley.edu". You can use the webnews proxy server with your EECS instructional Unix account login to reach the newsgroup

*   The midterm mean was 43, standard deviation 17.5, min = 4, max = 79.  If you did worse than 30, you should wonder why.

*   There is a new “Project Page

*   I wrote some Notes on QoS that explain the roles of token buckets and WFQ.

*   Here are your overall course grade and final exam score (along with all the other scores during the semester). The scores are listed by the last four digits of the SIDs (or by the last five digits if the last four digits are identical). The final exam stats are mean = 58.6, standard deviation = 14.7, min = 13, max = 87.5.

*   Here is the solution for the final exam.

*   The final exam will be held in 10 Evans (the same place as for the regular lectures) on Friday, May 20 during 12:30-3:30 PM.

*   The review session for the final will be held in 0051 Hildebrand, on Wednesday, May 18 from 6:30-8:30 PM. You can pick up your uncollected graded assignments at the review.

*   As some students could not make it to Wednesday’s review due to a conflict, there will be yet another last minute review in 141 McCone today (Thursday, May 19) from 7:00-9:00 PM. You can pick up your uncollected graded assignments at the review.

*   You have been a great class, we had fun interacting with you; thanks. We wish you all the best! 

 

Lectures: TuTh 3:30pm-5:00pm  10 EVANS (25410)

 

Discussion Sections: 

1.       M 1:00 - 2:00, 247 CORY (25413)  Daron Spektor

2.      W 10:00 - 11:00, 247 CORY (25416) Marghoob Mohiyuddin

3.      W 4:00 - 5:00, 106 MOFFIT (25419) Daron Spektor

4.      F 10:00 - 11:00, 299 CORY (25422) Marghoob Mohiyuddin

Students are expected to meet for one hour per week in one of the discussion sections led by the TAs. The goals of the discussion sections are to provide help, guidance, and hints on the homework problems and projects, and to elaborate the more subtle or difficult concepts from the lectures.
 

Instructors :

*   Dr. Shyam Parekh (485 Cory Hall, shyam@eecs)
Office Hours: F 3-4

*   Prof. Jean Walrand (257M Cory Hall, wlr@eecs)
Office Hours: Tu 2-3, W 2-3

 

Teaching Assistants:

*   Marghoob Mohiyuddin (marghoob@eecs)
Office Hours: Th 1-2, 197 Cory Hall

*   Daron Spektor (daspek@berkeley.edu)
Office Hours: M 3-4, 197 Cory Hall

 

Course Description

This course is an introductory survey of the design and implementation of computer networks. We will focus on the concepts and fundamental design principles that have contributed to the global Internet's scalability and robustness and will survey the underlying technologies --- e.g., Ethernet, Switches, and Optical Links --- that have led to the Internet's phenomenal success.

Topics include: congestion/flow/error control, routing, addressing, multicast, packet scheduling, switching, internetworking, network security, and networking programming interfaces. There will be both written and programming assignments in the class.  

The course includes a number of network simulation projects in OPNET.  There is no designated lab hour; however, students will use the lab in Cory 199 where the OPNET licenses are installed.

Textbook

The required course textbook is Computer Networks - A Systems Approach by Peterson and Davie, 3rd Edition, published by Morgan Kaufmann. Richard Stevens' books on TCP/IP programming (e.g., TCP/IP Illustrated, v1: The Protocols) are excellent references for socket programming.

Grading This is a 4-Unit Class

*

 Homework Assignments (25%)

*

 Projects (35%)

*

 Midterm (15%)

*

 Final (25%)

Prerequisites

Math 53 or 54 and CS61B. In addition, you should be able to write simple programs in C under UNIX. A rudimentary understanding of computer architecture and operating systems, while not required, would be helpful (CS61C).

Requirements

*

 Homework. Five bi-weekly homework assignments consisting of problems from the book and supplementary problems

*

 Projects. There will be one network programming project and five short OPNET-based projects (from textbook)

*

 Midterm. One midterm will be administered in class

*

 Final. A comprehensive final exam

---

 

Page last edited by Shyam on 5/22/05