메뉴 건너뛰기




Volumn , Issue , 2003, Pages 99-104

HASIL: Hardware assisted software-based IP lookup for large routing tables

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET PROTOCOLS;

EID: 84890870351     PISSN: 15566463     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icon.2003.1266174     Document Type: Conference Paper
Times cited : (10)

References (18)
  • 2
    • 0002002496 scopus 로고    scopus 로고
    • Scalable High Speed IP Routing Lookups
    • Cannes, France
    • M.Waldvogel , G.Varghese, et.al."Scalable High Speed IP Routing Lookups", Proc. of ACM SIGCOM'97, pp. 25-35, Cannes, France.
    • Proc. of ACM SIGCOM'97 , pp. 25-35
    • Waldvogel, M.1    Varghese, G.2
  • 6
    • 84906757864 scopus 로고    scopus 로고
    • Efficient Construction Of Variable-Stride Multibit Tries For IP Lookup
    • Sartaj Sahni and Kun Suk Kim, "Efficient Construction Of Variable-Stride Multibit Tries For IP Lookup," Proc. of SAINT, 2002.
    • Proc. of SAINT, 2002
    • Sahni, S.1    Kim, K.S.2
  • 7
    • 0032656493 scopus 로고    scopus 로고
    • IP Address Lookups Using LC-Tries
    • June
    • S.Nilsson and G.Karlsson , "IP Address Lookups Using LC-Tries," IEEE JSAC, June 1999 ,Vol.17, No. 6 , pp. 1083-1092.
    • (1999) IEEE JSAC , vol.17 , Issue.6 , pp. 1083-1092
    • Nilsson, S.1    Karlsson, G.2
  • 9
    • 0031679714 scopus 로고    scopus 로고
    • Routing Lookups in Hardware at Memory Access Speeds
    • N. McKeown, P.Gupta, and S.Lin, "Routing Lookups in Hardware at Memory Access Speeds," Proc. of IEEE Infocom'98, pp. 1240-1247.
    • Proc. of IEEE Infocom'98 , pp. 1240-1247
    • McKeown, N.1    Gupta, P.2    Lin, S.3
  • 10
  • 15
    • 84950243077 scopus 로고    scopus 로고
    • Routing Prefix Caching in Network Processor Design
    • Huan Liu, "Routing Prefix Caching in Network Processor Design," Proc. ICCCN 2001, Phoenix, AZ, 2001
    • (2001) Proc. ICCCN 2001, Phoenix, AZ
    • Liu, H.1
  • 18
    • 84890885684 scopus 로고    scopus 로고
    • DMP-Tree: Dynamic M-way Prefix Tree data structure for string matching
    • submitted to
    • Nasser Yazdani, Hossein Mohammadi, "DMP-Tree: Dynamic M-way Prefix Tree data structure for string matching", submitted to Elseveir Journal of Algorithms.
    • Elseveir Journal of Algorithms
    • Yazdani, N.1    Mohammadi, H.2


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