Algorithms for Routing Lookups and Packet Classification
PhD Defense (October 03, 2000)
PhD Dissertation (December 05, 2000)
Full Thesis (223 pages)
Thesis by Chapter
- Initial pages (24 pages):
Postscript (211 KB),
PDF (69 KB).
- Chapter 1 (30 pages):
Introduction.
Postscript (291 KB),
PDF (98 KB).
- Chapter 2 (48 pages):
An Algorithm for Performing Routing Lookups in Hardware.
Postscript (308 KB),
PDF (160 KB).
- Chapter 3 (26 pages):
Minimum Average and Bounded Worst-case Routing Lookup Time on Binary
Search Trees.
Postscript (689 KB),
PDF (722 KB).
- Chapter 4 (56 pages):
Recursive Flow Classification: An Algorithm for Packet Classification
on Multiple Fields.
Postscript (545 KB),
PDF (238 KB).
- Chapter 5 (16 pages):
Hierarchical Intelligent Cuttings: A Dynamic Multi-dimensional Packet
Classification Algorithm.
Postscript (150 KB),
PDF (56 KB).
- Chapter 6 (4 pages):
Future Directions.
Postscript (60 KB),
PDF (10 KB).
- Appendix A (2 pages):
Postscript (70 KB),
PDF (9 KB).
- Appendix B (2 pages):
Postscript (66 KB),
PDF (10 KB).
- Bibliography (14 pages):
Postscript (106 KB),
PDF (34 KB).
- Ending shloka (1 page):
Postscript (120 KB),
PDF (26 KB).
Please email me if you find any errors.
Last Updated December 07, 2000
Pankaj Gupta
pankaj@cs.stanford.edu