메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Building scalable virtual routers with trie braiding

Author keywords

[No Author keywords available]

Indexed keywords

HIGH-SPEED MEMORY; IN-NETWORK; IP LOOKUP; LIMITING FACTORS; PACKET CLASSIFICATION; PACKET CLASSIFICATION ALGORITHM; PACKET FORWARDING; REAL WORLD DATA; TREE DATA STRUCTURES;

EID: 77953317894     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5461960     Document Type: Conference Paper
Times cited : (41)

References (29)
  • 3
    • 77953306427 scopus 로고    scopus 로고
    • A Proposed Architecture for the GENI Backbone Platform
    • J. Turner, "A Proposed Architecture for the GENI Backbone Platform," in ACM ANCS, 2006.
    • (2006) ACM ANCS
    • Turner, J.1
  • 10
    • 70350764027 scopus 로고    scopus 로고
    • Efficient IP Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers
    • J. Fu and J. Rexford, "Efficient IP Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers," in ACM CoNEXT, 2008.
    • (2008) ACM CoNEXT
    • Fu, J.1    Rexford, J.2
  • 13
    • 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
  • 15
    • 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
  • 16
    • 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
  • 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
  • 19
    • 0003365604 scopus 로고    scopus 로고
    • Packet Classification using Hierarchical Intelligent Cuttings
    • P. Gupta and N. McKeown, "Packet Classification using Hierarchical Intelligent Cuttings," in IEEE Hot Interconnects, 1999.
    • (1999) IEEE Hot Interconnects
    • Gupta, P.1    McKeown, N.2
  • 21
    • 0000578923 scopus 로고    scopus 로고
    • Packet Classification on Multiple Fields
    • P. Gupta and N. McKeown, "Packet Classification on Multiple Fields," in ACM SIGCOMM, 1999.
    • (1999) ACM SIGCOMM
    • Gupta, P.1    McKeown, N.2
  • 22
    • 0002436227 scopus 로고    scopus 로고
    • High Speed Policy-based Packet Forwarding using Efficient Multidimentional Range Matching
    • T. V. Lakshman and D. Stiliadis, "High Speed Policy-based Packet Forwarding using Efficient Multidimentional Range Matching," in ACM SIGCOMM, 1998.
    • (1998) ACM SIGCOMM
    • Lakshman, T.V.1    Stiliadis, D.2
  • 24
    • 0026185673 scopus 로고
    • Identifying Syntactic Differences between two Programs
    • W. Yang, "Identifying Syntactic Differences Between two Programs," Software-Practice and Experience, Vol. 21(7), 739-755, 1991.
    • (1991) Software-Practice and Experience , vol.21 , Issue.7 , pp. 739-755
    • Yang, W.1
  • 26
    • 0001122858 scopus 로고
    • The Tree-to-tree Editing Problem
    • S. Selkow, "The Tree-to-tree Editing Problem," Information Processing Letters, Vol. 6(6), 184-186, 1977.
    • (1977) Information Processing Letters , vol.6 , Issue.6 , pp. 184-186
    • Selkow, S.1
  • 29
    • 25844521204 scopus 로고    scopus 로고
    • ClassBench: A Packet Classification Benchmark
    • D. Taylor and J. Turner, "ClassBench: A Packet Classification Benchmark," in IEEE INFOCOM, 2005.
    • (2005) IEEE INFOCOM
    • Taylor, D.1    Turner, J.2


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