최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기IEEE Communications surveys and tutorials, v.14 no.3, 2012년, pp.681 - 697
Hyesook Lim (Ewha Womans Univ., Seoul, South Korea) , Nara Lee (Ewha Womans Univ., Seoul, South Korea)
The IP address lookup has been a major challenge for Internet routers. This is accompanied with a background of advances in link bandwidth and rapid growth in Internet traffic and the number of networks. This survey paper explores binary search algorithms as a simple and efficient approach to the IP...
Alagu Priya, A.G., Lim, H.. Hierarchical packet classification using a Bloom filter and rule-priority tries. Computer communications, vol.33, no.10, 1215-1226.
IEEE Micro Tuple Pruning Using Bloom Filters for Packet Classification lim 2010 30 784
Dharmapurikar, S., Krishnamurthy, P., Taylor, D.E.. Longest prefix matching using bloom filters. IEEE/ACM transactions on networking : a joint publication of the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communication, vol.14, no.2, 397-409.
0
Proc ACM SIGMETRICS Fast Address Lookups Using Controlled Prefix Expansion srinivasan 1998 1
Chao, H.J.. Next generation routers. Proceedings of the IEEE, vol.90, no.9, 1518-1558.
Hyesook Lim, Ji-Hyun Seo, Yeo-Jin Jung. High speed IP address lookup architecture using hashing. IEEE communications letters : a publication of the IEEE Communications Society, vol.7, no.10, 502-504.
IEEE ICNP Shape Shifting Tries for Faster IP Route Lookup song 2005 358
Hyesook Lim, Ha Neul Chu, Changhoon Yim. Hierarchical Binary Search Tree for Packet Classification. IEEE communications letters : a publication of the IEEE Communications Society, vol.11, no.8, 689-691.
Sahni, S., Kim, Kun Suk. Efficient construction of multibit tries for IP lookup. IEEE/ACM transactions on networking : a joint publication of the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communication, vol.11, no.4, 650-662.
Kun Suk Kim, Sahni, S.. Efficient Construction of Pipelined Multibit-Trie Router-Tables. IEEE transactions on computers, vol.56, no.1, 32-43.
Sangireddy, R., Somani, A.K.. High-speed IP routing with binary decision diagrams based hardware address lookup engine. IEEE journal on selected areas in communications : a publication of the IEEE Communications Society, vol.21, no.4, 513-521.
Wencheng Lu, Sahni, S. Recursively Partitioned Static IP Router Tables. IEEE transactions on computers, vol.59, no.12, 1683-1690.
Lu, Haibin, Kim, K.S., Sahni, S.. Prefix and interval-partitioned dynamic IP router-tables. IEEE transactions on computers, vol.54, no.5, 545-557.
Hyesook Lim, Changhoon Yim, Swartzlander, Earl E. Priority Tries for IP Address Lookup. IEEE transactions on computers, vol.59, no.6, 784-794.
Lampson, B., Srinivasan, V., Varghese, G.. IP lookups using multiway and multicolumn search. IEEE/ACM transactions on networking : a joint publication of the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communication, vol.7, no.3, 324-334.
Sahni, S., Kim, Kun Suk. An O(log n) dynamic router-table design. IEEE transactions on computers, vol.53, no.3, 351-363.
Proc IEEE ISCC IP Lookup by Binary Search on Prefix Length kim 2003 77
Ju Hyoung Mun, Hyesook Lim, Changhoon Yim. Binary search on prefix lengths for IP address lookup. IEEE communications letters : a publication of the IEEE Communications Society, vol.10, no.6, 492-494.
Cisco CRS 2007
Sangireddy, R., Futamura, N., Aluru, S., Somani, A.K.. Scalable, memory efficient, high-speed IP lookup algorithms. IEEE/ACM transactions on networking : a joint publication of the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communication, vol.13, no.4, 802-812.
Taylor, D.E., Turner, J.S., Lockwood, J.W., Sproull, T.S., Parlour, D.B.. Scalable IP lookup for Internet routers. IEEE journal on selected areas in communications : a publication of the IEEE Communications Society, vol.21, no.4, 522-534.
Hyesook Lim,, Hyeong-gee Kim,, Changhoon Yim,. IP address lookup for internet routers using balanced binary search with prefix vector. IEEE transactions on communications, vol.57, no.3, 618-621.
Ruiz-Sanchez, M.A., Biersack, E.W., Dabbous, W.. Survey and taxonomy of IP address lookup algorithms. IEEE network, vol.15, no.2, 8-23.
Network Algorithmics varghese 2005
Computer Networking: A Top-Down Approach kurose 2010
Interconnections: Bridges, Routers, Switches, and Inter-connecting Protocols perlman 2005
IEEE Trans Comp O(log n) Dynamic Router-Tables for Prefixes and Ranges lu 2004 53 1217
IEEE Trans Comp A B-tree Dynamic Router-Table Design lu 2005 54 814
Taylor, D.E., Turner, J.S.. ClassBench: A Packet Classification Benchmark. IEEE/ACM transactions on networking : a joint publication of the IEEE Communications Society, the IEEE Computer Society, and the ACM with its Special Interest Group on Data Communication, vol.15, no.3, 499-511.
Lim, Hyesook, Lee, Bomi, Kim, Wonjung. Binary searches on multiple small trees for IP address lookup. IEEE communications letters : a publication of the IEEE Communications Society, vol.9, no.1, 75-77.
Lim, H., Kang, M.Y., Yim, C.. Two-dimensional packet classification algorithm using a quad-tree. Computer communications, vol.30, no.6, 1396-1405.
Yim, Changhoon, Lee, Bomi, Lim, Hyesook. Efficient binary search for IP address lookup. IEEE communications letters : a publication of the IEEE Communications Society, vol.9, no.7, 652-654.
Proc ACM Sigcomm Scalable High Speed IP Routing Lookups waldvogel 1997 25
Lim, Hyesook, Kim, Wonjung, Lee, Bomi, Yim, Changhoon. High-speed IP address lookup using balanced multi-way trees. Computer communications, vol.29, no.11, 1927-1935.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.