Two-Dimensional Binary Search on Length Using Bloom Filter for Packet Classification
Vol. 37, No. 4, pp. 245-257, Apr. 2012
Abstract
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.
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]
Y. Choe and H. Lim, "Two-Dimensional Binary Search on Length Using Bloom Filter for Packet Classification," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 4, pp. 245-257, 2012. DOI: .
[ACM Style]
Youngju Choe and Hyesook Lim. 2012. Two-Dimensional Binary Search on Length Using Bloom Filter for Packet Classification. The Journal of Korean Institute of Communications and Information Sciences, 37, 4, (2012), 245-257. DOI: .
[KICS Style]
Youngju Choe and Hyesook Lim, "Two-Dimensional Binary Search on Length Using Bloom Filter for Packet Classification," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 4, pp. 245-257, 4. 2012.