Class Presentation - CSCI 558L, Fall 2009

A presentation should be approximately 25 minutes without interrupting questions. (There may be unexpected clarification-type questions.) You should manange your time well during your talk. You will get penalty if your talk is too short or too long. There will be 5 minutes for questions and answers after your talk.

Important deadlines:

• Topic selection, due 11:45PM, 9/16/2009.

• UNIX/Linux
  • Linux boot process
  • Linux file system layout
  • Linux TCP/IP stack
  • Kernel modules and device drivers
  • Cross-platform development for embedded systems
  • Embedded Linux: kernel and filesystem

• Internet
  • IP address topics (classes, subnets, NAT, DHCP, etc.)
  • Interior routing protocols (RIP, OSPF, etc.)
  • Border gateway protocol (BGP)
  • BGP route oscillation
  • TCP flow behavior
  • Domain name system (DNS)
  • Network debugging and management (SNMP)
  • Network time protocol (NTP)

• Security
  • Distributed Denial of Service (DDoS) - (proactive defense only; also, please note that IP Traceback is no longer an approved topic)
  • OS fingerprinting
  • Firewalls
  • Intrusion Detection

• Wireless Networks
  • Overview of wireless LAN - IEEE 802.11 -- by Instructor
  • IEEE 802.11 security
  • IEEE 802.11 mesh networks
  • Bluetooth
  • IEEE 802.15.4 and Zigbee
  • Ad hoc routing protocols

• Sensor Networks
  • Overview of wireless sensor networks -- by Instructor
  • Operating systems for sensor networks
  • Sensor network programming
  • MAC protocols for sensor networks
  • Routing in sensor networks

• Your presentation must be based on at least one technical paper published in refereed journals, conferences, workshops, and symposiums. (Tech-reports, whitepapers, Internet articles, and books are not acceptable.) When you submit your presentation topic, you must specify (by giving full citation information) on which paper you will base your presentation.

  [BC: Paragraph added 9/6/2009]
  Please do not send a paper or a link to a paper or a link to a description of a paper to the instructor. It is your job to correctly extract the full citation information from what you have found.

• Please note that some journal publications are basically newsletters and they are lightly reviewed. For example, Computer Communications Review is the newsletter of SIGCOMM, Performance Evaluation Review is the newsletter of SIGMETRICS, Operating Systems Review is the newsletter of SIGOPS, and SIGMOD Record is the newsletter of SIGMOD. They are usually not as highly regarded as papers published in a well-established conference, workshop, or symposium.

• Please also note that some journals are magazines and they often lack technical depth. For example, IEEE Spectrum, IEEE Computer, IEEE Security & Privacy, and Communication of the ACM are magazines of IEEE and CAM. A list of IEEE magazines can be found here.

• The above requirement is a good starting point. If you don't adhere to the requirement above, you simply run the risk of losing some points. If you find a topic that does not satisfy the above requirement but are able to present it with depth, clarify, and interest, you may not lose points. You will not automatically lose points just because you do not satisfy the above requirement.

• In general, it's not a good idea to pick a paper that describes a system architecture or how to add a new feature to an existing system. The reason is that a paper like these often gives a laundry list of features and design choices without giving detailed explanation of why these are the best choices for the system in question. It is much better to pick a paper that tries to present a way to improve a particular aspect of a system because papers like this tends to be more focused, examined alternatives, and presents evidance why their approach is better.

• You are not required to agree with everything you have read in papers. You need to be critical of the papers you use for your presentation.

• Please do not present something that was presented as course material in another class (such as CS 530, CS 551, CS 555, CS 558L, CS 694a/b, etc.) If you did a paper in another class, but you did not give a talk about it, then this restriction does not apply.

• Please do not base your presentation on something that was published long time ago. Your main reference should be published within the past 10 years.

• In general, please do not present a very high level system description paper and give a laundry list of system features or buzzwords (unless you can make it very, very interesting). You need to present something with some technical depth (e.g., describe algorithms/protocols and present evaluations/studies of the algorithms/protocols).

• In general, please do not present a very low level system description paper and give a laundry list of system details (unless you can make it very, very interesting). You need to present something interesting.

Please note that PowerPoint/PDF slides may be available from some authors' web sites. You must avoid committing plagiarism when you create your slides! Please refer to the Academic Integrity policy of this class. Please make sure that you come up with your own slides! If you need to copy from other people's slides, please cite is properly (e.g., "this figure is copied from Figure 5 of reference [1]").

Your slides should look professional and visually consistent. (You do not need a lot of fancy graphics.)

Please make sure to include your main references by giving full citation information in your slides.

[BC: paragraph added 9/27/2009]
After you have given your presentation, you must send the slides you used for your talk to the instructor to be posted on the lectures web page. The only acceptable formats are PowerPoint (.ppt, please do not send .pptx) and PDF only.

