메뉴 건너뛰기




Volumn , Issue , 2006, Pages 29-36

Performance evaluation and cache behavior of LC-Trie for IP-address lookup

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUFFER STORAGE; COMPUTER SOFTWARE; DATA STRUCTURES;

EID: 41549151304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (14)
  • 2
    • 41549087113 scopus 로고    scopus 로고
    • CSC, Finish IT Center for Science, FUNET Looking Glass, Available: http.//www.csc.fi/sumoi/funet/noc/looking-glass/lg.cgi
    • CSC, Finish IT Center for Science, FUNET Looking Glass, Available: http.//www.csc.fi/sumoi/funet/noc/looking-glass/lg.cgi
  • 3
    • 0027222524 scopus 로고    scopus 로고
    • A. McAuley and P. Francis, Fast Routing table Lookups using CAMs, in Proc. of IEEE Infocom'93, 3, pp. 1382-1391, San Francisco, 1993
    • A. McAuley and P. Francis, "Fast Routing table Lookups using CAMs," in Proc. of IEEE Infocom'93, vol. 3, pp. 1382-1391, San Francisco, 1993
  • 4
    • 0041473487 scopus 로고    scopus 로고
    • F. Zane, N. Girija and A. Basu, CoolCAMs: Power-Efficient TCAMs for Forwarding Engines, in Proc. of IEEE Infocom'03, pp. 42-52, San Francisco, May 2003.
    • F. Zane, N. Girija and A. Basu, "CoolCAMs: Power-Efficient TCAMs for Forwarding Engines," in Proc. of IEEE Infocom'03, pp. 42-52, San Francisco, May 2003.
  • 5
    • 84943548570 scopus 로고    scopus 로고
    • E. Spitznagel, D. Taylor and J. Turner, Packet Classification Using Extended TCAMs, in Proc. of ICNP'03, pp. 120-131, Nov. 2003.
    • E. Spitznagel, D. Taylor and J. Turner, "Packet Classification Using Extended TCAMs", in Proc. of ICNP'03, pp. 120-131, Nov. 2003.
  • 6
    • 0031679714 scopus 로고    scopus 로고
    • P. Gupta, S. Lin, and N. McKeown, Routing Lookups in Hardware at Memory Access Speeds, in Proc. of IEEE Infocom'98, pp. 1240-1247, San Francisco, Apr. 1998.
    • P. Gupta, S. Lin, and N. McKeown, "Routing Lookups in Hardware at Memory Access Speeds," in Proc. of IEEE Infocom'98, pp. 1240-1247, San Francisco, Apr. 1998.
  • 7
    • 41549165777 scopus 로고    scopus 로고
    • A. Moestedt and P. Sjödin, IP Address Lookup in Hardware for High-Speed Routing, in Proceedings of Hot Interconnects VI, Stanford, 1998
    • A. Moestedt and P. Sjödin, "IP Address Lookup in Hardware for High-Speed Routing, " in Proceedings of Hot Interconnects VI, Stanford, 1998
  • 8
    • 0030609294 scopus 로고    scopus 로고
    • M. Degermark et al., Small Forwarding Tables for Fast Routing Lookups, in Proc. ACM SIGCOMM Conference'97, pages 3-14, Oct. 1997
    • M. Degermark et al., "Small Forwarding Tables for Fast Routing Lookups", in Proc. ACM SIGCOMM Conference'97, pages 3-14, Oct. 1997
  • 9
    • 0032094174 scopus 로고    scopus 로고
    • Faster IP lookups using controlled prefix expansion
    • Madison, pp
    • V. Srinivasan and G. Varghese, "Faster IP lookups using controlled prefix expansion," in Proc. of ACM SIGMETRICS 1998, Madison, pp. 1-10, 1998.
    • (1998) Proc. of ACM SIGMETRICS , pp. 1-10
    • Srinivasan, V.1    Varghese, G.2
  • 10
    • 0034819648 scopus 로고    scopus 로고
    • Performance modeling for fast IP lookups
    • G. Narlikar and F. Zane, "Performance modeling for fast IP lookups", in Proc. of ACM SIGMETRICS 2001, pp.1-12, 2001.
    • (2001) Proc. of ACM SIGMETRICS , pp. 1-12
    • Narlikar, G.1    Zane, F.2
  • 12
    • 0035278505 scopus 로고    scopus 로고
    • Survey and taxonomy of ip address lookup algorithms
    • Mar
    • M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of ip address lookup algorithms," IEEE Network Magazine, vol. 15, no. 2, pp. 8-23, Mar. 2001
    • (2001) IEEE Network Magazine , vol.15 , Issue.2 , pp. 8-23
    • Ruiz-Sanchez, M.A.1    Biersack, E.W.2    Dabbous, W.3
  • 14
    • 85011364350 scopus 로고    scopus 로고
    • A. Andersson and S. Nilsson. Faster searching in tries and quadtrees-an analysis of level compression, in Proc. of Second Annual European Symposium on algorithms, pp. 82-93, 1994.
    • A. Andersson and S. Nilsson. "Faster searching in tries and quadtrees-an analysis of level compression," in Proc. of Second Annual European Symposium on algorithms, pp. 82-93, 1994.


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