IEICE TRANSACTIONS on Communications
Incrementally Updatable Bloom Filter and Network Application
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E92-B No.11 pp.3484-3486
- Publication Date
- 2009/11/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E92.B.3484
- Type of Manuscript
- LETTER
- Category
- Fundamental Theories for Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