• Cover all important concepts and ideas and ignore unimportant details. This is the key to keep your talk within 30 minutes.
• If present multiple papers, try to present them in a systematic way by adding your own comments and summay that connect different papers together.
• Use examples effectively to clarify ideas that are not straightforward.
• Each slide should have a point. Details are used to support the point rather than burying it.
• Do not steal slides posted to the Web by others! You may use some materials (e.g. pictures), but you should acknowledge the source in your slides (e.g. in a footnote).
• Put page numbers on slides, so that people can easily refer to them.
• You should have about 25 slides.
• Do not speak too fast even if you can cover more contents. Your audience need a little time to think and follow your talk.
• You should rehearse your talk beforehand.

• Presentation Skills. This is a list of pointers to resources for effective oral communication.
• Another list of pointers to presentation advice.
• Ed Tufte's Advice on Presentations. Make this second nature! Also see a variant of this list.

• tentative title of your talk
• brief topic description (a few sentenses; should not be more than 2 paragraphs)
• which published paper you will base your presentation on (with full citation information).
  (Please do not send the actual paper, just the citation.)

After you have submitted your presentation topic selection, it is possible that the primary paper you have chosen does not satisfy the requirements. In this case, you have up to one week before your talk to nail down a primary paper that satisfies the requirements. If you fail to do so, you will get a 25% deduction off of your presentation score.

[BC: Paragraph added 9/6/2009]
Once someone has selected a primary paper, you may not use the same paper as your primary paper. Below are the primary papers that have been approved by the instructor:

• Z. Gutterman, B. Pinkas, and T. Reinman. Analysis of the Linux Random Number Generator. Proceedings of the 2006 IEEE Symposium on Security and Privacy, Pages: 371 - 385. (Sergey Sudakovich <sudakovi@usc.edu> will present.)

