CS 838 Algorithmic design for fast network systems
(a.k.a. Network algorithmics: building fast network devices)
Spring 2008 |
|
Class schedule
Lectures are Mondays, Wednesdays and Fridays from 11:00 AM to 12:15 PM in room 1207 of the Computer Sciences and Statistics building. The schedule below is tentative, changes to future lectures are likely.
|
| Wed, Jan 23 | First class |
| Introduction to the class. We cover Chapter 1 of the textbook. |
|
| Wed, Jan 30 | Rules of the game |
| Simple models of protocols, hardware, network device architectures and operating systems - Chapter 2 of the textbook. |
|
| Mon, Feb 4 | Fifteen principles |
| Fifteen implementation principles that unify the material of this class - Chapter 3 of the textbook. |
|
| Wed, Feb 6 | Simple examples (1) |
| We will go through a few examples for how the principles of network algorithmics can be applied - Chapter 4 of the textbook. |
|
| Fri, Feb 8 | Simple examples (2) + Q1 |
| We will start the class with the first quiz and finish up Chapter 4. |
|
| Mon, Feb 11 | Prefix lookups (1) |
| We will start discussing solutions for IP lookups (finding the longest matching prefix) - Chapter 11 of the textbook. |
|
| Fri, Feb 15 | Packet classification (1) |
| We will start discussing packet classification - Chapter 12 of the textbook. We will also cover the first paper of the semester, Algorithms for advanced packet classification with ternary CAMs by Karthik Lakshminarayanan, Anand Rangarajan and Srinivasan Venkatachary |
|
| Fri, Feb 22 | Packet classification (3) |
| We also discussed the solution to quiz 2. |
|
| Mon, Feb 25 | String matching |
| We will discuss string matching algorithms. Paper to read: Efficient string matching: An aid to bibliographic search by Alfred V. Aho and Margaret J. Corasick |
|
| Wed, Feb 27 | Regexp matching (1) |
| We will start discussing regular expression matching. Paper to read: Algorithms to accelerate multiple regular expressions matching for deep packet inspection by Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patrick Crowley, and Jonathan Turner |
|
| Fri, Feb 29 | Regexp matching (2) |
| We will discuss extending automata with auxiliary information to reduce memory requirements. The paper will be sent to the class mailing list. |
|
| Wed, Mar 12 | Network security |
| We will cover the rest of Chapter 17. Also read Space/time trade-offs in hash coding with allowable errors by Burton H. Bloom |
|
| Fri, Mar 14 | Exact-match lookups |
| We will cover chapter 10 from the textbook. |
|
| Mon, Mar 24 | Switching (1) |
| We start with chapter 13. |
|
| Mon, Mar 31 | Scheduling+Q4 |
| Chapter 14 |
|
| Wed, Apr 2 | Copying data (1) |
| Chapter 5 |
|
| Mon, Apr 7 | Control transfer (1) |
| Chapter 6 |
|
| Mon, Apr 14 | Timers+Q5 |
| Chapter 7 |
|
| Wed, Apr 16 | Demultiplexing |
| Chapter 8 |
|
| Mon, Apr 21 | Protocol processing (1) |
| Chapter 9 |
|
Last modified Wed Apr 16 12:23:27 2008
|
|
|
