Longest prefix matching using bloom filters
暂无分享,去创建一个
[1] Andrei Broder,et al. Network Applications of Bloom Filters: A Survey , 2004, Internet Math..
[2] Nick McKeown,et al. Routing lookups in hardware at memory access speeds , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[3] Bernhard Plattner,et al. Scalable high speed IP routing lookups , 1997, SIGCOMM '97.
[4] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[5] Vince Fuller,et al. Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.
[6] Paul Francis,et al. Fast routing table lookup using CAMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[7] Butler W. Lampson,et al. IP lookups using multiway and multicolumn search , 1999, TNET.
[8] Li Fan,et al. Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.
[9] Will Eatherton. Hardware-based internet protocol prefix lookups , 1998 .
[10] Svante Carlsson,et al. Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.
[11] B. Dipert,et al. SPECIAL-PURPOSE SRAMS SMOOTH THE RIDE , 1999 .
[12] George Varghese,et al. Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.
[13] Arin Apnic,et al. IPv6 Address Allocation and Assignment Policy , 2002 .