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 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.

[1]  Robert H. Morris,et al.  Counting large numbers of events in small registers , 1978, CACM.

[2]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[3]  No License,et al.  Intel ® 64 and IA-32 Architectures Software Developer ’ s Manual Volume 3 A : System Programming Guide , Part 1 , 2006 .

[4]  Balachander Krishnamurthy,et al.  Sketch-based change detection: methods, evaluation, and applications , 2003, IMC '03.

[5]  Andrea Montanari,et al.  Counter braids: a novel counter architecture for per-flow measurement , 2008, SIGMETRICS '08.

[6]  Carsten Lund,et al.  Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications , 2004, IMC '04.

[7]  Yossi Matias,et al.  Spectral bloom filters , 2003, SIGMOD '03.

[8]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[9]  George Varghese,et al.  Efficient implementation of a statistics counter architecture , 2003, SIGMETRICS '03.

[10]  Abhishek Kumar,et al.  Data streaming algorithms for efficient and accurate estimation of flow size distribution , 2004, SIGMETRICS '04/Performance '04.

[11]  Svante Carlsson,et al.  Small forwarding tables for fast routing lookups , 1997, SIGCOMM '97.

[12]  George Varghese,et al.  Deterministic memory-efficient string matching algorithms for intrusion detection , 2004, IEEE INFOCOM 2004.

[13]  Graham Cormode,et al.  An Improved Data Stream Summary: The Count-Min Sketch and Its Applications , 2004, LATIN.

[14]  Nan Hua,et al.  Rank-indexed hashing: A compact construction of Bloom filters and variants , 2008, 2008 IEEE International Conference on Network Protocols.

[15]  Abhishek Kumar,et al.  Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices , 2005, SIGMETRICS '05.

[16]  Devavrat Shah,et al.  Maintaining Statistics Counters in Router Line Cards , 2002, IEEE Micro.

[17]  Rade Stanojevic,et al.  Small Active Counters , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[18]  Graham Cormode,et al.  An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.

[19]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[20]  XuJun,et al.  Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices , 2005 .

[21]  Rainer Göb.  Bounds for median and 50 percetage point of binomial and negative binomial distribution , 1994 .

[22]  Cristian Estan,et al.  New directions in traffic measurement and accounting , 2001, IMW '01.

[23]  Mark A. McComb.  Comparison Methods for Stochastic Models and Risks , 2003, Technometrics.

[24]  Hayato Musa.  SMALL FORWARDING TABLES FOR FAST ROUTING LOOKUPS , 2011 .

[25]  Nan Hua,et al.  BRICK: a novel exact active statistics counter architecture , 2011, TNET.

[26]  George Varghese,et al.  New directions in traffic measurement and accounting , 2002, CCRV.

[27]  Bill Lin,et al.  Maintaining exact statistics counters with a multi-level counter memory , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[28]  L. Goddard.  Information Theory , 1962, Nature.

[29]  Qi Zhao,et al.  Design of a novel statistics counter architecture with optimal space and time efficiency , 2006, SIGMETRICS '06/Performance '06.

[30]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[31]  Andrej Cvetkovski,et al.  An algorithm for approximate counting using limited memory resources , 2007, SIGMETRICS '07.