최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기IEEE communications letters : a publication of the IEEE Communications Society, v.7 no.10, 2003년, pp.502 - 504
Hyesook Lim (Inf. Electron. Eng. Dept., Ewha W. Univ., Seoul, South Korea) , Ji-Hyun Seo , Yeo-Jin Jung
One of the most important design issues for IP routers responsible for datagram forwarding in computer networks is the route-lookup mechanism. In this letter, we explore a practical IP address lookup scheme which converts the longest prefix matching problem into the exact matching problem. In the pr...
Proc ACM SIGCOMM 97 small forwarding tables for fast routing lookups degermark 1997 3
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.
Proc ACM SIGCOMM 97 scalable high speed ip routing lookups waldvogel 1999 25
Huang, Nen-Fu, Zhao, Shi-Ming. A novel IP-routing lookup scheme and hardware architecture for multigigabit switching routers. IEEE journal on selected areas in communications : a publication of the IEEE Communications Society, vol.17, no.6, 1093-1104.
Jain, R.. A comparison of hashing schemes for address lookup in computer networks. IEEE transactions on communications, vol.40, no.10, 1570-1573.
RFC1812 Requirements for IP Version 4 Routers 0
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.