|
Time: |
Mondays 6:30pm – 9:30pm |
|
Place: |
McA 102 |
|
Instructor: |
Jeffrey N. Denenberg |
|
Phone: |
(203) 268-1021 |
|
Fax: |
(909) 363-9731 |
|
Engineering Office: |
(203) 254-4147 |
|
Email: |
|
Home Page: |
DoctorD’s Family Site at: http://doctord.webhop.net, http://doctord.AtHisSite.com:8000, or http://doctord.dyndns.org:8000 |
Prerequisites: SW131 – Intro
to Programming (or Equivalent)
Office Hours:
Engineering Office (McAuliffee) or Classroom (McAulifee 102) 5:30-6:30 Mondays (Also Thursdays). Contact me via Phone, Fax or Email at any reasonable time
Text: Peterson L. & Davie, B. Computer Networks: A Systems Approach, Morgan Kaufmann Publishers, Inc., 2003, ISBN 1-55860-832-X
Elahi, Ata Network Communication Technology, Delmar 2001, ISBN 07668-1388-6
Tanenbaum, A.S. Computer Networks 3rd edition, Prentice-Hall 1996
Topics Covered:
Layered Reference Models; network topology; communications theory; network performance protocols; packet switching (HW and SW); virtual circuits; local networks (Carrier Sense/Multiple Access, token ring); internetworking and TCP/IP
Course Objectives:
Upon completing this course the student will be familiar with current practices in data communications as well as their cost/performance tradeoffs. The student will also have been introduced to the underlying network theory including: bit error rate analysis (probability theory), throughput and delay (queuing theory), and data transmission (wired, optical and wireless)
Schedule - Fall 2004 (If the date is missing
below, install J2SE v.1.4
The Java VM Plug-in from Sun)
as of:
Homework: (available as scheduled)
Set 1
Exam and Homework Results
Summary: (as available)
HW, Exam 1, Exam 2, Final Exam and Final Grades
Class Contact List: You need a UserID and PassWord
Copy this link and use a real FTP client for reliable access. Remember to set the port Number to 2121.
Laboratory Assignments: (available as scheduled)
Supplementary Materials:
· Figures from Elahi, "Network Communication Technology ", (Thanks to Dr. Ata Elahi)
· Lecture Notes based on Peterson reference (Thanks to Dr. Larry Peterson)
· Figures from Tanenbaum, "Computer Networks", 3rd Ed. (PDF Files - Thanks to Dr. Tanenbaum)
· Information, Bandwidth and Noise
· Supplementary Note on Queuing Theory (Thanks to Dr. J. E. Beasly)
· Example Queuing Analysis - A Printer Buffer (Thanks to MathCAD)
·
Probability
and Queuing - A Full Textbook (Thanks to Ken Vastola, RPI)
This document contains much more than is needed in this course. The captured
structure is not quite complete so use the
original copy at RPI if you want to delve into any holes.
·
G.E.N.I.S.I.S - A
Detailed Discussion of SYN Attacks and Defenses (Thanks to Steve Gibson)
The original is at Steve's Web
Site.
·
Digital
Signal Encoding Formats (Thanks to Waseem Besada, Royal Institute of Technology
- Stockholm)
The original is at Waseem's
Web Site.
·
VPN
and NAT Routers (Thanks to Mike Fratto, Planet IT)
The original is at on
Planet IT's Web Site.
· NAT Routers, Dynamic IPs and FTP
· Introduction to IP6 Excerpted from Microsoft Technet
· Get IEEE Standards at IEEE Standards Online Search.
Links to Additional Materials
(Let me know if any links are broken):
· Another Forward Error-Correction example
· In my web-wanderings I came across this on-line networks course Introduction to Computer Networks by Jim Kurose. Let me know if you find it useful.
· Another supplement on Link-Level Protocols: A better (but more complex) sliding window simulation at http://www-mm.informatik.uni-mannheim.de/veranstaltungen/animation/darmstadt/sliding/applet/SlidingWindowApplet.html
·
A supplement on Token Ring
Performance
· Some supplements on CRC Polynomials and a shift register example
· If you're interested in more information about the PC's parallel (and serial) port(s), see http://www.geocities.com/SiliconValley/Bay/8302/parallel.htm and http://www.ntua.gr/electronics/hwb/co_ParallelPC.html (part of a larger hardware book).
· These pictures show hardware interfaces, but http://www.ntua.gr/electronics/hwb/hwb.html has better pictures.
· Supplementary Note on Probability Thanks to Dr. Howard F. Okrent
Grading:
40% Examinations (2 exams- lowest grade discounted,
but not ignored)
40% Final Exam
20% Homework Sets and Laboratory Assignments
There will be no make-up examinations. If you are unable to take one of the mid-term examinations on the assigned date, let me know in advance to make alternative arrangements. If you are unable to take the final examination on the assigned date, then the instructor will record a course grade of incomplete which can be redeemed by taking the final examination when the course is next offered (usually less than 1 year later).
In case of a class cancellation, use U.S. mail, e-mail, fax, or hand delivery to send in the homework assignment by the Friday following the due date. The activity scheduled for a cancelled meeting date, whether exam or lecture, is automatically postponed to the next class meeting when it is eventually held. After a cancellation, a new tentative schedule will be issued.
Late homework will be penalized 1 point/day, up to a maximum penalty of 5 points. All assignments must be turned in before the final exam to receive credit. Each reading assignment should be completed before the weekly meeting, in preparation for a pop quiz. Homework is due at the meeting following the week when it is assigned.
