• Description: In this seminar, we will review current conference and journal papers related to the design of reconfigurable hardware systems. In particular, we will choose papers that focus on topics related to reconfiguration techniques for systems with Field Programmable Gate Arrays (FPGAs), techniques of migrating algorithms from software to hardware, and study applications for FPGAs in computer networks.

• Instructor:Prof. John W. Lockwood
  • (lockwood@arl.wustl.edu)
    

• Credits:
  • 1 unit
  • Pass/Fail

• Class Format
  • A interactive seminar
  • Each week, everyone in the class reads an assigned paper, and submits a one-page page summary of the paper.
    • The summaries should represent your original throughts on the paper
    • Everyone in the class is expected to participate in the discussion of the paper.
    • Summaries must be submitted to the instructor no later than 10pm on the evening before the review.
    • The review will be graded pass/fail by the instructor.
  • Each week, a presentor will be chosen to prepare slides and present the paper in a 25 minute format.
    • The presentation should be complete, meaning that it covers the major concepts of the papers.
    • Graphics should be used to describe diagrams or results.
    • Prove that you understand the paper by presenting the paper in your own words
    • Explore the papers cited by the paper to provide context for the paper.
    • PowerPoint (.ppt) files for the 1st seminar are available on-line from the CS681x websites that can serve as a template in the required format.
    • The presentor should upload a draft of the presentation on the Friday before the date that he or she will review the material.
    • Members in the class will evaulate effectiveness of the the presentor using a gradesheet
  • Each week, a Heckler will will be chosen to challenge the ideas presented in the paper.
    • The heckler should challenge all questionable statements or ideas discussed in the paper
    • It is the responsiblity of the presentor to respond to each point with a counter arguement.
  • A passing grade for the course will only be awarded if:
    • As a presentor, you receive high marks by the class
    • As a heckler, you raise valid points.
    • You participate in class discussions
    • Your summaries are submitted on-time
  • Everyone in the FPX group is expected to be registered to take this course.
  • The Template Presentation should be downloaded and used to format the talk.
  • Presentations, Summaries, and heckler reports should be submitted to: http://www.gradebot.com/cse6815/submit/upload.cgi

• Time:
  • Wednesdays: 10am-11am

• Place:
  • Jolley 509c (conference room in main CS office)

• Readings
  • Updates and assignments will be made on a week-by-week basis. Please check the website,
    http://www.arl.wustl.edu/~lockwood/class/cs6815/index.html
    on a regular basis for the current assignments for reading, presenting, and heckling.
  • The papers listed below were chosen for use in this seminar course.
    • You should not attempt to submit papers listed in this for credit in other seminar courses.

• On-line References
  • Select Readings from networking conferences and journals
  • Articles Available from: The NECI Scientific Literature Digital Library (ResearchIndex)
  • Russell Tessier's 697c collection

• Related Links
  • More reading available from:
    • Publications on the Field programmable Port Extender (FPX)
    • CS6814: Research Seminar on Reconfigurable Hardware: Fall 2003
    • CS6813: Research Seminar on Reconfigurable Hardware: Spring 2003
    • CS6812: Research Seminar on Reconfigurable Hardware: Fall 2002
    • CS6811: Research Seminar on Reconfigurable Hardware: Spring 2002
  • Basic Tutorial on Architecture of FPGAs and CPLDs

  
  

Tentative Reading List

1. February 9, 2004: Enhancing ByteLevel Network Intrusion Detection Signatures with Context, by Robin Sommer and Vern Paxson; CCS, October 27-30, 2003, Washington, DC, USA.
   • Reviewer: Sarang
   • Heckler: Dave Lim

2. February 13, 2004: A Proposal for a High Performance TCP Flow Processing System for use in Extensible Networking Environments, by David V. Schuehier, Washington University in St. Louis, Jan 20, 2004.
   • Presentor: Dave Schuehler
   • Heckler: All

3. March 19, 2004: Next Century Challenges : Scalable Coordination in Sensor Networks, by Estrin, D.; Govindan, R..; Heidemann, J.; Kumar, S.; MOBICOM 99
   • Chris Neely

4. March 26, 2004: 10am: An approach for Detecting Self-propagating Email Using Anomaly Detection, by Ajay Gupta and R. Sekar; Sixth International Symposium on Recent Advances in Intrusion Detection (RAID), September, Pittsburgh, PA, September, 2003, pp. 55-72.
   • Reviewer: Bharath
   • Heckler: All

5. March 26, 2004: 1pm: Clockless Computing Coordinating Billions of Transistors, Special Symposium at Washington University in St. Louis, March 26, 2004, Whitaker auditorium.

6. April 2, 2004: Characterizing the Performance of Network Intrusion Detection Sensors, by Lambert Schaelicke, Thomas Slabach, Branden Moore and Curt Freeland; Symposium on Recent Advances in Intrusion Detection (RAID), September, Pittsburgh, PA, September, 2003, pp. 155-172.

7. April 9, 2004: DataRouter: A Network-Layer Service for Application-Layer Forwarding, Joseph D. Touch and Venkata K. Pingali, IWAN 2003, Kyota, Japan, December, 2003.
   • Reviewer: James

8. Using decision trees to improve signature-based intrusion detection, by Christopher Kruegel and Thomas Toth; Symposium on Recent Advances in Intrusion Detection (RAID), September, Pittsburgh, PA, September, 2003, pp. 173-191

9. Deterministic Memory-Efficient String Matching Algorithms for Intrusion Detection, by Nathan Tuck, Timothy Sherwood, Brad Calder, George Varghese, Infocom 2004.

10. C. Jason Coit, Stuart Staniford, Joseph McAlerney Towards Faster String Matching for Intrusion Detection or Exceeding the Speed of Snort, Whitepaper on www.silicondefense.com.