http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
IP Address Lookup Algorithm Using a Vectored Bloom Filter
Hayoung Byun(변하영),Hyesook Lim(임혜숙) 대한전기학회 2016 전기학회논문지 Vol.65 No.12
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 membership of the input, each index of the proposed vectored Bloom filter indicates a vector which is used to represent the membership and the output port for the input. Hence the proposed Bloom filter can complete the IP address lookup without accessing an off-chip hash table for most cases. Simulation results show that with a reasonable sized Bloom filter that can be stored using an on-chip memory, an IP address lookup can be performed with less than 0.0003 off-chip accesses on average in our proposed architecture.
변하영(Hayoung Byun),임혜숙(Hyesook Lim) 대한전자공학회 2017 대한전자공학회 학술대회 Vol.2017 No.6
Key-value data structures, which return a value corresponding to an input key, are commonly used in many applications. Hashing is a representative key-value data structure. However, as the load factor of the hash table increases, the number of collisions increases, and unsaved elements cause false results. In this paper, we propose to use a functional Bloom filter instead of the hash table. While the hash table should store the signature of each input key in addition to the return value, the functional Bloom filter stores values only. Simulation results show that the functional Bloom filter is more efficient than hashing-based data structures such as hashing with a linked list, cuckoo hashing, and d-left hashing. Especially when the load factor is close to 1, while the number of incorrect results increases in hashing-based data structures because of collisions, the functional Bloom filter provides more accurate results using the same amount of memory.