$\require{mediawiki-texvc}$

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

Survey and Proposal on Binary Search Algorithms for Longest Prefix Match

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)

Abstract AI-Helper 아이콘AI-Helper

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...

참고문헌 (42)

  1. 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.

  2. IEEE Micro Tuple Pruning Using Bloom Filters for Packet Classification lim 2010 30 784 

  3. 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.

  4. Proc ACM SIGMETRICS Fast Address Lookups Using Controlled Prefix Expansion srinivasan 1998 1 

  5. 10.1109/ICCCN.2003.1284179 

  6. 10.1145/316194.316216 

  7. Chao, H.J.. Next generation routers. Proceedings of the IEEE, vol.90, no.9, 1518-1558.

  8. 10.1145/1882486.1882534 

  9. 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.

  10. IEEE ICNP Shape Shifting Tries for Faster IP Route Lookup song 2005 358 

  11. 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.

  12. 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.

  13. Kun Suk Kim, Sahni, S.. Efficient Construction of Pipelined Multibit-Trie Router-Tables. IEEE transactions on computers, vol.56, no.1, 32-43.

  14. 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.

  15. Wencheng Lu, Sahni, S. Recursively Partitioned Static IP Router Tables. IEEE transactions on computers, vol.59, no.12, 1683-1690.

  16. 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.

  17. 10.1109/GLOCOM.2006.347 

  18. Hyesook Lim, Changhoon Yim, Swartzlander, Earl E. Priority Tries for IP Address Lookup. IEEE transactions on computers, vol.59, no.6, 784-794.

  19. 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.

  20. Sahni, S., Kim, Kun Suk. An O(log n) dynamic router-table design. IEEE transactions on computers, vol.53, no.3, 351-363.

  21. Proc IEEE ISCC IP Lookup by Binary Search on Prefix Length kim 2003 77 

  22. 10.1145/997150.997160 

  23. 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.

  24. 10.1109/INFCOM.2009.5062180 

  25. Cisco CRS 2007 

  26. 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.

  27. 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.

  28. 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.

  29. 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.

  30. Network Algorithmics varghese 2005 

  31. Computer Networking: A Top-Down Approach kurose 2010 

  32. Interconnections: Bridges, Routers, Switches, and Inter-connecting Protocols perlman 2005 

  33. IEEE Trans Comp O(log n) Dynamic Router-Tables for Prefixes and Ranges lu 2004 53 1217 

  34. 10.1109/HPSR.2000.856650 

  35. IEEE Trans Comp A B-tree Dynamic Router-Table Design lu 2005 54 814 

  36. 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.

  37. 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.

  38. Lim, H., Kang, M.Y., Yim, C.. Two-dimensional packet classification algorithm using a quad-tree. Computer communications, vol.30, no.6, 1396-1405.

  39. 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.

  40. Proc ACM Sigcomm Scalable High Speed IP Routing Lookups waldvogel 1997 25 

  41. 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.

LOADING...
섹션별 컨텐츠 바로가기

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

AI-Helper 아이콘
AI-Helper
안녕하세요, AI-Helper입니다. 좌측 "선택된 텍스트"에서 텍스트를 선택하여 요약, 번역, 용어설명을 실행하세요.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.

선택된 텍스트

맨위로