메뉴 건너뛰기




Volumn 1, Issue , 2003, Pages 64-74

Fast incremental updates for pipelined forwarding engines

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; ASSOCIATIVE STORAGE; COMPUTER ARCHITECTURE; DATA STRUCTURES; NETWORK PROTOCOLS; OPTIMIZATION; PACKET NETWORKS; PIPELINE PROCESSING SYSTEMS; SEARCH ENGINES; TABLE LOOKUP; ROUTERS;

EID: 0042475248     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (55)

References (25)
  • 1
    • 0032660761 scopus 로고    scopus 로고
    • Optimal routing table design of IP address lookups under memory constraints
    • New York, NY, March
    • G. Cheung and S. McCanne. Optimal Routing Table Design of IP Address Lookups Under Memory Constraints. In Proceedings of Infocom '99, pages 1437-1444, New York, NY, March 1999.
    • (1999) Proceedings of Infocom '99 , pp. 1437-1444
    • Cheung, G.1    McCanne, S.2
  • 4
    • 0030609294 scopus 로고    scopus 로고
    • Small forwarding tables for fast routing lookups
    • Cannes, France, September
    • M. Degermark, A. Brodnik, S. Carlsson, and S. Pink. Small Forwarding Tables for Fast Routing Lookups. In Proceedings of SIGCOMM '97, pages 3-14, Cannes, France, September 1997.
    • (1997) Proceedings of SIGCOMM '97 , pp. 3-14
    • Degermark, M.1    Brodnik, A.2    Carlsson, S.3    Pink, S.4
  • 6
    • 0031679714 scopus 로고    scopus 로고
    • Routing lookups in hardware at memory access speeds
    • San Francisco, CA, April
    • P. Gupta, S. Lin, and N. McKeown. Routing Lookups in Hardware at Memory Access Speeds. In Proceedings of Infocom '98, pages 1240- 1247, San Francisco, CA, April 1998.
    • (1998) Proceedings of Infocom '98 , pp. 1240-1247
    • Gupta, P.1    Lin, S.2    McKeown, N.3
  • 7
    • 0033885345 scopus 로고    scopus 로고
    • Near-optimal routing lookups with bounded worst case performance
    • Tel Aviv, Israel, March
    • P. Gupta, B. Prabhakar, and S. Boyd. Near-Optimal Routing Lookups with Bounded Worst Case Performance. In Proceedings of Infocom '00, pages 1184-1192, Tel Aviv, Israel, March 2000.
    • (2000) Proceedings of Infocom '00 , pp. 1184-1192
    • Gupta, P.1    Prabhakar, B.2    Boyd, S.3
  • 8
    • 0003245441 scopus 로고    scopus 로고
    • Analyzing the internet's BGP routing table
    • G. Huston. Analyzing the Internet's BGP Routing Table. The Internet Protocol Journal, 4, 2001.
    • (2001) The Internet Protocol Journal , vol.4
    • Huston, G.1
  • 9
    • 0041624916 scopus 로고    scopus 로고
    • IDT. http://www.idt.com.
  • 12
    • 0031701316 scopus 로고    scopus 로고
    • IP lookups using multiway and multicolumn search
    • San Francisco, CA, April
    • B. Lampson, V. Srinivasan, and G. Varghese. IP Lookups Using Multiway and Multicolumn Search. In Proceedings of Infocom '98, pages 1248- 1256, San Francisco, CA, April 1998.
    • (1998) Proceedings of Infocom '98 , pp. 1248-1256
    • Lampson, B.1    Srinivasan, V.2    Varghese, G.3
  • 13
    • 0028731102 scopus 로고
    • A fast algorithm for optimum height-limited alphabetic binary trees
    • December
    • L. L. Larmore and T. M. Przytycka. A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees. SIAM Journal on Computing, 23(6):1283-1312, December 1994.
    • (1994) SIAM Journal on Computing , vol.23 , Issue.6 , pp. 1283-1312
    • Larmore, L.L.1    Przytycka, T.M.2
  • 14
    • 0036168199 scopus 로고    scopus 로고
    • Routing table compaction in ternary CAM
    • January-February
    • H. Liu. Routing Table Compaction in Ternary CAM. IEEE Micro, 22(1):58-64, January-February 2002.
    • (2002) IEEE Micro , vol.22 , Issue.1 , pp. 58-64
    • Liu, H.1
  • 15
    • 38149018071 scopus 로고
    • PATRICIA - Practical algorithm to retrieve information coded in alphanumeric
    • October
    • D. R. Morrison. PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric. Journal of the ACM, 15(4):514-534, October 1968.
    • (1968) Journal of the ACM , vol.15 , Issue.4 , pp. 514-534
    • Morrison, D.R.1
  • 17
    • 0041624914 scopus 로고    scopus 로고
    • Netlogic microsystems, http : //www.netlogicmicro.com.
  • 21
    • 0035108517 scopus 로고    scopus 로고
    • Fast updating algorithms for TCAMs
    • January-February
    • D. Shah and P. Gupta. Fast Updating Algorithms for TCAMs. IEEE Micro, 21(1):36-47, January-February 2001.
    • (2001) IEEE Micro , vol.21 , Issue.1 , pp. 36-47
    • Shah, D.1    Gupta, P.2
  • 22
    • 0033645906 scopus 로고    scopus 로고
    • Memory-efficient state lookups with fast updates
    • Stockholm, Sweden, August
    • S. Sikka and G. Varghese. Memory-Efficient State Lookups with Fast Updates. In Proceedings of SIGCOMM '00, pages 335-347, Stockholm, Sweden, August 2000.
    • (2000) Proceedings of SIGCOMM '00 , pp. 335-347
    • Sikka, S.1    Varghese, G.2
  • 23
    • 0002832087 scopus 로고
    • A tree-based packet routing table for berkeley UNIX
    • Berkeley, CA, January
    • K. Sklower. A Tree-Based Packet Routing Table for Berkeley UNIX. In Proceedings of the Winter 1991 USENIX Conference, pages 93-104, Berkeley, CA, January 1991.
    • (1991) Proceedings of the Winter 1991 USENIX Conference , pp. 93-104
    • Sklower, K.1
  • 24
    • 0002260103 scopus 로고    scopus 로고
    • Fast address lookups using controlled prefix expansion
    • February
    • V. Srinivasan and G. Varghese. Fast Address Lookups Using Controlled Prefix Expansion. ACM Transactions on Computer Systems, 17(1):1-40, February 1999.
    • (1999) ACM Transactions on Computer Systems , vol.17 , Issue.1 , pp. 1-40
    • Srinivasan, V.1    Varghese, G.2


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