-
1
-
-
0032660761
-
Optimal routing table design of IP address lookups under memory constraints
-
New York, NY, March
-
G. Cheung and S. McCanne. Optimal Routing Table Design of IP Address Lookups Under Memory Constraints. In Proceedings of Infocom '99, pages 1437-1444, New York, NY, March 1999.
-
(1999)
Proceedings of Infocom '99
, pp. 1437-1444
-
-
Cheung, G.1
McCanne, S.2
-
4
-
-
0030609294
-
Small forwarding tables for fast routing lookups
-
Cannes, France, September
-
M. Degermark, A. Brodnik, S. Carlsson, and S. Pink. Small Forwarding Tables for Fast Routing Lookups. In Proceedings of SIGCOMM '97, pages 3-14, Cannes, France, September 1997.
-
(1997)
Proceedings of SIGCOMM '97
, pp. 3-14
-
-
Degermark, M.1
Brodnik, A.2
Carlsson, S.3
Pink, S.4
-
5
-
-
0032673941
-
Constructing optimal IP routing tables
-
New York, NY, March
-
R. P. Draves, C. King, S. Venkatachary, and B. N. Zill. Constructing Optimal IP Routing Tables. In Proceedings of Infocom '99, New York, NY, March 1999.
-
(1999)
Proceedings of Infocom '99
-
-
Draves, R.P.1
King, C.2
Venkatachary, S.3
Zill, B.N.4
-
6
-
-
0031679714
-
Routing lookups in hardware at memory access speeds
-
San Francisco, CA, April
-
P. Gupta, S. Lin, and N. McKeown. Routing Lookups in Hardware at Memory Access Speeds. In Proceedings of Infocom '98, pages 1240- 1247, San Francisco, CA, April 1998.
-
(1998)
Proceedings of Infocom '98
, pp. 1240-1247
-
-
Gupta, P.1
Lin, S.2
McKeown, N.3
-
7
-
-
0033885345
-
Near-optimal routing lookups with bounded worst case performance
-
Tel Aviv, Israel, March
-
P. Gupta, B. Prabhakar, and S. Boyd. Near-Optimal Routing Lookups with Bounded Worst Case Performance. In Proceedings of Infocom '00, pages 1184-1192, Tel Aviv, Israel, March 2000.
-
(2000)
Proceedings of Infocom '00
, pp. 1184-1192
-
-
Gupta, P.1
Prabhakar, B.2
Boyd, S.3
-
8
-
-
0003245441
-
Analyzing the internet's BGP routing table
-
G. Huston. Analyzing the Internet's BGP Routing Table. The Internet Protocol Journal, 4, 2001.
-
(2001)
The Internet Protocol Journal
, vol.4
-
-
Huston, G.1
-
9
-
-
0041624916
-
-
IDT. http://www.idt.com.
-
-
-
-
10
-
-
0032597647
-
Experimental study of internet stability and wide-area backbone failures
-
Madison, WI, June
-
C. Labovitz, A. Ahuja, and F. Jahanian. Experimental Study of Internet Stability and Wide-Area Backbone Failures. In Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing, Madison, WI, June 1999.
-
(1999)
Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
-
-
Labovitz, C.1
Ahuja, A.2
Jahanian, F.3
-
11
-
-
0032628836
-
Origins of internet routing instability
-
New York, NY, March
-
C. Labovitz, G. R. Malan, and F. Jahanian. Origins of Internet Routing Instability. In Proceedings of Infocom '99, New York, NY, March 1999.
-
(1999)
Proceedings of Infocom '99
-
-
Labovitz, C.1
Malan, G.R.2
Jahanian, F.3
-
12
-
-
0031701316
-
IP lookups using multiway and multicolumn search
-
San Francisco, CA, April
-
B. Lampson, V. Srinivasan, and G. Varghese. IP Lookups Using Multiway and Multicolumn Search. In Proceedings of Infocom '98, pages 1248- 1256, San Francisco, CA, April 1998.
-
(1998)
Proceedings of Infocom '98
, pp. 1248-1256
-
-
Lampson, B.1
Srinivasan, V.2
Varghese, G.3
-
13
-
-
0028731102
-
A fast algorithm for optimum height-limited alphabetic binary trees
-
December
-
L. L. Larmore and T. M. Przytycka. A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. SIAM Journal on Computing, 23(6):1283-1312, December 1994.
-
(1994)
SIAM Journal on Computing
, vol.23
, Issue.6
, pp. 1283-1312
-
-
Larmore, L.L.1
Przytycka, T.M.2
-
14
-
-
0036168199
-
Routing table compaction in ternary CAM
-
January-February
-
H. Liu. Routing Table Compaction in Ternary CAM. IEEE Micro, 22(1):58-64, January-February 2002.
-
(2002)
IEEE Micro
, vol.22
, Issue.1
, pp. 58-64
-
-
Liu, H.1
-
15
-
-
38149018071
-
PATRICIA - Practical algorithm to retrieve information coded in alphanumeric
-
October
-
D. R. Morrison. PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric. Journal of the ACM, 15(4):514-534, October 1968.
-
(1968)
Journal of the ACM
, vol.15
, Issue.4
, pp. 514-534
-
-
Morrison, D.R.1
-
17
-
-
0041624914
-
-
Netlogic microsystems, http : //www.netlogicmicro.com.
-
-
-
-
21
-
-
0035108517
-
Fast updating algorithms for TCAMs
-
January-February
-
D. Shah and P. Gupta. Fast Updating Algorithms for TCAMs. IEEE Micro, 21(1):36-47, January-February 2001.
-
(2001)
IEEE Micro
, vol.21
, Issue.1
, pp. 36-47
-
-
Shah, D.1
Gupta, P.2
-
22
-
-
0033645906
-
Memory-efficient state lookups with fast updates
-
Stockholm, Sweden, August
-
S. Sikka and G. Varghese. Memory-Efficient State Lookups with Fast Updates. In Proceedings of SIGCOMM '00, pages 335-347, Stockholm, Sweden, August 2000.
-
(2000)
Proceedings of SIGCOMM '00
, pp. 335-347
-
-
Sikka, S.1
Varghese, G.2
-
23
-
-
0002832087
-
A tree-based packet routing table for berkeley UNIX
-
Berkeley, CA, January
-
K. Sklower. A Tree-Based Packet Routing Table for Berkeley UNIX. In Proceedings of the Winter 1991 USENIX Conference, pages 93-104, Berkeley, CA, January 1991.
-
(1991)
Proceedings of the Winter 1991 USENIX Conference
, pp. 93-104
-
-
Sklower, K.1
-
24
-
-
0002260103
-
Fast address lookups using controlled prefix expansion
-
February
-
V. Srinivasan and G. Varghese. Fast Address Lookups Using Controlled Prefix Expansion. ACM Transactions on Computer Systems, 17(1):1-40, February 1999.
-
(1999)
ACM Transactions on Computer Systems
, vol.17
, Issue.1
, pp. 1-40
-
-
Srinivasan, V.1
Varghese, G.2
-
25
-
-
0030609298
-
Scalable high speed IP routing lookups
-
Cannes, France, September
-
M. Waldvogel, G. Varghese, J. Turner, and B. Plattner. Scalable High Speed IP Routing Lookups. In Proceedings of SIGCOMM '97, pages 25- 38, Cannes, France, September 1997.
-
(1997)
Proceedings of SIGCOMM '97
, pp. 25-38
-
-
Waldvogel, M.1
Varghese, G.2
Turner, J.3
Plattner, B.4
|