You can find all the papers listed here at citeseer. For example, to get the paper of Srinivasan and Varghese titled "Faster IP Lookups using Controlled Prefix Expansion", enter Srinivasan AND Varghese AND expansion in the search window, then click on the doc link.

• Router architecture
  • S. Keshav and R. Sharma. Issues and trends in router design. IEEE Communications Magazine, May 1998.
  • L. Peterson and B. Davie. Computer Networks, A Systems Approach.
• IP forwarding in software
  • Radia Perlman, ``Interconnections: Second Edition,'' Chapter 13, Addison-Wesley, 2000.
  • Knuth, vol. 3, TAOCP, pages 492--512
  • Srinivasan and Varghese, "Faster IP Lookups using Controlled Prefix Expansion," ACM Sigmetrics, 1998
  • Degermark, et al., "Small forwarding tables for fast routing lookups," ACM Sigcomm, 1998
  • M. Waldvogel, et al., "Scalable High Speed IP Routing Lookups," ACM Sigcomm, 1997
  • B. Lampson, et al., "IP Lookups using Multiway and Multicolum Search," IEEE Infocom, 1998
• IP forwarding in hardware
  • A. McAuley and P. Francis. Fast Routing Table Lookup Using CAMs. IEEE Infocom, 1993.
  • Lara Networks. CYNSE70032 Network Search Engine. www.laranetworks.com
  • P. Gupta, S. Lin, and N. McKeown. Routing Lookups in Hardware at Memory Access Speeds. IEEE Infocom, 1998.
  • A. Prakash and A. Aziz. OC-3072 Packet Classification Using BDDs and Pipelined SRAMs. Hot Interconnects, 2001.
• Packet classification
  • P. Gupta. Algorithms for routing lookups and packet classification. PhD Thesis, Stanford University, 2001. (Excellent survey, pages 106--128; recursive flow classification in detail)
  • F. Baboescu and G. Varghese. Scalable packet classification. ACM SIGCOMM, 2001. (Aggregated bit vector appproach in detail.)
  • P. Agrawal and J. Erickson. Geometric range searching and its relatives. (Extremely rigorous, mathematical treatment.)
  • T. Lakshman and D. Stiliadis. High-speed policy-based packet forwarding using efficient multidimensional range matching. ACM SIGCOMM, 1998. (An O(N) space, O(log N) time scheme for 2-dimensional classification.)
• Scheduling
  • An Engineering Approach to Computer Networking, Chapter 9. S. Keshav. Addison-Wesley, 1997.
  • Hashed and Hierarchical Timing Wheels: Efficient Data Structures for Impelementing a Timer Facility. G. Varghese and A. Lauck. IEEE/ACM Transactions on Networking, 5(6), 1997.
• Fabrics
  • Architectural choices in large scale ATM switches. J. Turner and N. Yamanaka. IEICE Transactions, 1998.
  • An Engineering Approach to Computer Networking, Chapter 8. S. Keshav. Addison-Wesley, 1997.
  • Parallel Algorithms and Architectures. T. Leighton. Morgan Kaufmann, 1992.
• SLIP and its variants
  • Scheduling algorithms for input-queued cell switches. N. McKeown. PhD Thesis, UC Berkeley, 1995.
• Stability
  • Universal Stability Results for Greedy Contention-Resolution Protocols. M. Andrews, B. Awerbuch, A. Fernandex, J. Kleinberg, T. Leighton, and Z. Liu. FOCS 1996.
  • Achieving 100% throughput in an input-queued switch. N. McKeown, A. Mekkittul, V. Anatharam, and J. Walrand. IEEE Transactions on Communications, Vol.47, No.8, August 1999.
  • The throughput f data switches with and without speedup. J. Dai and B. Prabhakar. IEEE Infocom 2000.
  • Achieving stability in networks of input-queued switches. M. Andrews and L. Zhang. IEEE Infocom 2001.