최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기IEEE communications letters : a publication of the IEEE Communications Society, v.10 no.6, 2006년, pp.492 - 494
Ju Hyoung Mun (Inf. Electron. Eng. Dept., Ewha Womans Univ., Seoul) , Hyesook Lim (Inf. Electron. Eng. Dept., Ewha Womans Univ., Seoul) , Changhoon Yim
Address lookup is an essential function in the Internet routers that should be performed in wire-speed. A lot of address lookup algorithms have been widely studied. Among them, we have thoroughly investigated the binary-search-based address lookup algorithms. Most of the existing binary search schem...
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 HPSR 2005 Binary search in a balanced tree for IP address lookup lim 0 490
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.
Proc ACM Sigcomm Scalable high speed IP routing lookup waldvogel 0 25
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.
Srinivasan, V., Varghese, G.. Fast address lookups using controlled prefix expansion. ACM transactions on computer systems, vol.17, no.1, 1-40.
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.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.