메뉴 건너뛰기




Volumn , Issue , 2009, Pages 2518-2526

IPv6 lookups using distributed and load balanced bloom filters for 100Gbps core router line cards

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERS; BOARD FOOTPRINT; CORE ROUTERS; IP LOOKUP ALGORITHM; LINE CARD; LINE RATE; LOAD-BALANCED; LONGEST PREFIX MATCHES; LOOKUPS; MILLION PACKETS PER SECONDS; MODULAR HARDWARE; ON CHIP MEMORY; POWER DISSIPATION; RESOURCE CONSUMPTION; TABLE SIZE; THREE DIMENSIONS;

EID: 70349653166     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062180     Document Type: Conference Paper
Times cited : (132)

References (27)
  • 1
    • 0014814325 scopus 로고
    • Space/Time Trade-offs in Hash Coding With Allowable Errors
    • July
    • B. Bloom. Space/Time Trade-offs in Hash Coding With Allowable Errors. Communications of the ACM, July 1970.
    • (1970) Communications of the ACM
    • Bloom, B.1
  • 2
    • 0035015894 scopus 로고    scopus 로고
    • Using Multiple Hash Functions to Improve IP Lookups
    • A. Broder and M. Mitzenmacher. Using Multiple Hash Functions to Improve IP Lookups. In IEEE INFOCOM, 2001.
    • (2001) IEEE INFOCOM
    • Broder, A.1    Mitzenmacher, M.2
  • 12
    • 34547678280 scopus 로고    scopus 로고
    • Dynamic Pipelining: Making IP Lookup Truly Scalable
    • J. Hasan and T. N. Vijaykumar. Dynamic Pipelining: Making IP Lookup Truly Scalable. In ACM SIGCOMM, 2005.
    • (2005) ACM SIGCOMM
    • Hasan, J.1    Vijaykumar, T.N.2
  • 13
    • 70349711058 scopus 로고    scopus 로고
    • http://bgp.potaroo.net. BGP Routing Table Analysis Reports. 2008.
    • http://bgp.potaroo.net. BGP Routing Table Analysis Reports. 2008.
  • 14
    • 70349714026 scopus 로고    scopus 로고
    • http://www.cisco.com/en/US/products. Cisco CRS. 2007.
    • (2007) Cisco CRS
  • 17
    • 70349723280 scopus 로고    scopus 로고
    • http://www.netlogicmicro.com. NetLogic.
    • NetLogic
  • 18
    • 51349144110 scopus 로고    scopus 로고
    • Beyond TCAMs: An SRAM-based Multi-Pipeline Architecture for Terabit IP Lookup
    • W. Jiang and V. K. Prasanna. Beyond TCAMs: An SRAM-based Multi-Pipeline Architecture for Terabit IP Lookup. In IEEE INFOCOM, 2008.
    • (2008) IEEE INFOCOM
    • Jiang, W.1    Prasanna, V.K.2
  • 20
    • 70349724980 scopus 로고    scopus 로고
    • Peacock Hash: Fast and Updatable Hashing for High Performance Packet Processing Algorithms
    • S. Kumar, J. Turner, and P. Crowley. Peacock Hash: Fast and Updatable Hashing for High Performance Packet Processing Algorithms. In IEEE INFOCOM, 2008.
    • (2008) IEEE INFOCOM
    • Kumar, S.1    Turner, J.2    Crowley, P.3
  • 25
    • 33749851941 scopus 로고    scopus 로고
    • Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing
    • H. Song, S. Dharmapurikar, J. S. Turner, and J. W. Lockwood. Fast Hash Table Lookup Using Extended Bloom Filter: an Aid to Network Processing. In ACM SIGCOMM, 2005.
    • (2005) ACM SIGCOMM
    • Song, H.1    Dharmapurikar, S.2    Turner, J.S.3    Lockwood, J.W.4
  • 26
    • 34547673302 scopus 로고    scopus 로고
    • Shape Shifting Tries for Faster IP Lookup
    • H. Song, J. Turner, and J. Lockwood. Shape Shifting Tries for Faster IP Lookup. In IEEE ICNP, 2005.
    • (2005) IEEE ICNP
    • Song, H.1    Turner, J.2    Lockwood, J.3
  • 27
    • 0004755523 scopus 로고    scopus 로고
    • Faster IP Lookups Using Controlled Prefix Expansion
    • V. Srinivasan and G. Varghese. Faster IP Lookups Using Controlled Prefix Expansion. In ACM SIGMETRICS, 1998.
    • (1998) ACM SIGMETRICS
    • Srinivasan, V.1    Varghese, G.2


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