CSE 434: Computer Networks (Fall 2009)

Lecture M, W 2:00 P.M. - 3:15 P.M. BYAC 150
Instructor Sandeep Gupta
Office BY522
Email Sandeep.Gupta@asu.edu
Office Hours M, W 3:15 P.M. - 4:45 P.M.
TA Su Jin Kim (Su.Kim@asu.edu)
TA Office BY517AD
TA Office Hour T, TH 10:30 - 12:00 P.M.

Announcements

  • [12-02-2009] The final report of the project is extended to Noon, Dec. 11th, 2009.
  • [11-30-2009] The third programming assignment is extended to Noon, Dec. 4th, 2009 instead of Dec. 2nd, 2009.
  • [11-23-2009] The presentation schedule for the project has been posted here.
  • [11-18-2009] The third programming assignment has been posted. It is due on Wednesday, Dec. 2nd, 2009.
  • [11-02-2009] We extended the phase 2 report deadline to Monday, Nov. 16th, 2009 instead of Nov. 9th.
  • [10-21-2009] The fourth homework has been posted here.
  • [10-21-2009] The grades for midterm 1 have been uploaded. Please check your grade and contact TA if you have any questions or doubts.
  • [10-05-2009] The third homework has been posted here. Some questions require to read a section in the book. If you need a copy, contact the TA (su.kim@asu.edu).
  • [09-30-2009] The group list for the term project has been posted here.
  • [09-28-2009] We will have a socket programming session at 5:00pm on Tuesday, September 29, 2009. The location is BYENG 528.
  • [09-24-2009] The second programming assignment has been posted. It is due on Wednesday, October 07, 2009.
  • [09-23-2009] The project description has been posted here.
  • [09-16-2009] The first programming assignment has been posted. It is due on Monday, September 21, 2009.
  • The second homework has been posted. It is due on Monday, September 14, 2009.
  • We will have a quiz on topics covered so far in the class on Wednesday, Sep. 2, 2009.
  • I have sent the email to invite you to the google group. Please check your email and join the group immediately. If you did not get the invitation yet, please visit here and send the request to the TA.
  • Please check this page regularly.


Class Blog



Scores



Course Description

The emphasis of this course is on understanding the Internet protocols. The course will follow the textbook and take a top down approach. The students will understand the layered architecture of the Internet protocol stack and the important protocols which make the Internet work such as TCP, IP, and DNS. They will understand the various service models supported by the Internet and the applications such as WWW and Internet email which use them. The course will also cover various LAN technologies and Internet hardware such as routers, switches and hubs. If time permits, topics on multimedia applications, Internet security, and network management will also be covered.


Required Text:
  • Computer Networking: A Top-Down Approach Featuring the Internet by James F. Kurose and Heith W. Ross (Pearson Education, Inc. )

Grading

The following grading rubric will be used to evaluate all the submitted material and performance tasks:
A+: Student shows superior understanding of purpose and significance of the problem; is able to identify related problems; has solved the problem using novel approach and insight.
A: Student shows good understanding of purpose and significance of the problem; is able to identify related problems; has solved the problem displaying some degree of insight.
B: Student can solve the problem with some sophistication but is unable to judge its importance.
C: Student lacks understanding of how to approach the problem or proposes very naive solutions for the problem.

The final letter grade will be assigned based on weighted average of the grades obtained in the following categories:
Homework 40%
Term Project 20%
Exam 40% (Midterm 1: 10%, Midterm 2: 10%, Final: 20%)
Quiz 5% (will be a part of Homework or Exam.)


Notice: the above description is not finalized and subject to change. Student should check back this page on a regular basis.



Assignment Points Date Assigned Due Date Files
Homework
#1 Aug. 26, 2009 Aug. 31, 2009 CSE434--HW01.doc
#2 Sep. 2, 2009 Sep. 14, 2009 CSE434--HW02.pdf
#3 Oct. 5, 2009 Oct. 12, 2009 CSE434--HW03.pdf
#4 Oct. 21, 2009 Nov. 4, 2009 CSE434--HW04.pdf, HW04--package.zip
Programming Assignment
#1 Sep. 16, 2009 Sep. 21, 2009 CSE434--PA1.pdf
#2 Sep. 24, 2009 Oct. 07, 2009 CSE434--PA2.pdf, PA2-package.zip
Socket Programming Basics
#3 Nov. 18, 2009 Dec. 04, 2009 CSE434--PA3.pdf, CSE434--PA3-package.zip
Project Description Group list
#1 4% Oct. 19, 2009 Requirement
#2 6% Nov. 16, 2009 Requirement
#3 10% Dec. 11, 2009 Requirement
Mid-term
#1 Oct. 14, 2009
#2 Nov. 9, 2009
Final exam Monday, Dec 14
(12:10 - 2:00 PM)

