최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기전기학회논문지 = The Transactions of the Korean Institute of Electrical Engineers, v.65 no.12, 2016년, pp.2061 - 2068
변하영 (Dept. of Electronic and Electrical Engineering, Ewha Womans University) , 임혜숙 (Dept. of Electronic and Electrical Engineering, Ewha Womans University)
A Bloom filter is a space-efficient data structure popularly applied in many network algorithms. This paper proposes a vectored Bloom filter to provide a high-speed Internet protocol (IP) address lookup. While each hash index for a Bloom filter indicates one bit, which is used to identify the member...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
H. J. Chao, "Next Generation Routers," Proc. IEEE, Vol. 90, No. 9, pp. 1518-1588, Sep. 2002.
S. Fuller, T. Li, J. Yu, and K. Varadhan, "Classless Inter-Domain Routing(CIDR): An Address Assignment and Aggregation Strategy," RFC 1519, Sep.1993.
M. A. Ruiz-Sanchez, E. M. Biersack and W. Dabbous, "Survey and Taxonomy of IP Lookup Algorithms", IEEE Networks, Vol. 15, No. 2, pp. 8-23, Mar./Apr. 2001.
H. Lim and N. Lee, "Survey and Proposal on Binary Search Algorithms for Longest Prefix Match," IEEE Communications Surverys and Tutorials, Vol. 14, No. 3, pp. 681-697, Third Quarters, 2012.
T. Yand, G. Xie, Y. Li, Q. Fu, A. Liu, Q. Li, and L. Mathy, "Guarantee IP Lookup Performance with FIB Explosion," ACM Sigcomm, pp. 39-50, 2014.
P. Gupta, S. Lin, and N. Mckeown, "Routing Lookups in Hardware at Memory Access Speed." IEEE INFOCOM, pp.1240-1247, 1998.
S. Dharmapurikar, P. Krishnamurthy, and D. Taylor, "Longest Prefix Matching Using Bloom Filters," IEEE/ACM Trans. Networking, Vol. 14, No. 2, pp. 397-409, Feb. 2006.
Y. Wang, T. Pan, Z. Mi, H. Dai, X. Guo, T. Zhang, B. Liu, and Q. Dong, "NameFilter: Achieving Fast Name Lookup with Low Memory Cost via Applying Two-Stage Bloom Filters," in Proceedings of the IEEE INFOCOM'13, pp. 93-99, 2013.
H. Lim, K. Lim, N. Lee, and K. Park, "On Adding Bloom Filters to Longest Prefix Matching Algorithms," IEEE Trans. Computers, Vol. 63, No. 2, pp. 411-423, Feb. 2014.
P. Panda, N. Dutt, and A. Nicolau, "On-Chip vs. Off-Chip Memory: The Data Partitioning Problem in Embedded Processor-Based Systems," ACM Transactions on Design Automation of Electronics Systems, Vol. 5, No. 3, pp. 682-704, July 2000.
B. H. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Communications of the ACM, Vol. 13, No. 7, pp. 422-426, 1970.
S. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, "Theory and Practice of Bloom Filters for Distributed Systems," IEEE Communications Surveys and Tutorials, Vol. 14, No. 1, pp. 131-155, First Quarter, 2012.
M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable High Speed IP Routing Lookups," Proc. ACM SIGCOMM, pp. 25-35, 1997.
J. Mun, H. Lim and C. Yim, "Binary Search on Prefix Lengths for IP Address Lookup," IEEE Communications Letters, Vol. 10, No. 6, pp. 492-494, June 2006.
J. Mun, and H. Lim, "New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms," IEEE Trans. on Computers, Vol. 65, No. 5, pp. 1558-1565, May 2016.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.