CS 636: Internetworking

Schedule

Date	Topic	Comments
Jan 13	Course Overview, Administrative details and Introduction	Slides [pdf]
Jan 15	Models	Slides [pdf]
Jan 20	Principles [Chapters 1, 3 and 4] Form project groups of 2-3 students. Preliminary project ideas will be given out.	Slides [pdf]
ROUTER ALGORITHMICS
Jan 22	Exact Match Lookups [Read Chapter 10 of the book]	Slides [pdf]
Jan 27	IP prefix lookups Trie-based lookups Multi-bit tries Controlled-prefix expansion [READ PAPER] Lulea-tries Project proposals due	Slides [pdf]
Jan 29	IP prefix lookups Tree bitmaps Non-trie approaches [binary search on ranges] Bloom Filters [Dharmapurikar et al. SIGCOMM 2003]	Slides [pdf]
Feb 3	Packet Classification Set pruning tries Grid of tries [Srinivasan, Varghese, SIGCOMM 1998] Programming Assignment 1 [Due Feb 19th]	Slides[pdf]
Feb 5 Feb 10	Packet Classification Recursive Flow Classification [Gupta, McKeown] Bit Vector Scheme [Lakshman, Stiliadis] Hi Cuts [Gupta, McKeown] Hyper Cuts [Singh, Varghese] [READ PAPER]	Slides[pdf] Slides[pdf]
Feb 12	Switching Queuing in high-performance packet switching [READ PAPER] Achieving 100% throughput in an input-queued switch [READ PAPER]	Slides[pdf]
Feb 17	Switching A fast switched backplane for a gigabit switched router [READ PAPER]	Slides [pdf]
Feb 19 Feb 24	Switching + packet buffers CIOQ Switches (speedup required to emulate OQ switches) Designing Buffers for Router Line Cards	Slides [pdf]
Feb 26	Scheduling Virtual Clock : A new traffic control algorithm for packet switched networks Efficient fair queueing using deficit round robin	Slides [pdf]
Mar 3	Scheduling Core-stateless fair queuing : Achieving approximately fair bandwidth allocation in high speed networks [Camille] -- slides [pptx] Stratified Round Robin [READ PAPER]	Slides [pdf]
Mar 5	Scheduling Random early detection for congestion avoidance Choke: A stateless active queue management scheme for approximating fair bandwidth allocation Stochastic Fair Blue: A queue management algorithm for enforcing fairness Dynamics of Random Early Detection (FRED paper)	Slides [pdf]
Mar 10	Midterm Review	Slides [pdf]
Mar 12	Midterm exam (in class) [Closed Notes] 1hour and 15 minutes duration!
Mar 17	SPRING BREAK (Have a nice holiday!)
Mar 19	SPRING BREAK (Have a nice holiday!)
Mar 24 Mar 26 Mar 31 Apr 2	Flow measurement New directions in traffic measurement and accounting [READ PAPER] Flow slices Adaptive NetFlow Flow measurement Usage based sampling [Sriharsha] -- slides [pdf] Hierarchical heavy-hitters [John] -- slides [ppt] Statistics Counters Counter architecture Efficient implementation of a statistics counters architecture Counter Braids [Chamikara] -- slides [ppt]	Slides [pdf] Slides [pdf]
Apr 7	Router delay and loss measurement primitives	Slides [pdf]
Apr 9 Apr 14	Security Aho-Corasick, Boyer-Moore, Knuth-morris-pratt, Bloom Filter Approach D2FA for regular expression searches XFA [Debbie] -- slides [pdf]	Slides [pdf] Slides [pdf]
Apr 16 Apr 21	IP Traceback Probabilistic Packet Marking [Mohammad] -- slides [pptx] Hash-based IP traceback [Ankur] -- slides [pdf] Scalable Attack detection TTL based detection [Vivek] -- slides [pdf] Detection of portscans [Eric Sung] -- slides [ppt] Superspreader detection worm detection [Karthik] -- slides [pdf]
Apr 23 Apr 28 Apr 30	END NODE ALGORITHMICS Copying Transferring Control Demultiplexing Protocol Processing	Slides [pdf] Slides [pdf]
FINAL REVIEW SLIDES in PDF Note that student presentation slides are not merged into the final review slides.
May 1	Project presentations Project deadline -- Report & software due on May 8th
May 4 - May 9 FINAL EXAM WEEK