534: Advanced Computer Networks (Fall 2006)
Final Exam Schedule
|| M, W 1:40 P.M. - 2:55 P.M. BYAC 220
|| Sandeep Gupta
||M, W 3:00 P.M. - 4:30 P.M.
||Guofeng Deng (Guofeng.Deng@asu.edu)
|TA Office Hour
||T 3:00 P.M. - 5:00 P.M. or by appointment
Project Presentation Schedule
Distinguished Lecturer Presentation
- 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.
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.
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.
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
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.
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.
- 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
- 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
| Reading #1
| Homework #1
| Reading #2
| Reading #3
| Reading #4
| Reading #5
| Reading #6
| Reading #7
| Homework #2
| Reading #8
| Reading #9
| Reading #10
| Quiz #1
| Quiz #2
| Quiz #3
| Quiz #4
| Phase I report
| Phase II report
| Project presentation
| Final report
(2:40 P.M. - 4:30 P.M.)
||Introduction & prerequisite knowledge review
||Review of application layer, Quiz1
||Review of transport layer, Quiz2, Solution to Pre-test
||Review of transport layer, Quiz3, RA#3 assigned
||End-to-end arguments, congestion control, Quiz4, RA#4 assigned
||Review of network layer
||Tussle in cyberspace, P2P network, multimedia networking and beyond best-effort services
||ALF-ILP, queuing theory
||Network traffic self-similar, traffic management, RA#6 assigned
||Continue the discussion of traffic management
||Design principles: multiplexing, hard vs. soft state, HW2 assigned
hard vs. soft state,
||Term project discussion: research projects in IMPACT
pervasive health monitoring,
||Continue the discussion on term projects, link layer review
Link Layer and LAN|
Dynamics of Internet Transport Protocols
||Wireless and mobile networks, RA#7 assigned
||Project phase 1 review
||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
Negotiation-Based Disseminating Information,
Two-Tier Data Dissemination|
||HW2 review, Midterm handed out, broadcast lifetime research in wireless ad hoc networks
||Project phase 2 review
||Wireless mesh network, RA#8 assigned
||Routing in multi-radio, multi-hop wireless mesh networks
||Bloom filter, RA#9 assigned
||Bloom filters, BGP, Free riding multicast
||Midterm review, RA#10 assigned
POLICY ON CHEATING
- V. Cerf and R. Kahn. A Protocol for Packet Network Intercommunication. IEEE Transaction on Communication COM-22(5):637-648, May 1974.
- RFC 793 Transmission Control Protocol, Darpa Internet Program Protocol Specification (pdf)
- RFC 791 Internet Protocol, Darpa Internet Program Protocol Specification (pdf)
- D. Clark, What is "Architecture"?
- Hubert Zimmermann, OSI Reference Model - The ISO Model of Architecture for Open Systems Interconnection,IEEE Transactions on Communications, COM 28(4):425-432, April 1980.
- D. Clark, Design Philosophy of the DARPA Internet Protocols, ACM SIGCOMM' 88, pp 106-114, Aug. 1998.
- How Anarchy Works - On location with the masters of the metaverse, the Internet Engineering Task Force by Paulina Borsook
- A PERSPECTIVE ON THE ARPANET REFERENCE MODEL
- Peterson Davie's Book (Internet version)
- Growth of the Internet, K. G. Coffman and A. M. Odlyzko, AT&T Labs - Research
- RFC 2775 Internet Transparency, B. Carpenter, Feb 2000
- Marjory S. Blumenthal and David D. Clark, Rethinking the design of the Internet: the end-to-end arguments vs. the brave new world, ACM Transactions on Internet Technology (TOIT), Volume 1, Issue 1 (August 2001), Pages: 70 - 109.
- David D. Clark, John Wroclawski, Karen R. Sollins and Robert Braden, Tussle in cyberspace: defining tomorrow's internet, IEEE/ACM Transactions on Networking (TON), Volume 13, Issue 3 (June 2005), Pages: 462 - 475.
- D. Clark and D. Tennenhouse, Architectural Considerations for a New Generation of Protocols, ACM SIGCOMM Computer Communication Review, Sep. 1990, pages 200-208
- Shenker, S, Fundamental design issues for the future Internet, Selected Areas in Communications, IEEE Journal on, Volume 13, Issue 7, Sept. 1995 Page(s):1176 - 1188
- M. Corvella and A. Bestavros, Self-similarity in World Wide Web traffic: evidence and possible causes, IEEE/ACM Transactions on Networking (TON), Volume 5, Issue 6 (December 1997), Pages: 835 - 846
- A. Veres et al., On the propagation of long-range dependence in the Internet, Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), Stockholm, Sweden, Pages: 243 - 254, 2000
- S. Floyd and V. Jacobson, Link-Sharing and Resource Management for Packet Networks, IEEE/ACM Transactions on Networking, Vol 3. No. 4, August 1995.
- L. Zhang et al., RSVP: A New Resource ReSerVation Protocol, IEEE Communications Magazine, 50th Anniversary Commemorative Issue, May 2002.
- W. Ye, J. Heidemann, and D. Estrin, Medium Access Control With Coordinated Adaptive Sleeping for Wireless Sensor Networks IEEE/ACM Trans. on Networking, Vo. 12, No. 3, June 2004.
- R. Ramanathan, Challenges: A Radically New Architecture for Next Generation Mobile Ad Hoc Networks, Proc. ACM Mobicom'05, 2005.
- Mihail L. Sichitiu, Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks, In Proceedings Infocom 2004
- W. Ye et al., An Energy-Efficient MAC Protocol for Wireless Sensor Networks, In Proceedings Infocom 20002
- C. Intanagonwiwat et al., Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks, MOBICOM'00
- J. Kulik et al., Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks, MOBICOM'99
- F. Ye et al., A Two-Tier Data Dissemination Model for Large-scale
Wireless Sensor Networks, MOBICOM'02
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.