Counter braids: A novel counter architecture for per-flow measurement

SIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

Volumn 36, Issue 1 SPECIAL ISSUE, 2008, Pages 121-132

  Lu, Yi ^a   Montanari, Andrea ^a   Prabhakar, Balaji ^a   Dharmapurikar, Sarang ^b   Kabbani, Abdul ^a  

^a STANFORD UNIVERSITY   (United States)

^b Nuova Systems Inc   (United States)

Author keywords

Message passing algorithms; Network measurement; Statistics counters

Indexed keywords

APPROXIMATE METHODS; CENTRAL PROBLEMS; COMPRESSION RATES; DECODING ALGORITHMS; FLOW SIZES; HASH FUNCTIONS; INTERNET TRACES; LARGE ARRAYS; LINK SPEEDS; NETWORK MEASUREMENT; NETWORK MEASUREMENTS; NUT-SHELLS; RANDOM GRAPHS; SPACE REDUCTIONS;

ASSOCIATIVE PROCESSING; COMPUTER SYSTEMS; DECODING; FLOW MEASUREMENT; FLOW MEASURING INSTRUMENTS; FLOWMETERS; FUNCTIONS; GRAPH THEORY; MESSAGE PASSING; RANDOM PROCESSES; WEAVING;

MEASUREMENTS;

EID: 57349116869     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375457.1375472     Document Type: Conference Paper

References (23)

1. http://www.cisco.com/warp/public/732/Tech/netflow.
2. Juniper networks solutions for network accounting. www.juniper.net/ techcenter/appnote/350003.html.
3. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Comm. ACM, 13, July 1970.
4. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. In SIGCOMM, pages 56-67, 1998.
5. G. Caire, S. Shamai, and S. Verdú. Noiseless data compression with low density parity check codes. In DIM ACS, New York, 2004.
6. E. Candès and T. Tao. Near optimal signal recovery from random projections and universal encoding strategies. IEEE Trans. Inform. Theory, 2004.
7. G. Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 55(1), April 2005.
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, New York, 1991.
9. M. Crovella and A. Bestavros. Self-similarity in world wide web traffic: Evidence and possible causes. IEEE/ACM Trans. Networking, 1997.
10. S. Dharmapurikar and V. Paxson. Robust tcp stream reassembly in the presence of adversaries. 14th USENIX Security Symposium, 2005.
11. D. Donoho. Compressed sensing. IEEE Trans. Inform. Theory, 52(4), April 2006.
12. C. Estan and G. Varghese. New directions in traffic measurement and accounting. Proc. ACM SIGCOMM Internet Measurement Workshop, pages 75-80, 2001.
13. R. G. Gallager. Low-Density Parity-Check Codes. MIT Press, Cambridge, Massachussetts.
14. M. Grossglauser and J. Rexford. Passive traffic measurement for ip operations. The Internet as a Large-Scale Complex System, 2002.
15. F. Kschischang, B. Prey, and H.-A. Loeliger. Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory, 47:498-519, 2001.
16. A. Kumar, M. Sung, J. J. Xu, and J. Wang. Data streaming algorithms for efficient and accurate estimation of flow size distribution. Proceedings of ACM SIGMETRICS, 2004.
17. Y. Lu, A. Montanari, and B. Prabhakar, Detailed network measurements using sparse graph counters: The theory. Allerton Conference, September 2007.
18. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. A. Spielman, and V. Stemann. Practical loss-resilient codes. In Proc. of STOC, pages 150-159, 1997.
19. M. Mézard and A. Montanari. Constraint satisfaction networks in Physics and Computation. In Preparation.
20. S. Ramabhadran and G. Varghese. Efficient implementation of a statistics counter architecture. Proc. ACM SIGMETRICS, pages 261-271, 2003.
21. T. Richardson and R. Urbanke. Modern Coding Theory. Cambridge University Press, 2007.
22. D. Shah, S. Iyer, B. Prabhakar, and N. McKeown. Analysis of a statistics counter architecture. Proc. IEEE HotI 9.
23. Q. G. Zhao, J. J. Xu, and Z. Liu. Design of a novel statistics counter architecture with optimal space and time efficiency. SIGMetrics/Performance, June 2006.