메뉴 건너뛰기




Volumn 17, Issue 6, 1999, Pages 1083-1092

IP-address lookup using LC-tries

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; DATA STRUCTURES; INTERNET; MULTICASTING; NETWORK PROTOCOLS; PACKET SWITCHING; ROUTERS; SWITCHING SYSTEMS; TABLE LOOKUP; TELECOMMUNICATION SERVICES; VECTORS;

EID: 0032656493     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.772439     Document Type: Article
Times cited : (355)

References (24)
  • 1
    • 0027634755 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • Implementing radixsort
    • to be published
    • _, "Implementing radixsort," ACM J. Experimental Algorithmics, to be published.
    • ACM J. Experimental Algorithmics
  • 6
    • 0020384018 scopus 로고
    • 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
  • 9
    • 0029356674 scopus 로고
    • 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 scopus 로고
    • 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
  • 13
    • 0031679714 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 20
    • 0000424839 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 24
    • 0026748024 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.