메뉴 건너뛰기




Volumn 61, Issue 7, 2012, Pages 1026-1039

Scalable tree-based architectures for IPv4/v6 lookup using prefix partitioning

Author keywords

field programmable gate array (FPGA); IP Lookup; longest prefix matching; partitioning; pipeline; reconfigurable

Indexed keywords

ADDRESS SPACE; DISJOINT PREFIX; DISTRIBUTED ROUTING; FPGA DEVICES; HIGH THROUGHPUT; INCREMENTAL UPDATES; INTERNET PROTOCOL LOOKUPS; IP LOOKUP; LONGEST-PREFIX MATCHING; LOOKUPS; MEMORY EFFICIENCY; MEMORY FOOTPRINT; MEMORY REQUIREMENTS; ON CHIP MEMORY; PARTITIONING; PIPELINED ARCHITECTURE; PREFIX PARTITIONING; PREFIX PARTITIONING ALGORITHM; PROPOSED ARCHITECTURES; RECONFIGURABLE; RESEARCH COMMUNITIES; ROUTING TABLE; STATE OF THE ART; SUBSTANTIAL REDUCTION; TREE-BASED; TREE-BASED APPROACH;

EID: 84861793167     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2011.130     Document Type: Article
Times cited : (37)

References (35)
  • 1
    • 84861833138 scopus 로고    scopus 로고
    • 2-3 Tree
    • 2-3 Tree, http://en.wikipedia.org/wiki/2-3-tree, 2011.
    • (2011)
  • 2
    • 33645317031 scopus 로고    scopus 로고
    • Hardware implementation of a tree based IP lookup algorithm for oc-768 and beyond
    • F. Baboescu, S. Rajgopal, L. Huang, and N. Richardson, "Hardware Implementation of a Tree Based IP Lookup Algorithm for oc-768 and beyond," Proc. DesignCon '05, pp. 290-294, 2005.
    • (2005) Proc. DesignCon '05 , pp. 290-294
    • Baboescu, F.1    Rajgopal, S.2    Huang, L.3    Richardson, N.4
  • 4
    • 0042475248 scopus 로고    scopus 로고
    • Fast incremental updates for pipelined forwarding engines
    • A. Basu and G. Narlikar, "Fast Incremental Updates for Pipelined Forwarding Engines," Proc. IEEE INFOCOM '03, pp. 64-74, 2003.
    • (2003) Proc. IEEE INFOCOM '03 , pp. 64-74
    • Basu, A.1    Narlikar, G.2
  • 5
    • 70349656172 scopus 로고    scopus 로고
    • Scalar prefix search - A new route lookup algorithm for next generation internet
    • M. Behdadfar, H. Saidi, H. Alaei, and B. Samari, "Scalar Prefix search-a New Route Lookup Algorithm for Next Generation Internet," Proc. IEEE INFOCOM '09, 2009.
    • (2009) Proc. IEEE INFOCOM '09
    • Behdadfar, M.1    Saidi, H.2    Alaei, H.3    Samari, B.4
  • 6
    • 84861806424 scopus 로고    scopus 로고
    • BST, http://en.wikipedia.org/wiki/Binary-search-tree, 2011.
    • (2011) BST
  • 7
    • 84861794223 scopus 로고    scopus 로고
    • CACTI Tool, http://quid.hpl.hp.com:9081/cacti/, 2011.
    • (2011) CACTI Tool
  • 9
    • 84861808210 scopus 로고    scopus 로고
    • CompleteBST, http://xlinux.nist.gov/dads//HTML/completeBinaryTree. html, 2011.
    • (2011) Complete BST
  • 10
    • 0003717623 scopus 로고    scopus 로고
    • Dynamic Programming, http://en.wikipedia.org/wiki/Dynamic-programming, 2011.
    • (2011) Dynamic Programming
  • 12
    • 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," CoNEXT '08: Proc. ACM CoNEXT Conf., pp. 1-12, 2008.
    • (2008) CoNEXT '08: Proc. ACM CoNEXT Conf. , pp. 1-12
    • Fu, J.1    Rexford, J.2
  • 19
    • 22944456161 scopus 로고    scopus 로고
    • A B-tree dynamic router-table design
    • DOI 10.1109/TC.2005.104
    • H. Lu and S. Sahni, "A B-Tree Dynamic Router-Table Design," IEEE Trans. Computers, vol. 54, no. 7, pp. 813-824, July 2005. (Pubitemid 41046913)
    • (2005) IEEE Transactions on Computers , vol.54 , Issue.7 , pp. 813-824
    • Lu, H.1    Sahni, S.2
  • 20
    • 38149018071 scopus 로고
    • Patricia-practical algorithm to retrieve information coded in alphanumeric
    • D.R. Morrison, "Patricia-Practical Algorithm to Retrieve Information Coded in Alphanumeric," J. ACM, vol. 15, no. 4, pp. 514-534, 1968.
    • (1968) J. ACM , vol.15 , Issue.4 , pp. 514-534
    • Morrison, D.R.1
  • 22
    • 84861800898 scopus 로고    scopus 로고
    • RIS RAW DATA, http://data.ris.ripe.net, 2011.
    • (2011) RIS RAW DATA
  • 23
    • 0035278505 scopus 로고    scopus 로고
    • Survey and taxonomy of IP address lookup algorithms
    • DOI 10.1109/65.912716
    • M.A. Ruiz-Sanchez, E.W. Biersack, and W. Dabbous, "Survey and Taxonomy of IP Address Lookup Algorithms," IEEE Network, vol. 15, no. 2, pp. 8-23, Mar./Apr. 2001. (Pubitemid 32334274)
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 8-23
    • Ruiz-Sanchez, M.A.1    Biersack, E.W.2    Dabbous, W.3
  • 24
    • 1842478794 scopus 로고    scopus 로고
    • An o(log n) dynamic router-table design
    • Mar.
    • S. Sahni and K.S. Kim, "An o(log n) Dynamic Router-table Design," IEEE Trans. Computers, vol. 53, no. 3, pp. 351-363, Mar. 2004.
    • (2004) IEEE Trans. Computers , vol.53 , Issue.3 , pp. 351-363
    • Sahni, S.1    Kim, K.S.2
  • 25
    • 84861836096 scopus 로고    scopus 로고
    • SAMSUNG SRAMs
    • SAMSUNG SRAMs, http://www.samsung.com, 2011.
    • (2011)
  • 26
    • 24644487256 scopus 로고    scopus 로고
    • Scalable, memory efficient, high-speed IP lookup algorithms
    • DOI 10.1109/TNET.2005.852878
    • R. Sangireddy, N. Futamura, S. Aluru, and A.K. Somani, "Scalable, Memory Efficient, High-Speed IP Lookup Algorithms," IEEE/ACM Trans. Networking, vol. 13, no. 4, pp. 802-812, Aug. 2005. (Pubitemid 41269123)
    • (2005) IEEE/ACM Transactions on Networking , vol.13 , Issue.4 , pp. 802-812
    • Sangireddy, R.1    Futamura, N.2    Aluru, S.3    Somani, A.K.4
  • 27
    • 0002832087 scopus 로고
    • A tree-based packet routing table for berkeley unix
    • K. Sklower, "A Tree-Based Packet Routing Table for Berkeley Unix," Proc. Winter Usenix Conf., pp. 93-99, 1991.
    • (1991) Proc. Winter Usenix Conf. , pp. 93-99
    • Sklower, K.1
  • 28
    • 70349653166 scopus 로고    scopus 로고
    • IPv6 lookups using distributed and load balanced bloom filters for 100Gbps core router line cards
    • H. Song, F. Hao, M. Kodialam, and T. Lakshman, "IPv6 Lookups Using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards," Proc. IEEE INFOCOM '09, 2009.
    • (2009) Proc. IEEE INFOCOM '09
    • Song, H.1    Hao, F.2    Kodialam, M.3    Lakshman, T.4
  • 32
    • 0002260103 scopus 로고    scopus 로고
    • Fast address lookups using controlled prefix expansion
    • V. Srinivasan and G. Varghese, "Fast Address Lookups Using Controlled Prefix Expansion," ACM Trans. Computer Systems, vol. 17, pp. 1-40, 1999. (Pubitemid 129545750)
    • (1999) ACM Transactions on Computer Systems , vol.17 , Issue.1 , pp. 1-40
    • Srinivasan, V.1    Varghese, G.2
  • 35
    • 84861808211 scopus 로고    scopus 로고
    • Xilinx
    • Xilinx, http://www.xilinx.com/support/documentation/application-notes/ xapp802.pdf, 2011.
    • (2011)


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