메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 992-1001

IPStash: A set-associative memory approach for efficient IP-lookup

Author keywords

Network architectures; Network routers; Routing table lookup; Set associative memories; Ternary Content Addressable Memories

Indexed keywords

NETWORK ARCHITECTURE; NETWORK ROUTERS; ROUTING TABLE LOOKUP; SET-ASSOCIATIVE MEMORY; TERNARY CONTENT ADDRESSABLE MEMORIES;

EID: 25844468554     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2005.1498328     Document Type: Conference Paper
Times cited : (28)

References (30)
  • 1
    • 84968830512 scopus 로고    scopus 로고
    • Memory hierarchy design for a multiprocessor lookup engine
    • Septemper
    • J. Baer, D. Low, P. Crowley, and N Sidhwaney. Memory Hierarchy Design for a Multiprocessor Lookup Engine. Pact 2003, Septemper 2003.
    • (2003) Pact 2003
    • Baer, J.1    Low, D.2    Crowley, P.3    Sidhwaney, N.4
  • 2
    • 0032660761 scopus 로고    scopus 로고
    • Optimal routing table design for IP address lookups under memory constraints
    • G. Cheung and S. McCanne, "Optimal Routing Table Design for IP Address Lookups Under Memory Constraints." IEEE INFOCOM, pp. 1437-44, 1999.
    • (1999) IEEE INFOCOM , pp. 1437-1444
    • Cheung, G.1    McCanne, S.2
  • 5
    • 0035336453 scopus 로고    scopus 로고
    • Meeting traffic demands with next-generation Internet infrastructure
    • May
    • A. Gallo, "Meeting Traffic Demands with Next-Generation Internet Infrastructure." Lightwave, 18(5):118-123, May 2001.
    • (2001) Lightwave , vol.18 , Issue.5 , pp. 118-123
    • Gallo, A.1
  • 6
    • 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
  • 7
    • 25844529730 scopus 로고    scopus 로고
    • IDT. http://www.idt.com
  • 8
    • 27944489986 scopus 로고    scopus 로고
    • IPStash: A power efficient memory architecture for IP lookup
    • November
    • S. Kaxiras and G. Keramidas, "IPStash: A Power Efficient Memory Architecture for IP lookup", In Proc. of MICRO-36, November 2003.
    • (2003) Proc. of MICRO-36
    • Kaxiras, S.1    Keramidas, G.2
  • 12
    • 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
  • 13
    • 25844496401 scopus 로고    scopus 로고
    • Routing prefix caching in network processor design
    • October
    • H. Liu, "Routing Prefix Caching in Network Processor Design." IEEE ICCCN 2001, October 2001.
    • (2001) IEEE ICCCN 2001
    • Liu, H.1
  • 18
    • 3042607216 scopus 로고    scopus 로고
    • Reducing TCAM power consumption and increasing thoughput
    • Stanford, California
    • R. Panigraphy and S. Sharma, "Reducing TCAM Power Consumption and Increasing Thoughput", Proc. of HotI'02, Stanford, California, 2002.
    • (2002) Proc. of HotI'02
    • Panigraphy, R.1    Sharma, S.2
  • 20
    • 84890868289 scopus 로고    scopus 로고
    • National Laboratory for Applied Network Research
    • Passive Measurement and Analysis project, National Laboratory for Applied Network Research. http://pma.nlanr.net/PMA
    • Passive Measurement and Analysis Project
  • 21
    • 25844476619 scopus 로고    scopus 로고
    • EaseCAM: An energy and storage efficient TCAM-based router architecture
    • V. C. Ravikumar, R. Mahapatra and L. Bhuyan, "EaseCAM: An Energy and Storage Efficient TCAM-based Router Architecture", IEEE Micro, 2004.
    • (2004) IEEE Micro
    • Ravikumar, V.C.1    Mahapatra, R.2    Bhuyan, L.3
  • 22
    • 25844530375 scopus 로고    scopus 로고
    • RIPE Network Coordination Centre. http://www.ripe.net
  • 24
    • 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
  • 26
    • 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
  • 29
    • 0041473487 scopus 로고    scopus 로고
    • CoolCAMs:Power-efficient TCAMs for forwarding engines
    • April
    • F. Zane, G. Narlikar, A. Basu, "CoolCAMs:Power-Efficient TCAMs for Forwarding Engines." IEEE INFOCOM, April 2003.
    • (2003) IEEE INFOCOM
    • Zane, F.1    Narlikar, G.2    Basu, A.3
  • 30
    • 8344242921 scopus 로고    scopus 로고
    • An ultra high thoughput and power efficinent TCAM-based IP lookup engine
    • K. Zheng, C. Hu, H. Lu and B. Liu, "An Ultra High Thoughput and Power Efficinent TCAM-Based IP Lookup Engine", IEEE Infocom, 2004.
    • (2004) IEEE Infocom
    • Zheng, K.1    Hu, C.2    Lu, H.3    Liu, B.4


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