• J. Karlin, S. Forrest, and J. Rexford. Pretty Good BGP: Improving BGP by Cautiously Adopting Routes. In Proceedings of the 14th IEEE International Conference on Network Protocols (ICNP'06), Santa Barbara, CA, November 2006. (Vikram Kommaraju <kommaraj@usc.edu> will present.)

• J. Halderman, S. Schoen, N. Heninger, W. Clarkson, W. Paul, J. Calandrino, A. Feldman, J. Appelbaum, and E. Felten. Lest We Remember: Cold Boot Attacks on Encryption Keys. In proceedings of 2008 USENIX Security Symposium, San Jose, CA, 2008. (Rajas Mohile <rmohile@usc.edu> will present.)

• S. Ganeriwal, R. Kumar, and M. Srivastava. Time Synchronization Protocols for Sensor Networks . In Proceedings of the 1st International Conference on Embedded Networked Sensor Systems, pages 138-149, Los Angeles, California, 2003. (Sagar Saha <sagarsah@usc.edu> will present.)

• Y. Wang, M. Schapira, and J. Rexford. Neighbor-Specific BGP: More Flexible Routing Policies While Improving Global Stability. In Proceedings of the Eleventh International Joint Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'09), Seattle, WA, 2009. (Vikas Meka <vmeka@usc.edu> will present.)

• K. Mehta, D. Liu, and M. Wright. Location Privacy in Sensor Networks Against a Global Eavesdropper. In Proceedings of the 15th IEEE International Conference on Network Protocols (ICNP'07), Beijing, China, 2007. (Jerry Bert <jbert@usc.edu> will present.)

• W. Sun, Z. Mao, and K. Shin. Differentiated BGP Update Processing for Improved Routing Convergence. In Proceedings of the 14th IEEE International Conference on Network Protocols (ICNP'06), Santa Barbara, CA, 2006. (Bharath Horatti <horatti@usc.edu> will present.)

• T. Klockar and L. Carr-Motyckova. Preventing Oscillations in Route Reflector-based I-BGP. In Proceedings of the 13th International Conference on Computer Communications and Networks (ICCCN'04), Chicago, IL, 2004. (Vamshi Karnati <karnati@usc.edu> will present.)

• M. Rajab, J. Zarfoss, F. Monrose, and A. Terzis. A Multifaceted Approach to Understanding the Botnet Phenomenon. In Proceedings of ACM SIGCOMM/USENIX Internet Measurement Conference (IMC'06), Rio de Janeiro, Brazil, Oct 2006. (Hassan Khan <hassankh@usc.edu> will present.)

• L. Su, C. Liu, H. Song, and G. Cao. Routing in Intermittently Connected Sensor Networks. In Proceedings of the 16th IEEE International Conference on Network Protocols (ICNP'08), Orlando, FL, 2008. (Raja Venkatraman <pulankin@usc.edu> will present.)

• Y. Shaked and A. Wool. Cracking the Bluetooth PIN. In Proceedings of the 3rd International Conference on Mobile Systems, Applications, and Services (MobiSys'05), Seattle, WA, June 2005. (Gauravkumar Shah <gauravrs@usc.edu> will present.)

• X. Lin, Y. Kwok, and V. Lau. A Quantitative Compar ison of Ad Hoc Routing Protocols with and without Channel Adaptation. In IEEE Transactions on Mobile Computing, Vol. 4, No. 2, pp. 111-128, Mar/Apr 2005. (Huzefa Zakir <zakir@usc.edu> will present.)

• R. Geambasu, T. Kohno, A. Levy, and H. Levy. Vanish: Increasing Data Privacy with Self-destructing Data. In Proceedings of the 18th USENIX Security Symposium, Montreal, Canada, August 2009. (Husain Rangwala <hrangwal@usc.edu> will present.)

• X. Li, K. Fang, J. Gu and L. Zhang. An Improved ZigBee Routing Strategy for Monitoring System. In Presented of the First International Conference on Intelligent Networks and Intelligent Systems (ICINIS'08), Wuhan, China, 2008. (Manish Mahajan <mamahaja@usc.edu> will present.)

• T. He, J. Stankovic, C. Lu, and T. Abdelzaher. SPEED: a Stateless Protocol for Real-time Communication in Sensor Networks. In Presented of the 23rd International Conference in Distributed Computer Systems (ICDCS'03), Los Alamitos, CA, May 2003. (Devarshi Shah <devarsps@usc.edu> will present.)

• L. Tan and T. Sherwood. A High Throughput String Matching Architecture for Intrusion Detection and Prevention. In Presented of the 32nd International Symposium on Computer Architecture (ISCA'05), Madison, WI, June 2005. (Chirag Nanavati <cnanavat@usc.edu> will present.)

• C. Karlof and D. Wagner. Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures. In Presented of the First IEEE International Workshop on Sensor Network and Applications, Anchorage, AK, May 2003. (Shreyas Chandrashekar <shreyasc@usc.edu> will present.)

• L. Subramanian, V. Roth, I. Stoica, S. Shenker, and R. Katz. Listen and whisper : Security Mechanisms for BGP. In Presented of the First Symposium on Networked Systems Design and Implementation (Usenix NSDI'04), San Francisco, CA, March 2004. (Neeraj Agicha <agicha@usc.edu> will present.)

• E. Belding-Royer and C. Perkins. Evolution and Future Directions of the Ad Hoc On-demand Distance Vector Routing Protocol. In Ad Hoc Networks Journal, Vol. 1, No. 1, pps 125-150, July 2003. (Nirmit Saurabhbhai Desai <nirmitde@usc.edu> will present.)

• M. Lad, D. Massey, D. Pei, Y. Wu, B. Zhang, and L. Zhang. PHAS: Prefix Hijack Alert System. In Proceedings of the 15th USENIX Security Symposium, Vancouver, Canada, 2006. (Dhwani Sanjay Dagli <dagli@usc.edu> will present.)

• H. Zhu, T. Liu, C. Zhou, and G. Chang. Research and Implementation of Zero-Copy Technology Based on Device Driver in Linux. In Proceedings of the International Multi-Symposiums of Computer and Computational Sciences Conference (IMSCCS'06), Hangzhou, China, June 2006. (Tushar Nautiyal <tnautiya@usc.edu> will present.)

• Z. Zhang, X. Wen, and W. Zheng. A NAT Traversal Mechanism for Peer-To-Peer Networks. In Proceedings of the International Symposium on Intelligent Ubiquitous Computing and Education, Chengdu, China, pps 129-132, May 2009. (Nikhil Dabhade <dabhade@usc.edu> will present.)

• J. Eriksson, M. Faloutsos, and S. Krishnamurthy. Scalable Ad Hoc Routing: The Case for Dynamic Addressing. In Proceedings of IEEE INFOCOM, February 2007. (Soudhamini Rajanna <rajanna@usc.edu> will present.)

• (70%) Technical content - coverage of important concepts, depth
  • In order to get an A in this category, you need to present something with good technical depth. This means that you need to give detailed description of difficult-to-understand concepts, algorithms, and/or protocols.

• (30%) Presentation - familiarity, fluency, ability to present in easy-to-understand and interesting ways, quality of slides

• Miscellaneous (possible deduction)
  • Time management: the maximum time for a talk is 30 minutes (if you go past 30 minutes, you will be asked to stop abruptly), so you should time your talk between 20 and 30 minutes
  • Interaction with audience, including listening to questions and giving relavent answers

We will assign letter grades to various parts of your project. The conversion from a letter grade to a numeric score (for the project) is done according to the following table:

Grade		Points
A		50
A-		44
B+		36
B		30
B-		24
C+		16
C		10
C-		4
F		0