TY - GEN
T1 - Evolution of cache replacement policies to track heavy-hitter flows
AU - Zadnik, Martin
AU - Canini, Marco
PY - 2011
Y1 - 2011
N2 - Several important network applications cannot easily scale to higher data rates without requiring focusing just on the large traffic flows. Recent works have discussed algorithmic solutions that trade-off accuracy to gain efficiency for filtering and tracking the so-called "heavy-hitters". However, a major limit is that flows must initially go through a filtering process, making it impossible to track state associated with the first few packets of the flow. In this paper, we propose a different paradigm in tracking the large flows which overcomes this limit. We view the problem as that of managing a small flow cache with a finely tuned replacement policy that strives to avoid evicting the heavy-hitters. Our scheme starts from recorded traffic traces and uses Genetic Algorithms to evolve a replacement policy tailored for supporting seamless, stateful traffic-processing. We evaluate our scheme in terms of missed heavy-hitters: it performs close to the optimal, oracle-based policy, and when compared to other standard policies, it consistently outperforms them, even by a factor of two in most cases.
AB - Several important network applications cannot easily scale to higher data rates without requiring focusing just on the large traffic flows. Recent works have discussed algorithmic solutions that trade-off accuracy to gain efficiency for filtering and tracking the so-called "heavy-hitters". However, a major limit is that flows must initially go through a filtering process, making it impossible to track state associated with the first few packets of the flow. In this paper, we propose a different paradigm in tracking the large flows which overcomes this limit. We view the problem as that of managing a small flow cache with a finely tuned replacement policy that strives to avoid evicting the heavy-hitters. Our scheme starts from recorded traffic traces and uses Genetic Algorithms to evolve a replacement policy tailored for supporting seamless, stateful traffic-processing. We evaluate our scheme in terms of missed heavy-hitters: it performs close to the optimal, oracle-based policy, and when compared to other standard policies, it consistently outperforms them, even by a factor of two in most cases.
KW - Network traffic measurement
KW - genetic algorithms
KW - replacement policy
KW - scalability
KW - tracking heavy-hitter flows
UR - http://www.scopus.com/inward/record.url?scp=79952948495&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-19260-9_3
DO - 10.1007/978-3-642-19260-9_3
M3 - Conference contribution
AN - SCOPUS:79952948495
SN - 9783642192593
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 21
EP - 31
BT - Passive and Active Measurement - 12th International Conference, PAM 2011, Proceedings
T2 - 12th International Conference on Passive and Active Measurement, PAM 2011
Y2 - 20 March 2011 through 22 March 2011
ER -