|
37
|
A tree-based routing table for Berkeley Unix
– K Sklower
- 1993
|
|
18
|
Trading Packet Headers for Packet Processing
– George Varghese
- 1994
|
|
61
|
Routing on longestmatching prefixes
– W Doeringer, G Karjoth, M Nassehi
- 1996
|
|
29
|
Trading Packet Headers for Packet Processing
– Girish Chandranmenon, Girish P. Ch, George Varghese
- 1995
|
|
138
|
Scalable High Speed IP Routing Lookups
– Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
- 1997
|
|
23
|
Optimal Routing Table Design for IP Address Lookups Under Memory Constraints
– Gene Cheung, Steve McCanne
- 1999
|
|
157
|
Small forwarding tables for fast routing lookups
– Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink
- 1997
|
|
74
|
Fast address lookup for Internet routers
– Stefan Nilsson, Gunnar Karlsson
- 1998
|
|
71
|
IP switching and gigabit routers
– Peter Newman, Greg Minshall, Tom Lyon, Larry Huston
- 1997
|
|
85
|
Faster IP Lookups using Controlled Prefix Expansion
– V. Srinivasan, George Varghese
- 1998
|
|
89
|
Fast Routing Table Lookup Using CAMs
– Anthony J. Mcauley, Paul Francis
- 1993
|
|
137
|
Routing Lookups in Hardware at Memory Access Speeds
– Pankaj Gupta, Steven Lin, Nick Mckeown
- 1998
|
|
22
|
Memory-efficient state lookups with fast updates
– Sandeep Sikka
- 2000
|
|
13
|
Fast multilevel hierarchical routing table using content-adressable memory
– A McAuley, P Tsuchiya, D Wilson
- 1995
|
|
3
|
Internet Routing
– C Labovitz, G Malan, F Jahanian
|
|
13
|
IP/ATM: A strategy for Integrating
– G Parulkar, D Schmidt, J Turner
- 1995
|
|
6
|
Ipma statistics, http://nic.merit.edu/ipma, (snapshot on
– Merit
- 2000
|
|
3
|
IP lookup by binary search on length
– K Kim, S Sahni
- 2002
|
|
8
|
An O(log n) Dynamic Router-Table Design
– Sartaj Sahni, Kun Suk Kim
- 2004
|
