Hierarchical statisically multiplexed counters and a method thereof
Embodiments of the present invention relate to an architecture that uses hierarchical statistically multiplexed counters to extend counter life by orders of magnitude. Each level includes statistically multiplexed counters. The statistically multiplexed counters includes P base counters and S subcounters, wherein the S subcounters are dynamically concatenated with the P base counters. When a row overflow in a level occurs, counters in a next level above are used to extend counter life. The hierarchical statistically multiplexed counters can be used with an overflow FIFO to further extend counter life.
1. A counter architecture implemented in a network device, the counter architecture comprising:
a hierarchy of levels of statistically multiplexed counters, wherein each of the hierarchy of levels includes a plurality of rows of bits, wherein each row includes a first set of consecutive bits, a second set of consecutive bits and a third set of consecutive bits; and
an overflow FIFO used and shared by all counters in the highest level in the hierarchy of levels, wherein the overflow FIFO stores associated counter identifiers of any of the counters that are overflowing in the highest level in the hierarchy of levels.
2. The counter architecture of claim 1 , wherein the first set of consecutive bits is evenly shared by S subcounters, the second set of consecutive bits is evenly shared by P base counters, and the third set of consecutive bits represents a mapping of the S subcounters to the P base counters.
3. The counter architecture of claim 1 , wherein a counter is expanded by concatenating one or more of the S subcounters to one of the P base counters.
4. The counter architecture of claim 1 , wherein a counter is shrunk by removing one or more of the S subcounters from one of the P base counters.
5. The counter architecture of claim 1 , wherein when row overflow occurs in one level of the hierarchy occurs, counters in a next level above are used to extend counter life.
6. The counter architecture of claim 5 , wherein counters in the one level of the hierarchy are shuffled into different rows in the next level above of the hierarchy.
7. A counter architecture implemented in a network device, the counter architecture comprising:
a plurality of levels of multiplexed counters, wherein each of the plurality of levels includes a plurality of rows of bits, wherein each row includes a first set of consecutive bits, a second set of consecutive bits and a third set of consecutive bits; and
an overflow FIFO used and shared by all counters in a highest level in the plurality of levels, wherein the overflow FIFO stores associated counter identifiers of any of the counters that are overflowing in the highest level in the hierarchy of levels.
8. The counter architecture of claim 7 , wherein the first set of consecutive bits is evenly shared by S subcounters, the second set of consecutive bits is evenly shared by P base counters, and the third set of consecutive bits represents a mapping of the S subcounters to the P base counters.
9. The counter architecture of claim 7 , wherein a counter is expanded by concatenating one or more of the S subcounters to one of the P base counters.
10. The counter architecture of claim 7 , wherein a counter is shrunk by removing one or more of the S subcounters from one of the P base counters.
11. The counter architecture of claim 7 , wherein when row overflow occurs in one level of the plurality of levels occurs, counters in a next level above are used to extend counter life.
12. The counter architecture of claim 11 , wherein counters in the one level of the plurality of levels are shuffled into different rows in the next level above of the plurality of levels.
13. A counter architecture implemented in a network device, the counter architecture comprising:
a hierarchy of levels of statistically multiplexed counters, wherein each of the hierarchy of levels includes a plurality of rows of bits, wherein each row includes a first set of consecutive bits, a second set of consecutive bits and a third set of consecutive bits, wherein the first set of consecutive bits is evenly shared by S subcounters, the second set of consecutive bits is evenly shared by P base counters, and the third set of consecutive bits represents a mapping of the S subcounters to the P base counters; and
an overflow FIFO used and shared by all counters in the highest level in the hierarchy of levels, wherein the overflow FIFO stores associated counter identifiers of any of the counters that are overflowing in the highest level in the hierarchy of levels.
14. The counter architecture of claim 13 , wherein a counter is expanded by concatenating one or more of the S subcounters to one of the P base counters.
15. The counter architecture of claim 13 , wherein a counter is shrunk by removing one or more of the S subcounters from one of the P base counters.
16. The counter architecture of claim 13 , wherein when row overflow occurs in one level of the hierarchy occurs, counters in a next level above are used to extend counter life.
17. The counter architecture of claim 16 , wherein counters in the one level of the hierarchy are shuffled into different rows in the next level above of the hierarchy.