CacheFlow: Dependency-Aware Rule-Caching for Software-Defined Networks

被引:95
作者
Katta, Naga [1 ]
Alipourfard, Omid [2 ]
Rexford, Jennifer [1 ]
Walker, David [1 ]
机构
[1] Princeton Univ, Princeton, NJ 08544 USA
[2] Univ Southern Calif, Los Angeles, CA 90089 USA
来源
SYMPOSIUM ON SOFTWARE DEFINED NETWORKING (SDN) RESEARCH (SOSR'16) | 2016年
关键词
Rule Caching; Software-Defined Networking; OpenFlow; Commodity Switch; TCAM;
D O I
10.1145/2890955.2890969
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Software-Defined Networking (SDN) allows control applications to install fine-grained forwarding policies in the underlying switches. While Ternary Content Addressable Memory (TCAM) enables fast lookups in hardware switches with flexible wildcard rule patterns, the cost and power requirements limit the number of rules the switches can support. To make matters worse, these hardware switches cannot sustain a high rate of updates to the rule table. In this paper, we show how to give applications the illusion of high-speed forwarding, large rule tables, and fast updates by combining the best of hardware and software processing. Our CacheFlow system "caches" the most popular rules in the small TCAM, while relying on software to handle the small amount of "cache miss" traffic. However, we cannot blindly apply existing cache-replacement algorithms, because of dependencies between rules with overlapping patterns. Rather than cache large chains of dependent rules, we "splice" long dependency chains to cache smaller groups of rules while preserving the semantics of the policy. Experiments with our CacheFlow prototype-on both real and synthetic workloads and policies-demonstrate that rule splicing makes effective use of limited TCAM space, while adapting quickly to changes in the policy and the traffic demands.
引用
收藏
页数:12
相关论文
共 33 条
  • [1] [Anonymous], 2011, ACM SIGCOMM
  • [2] [Anonymous], 2003, ICNP
  • [3] [Anonymous], 2012, HEADER SPACE ANAL ST
  • [4] [Anonymous], 2013, ACM SIGCOMM
  • [5] [Anonymous], 2010, ACM SIGCOMM
  • [6] [Anonymous], ACM SIGMETRICS
  • [7] [Anonymous], 2013, P NSDI
  • [8] Dobrescu M., 2009, SOSP
  • [9] Feldmeier D., 1988, IEEE INFOCOM
  • [10] Foster Nate., P ICFP 11