一般使用三元內容定址記憶體(Ternary Content Addressable Memory)，實作交換器裡的SDN路由表(Flow-table)。因交換器硬體規格不同只能提供少量的TCAMs。在軟體定義網路(Software-define network)中，需要提供各式各樣的服務，像是安全防護、虛擬私人網路(VPN)、服務質量(QoS)、負載平衡和流量監控，而這些服務都需要龐大的規則(Rule)去完成。而要如何將這些龐大的規則存放在SDN交換器是個嚴重的問題。
在本篇論文中，我們的方法將完整的路由表(Full flow-table)分割成幾個小的部分路由表(partial flow-table)，再將這些部分路由表分配給網路中的各個交換器。我們的目標是減少各個交換器使用的儲存空間和平衡各個交換器負載平衡。更重要的是在加入新的規則時，減少了控制者(controller)通訊成本。

The switch's flow-table is usually implemented by using ternary content addressable memory (TCAMs). In SDN, TCAM supports just a few thousand or tens of thousands of entries (which is according to the different hardware). However, SDN needs to provide a variety of services, such like the security services, virtual private network (VPN), quality of service (QoS), load balancing, traffic monitoring and accounting, network address translation (NAT), etc. These services will need a lot of policies to complete, which is mapping to a large number of rules. So, how to store all the rules in the SDN switch becomes a serious problem. Our method decomposes a large SDN flow-tables into small ones and then distributing them across the network. Our goal is to reduce the total number of table entries and also balance the number of table entries in each switch. When the SDN tables update, our method also reduces the controller communication cost.

[1] http://www.sdncentral.com/, “sdn central.”
[2] http://archive.openflow.org/, “Openflow.”
[3] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford,
S. Shenker, and J. Turner, “Openflow: enabling innovation in campus networks,”
ACM SIGCOMM Computer Communication, vol. 38, pp. 69–74, 2008.
[4] http://searchnetworking.techtarget.com/, “Searchnetworking.”
[5] F. Yu, T. V. Lakshman, M. Motoyama, and R. Katz, “Ssa,” in Architecture for
networking and communications systems, Oct 2005, pp. 105–113.
[6] B. Stephens, A. Cox, W. Felter, C. Dixon, and J. Carter, “Past: Scalable ethernet
for data centers,” international conference on Emerging networking experiments and
technologies, pp. 49–60, 2012.
[7] Y. Kanizo, D. Hay, and I. Keslassy, “Palette: Distributing tables in software-defined
networks,” in INFOCOM, 2013 Proceedings IEEE, 2013, pp. 545–549.
[8] Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, “Fast accurate computation
of large-scale ip traffic matrices from link loads,” ACM SIGMETRICS, vol. 31, pp.
206–217, 2003.
[9] A. Lakhina, M. Crovella, and C. Diot, “Diagnosing network-wide traffic anomalies,”
ACM SIGCOMM Computer Communication, vol. 34, pp. 219–230, 2004.
[10] X. Li, F. Bian, H. Zhang, C. Diot, R. Govindan, W. H. Hong, and G. Iannaccone,
“Mind: A distributed multi-dimensional indexing system for network diagnosis,”
IEEE International Conference on Computer Communications, pp. 1–12, 2006.
[11] M. Kodialam and T. V. Lakshman, “Detecting network intrusions via sampling: a
game theoretic approach,” in INFOCOM 2003. Twenty-Second Annual Joint Conference
of the IEEE Computer and Communications. IEEE Societies, vol. 3, 2003,
pp. 1880–1889.
[12] V. Sekar, M. K. Reiter, W. Willinger, H. Zhang, R. R. Kompella, and D. G. Andersen,
“csamp: A system for network-wide flow monitoring,” USENIX Symposium on
Networked Systems Design and Implementation, pp. 223–246, 2008.
[13] K. Suh, Y. Guo, J. Kurose, and D. Towsley, “Locating network monitors: complexity,
heuristics, and coverage,” in IEEE Computer and Communications Societies, vol. 1,
2005, pp. 351–361.
[14] S. Raza, G. Huang, C.-N. Chuah, S. Seetharaman, and J. Singh, “Measurouting: A
framework for routing assisted traffic monitoring,” in INFOCOM, 2010 Proceedings
IEEE, 2010, pp. 1–9.
[15] A. Di Pietro, F. Huici, D. Costantini, and S. Niccolini, “Decon: Decentralized coordination
for large-scale flow monitoring,” in INFOCOM IEEE Conference on Computer
Communications Workshops , 2010, 2010, pp. 1–5.
[16] D. L. Applegate, G. Calinescu, D. S. Johnson, H. Karlo, K. Ligett, and J. Wang,
“Compressing rectilinear pictures and minimizing access control lists,” ACM-SIAM
symposium on Discrete algorithms, pp. 1066–1075, 2007.
[17] C. R. Meiners, A. X. Liu, and E. Torng, “Bit weaving: A non-prefix approach to
compressing packet classifiers in tcams,” IEEE/ACM Transactions on Networking,
vol. 20, pp. 488–500, 2012.
[18] A. Liu, C. Meiners, and E. Torng, “Tcam razor: A systematic approach towards
minimizing packet classifiers in tcams,” IEEE/ACM Transactions on Networking,
vol. 18, pp. 490–500, 2010.
[19] M. Yu, J. Rexford, M. J. Freedman, and J. Wang, “Scalable flow-based networking
with difane,” ACM SIGCOMM Computer Communication, vol. 40, pp. 351–362,
2010.
[20] N. Kang, Z. Liu, J. Rexford, and D. Walker, “Optimizing the ”one big switch”
abstraction in software-defined networks,” ACM conference on Emerging networking
experiments and technologies, pp. 13–24, 2013.
[21] Q. Dong, S. Banerjee, J. Wang, and D. Agrawal, “Wire speed packet classification
without tcams: A few more registers (and a bit of logic) are enough,” ACM SIGMETRICS,
vol. 35, pp. 253–264, 2007.
[22] http://mininet.org/, “Mininet.”
[23] http://www.projectfloodlight.org/, “Project floodligh.”