http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
IP 주소 검색을 위한 블룸 필터를 적용한 새로운 리프푸싱 트라이
이정원(Jungwon Lee),심채연(Chaeyun Shim),박슬기(Seulki Park),이보경(Bokyung Lee),황아름(Areum Hwang),임혜숙(Hyesook Lim) 대한전자공학회 2015 대한전자공학회 학술대회 Vol.2015 No.11
This paper proposes a new IP address lookup algorithm which applies a Bloom filter for the prefix search in a leaf-pushing trie. The proposed approach is differentiated from a previous approach in the way of programming the Bloom filter. The proposed algorithm in this paper does not program every node in a trie but programs internal nodes with at least a prefix child. Hence the Bloom filter size is greatly reduced. In addition, the proposed algorithm starts the search process from the longest length, which is 32 bits in IPv4, in order to utilize the characteristic of the leaf-pushing trie. Simulations using actual routing tables show that the proposed approach achieves less than 1.25 number of hash table accesses in average to perform an IP address lookup.