Research Interests, Talks and Publications

Research Interests

PhD Defense and Thesis

Talks

• "Routing lookups and packet classification: theory and practice", August 2000, Tutorial at Hot Interconnects VIII, Stanford.
• "Routing lookups and packet classification", July 2000, Tutorial at AT&T research, Florham Park, NJ.
• "Algorithms for routing lookups and packet classification", June 2000, Tutorial at ICCC 2000, New Orleans, LA.
• "Where to go next ?", October 1999, Overview talk on packet classification and its implications on the future of Internet, Stanford University.
• "On Optimal Routing Lookups", May 1999, Talk at Information Systems Lab Seminar, Stanford University.
• "Fast Routing Lookup Mechanisms", March 1998, Seminar on High-Speed Switching, Laboratory of Computer Science, MIT.
• "Scheduling Cells in a Crossbar Switch", September 1997, Stanford University Telecom Center Workshop on Routing and Switching.
• "The Tiny Tera: A Packet Switch Core", March 1997, Presentation to industry visitors at Stanford University.

Publications

• Pankaj Gupta and Nick McKeown, Algorithms for Packet Classification, IEEE Network Special Issue, March/April 2001, vol. 15, no. 2, pp 24-32. PS PDF
• Devavrat Shah and Pankaj Gupta, Fast Updates on Ternary-CAMs for Packet Lookups and Classification, Proc. Hot Interconnects VIII, August 2000, Stanford. PS PDF Slides in PPT. Also in IEEE Micro, vol. 21, no. 1, January/February 2001.
• Pankaj Gupta and Nick McKeown, Dynamic Algorithms with Worst-case Performance for Packet Classification, Proc. IFIP Networking, pp 528-39, May 2000, Paris, France. PS PDF Slides in PPT Errata (PDF)
• Pankaj Gupta, Balaji Prabhakar and Stephen Boyd, Near-Optimal Routing Lookups with Bounded Worst Case Performance, Proc. Infocom, vol. 3, pp 1184-92, March 2000, Tel Aviv, Israel. PS PDF Slides in PPT
• Pankaj Gupta and Nick McKeown, Packet Classification on Multiple Fields, Proc. Sigcomm, Computer Communication Review, vol. 29, no. 4, pp 147-60, September 1999, Harvard University. PS PDF Code Slides in PPT
• Pankaj Gupta and Nick McKeown, Packet Classification using Hierarchical Intelligent Cuttings , Proc. Hot Interconnects VII, August 99, Stanford. PS PDF Code Slides in PPT This paper is also available here, in IEEE Micro, pp 34-41, vol. 20, no. 1, January/February 2000.
• Pankaj Gupta and Nick McKeown, Design and Implementation of a Fast Crossbar Scheduler ( PS , PDF ) Proc. Hot Interconnects VI, August 98, Stanford. Slides in compressed postscript This paper is also available here, in IEEE Micro, pp 20-28, Vol. 19, No. 1, January/February 1999.
• Pankaj Gupta, Steven Lin and Nick McKeown, Routing Lookups in Hardware at Memory Access Speeds, Proc. Infocom, April 98, San Francisco. PS PDF Slides in compressed postscript
• Pankaj Gupta, Simpler (Potential-Based) Proofs of the Running Times of Some Disjoint Set Union-Find Algorithms , in Proceedings of Fifth National Seminar of Theoretical Computer Science , August 1-5 1995, Bombay, India.
• Pankaj Gupta and Neeraj Mittal, Automatic Incorporation of Modifications to Sequential Code in Efficient Compile-Time Parallelization on Distributed Memory Machines, Undergraduate Thesis , May 1995, Department of Computer Science and Engineering, Indian Institute of Technology, Delhi.
• Pankaj Gupta and Samar Sharma, An Efficient Strategy for Solving Search Problems by Learning Macro-operators Dynamically , in Proceedings Tryst'94 . Also available as Technical Report TR 94/4 of the Department of Computer Science and Engineering, Indian Institute of Technology, Delhi.

Unpublished Manuscripts

• Pankaj Gupta, Scheduling in Input Queued Switches: A Survey , June 1996.

Tools

Back to my Home Page