Research Interests, Talks and Publications
Research Interests
Networks and Distributed Systems, with focus in high speed switches
and routers: fast routing lookup mechanisms, packet classification,
IP routing, switching architectures, scheduling algorithms, protocols.
Talks and Presentations
-
"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,
Dynamic Algorithms with Worst-case Performance for Packet Classification,
Proc. IFIP Networking, May 2000, Paris, France.
PS PDF
Slides in PPT
- Pankaj Gupta, Balaji Prabhakar and Stephen Boyd,
Near-Optimal Routing Lookups with Bounded Worst Case Performance,
Proc. Infocom, March 2000, Tel Aviv, Israel.
PS PDF
Slides in PPT
- Pankaj Gupta and Nick McKeown,
Packet Classification on Multiple Fields,
Proc. Sigcomm, September 1999, Harvard University.
PS PDF
Code
Slides in PPT
(This work is publicly available for general use).
- 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 work is currently under the process of being patented. For
licensing, please email here).
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 ,
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
Back to my Home Page
Last Updated June 7, 2000
pankaj@cs.stanford.edu
