[1] 徐 恪, 徐明伟, 吴建平. 路由查找算法研究综述[J]. 软件学报, 2002, 13(1): 42-50. [2] Ruiz-Sanchez M A, Biersack E W, Dabbous W. Survey and Taxonomy of IP Address Lookup Algorithms[J]. IEEE Network, 2001, 15(2): 8-23. [3] Kim Nam-Soo, Kim Young-Sang. Comparative Studies of Address Lookup Algorithms for IPv6[C]//Proc. of ICACT’06. Hong Kong, China: [s. n.], 2006: 285-290. [4] 赵国峰, 闫 亮. 用于快速流分类的关键字分解Hash算法[J].计算机工程, 2010, 36(16): 79-81. [5] Gamache B, Pfeffer Z, Khatri S P. A Fast Ternary CAM Design for IP Networking Applications[C]//Proc. of the 12th International Conference on Computer Communications and Networks. Dallas, USA: [s. n.], 2003: 434-439. [6] 刘 丹, 赵有健. 基于Trie树分割路由表降低TCAM功耗的方法[J]. 计算机工程, 2007, 33(11): 100-102. [7] Erdem O, Bazlama X E, Bazlama?i C F. Array Design for Trie-based IP Lookup[J]. Communications Letters, 2010, 14(8): 773-775. [8] Zheng Kai, Liu Zhen, Liu Bin. A Scalable IPv6 Route Lookup Scheme via Dynamic Variable-stride Bitmap Compression and Path Compression[J]. Computer Communications, 2006, 29(16): 3037-3050. [9] Chu Yuansun, Su Huikai, Lin Pofeng, et al. IC Design of IPv6 Routing Lookup for High Speed Networks[C]//Proc. of the 6th International Conference on Computational Science. New York, USA: [s. n.], 2006: 1832-1835. [10] Li Zhenqiang, Deng Xiaohong, Ma Hongxiao, et al. Divide and Conquer: A Scheme for IPv6 Address Longest Prefix Matching[C]//Proc. of Workshop on High Performance Switching and Routing. Hong Kong, China: [s. n.], 2006: 37-42. [11] Gamache B, Pfeffer Z, Khatri S P. A Fast Ternary CAM Design for IP Networking Applications[C]//Proc. of the 12th International Conference on Computer Communications and Networks. Dallas, USA: [s. n.], 2003: 434-439. [12] Table Data[EB/OL]. (2011-05-15). http://bgp.potaroo.net. [13] Jain R. A Comparison of Hashing Schemes for Address Lookup in Computer Networks[J]. IEEE Transactions on Communications, 1992, 40(10): 1570-1573.
|