Course Outline:
Content Description
Computer Networks and the Internet Layered Architecture, Protocol, Delay and Packet Loss
Application Layer Application Layer Protocols, HTTP, FTP; DNS, Introduction to Socket Programming
Transport Layer Transport Layer Services and Principles, UDP, TCP, Congestion Control
Network Layer and Routing Routing, Internet Protocol (IP), Routing in the Internet, Routers, Multicast Routing
Link Layer and Local Area Networks Error Detection and Correction, Media Access Control (MAC) Protocols, Ethernet, CSMA/CD, Wireless LAN, IEEE 802.11
Multimedia Networking (Covered only if time permits) Combination of client buffers, packet sequence numbers and timestamps. Forward error correction and packet interleaving. RTP and H.323 protocols, scheduling and policing mechanisms.
Network Security (Covered only if time permits) Introduction to Cryptography, Network Intrusion Detection
Network Management (Covered only if time permits) Network manager, managed remote devices, management information bases (MIBs), remote agents that report MIB information and take action under the control of the network manager, and a protocol for communicating between the network manager and the remote devices.

Lecture Notes

Week Class # Date Topics Materials
1 1 08/24 Course Introduction Slide, Lecture audio
2 08/25 The History and Future of the Internet Slide
2 3 08/31 Network Basics, Switched Networks, and Multiplexing (Chap. 1 and Peterson & Davie's book) Slide, Lecture audio
Computer Networks by Peterson & Davie (See Sample Chapters)
4 09/02 Chap. 1 - Internet, Protocol Layers, Network Structure, and Performance Slide, Lecture audio
3 5 09/09 Chap. 1 and 6 - HW1 discussion, Loss and Delay and Wireless Communications Slide, Lecture audio
4 6 09/14 Chap. 1 - Network Security and Protocol Layering Basics Slide, Lecture adio
7 09/16 Chap. 1 and 2 - Network Security, Protocol Layers, and Application Layer Basics Slide, Lecture audio
5 8 09/21 Chap. 2 - Addressing and DHCP Slide, Lecture audio
9 09/23 Chap. 2 - Addressing - Cont. and NAT Slide, Lecture audio
6 10 09/28 Chap. 2 - DNS and HTTP Slide, Lecture audio
11 09/30 Chap. 2 - HTTP, Electronic Mail and P2P intro. Slide, Lecture audio
7 12 10/05 Chap. 2 - P2P Cont. Slide
13 10/07 Chap. 2 and 4 - P2P Cont. and Network Layer Intro. Slide, Lecture audio
8 14 10/12 HW3 discussion and Midterm Review
15 10/14 Midterm 1
9 16 10/19 Chap. 4 - Network Layer Intro. and Routing Protocols Slide, Lecture audio
17 10/21 Midterm Discussion Slide
10 18 10/26 Chap. 4 - Routing Algorithms Slide
19 10/28 Chap. 4 - Router and Routing (Cont.) Slide
11 20 11/02 Chap. 4 - Multicast and Broadcast Slide, Lecture audio
21 11/04 Chap. 5 - Link Layer Intro. Slide, Lecture audio
12 22 11/09 Midterm 2
13 23 11/16 Chap. 5 - Link Layer Intro. (Cont.), Ethernet, Switches, VLAN, and Virtualization Slide, Lecture audio
24 11/18 Chap 3 - Transport Layer Intro. and Reliable data transfer Slide, Lecture audio
14 25 11/23 Chap 3 - Reliable data transfer Slide, Lecture audio
26 11/25 Chap 3 - TCP Slide
15 27 11/30 Chap 3 - TCP (Cont.): Congestion control and Fairness Slide
28 12/02 Project Presentation Slides
16 29 12/07 Project Presentation Slides




Policy on Cheating

Any incidence of cheating in this class will be severely dealt with. This applies to homework assignments, programming assignments, quizzes and tests. The minimum penalty for cheating will be that the student will not obtain any credit for that particular assignment. (This means that if in a test and/or assignment a student is found have cheated, he/she will obtain zero in that test and/or assignment.) For the homework and the programming assignments students may discuss the problems with others, but one is expected to turn in the results of one's own effort (not the results of a friend's efforts). One tends to get very suspicious if two identically wrong results show up in the homework assignment and/or tests. The names of the offenders will be maintained in the departmental files. The repeat offenders may be debarred from the University.









Home | Projects | People | Publications | Courses | Resources | Contact