The Community for Technology Leaders
High-Performance Interconnects, Symposium on (2001)
Stanford, California
Aug. 22, 2001 to Aug. 24, 2001
ISBN: 0-7695-1357-3
pp: 0107
Devavrat Shah , Stanford University
Sundar Iyer , Stanford University
Balaji Prabhakar , Stanford University
Nick McKeown , Stanford University
Abstract: Packet switches (e.g., IP routers, ATM switches and Ethernet switches) maintain statistics for a variety of reasons: performance monitoring, network management, security, network tracing, and traffic engineering. The statistics are usually collected by counters which might, for example, count the number of arrivals of a specific type of packet, or count particular events, such as when a packet is dropped. The arrival of a packet may lead to several different statistics counters being updated. The number of statistics counters and the rate at which they are updated is often limited by memory technology. A small number of counters may be held in on-chip registers or in (on- or off-chip) SRAM. But often, the number of counters is very large, and hence they need to be stored in off-chip DRAM. However, the large random access times of DRAMs make it difficult to support high bandwidth links. The time taken to read, update and write a single counter would be too large, and worse still multiple counters may need to be updated for each arriving packet. In this paper we consider a specific architecture for storing and updating statistics counters. Smaller sized counters are maintained in fast (potentially on-chip) SRAM, while a large, slower DRAM maintains the full-sized counters. The problem is to ensure that the counter values are always correctly maintained at line-rate. We describe and analyze an optimal counter management algorithm (LCF-CMA), which minimizes the size of the SRAM required while ensuring correct line-rate operation of a large number of counters.

B. Prabhakar, D. Shah, N. McKeown and S. Iyer, "Analysis of a Statistics Counter Architecture," High-Performance Interconnects, Symposium on(HOTI), Stanford, California, 2001, pp. 0107.
93 ms
(Ver 3.3 (11022016))