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.
Here
are the finals
solutions.
The
solution posted for Homework 5, problem 7 has errors. The packet delays were
calculated incorrectly. Please take at look at the corrected solutions
for homework 5, problem 7
Here are your grades so far. Please verify them. In case of any
discrepancy, send an e-mail to shyam@eecs.berkeley.edu.
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).
·
EECS Network, Fred Archibald, April
30.
·
UCB External Connectivity,
Ken Lindahl, May 7.
Finals Schedule: Due to the conflict with
the graduation ceremony plans for some students, we will offer the finals
during
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.
Posted extra specifications for Java Socket Project. Check Syllabus page.
The solutions for the midterm are available.
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
1.
Tu
2.
W
3.
Th
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.
Dr. Shyam Parekh (463 Cory, shyam@eecs)
Office Hours: M3-4, F10-11
Prof.
Jean Walrand (257M Cory
Hall, wlr@eecs)
Office Hours: Tu11-12, W2-3
Rajarshi Gupta (guptar@eecs)
Office Hours: Tu2-3, 493 Cory
Rishi Kant
(rik@berkeley.edu)
Office Hours: F12-1, 493 Cory
John Musacchio (musacchj@eecs)
Office Hours: Th1-2, 493 Cory
Course
Manager:
Dr. Shyam Parekh
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.
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.
|
Homework
Assignments (25%)
|
|
Projects
(35%)
|
|
Midterm
(15%)
|
|
Final (25%) |
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).
|
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: March 12 |
|
Final. A
comprehensive final exam: May 22, 12:30 - 3:30 pm (Place: 1 Le Conte).
|
Page last edited by Shyam Parekh on 5/23/04