Design of a High-Speed RFID Filtering Engine and Cache Based Improvement 


Vol. 31,  No. 5, pp. 517-525, May  2006


PDF
  Abstract

In this paper, we present a high-speed RFID data filtering engine designed to carry out filtering under the conditions of massive data and massive filters. We discovered that the high-speed RFID data filtering technique is very similar to the high-speed packet classification technique which is used in high-speed routers and firewall systems. Actually, our filtering engine is designed based on existing packet classification algorithms, Bit Parallelism and Aggregated Bit Vector(ABV). In addition, we also discovered that there are strong temporal relations and redundancy in the RFID data filtering operations. We incorporated two kinds of caches, tag and filter caches, to make use of this characteristic to improve the efficiency of the filtering engine. The performance of the proposed engine has been examined by implementing a prototype system and testing it. Compared to the basic sequential filter comparison approach, our engine shows much better performance, and it gets better as the number of filters increases.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Park and J. Kim, "Design of a High-Speed RFID Filtering Engine and Cache Based Improvement," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 5, pp. 517-525, 2006. DOI: .

[ACM Style]

Hyun-Sung Park and Jong-Deok Kim. 2006. Design of a High-Speed RFID Filtering Engine and Cache Based Improvement. The Journal of Korean Institute of Communications and Information Sciences, 31, 5, (2006), 517-525. DOI: .

[KICS Style]

Hyun-Sung Park and Jong-Deok Kim, "Design of a High-Speed RFID Filtering Engine and Cache Based Improvement," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 5, pp. 517-525, 5. 2006.