(Acronym?: RRA)
Think of a round-robin archive as a data structure that contains a pointer and N (eg 1000) spaces for data.
Whenever you want to add a data item, you put the data item at the space pointed to by the pointer and increment it. If it gets to N, you set it back to 0 again.
Basically, this lets you easily build a graph of the last 1000 items of data, without ever having a situation where you store more than 1000 items of data and have to remove any of them.
This is how rrdtool works.
No other page links to RoundRobinArchive yet.
