A Memory-Balanced Linear Pipeline Architecture for Trie-based IP Lookup
暂无分享,去创建一个
[1] Haoyu Song,et al. Shape shifting tries for faster IP route lookup , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).
[2] Gunnar Karlsson,et al. IP-address lookup using LC-tries , 1999, IEEE J. Sel. Areas Commun..
[3] David E. Taylor,et al. Longest prefix matching using bloom filters , 2006, TNET.
[4] Sartaj Sahni,et al. Efficient Construction of Pipelined Multibit-Trie Router-Tables , 2007, IEEE Transactions on Computers.
[5] Bernhard Plattner,et al. Scalable high speed IP routing lookups , 1997, SIGCOMM '97.
[6] George Varghese,et al. Tree bitmap: hardware/software IP lookups with incremental updates , 2004, CCRV.
[7] George Varghese,et al. Memory-efficient state lookups with fast updates , 2000, SIGCOMM.
[8] V. Srinivasan,et al. Fast address lookups using controlled prefix expansion , 1999, TOCS.
[9] Masoud Sabaei,et al. A novel reconfigurable hardware architecture for IP address lookup , 2005, 2005 Symposium on Architectures for Networking and Communications Systems (ANCS).
[10] Girija J. Narlikar,et al. Fast incremental updates for pipelined forwarding engines , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[11] Sartaj Sahni,et al. Packet Forwarding Using Pipelined Multibit Tries , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).
[12] Grigore Rosu,et al. A tree based router search engine architecture with single port memories , 2005, 32nd International Symposium on Computer Architecture (ISCA'05).
[13] Sartaj Sahni,et al. Efficient construction of multibit tries for IP lookup , 2003, TNET.
[14] Patrick Crowley,et al. CAMP: fast and efficient IP lookup architecture , 2006, ANCS '06.
[15] Walid Dabbous,et al. Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..