-
1
-
-
0027634755
-
Improved behavior of tries by adaptive branching
-
A. Andersson and S. Nilsson, "Improved behavior of tries by adaptive branching," Inform. Processing Lett., vol. 46, no. 6, pp. 295-300, 1993.
-
(1993)
Inform. Processing Lett.
, vol.46
, Issue.6
, pp. 295-300
-
-
Andersson, A.1
Nilsson, S.2
-
2
-
-
85011364350
-
Faster searching in tries and quadtrees - An analysis of level compression
-
_, "Faster searching in tries and quadtrees - An analysis of level compression," in Proc. 2nd Ann. European Symp. Algorithms, 1994, pp. 82-93.
-
(1994)
Proc. 2nd Ann. European Symp. Algorithms
, pp. 82-93
-
-
-
3
-
-
0344981011
-
Implementing radixsort
-
to be published
-
_, "Implementing radixsort," ACM J. Experimental Algorithmics, to be published.
-
ACM J. Experimental Algorithmics
-
-
-
4
-
-
0027693789
-
Engineering a sort function
-
J. L. Bentley and M. D. McIlroy, "Engineering a sort function," Software - Practice and Experience, vol. 23, no. 11, pp. 1249-1265, 1993.
-
(1993)
Software - Practice and Experience
, vol.23
, Issue.11
, pp. 1249-1265
-
-
Bentley, J.L.1
McIlroy, M.D.2
-
5
-
-
0030609294
-
Small forwarding tables for fast routing lookups
-
Oct.
-
M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small forwarding tables for fast routing lookups," ACM Comput. Commun. Rev., vol. 27, pp. 3-14, Oct. 1997.
-
(1997)
ACM Comput. Commun. Rev.
, vol.27
, pp. 3-14
-
-
Degermark, M.1
Brodnik, A.2
Carlsson, S.3
Pink, S.4
-
6
-
-
0020384018
-
A note on the average depth of tries
-
L. Devroye, "A note on the average depth of tries," Computing, vol. 28, no. 4, pp. 367-371, 1992.
-
(1992)
Computing
, vol.28
, Issue.4
, pp. 367-371
-
-
Devroye, L.1
-
7
-
-
0030085398
-
Routing on longest-matching prefixes
-
Feb.
-
W. Doeringer, G. Karjoth, and M. Nassehi, "Routing on longest-matching prefixes," IEEE/ACM Trans. Networking, vol. 4, pp. 86-97, Feb. 1996.
-
(1996)
IEEE/ACM Trans. Networking
, vol.4
, pp. 86-97
-
-
Doeringer, W.1
Karjoth, G.2
Nassehi, M.3
-
8
-
-
0032097258
-
A 50-Gb/s IP router
-
June
-
C. Partridge, P. P. Carvey, E. Burgess, I. Castineyra, T. Clarke, L. Graham, M. Hathaway, P. Herman, A. King, S. Kohalmi, T. Ma, J. McCallen, T. Mendez, W. C. Milliken, R. Pettyjohn, J. Rokosz, J. Seeger, M. Sollins, S. Storch, B. Tober, G. D. Troxel, D. Waitzman, and S. Winterble, "A 50-Gb/s IP router," IEEE/ACM Trans. Networking, vol. 6, pp. 237-248, June 1998.
-
(1998)
IEEE/ACM Trans. Networking
, vol.6
, pp. 237-248
-
-
Partridge, C.1
Carvey, P.P.2
Burgess, E.3
Castineyra, I.4
Clarke, T.5
Graham, L.6
Hathaway, M.7
Herman, P.8
King, A.9
Kohalmi, S.10
Ma, T.11
McCallen, J.12
Mendez, T.13
Milliken, W.C.14
Pettyjohn, R.15
Rokosz, J.16
Seeger, J.17
Sollins, M.18
Storch, S.19
Tober, B.20
Troxel, G.D.21
Waitzman, D.22
Winterble, S.23
more..
-
9
-
-
0029356674
-
Link-sharing and resource management models for packet networks
-
Aug.
-
S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet networks," IEEE/ACM Trans. Networking, vol. 3, pp. 365-386, Aug. 1995.
-
(1995)
IEEE/ACM Trans. Networking
, vol.3
, pp. 365-386
-
-
Floyd, S.1
Jacobson, V.2
-
10
-
-
84945709825
-
Trie memory
-
E. Fredkin, "Trie memory," Commun. ACM, vol. 3, pp. 490-500, 1960.
-
(1960)
Commun. ACM
, vol.3
, pp. 490-500
-
-
Fredkin, E.1
-
11
-
-
0003867558
-
-
RFC 1519, Sept.
-
V. Fuller, T. Li, J. Yu, and K. Varadhan, "Classless inter-domain routing (CIDR): An address assignment and aggregation strategy," RFC 1519, Sept. 1993.
-
(1993)
Classless Inter-domain Routing (CIDR): An Address Assignment and Aggregation Strategy
-
-
Fuller, V.1
Li, T.2
Yu, J.3
Varadhan, K.4
-
13
-
-
0031679714
-
Routing lookups in hardware at memory access speeds
-
San Francisco, CA
-
P. Gupta, S. Lin, and N. McKeown, "Routing lookups in hardware at memory access speeds," in Proc. Infocom'98, San Francisco, CA.
-
Proc. Infocom'98
-
-
Gupta, P.1
Lin, S.2
McKeown, N.3
-
14
-
-
0031096030
-
A literature survey on traffic dispersion
-
E. Gustafsson and G. Karlsson, "A literature survey on traffic dispersion," IEEE Network, vol. 11, no. 2, pp. 265-270, 1997.
-
(1997)
IEEE Network
, vol.11
, Issue.2
, pp. 265-270
-
-
Gustafsson, E.1
Karlsson, G.2
-
16
-
-
0031701316
-
IP lookups using multiway and multicolumn search
-
San Francisco, CA
-
B. Lampson, V. Srinivasan, and G. Varghese, "IP lookups using multiway and multicolumn search," in Proc. IEEE Infocom'98, San Francisco, CA, 1998, pp. 1248-1256.
-
(1998)
Proc. IEEE Infocom'98
, pp. 1248-1256
-
-
Lampson, B.1
Srinivasan, V.2
Varghese, G.3
-
17
-
-
0006499220
-
IP address lookup in hardware for high-speed routing
-
Stanford, Aug.
-
A. Moestedt and P. Sjödin, "IP address lookup in hardware for high-speed routing," in Proc. Hot Interconnects VI, Stanford, Aug. 1998.
-
(1998)
Proc. Hot Interconnects VI
-
-
Moestedt, A.1
Sjödin, P.2
-
18
-
-
0002615722
-
IP switching and gigabit routers
-
Jan.
-
P. Newman, G. Minshall, T. Lyon, and L. Huston, "IP switching and gigabit routers," IEEE Commun. Magazine, vol. 35, pp. 64-69, Jan. 1997.
-
(1997)
IEEE Commun. Magazine
, vol.35
, pp. 64-69
-
-
Newman, P.1
Minshall, G.2
Lyon, T.3
Huston, L.4
-
19
-
-
0001847147
-
Fast address lookup for internet routers
-
P. Kühn and R. Ulrich, Eds. London: Chapman & Hall
-
S. Nilsson and G. Karlsson, "Fast address lookup for internet routers," in Proceedings of Broadband Communications: The Future of Telecommunications, P. Kühn and R. Ulrich, Eds. London: Chapman & Hall, 1998, pp. 11-22.
-
(1998)
Proceedings of Broadband Communications: The Future of Telecommunications
, pp. 11-22
-
-
Nilsson, S.1
Karlsson, G.2
-
20
-
-
0000424839
-
Limiting distribution for the depth in Patricia tries
-
B. Rais, P. Jacquet, and W. Szpankowski, "Limiting distribution for the depth in Patricia tries," SIAM J. Discrete Math., vol. 6, no. 2, pp. 197-213, 1993.
-
(1993)
Siam J. Discrete Math.
, vol.6
, Issue.2
, pp. 197-213
-
-
Rais, B.1
Jacquet, P.2
Szpankowski, W.3
-
21
-
-
0002832087
-
A tree-based packet routing table for Berkeley Unix
-
Dallas, TX
-
K. Sklower, "A tree-based packet routing table for Berkeley Unix," in Proc. 1991 Winter USENIX Conf., Dallas, TX, pp. 93-99.
-
Proc. 1991 Winter USENIX Conf.
, pp. 93-99
-
-
Sklower, K.1
-
22
-
-
0032094174
-
Faster IP lookups using controlled prefix expansion
-
Madison, WI
-
V. Srinivasan and G. Varghese, "Faster IP lookups using controlled prefix expansion," in Proc. SIGMETRICS 98, Madison, WI, pp. 1-10.
-
Proc. Sigmetrics 98
, pp. 1-10
-
-
Srinivasan, V.1
Varghese, G.2
-
23
-
-
0030609298
-
Scalable high speed ip routing lookups
-
Oct.
-
M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed IP routing lookups," ACM Comput. Commun. Rev., vol. 27, pp. 25-36, Oct. 1997.
-
(1997)
Acm Comput. Commun. Rev.
, vol.27
, pp. 25-36
-
-
Waldvogel, M.1
Varghese, G.2
Turner, J.3
Plattner, B.4
-
24
-
-
0026748024
-
Putting routing tables into silicon
-
Jan.
-
C. A. Zukowski and T. Pei, "Putting routing tables into silicon," IEEE Network, pp. 42-50, Jan. 1992.
-
(1992)
IEEE Network
, pp. 42-50
-
-
Zukowski, C.A.1
Pei, T.2
|