The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
블룸 필터는 다양한 네트워크 애플리케이션에 널리 사용됩니다. 온칩 메모리의 제한된 크기와 대량의 네트워크 트래픽으로 인해 Bloom 필터는 콘텐츠를 점진적으로 업데이트해야 하는 경우가 많습니다. 이를 위해 콜드 캐시와 이중 버퍼링이라는 두 가지 기술이 사용되었습니다. 콜드 캐시는 평균 캐시 비율 측면에서 이중 버퍼링보다 성능이 뛰어납니다. 그러나 최악의 캐시 적중률에 대해서는 이중 버퍼링이 콜드 캐시보다 훨씬 더 잘 작동합니다. 본 논문에서는 할당된 메모리 공간을 최대한 활용하는 동안 Bloom 필터의 내용을 점진적으로 업데이트하는 새로운 Bloom 필터 업데이트 방식을 제안합니다. 제안된 방식은 평균 캐시 적중률 측면에서 콜드 캐시보다 더 잘 작동합니다. 동시에 최악의 캐시 적중률에 대해서는 이중 버퍼링보다 성능이 뛰어납니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
MyungKeun YOON, "Incrementally Updatable Bloom Filter and Network Application" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 11, pp. 3484-3486, November 2009, doi: 10.1587/transcom.E92.B.3484.
Abstract: Bloom filters are widely used for various network applications. Because of the limited size of on-chip memory and the large volume of network traffic, Bloom filters are often required to update their contents incrementally. Two techniques have been used for this purpose: cold cache and double buffering. Cold cache outperforms double buffering in terms of the average cache ratio. However, double buffering works much better than cold cache for the worst-case cache hit ratio. In this paper, we propose a new updating scheme for Bloom filters, which updates the contents of Bloom filter incrementally while the assigned memory space is fully utilized. The proposed scheme works better than cold cache in terms of the average cache hit ratio. At the same time, it outperforms double buffering for the worst-case cache hit ratio.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3484/_p
부
@ARTICLE{e92-b_11_3484,
author={MyungKeun YOON, },
journal={IEICE TRANSACTIONS on Communications},
title={Incrementally Updatable Bloom Filter and Network Application},
year={2009},
volume={E92-B},
number={11},
pages={3484-3486},
abstract={Bloom filters are widely used for various network applications. Because of the limited size of on-chip memory and the large volume of network traffic, Bloom filters are often required to update their contents incrementally. Two techniques have been used for this purpose: cold cache and double buffering. Cold cache outperforms double buffering in terms of the average cache ratio. However, double buffering works much better than cold cache for the worst-case cache hit ratio. In this paper, we propose a new updating scheme for Bloom filters, which updates the contents of Bloom filter incrementally while the assigned memory space is fully utilized. The proposed scheme works better than cold cache in terms of the average cache hit ratio. At the same time, it outperforms double buffering for the worst-case cache hit ratio.},
keywords={},
doi={10.1587/transcom.E92.B.3484},
ISSN={1745-1345},
month={November},}
부
TY - JOUR
TI - Incrementally Updatable Bloom Filter and Network Application
T2 - IEICE TRANSACTIONS on Communications
SP - 3484
EP - 3486
AU - MyungKeun YOON
PY - 2009
DO - 10.1587/transcom.E92.B.3484
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2009
AB - Bloom filters are widely used for various network applications. Because of the limited size of on-chip memory and the large volume of network traffic, Bloom filters are often required to update their contents incrementally. Two techniques have been used for this purpose: cold cache and double buffering. Cold cache outperforms double buffering in terms of the average cache ratio. However, double buffering works much better than cold cache for the worst-case cache hit ratio. In this paper, we propose a new updating scheme for Bloom filters, which updates the contents of Bloom filter incrementally while the assigned memory space is fully utilized. The proposed scheme works better than cold cache in terms of the average cache hit ratio. At the same time, it outperforms double buffering for the worst-case cache hit ratio.
ER -