CSE 534: Advanced Computer Networks (Fall 2006)

Lecture M, W 1:40 P.M. - 2:55 P.M. BYAC 220
Line No 53921
Instructor Sandeep Gupta
Office BY522
Email Sandeep.Gupta@asu.edu
Office Hours M, W 3:00 P.M. - 4:30 P.M.
TA Guofeng Deng (Guofeng.Deng@asu.edu)
TA Office BY517AE
TA Office Hour T 3:00 P.M. - 5:00 P.M. or by appointment


CONTENTS

ANNOUNCEMENT

Final Exam Schedule
  • Project Presentation: Each group will have a 12 minute slot in one of the three classes (Nov 27, Nov 29 and Dec 4). You can find the schedule here. DUE: Each group is required to submit the ppt slides to the instructor and TA via email before 12PM Monday, Nov 27.
  • Final Report: is due on Monday Dec 4th.
  • Project Demo: Each group will have a 20 minute slot on Tuesday, Dec 5th, from 10AM to 5PM, for project demo in BY517. Send an email to the TA if you have any preference for time slot before 5PM Sunday, Dec 3rd. The demo schedule will be sent via emails on Monday.
  • Final Exam: The final exam will be a take-home one. The exam sheet will be distributed on Friday, Dec 1st. Students will have a week to work on their exams and submit the answer before 5PM Friday, Dec 8th. Each on-campus student should submit a hard copy to the TA (in BY517) or the department front desk (BY553) to be forwarded to the TA; off-campus students should submit an electronic copy to the TA by that time. Students are required to attend the class on Wednesday, Dec 13th for a final exam discussion.
Project Presentation Schedule

Distinguished Lecturer Presentation
Nagi Rao from the Computer Science and Math Division at ORNL will be visiting ASU on October 9, and giving a CSE distuinished lecture from 2:00pm to 3:00pm in BY210 on Dynamics of Internet Transport Protocols. Students are required to come to class as usual and submit homework and then go to attend the lecture.

About IMPACT LAB
A brief introduction of research projects that we are and have been doing in IMPACT.


COURSE DESCRIPTION

Goal and Topics
The goal of this course is to understand what are the current and future chanllenges in the domain of computer networking, especially internetworking, wireless mobile ad hoc and embedded sensor networking, and what tools and techniques are most suited to address these challenges. Topics for the course include internetworking, wireless mobile networking, embedded sensor networking, networking and communication theory and performance modeling. If time permits, topics on multimedia applications, Internet security, and network management will also be covered. Students are referred to the TOPICS section on this page for more information about topics to be covered in this course.

Course Format
The student will gain progressively deeper understanding of the subject matter by using continual spiral technique in which the student is helped in providing an increasingly sophisticated response to the sub-questions originating from the above topics. Periodically the students will be assigned technical research papers to be read. For some or all papers assigned the student will submit a brief report.

A major portion of the class grade will be based on the term project. Each student will conduct in-dept research on a computer networking topic of his/her choice for the term project. In Phase I of the research the student will choose a topic to work on in consultation with the instructor and submit a written report per the requirements by October 11. In Phase II of the research the student will thoroughly survey the selected topic, define a research problem related to the chosen topic, propose a solution and submit a written report per the requirments by October 25. In Phase III, the student evaluates the solution using mathematical analysis, simulation, and/or implementation. A student is required to make an oral presentation on his/her accomplishments for the term project in either one of the last two classes and submit a written report at the time of final exam, i.e. December 13, 2006. More details on term projects will be discussed in class.

The course will have assignments in which the students will be asked to solve various problems of different degree of difficulty. The student will submit their written response by the assignment deadline at the beginning of the class (no late assignment will be accepted), however the assignments will not be graded in conjunction with student self-assessment: the student will do a self-evaluation (before and after the solution is provided) of their understanding and performance on the assignment.

There will be a midterm and a final exam based on the course material covered in the class.

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 na?ve solutions for the problem.

The final letter grade will be assigned based on weighted average of the grades obtained in the following categories:
Assignments : 20%
Project : 40%
Midterm Exam : 15%
Final Exam : 25%

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


