Class Presentation - CSCI 558L, Fall 2010

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/15/2010.

• 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
  • 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
  • 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.

  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.

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.

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:

• J. Newsome, B. Karp, and D. Song. Polygraph: automatically generating signatures for polymorphic Worms. IEEE Symposium on Security and Privacy, 2005. (Allan George <aageorge@usc.edu> will present.)

• F. Ye, G. Zhong, S. Lu, and L. Zhang. GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor Networks. In Proceedings of the 2nd International Conference on Information Processing in Sensor Networks, Palo Alto, California, 2005. (Vaibhav Dhage <dhage@usc.edu> will present.)

• M. A. Vouk. Cloud computing -- Issues, research and implementations. In Proceedings of the ITI 2008 30th Int. Conf. on Information Technology Interfaces, June 23-26, 2008, Cavtat, Croatia. (Nikhil Aggarwal <nmaggarw@usc.edu> will present.)

• A. Patwardhan, J. Parker, A. Joshi, M. Iorga, and T. Karygiannis. Secure Routing and Intrusion Detection in Ad Hoc Networks. In Proceedings of the 3rd IEEE International Conference on Pervasive Computing and Communications (PerCom 2005), March 2008, Kauai Island, Hawaii. (Pradeep Prabhu <tprabhu@usc.edu> will present.)

• Y. Xu, J. Heidemann, and D. Estrin. Geography-informed energy conservation for Ad Hoc routing. In Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, 2001, Rome, Italy. (Aruna Padmanabhan <arunapad@usc.edu> will present.)

• J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In Proceedings of the Sixth Symposium on Operating System Design and Implementation (OSDI), San Francisco, California, December, 2004. (Naveen Birru <nbirru@usc.edu> will present.)

• D. X. Wei, C. Jin, S. H. Low, and S. Hegde. FAST TCP: Motivation, Architecture, Algorithms, Performance. IEEE/ACM Transactions on Networking, Vol. 14, No. 6, Pages 1246-1259, December, 2006. (Hardik Desai <hardiksd@usc.edu> will present.)

• H. Zhang, A. Arora, and Z. Liu. A Stability-oriented Approach to Improving BGP Convergence. In Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems (SRDS'04), Florianpolis, Brazil, 2004. (Pranayini Gudali <gudali@usc.edu> will present.)

• C. Karlof and D. Wagner. Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures. In Proceedings of the First IEEE. 2003 IEEE International Workshop on Sensor Network Protocols and Applications, 2003. (Abhiram Gajjala <gajjala@usc.edu> will present.)

• D. Massey, L. Wang, B. Zhang, and L. Zhang. A Scalable Routing System Design for Future Internet. In Proceedings of the SIGCOMM 2007 Workshop on IPv6 and the Future of the Internet, Kyoto, Japan, August 31, 2007. (Udayan Banerji <ubanerji@usc.edu> will present.)

• P.C. van Oorschot, T. Wan, and E. Kranakis. On interdomain routing security and pretty secure BGP (psBGP). ACM Transactions on Information and System Security (TISSEC), Vol. 10, No. 3, July 2007. (Sriranjani Babu <sriranjb@usc.edu> will present.)

• H. Huang, J. H. Hartman, and T. N. Hurst. Data-Centric Routing in Sensor Networks using Biased Walk. In Proceedings of SECON'06, 2006, 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, Reston, VA, September 28th, 2006. (Akhil Chauhan <akhilcha@usc.edu> will present.)

• G. A. Di Caro, F. Ducatelle, and L. M. Gambardella. Swarm intelligence for routing in mobile ad hoc networks. In Proceedings of the IEEE Swarm Intelligence Symposium, January 2005, Visakhapatanam, India. (Deborshi Saha <dsaha@usc.edu> will present.)

• C. Dana, D. Li, D. Harrison, C.-N. Chuah. BASS: BitTorrent Assisted Streaming System for Video-on-Demand. In Proceedings of the IEEE 7th Workshop on Multimedia Signal Processing, October 30 2005, Shanghai, China. (Rohit Jogaikar <jogaikar@usc.edu> will present.)

• R. K. Murugesan, S. Ramadass, and R. Budiarto. Improving the Performance of IPv6 Packet Transmission over LAN. In Proceedings of the 2009 IEEE Symposium on Industrial Electronics and Applications (ISIEA 2009), Kuala Lumpur, Malaysia, October 4-6, 2009. (Rishi Kanth Alapati <alapati@usc.edu> will present.)

• P. Nikander, A. Gurtov, and T. R. Henderson. Host Identity Protocol (HIP): Connectivity, Mobility, Multi-Homing, Security, and Privacy over IPv4 and IPv6 Networks. In EEEE Communications Surveys & Tutorials, Vol. 12, No. 2, pages 186-204, April 2010. (Rishi Vora <rishivor@usc.edu> will present.)

• S. Bhandarkar, N. E. Sadry, A. L. N. Reddy, and N. H. Vaidya. TCP-DCR A Novel Protocol For Tolerating Wireless Channel Errors. In IEEE Transactions on Mobile Computing, Vol. 4, No. 5, pages 517-529, August 2005. (Vikas Ediga <ediga@usc.edu> will present.)

• S. Chen and N. Yang. Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks. In IEEE Transactions on Parallel and Distributed Systems, Vol. 17, No. 9, September 2006. (Rakesh Sunki <sunki@usc.edu> will present.)

• C. Busch, M. Magdon-Ismail, F. Sivrikaya, and B. Yener. Contention-free MAC Protocols for Wireless Sensor Networks. In Proceedings of the 18th International Conference of Distributed Computing (DISC), pages 245-259, 2004. (Ashish Joshi <ashishjo@usc.edu> will present.)

• K. Xu, M. Gerla, L. Qi, and Y. Shu. Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED. In Proceedings of the 9th Annual International Conference on Mobile Computing and Networking (MobiCom'03), San Diego, California, 2003. (Nishkam Agrawal <nishkama@usc.edu> will present.)

• M. O. Nicholes and B. Mukherjee. A Survey of Security Techniques for the Border Gateway Protocol (BGP). In EEEE Communications Surveys & Tutorials, Vol. 11, No. 1, pages 52-65, March 2009. (Kartheek Babu Kolla <kkolla@usc.edu> will present.)

• F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Ch, A. Fikes, and R. E. Gruber. Bigtable: A Distributed Storage System for Structured Data. In Proceedings of the 7th Conference on USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2006. (Anupama Mann <mannanup@usc.edu> will present.)

• Z. Yu, J. J. P. Tsai, and T. Weigert. An Adaptive Automatically Tuning Intrusion Detection System. ACM Transactions on Autonomous and Adaptive Systems, Vol. 3, No. 3, August 2008. (Arnab Dutta <adutta@usc.edu> will present.)

• D. H. Summerville, N. Nwanze, and V. A. Skormin. Anomalous Packet Identification for Network Intrusion Detection. In Proceedings of the 2004 IEEE Workshop on Information Assurance, West Point, NY, June 2004. (Chirabrata Senapati <senapati@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 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

After you have given your presentation, you should send your final slides to the instructor as soon as possible so that they can be posted on the lectures web page. If the instructor does not receive your final slides by the end of the last week of classes, you stand to lose a lot of points. (If you have never sent any draft copies of your slides to the instructor, you will receive a score of zero for your presentation.)