EECS 122 -
COMMUNICATION NETWORKS

Spring
2004

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.

·The
column marked “OVERALL” shows the grades normalized to the maximum of 75 points
(as per the announced grading policy). This leaves 25 points for the finals.
Towards the bottom of the column, you can see the class average and the
standard deviation.

·The
column marked “EX CR” indicates if you have received any extra project credits.
This information will be used for the borderline cases.

The finals will not include any questions on
Security, Sensor Networks, and Overlay/Peer-to-Peer Networks. For the finals,
you are responsible for all the topics covered up to and including Lecture #35
(Multicast and Scheduling).

We are very pleased to announce the
following two guest seminars during regular lectures. They should be very
helpful in understanding how the principles we have discussed in the class are
applied in practice.

Finals Schedule: Due to the conflict with
the graduation ceremony plans for some students, we will offer the finals
during 3:30-6:30 on May
22 in addition to the scheduled 12:30-3:30 slot
the same day. The location for the 3:30-6:30 slot is 385 Le Conte. Due to
the potential room size problem, only those students who have indicated their
preference for the later slot will be allowed to take the finals in that slot.

We have requested the Engineering Library to put “Unix Network
Programming,” Vol. 1 and 2 by W. Richard Stevens on 2-hour reserve. These are
good references for the Sockets programming.

Posted information on non-blocking UDP sockets in Java on newsgroup and
web.

We have created a study guide to help with the 802.11 material. We have also outlined an example showing the efficiency of the 802.11 protocol.

802.11 Wireless LANs material covered in the lectures is based on
“802.11 Wireless Networks: The Definitive Guide,” by M. Gast
(2002). This book is available in the Engineering Library on the 2-hour reserve
basis.

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

Lectures: MWF
1:00pm-2:00pm10 EVANS(25437)

Discussion Sections:

1.Tu1:00 - 2:00, 170 BARROWS
(25440) Rajarshi Gupta

2.W
4:00 - 5:00, 106 MOFFIT (25446) Rishi Kant

3.Th11:00 - 12:00 234 Dwinelle (25449) John Musacchio

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.

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.

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. Fivebi-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)