TOPICS

  • Internetworking (4 Weeks) [Background KR3e-Ch1-5]
    • Current Internet Architecture (IP Internet) [PD3e-Ch4]
      • Reason for Success
      • Problems with Current Internet - Exhaustion of Address Space, Lack of QoS support
      • TCP/IP Layered Architecture (Hourglass model)
    • Future Internet Initiative [http://find.isi.edu]
      • What is Network Architecture
    • Congestion Control/Resource Allocation [PD3e-Ch6]
    • Multimedia Networking [KR3e-Ch7]
    • Multicast/Broadcast Routing
    • Network Security [KR3e-Ch8]
  • Wireless Mobile Networking (2 weeks) [KR3e-Ch6]
    • Wireless Communication
    • Wireless Cellular Network - Channel Allocation, Handoff
    • WLAN (IEEE 802.11)
    • Mobile IP
    • Location Management
  • Embedded Sensor Networking (4 Weeks)
    • Networking between Physical and Virtual Space
    • Applications
    • Sensor Network Architecture
    • Topology Management/ Distributed Clustering
    • Data aggregation Routing
    • Energy-Aware Protocols
    • Sensor Network Platforms
  • Networking/Communication Theory (2 Weeks)
    • Network Coding
    • Information Theory
    • Game Theory
  • Performance Modeling (2 Weeks)
    • Queuing Model
    • Throughput/Delay/Reliability Analysis

ASSIGNMENTS

Assignment Points Date Assigned Due Date Files
Homework 20
    Reading #1 Mon 08/21/2006 Wed 08/23/2006 RA1
    Homework #1 Wed 08/23/2006 Mon 08/28/2006 HW1, Ethereal1, HW1-solution
    Reading #2 Wed 08/23/2006 Mon 08/28/2006 RA2
    Reading #3 Wed 08/30/2006 Wed 09/06/2006 RA3
    Reading #4 Wed 09/06/2006 Mon 09/11/2006 RA4
    Reading #5 Wed 09/13/2006 Mon 09/18/2006 RA5
    Reading #6 Wed 09/20/2006 Mon 09/25/2006 RA6
    Reading #7 Wed 10/11/2006 Mon 10/16/2006 RA7
    Homework #2 Wed 09/27/2006 Mon 10/09/2006 HW2, HW2-solution
    Reading #8 Wed 11/01/2006 Mon 11/06/2006 RA8
    Reading #9 Wed 11/08/2006 Mon 11/13/2006 RA9
    Reading #10 Wed 11/15/2006 Mon 11/20/2006 RA10
Quiz
    Quiz #1 Wed 08/23/2006 QZ1, QZ1-sol
    Quiz #2 Mon 08/28/2006 QZ2, QZ2-sol
    Quiz #3 Wed 08/30/2006 QZ3, QZ3-sol
    Quiz #4 Wed 09/06/2006 QZ4, QZ4-sol
Project 40
    Phase I report Wed 10/11/2006 requirements
    Phase II report Wed 10/25/2006 requirements
    Project presentation 11/29/2006,12/04/2006 schedule
    Final report Mon 12/04/2006
Mid-term 15 Mon 10/23/2006 Mon 10/30/2006 Midterm
Final exam 25 Wed 12/13/2006
(2:40 P.M. - 4:30 P.M.)


SCORES

LECTURE NOTES

Week Class # Date Topics Materials
1 1 08/21 Introduction & prerequisite knowledge review slides,Pre-test
2 08/23 Review of application layer, Quiz1 CH2, QZ1, QZ1-sol
2 3 08/28 Review of transport layer, Quiz2, Solution to Pre-test CH3, QZ2, QZ2-sol, pre-test-sol
4 08/30 Review of transport layer, Quiz3, RA#3 assigned CH3, QZ3, QZ3-sol, RA3
3 5 09/06 End-to-end arguments, congestion control, Quiz4, RA#4 assigned Layering&E2E, CH3, QZ4, QZ4-sol, RA4
4 6 09/11 Review of network layer Tussle, internetarch-evolution, CH4
7 09/13 Tussle in cyberspace, P2P network, multimedia networking and beyond best-effort services Tussle, CacheLogic Data, CH7
5 8 09/18 ALF-ILP, queuing theory ALF-ILP, queuing
9 09/20 Network traffic self-similar, traffic management, RA#6 assigned Self-similarity, traffic management, RA6
6 10 09/25 Continue the discussion of traffic management traffic management
11 09/27 Design principles: multiplexing, hard vs. soft state, HW2 assigned multiplexing, hard vs. soft state, HW2
7 12 10/02 Term project discussion: research projects in IMPACT Overview, intelligent container, multicast lifetime, pervasive health monitoring, criticality aware
13 10/04 Continue the discussion on term projects, link layer review multicast lifetime, Link Layer and LAN
8 14 10/09 Distinguished Lecture: Dynamics of Internet Transport Protocols
15 10/11 Wireless and mobile networks, RA#7 assigned CH6, RA#7
9 16 10/16 Project phase 1 review
17 10/18 MAC layer issues in mobile ad hoc networks: MAC Layer Design for Wireless Sensor Networks by Ye, Cross-layer scheduling for power efficiency in wireless sensor networks by Sichitiu, Routing and data dissemination in wireless sensor networks by Gupta cross-layer scheduling, S-MAC, directed diffusion, Negotiation-Based Disseminating Information, Two-Tier Data Dissemination
10 18 10/23 HW2 review, Midterm handed out, broadcast lifetime research in wireless ad hoc networks HW2-solution, Midterm
19 10/25 Midterm Midterm
11 20 10/30 Project phase 2 review
21 11/01 Wireless mesh network, RA#8 assigned video, keynote, tutorial, RA#8
12 22 11/06 Routing in multi-radio, multi-hop wireless mesh networks routing, Feedback
23 11/08 Bloom filter, RA#9 assigned RA#9, Bloom paper, slides
13 24 11/13 Bloom filters, BGP, Free riding multicast Bloom paper, slides, BGP, FRM
25 11/15 Midterm review, RA#10 assigned RA#10
14 26 11/20
27 11/22 Review
15 28 11/27 Project presentations Slides
29 11/29 Project presentations Slides
16 30 12/04 Project presentations Slides


REFERENCE



READING LIST



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