Issue No.09 - Sept. (2013 vol.24)
Hao Wang , University of California, San Diego, La Jolla
Bill Lin , University of California, San Diego, La Jolla
Jun Jim Xu , Georgia Instiute of Technology, Atlanta
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.287
Statistics counters are essential in network measurement on tracking various network statistics and implementing various network counting sketches. For such applications it is crucial to maintain a large number of statistics counters at very high speeds. On the Internet with millions of flows, potentially millions of counters are required to be updated at wirespeed of 40 Gb/s and beyond. It is widely accepted that SRAM is too costly to store such large counter arrays entirely, and DRAM is too slow to catch up with the line rate. In this paper, we propose a DRAM-based architecture that takes advantage of the performance of modern commodity DRAM by interleaving counter updates to multiple memory banks. Our architecture is based on the observation that most flows on the Internet consist of multiple packets that are transmitted during a relatively short period of time, which are referred to as traffic bursts. Our proposed architecture makes use of a simple randomization scheme and a set of small fully associative request queues to statistically guarantee a near-perfect load balancing of counter updates to the memory banks. The architecture explores the benefit of traffic bursts to greatly reduce the maximum size of the request queues while providing a diminishing overflow probability guarantee. We also develop queuing models to show that as long as the flow sizes are heavy-tailed distributed due to traffic bursts, the maximum request queue length is always bounded by a small constant. The simulation results confirm the effectiveness of our queuing models. The proposed statistics counter arrays can effectively maintain line rate updates to a large number of counters while guaranteeing a diminishing overflow probability in the system.
Radiation detectors, Random access memory, Internet, Probability, Merging, Bandwidth, Emulation, queuing theory, Interleaved memories, statistics counter array, random access memories
Hao Wang, Bill Lin, Jun Jim Xu, "Robust Statistics Counter Arrays with Interleaved Memories", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 9, pp. 1894-1907, Sept. 2013, doi:10.1109/TPDS.2012.287