메뉴 건너뛰기




Volumn , Issue , 2007, Pages 218-223

A cache architecture for counting bloom filters

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERING; CACHE ARCHITECTURE; INTERNATIONAL CONFERENCES; MEMORY ACCESSES; MULTI-LEVEL CACHE ARCHITECTURE; MULTI-LEVEL MEMORY HIERARCHIES; NETWORK PROCESSORS; PACKET CLASSIFICATION; PACKET PROCESSING; SPECIAL HARDWARE; WEB CACHING SYSTEMS;

EID: 48149099104     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICON.2007.4444089     Document Type: Conference Paper
Times cited : (16)

References (10)
  • 3
    • 0014814325 scopus 로고
    • Space /Time Trade-offs in Hash Coding with Allowable Errors
    • July
    • B. H. Bloom. "Space /Time Trade-offs in Hash Coding with Allowable Errors". Communication of the ACM. 13(7):422-426, July 1970.
    • (1970) Communication of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 6
    • 38949094067 scopus 로고    scopus 로고
    • Fast Packet Classification Using Bloom Filters
    • Technical Report 27, Department of Computer Science And Engineering, Washington University in St. Louis, May
    • S. Dharmapurikar, H. Song, J. Turner, and J. Lockwood. "Fast Packet Classification Using Bloom Filters". Technical Report 27, Department of Computer Science And Engineering, Washington University in St. Louis, May 2006.
    • (2006)
    • Dharmapurikar, S.1    Song, H.2    Turner, J.3    Lockwood, J.4
  • 7


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