Nan Hua
ABSTRACT
In this paper, we present an exact active statistics counter architecture called BRICK (Bucketized Rank Indexed Counters) that can efficiently store per-flow variable-width statistics counters entirely in SRAM while supporting both fast updates and lookups (e.g., 40 Gb/s line rates). BRICK exploits statistical multiplexing by randomly bundling counters into small fixed-size buckets and supports dynamic sizing of counters by employing an innovative indexing scheme called rank-indexing. Experiments with Internet traces show that our solution can indeed maintain large arrays of exact active statistics counters with moderate amounts of SRAM.
- Intel 64 and IA-32 architectures software developer's manual, volume 2B, November 2007. Available at ftp://download.intel.com/technology/architecture/new-instructions-paper.pdf.Google Scholar
- Software optimization guide for AMD family 10h processors, December 2007. Available at http://www.amd.com/us-en/assets/content_type/white_papers_and_tech_docs/40546.pdf.Google Scholar
- S. Cohen and Y. Matias. Spectral bloom filters.Google Scholar
- G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms, 2004. Google ScholarDigital Library
- A Cvetkovski. An algorithm for approximate counting using limited memory resources. In Proc of ACM SIGMETRICS, 2007. Google ScholarDigital Library
- Mikael Degermark, Andrej Brodnik, Svante Carlsson, and Stephen Pink. Small forwarding tables for fast routing lookups. In SIGCOMM, pages 3--14, 1997. Google ScholarDigital Library
- C. Estan and G. Varghese. New directions in traffic measurement and a ccounting. In Proc. of ACM SIGCOMM, August 2002. Google ScholarDigital Library
- Robert G. Gallager. Low-Density Parity-Check Codes. MIT Press, 1963.Google ScholarCross Ref
- Rainer GöbDoi. Bounds for median and 50 percetage point of binomial and negative binomial distribution. In Metrika, Volume 41, Number 1, 43--54, 2003.Google Scholar
- Nan Hua, Haiquan Zhao, Bill Lin, and Jun Xu. Rank-indexed hashing: A compact construction of bloom filters and variants. In Proc. of IEEE ICNP, October 2008.Google Scholar
- G. Jacobson. Space-efficient static trees and graphs. In 30th FOCS, pages 549--554, 1989. Google ScholarDigital Library
- B. Krishnamurthy, S. Sen, Y. Zhang, and Y. Chen. Sketch-based change detection: Methods, evaluation, and applications. In Proc. of ACM SIGCOMM IMC, October 2003. Google ScholarDigital Library
- A. Kumar, M. Sung, J. Xu, and J. Wang. Data streaming algorithms for efficient and accurate estimation of flow size distribution. In Proc. of ACM SIGMETRICS, 2004. Google ScholarDigital Library
- Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani. Counter braids: A novel counter architecture for per-flow measurement. In Prof. of ACM SIGMETRICS, 2008. Google ScholarDigital Library
- Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005. Google ScholarDigital Library
- R. Morris. Counting large numbers of events in small registers. In Commun. ACM 21(10), 1978. Google ScholarDigital Library
- R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- Alfred Müller and Dietrich Stoyan. Comparison Methods for Stochastic Models and Risks. Wiley, 2002.Google Scholar
- S. Ramabhadran and G. Varghese. Efficient implementation of a statistics counter architecture. In Proc. ACM SIGMETRICS, June 2003. Google ScholarDigital Library
- M. Roeder and B. Lin. Maintaining exact statistics counters with a multilevel counter memory. In Proc. of IEEE Globecom, Dallas, USA, 2004.Google Scholar
- D. Shah, S. Iyer, B. Prabhakar, and N. McKeown. Maintaining statistics counters in router line cards. In IEEE Micro, 2002. Google ScholarDigital Library
- Rade Stanojevic. Small active counters. In Proc of IEEE Infocom, 2007.Google ScholarDigital Library
- Nathan Tuck, Timothy Sherwood, Brad Calder, and George Varghese. Deterministic memory-efficient string matching algorithms for intrusion detection. In IEEE INFOCOM, 2004.Google ScholarCross Ref
- Y. Zhang, S. Singh, S. Sen, N. Duffield, and C. Lund. Online identification of hierarchical heavy hitters: Algorithms, evaluation, and application. In Proc. of ACM SIGCOMM IMC, October 2004. Google ScholarDigital Library
- Q. Zhao, A. Kumar, J. Wang, and J. Xu. Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices. In Proc. of ACM SIGMETRICS, June 2005. Google ScholarDigital Library
- Q. Zhao, J. Xu, and Z. Liu. Design of a novel statistics counter architecture with optimal space and time efficiency. In Proc. of ACM SIGMETRICS, June 2006. Google ScholarDigital Library
Index Terms
- BRICK: a novel exact active statistics counter architecture
Recommendations
Design of a novel statistics counter architecture with optimal space and time efficiency
SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systemsThe problem of how to efficiently maintain a large number (say millions) of statistics counters that need to be incremented at very high speed has received considerable research attention recently. This problem arises in a variety of router management ...
BRICK: a novel exact active statistics counter architecture
In this paper, we present an exact active statistics counter architecture called Bucketized Rank Indexed Counters (BRICK) that can efficiently store per-flow variable-width statistics counters entirely in SRAM while supporting both fast updates and ...
Design of a novel statistics counter architecture with optimal space and time efficiency
Performance evaluation reviewThe problem of how to efficiently maintain a large number (say millions) of statistics counters that need to be incremented at very high speed has received considerable research attention recently. This problem arises in a variety of router management ...
Comments