Binary search in a balanced tree for IP address lookup
暂无分享,去创建一个
Hyesook Lim | Bomi Lee | Wonjung Kim | Hyesook Lim | Wonjung Kim | B. Lee
[1] Svante Carlsson,et al. Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.
[2] Butler W. Lampson,et al. IP lookups using multiway and multicolumn search , 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] George Varghese,et al. Faster IP lookups using controlled prefix expansion , 1998, SIGMETRICS '98/PERFORMANCE '98.
[4] 김상욱,et al. 카메라 폰 환경에서의 자동 초점 시스템 구현 , 2005 .
[5] Sungho Kang,et al. Reinforcement Optimization to Implement AntNet-Based Routing on Packet Forwarding Engines , 2005 .
[6] Hyesook Lim,et al. Weighted Binary Prefix Tree for IP Address Lookup , 2004 .
[7] Bernhard Plattner,et al. Scalable high speed IP routing lookups , 1997, SIGCOMM '97.
[8] Walid Dabbous,et al. Survey and taxonomy of IP address lookup algorithms , 2001, IEEE Netw..
[9] Lim Hyesook,et al. Weighted Binary Prefix Tree for IP Address Lookup , 2004 .
[10] N. Yazdani,et al. Fast and scalable schemes for the IP address lookup problem , 2000, ATM 2000. Proceedings of the IEEE Conference on High Performance Switching and Routing (Cat. No.00TH8485).
[11] Hung-Hsiang Jonathan Chao,et al. Next generation routers , 2002, Proc. IEEE.
[12] V. Srinivasan,et al. Fast address lookups using controlled prefix expansion , 1999, TOCS.