Novel hardware architecture for fast address lookups

IEEE Communications Magazine

Volumn 40, Issue 11, 2002, Pages 66-71

  Mehrotra, Pronita ^a   Franzon, Paul D ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC RANDOM ACCESS STORAGE; NETWORK PROTOCOLS; PACKET NETWORKS; STATIC RANDOM ACCESS STORAGE; SWITCHING;

OPTICAL BURST SWITCHING (OBS);

ROUTERS;

EID: 0036872717     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCOM.2002.1046995     Document Type: Article

References (7)

1. N. McKeown and B. Prabhakar, "High Performance Switches and Routers: Theory and Practice," Hot Interconnects Tutorial Slides; http://tiny-tera.stanford.edu/ nickm/talks/index.html), Aug. 1999.
2. P. Gupta, S. Lin, and N. McKeown, "Routing Lookups in Hardware at Memory Access Speeds," Proc. IEEE INFOCOM '98, San Francisco, CA, 1998, pp. 1382-91.
3. K. Sklower, "A Tree-Based Routing Table for Berkeley Unix," Tech. rep., UC Berkeley.
4. S. Nilsson and G. Karlsson, "IP-Address Lookup Using LC-Tries," IEEE JSAC, vol. 17, June 1999, pp. 1083-92.
5. B. Lampson, V. Srinivasan, and G. Varghese, "IP Lookups using Multiway and Multicolumn Search," Proc. IEEE INFOCOM '98, vol. 3, San Francisco, CA, 1998, pp. 1248-56.
6. M. Waldvogel et al., "Scalable High Speed IP Routing Lookups," Proc. ACM SIGCOMM, vol. 27, Oct. 1997, pp. 25-36.
7. "Michigan University and Merit Network. Internet Performance Management and Analysis (IPMA) Project," http://nic.merit.edu/ipma.