|
[1]D. Kreutz, F. M. V. Ramos, P. E. Veríssimo, C. E. Rothenberg, S. Azodolmolky and S. Uhlig, "Software-Defined Networking: A Comprehensive Survey," in Proceedings of the IEEE, vol. 103, no. 1, pp. 14-76, Jan. 2015.
[2]Andrew R. Curtis, Jeffrey C. Mogul, Jean Tourrilhes, Praveen Yalagandula, Puneet Sharma, and Sujata Banerjee. 2011. DevoFlow: scaling flow management for high-performance networks. SIGCOMM Comput. Commun. Rev. 41, 4 (August 2011), 254-265.
[3]F. Hu, Q. Hao and K. Bao, "A Survey on Software-Defined Network and OpenFlow: From Concept to Implementation," in IEEE Communications Surveys & Tutorials, vol. 16, no. 4, pp. 2181-2206, Fourthquarter 2014.
[4]M G Gouda, X Y Liu, A. Firewall, "design: Consistency completeness and compactness[C]IIDistributed Computing Systems 2004," Proceedings. 24th International Conference on. IEEE, pp. 320-327, 2004.
[5]B. Leng, L. Huang, X. Wang, H. Xu and Y. Zhang, "A mechanism for reducing flow tables in software defined network," 2015 IEEE International Conference on Communications (ICC), London, 2015, pp. 5302-5307.
[6]R. P. Draves, C. King, S. Venkatachary and B. D. Zill, "Constructing optimal IP routing tables," INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, New York, NY, 1999, pp. 88-97 vol.1.
[7]Y. Liu, B. Zhang and L. Wang, "FIFA: Fast incremental FIB aggregation," 2013 Proceedings IEEE INFOCOM, Turin, 2013, pp. 1-9.
[8]A. X. Liu, C. R. Meiners and E. Torng, "TCAM Razor: A Systematic Approach Towards Minimizing Packet Classifiers in TCAMs," in IEEE/ACM Transactions on Networking, vol. 18, no. 2, pp. 490-500, April 2010.
[9]C. R. Meiners, A. X. Liu and E. Torng, "Bit weaving: A non-prefix approach to compressing packet classifiers in TCAMs," 2009 17th IEEE International Conference on Network Protocols, Princeton, NJ, 2009, pp. 93-102.
[10]S. Luo, H. Yu and L. M. Li, "Fast incremental flow table aggregation in SDN," 2014 23rd International Conference on Computer Communication and Networks (ICCCN), Shanghai, 2014, pp. 1-8.
[11]TCAMs and OpenFlow – What Every SDN Practitioner Must Know, available: https://www.sdxcentral.com/articles/contributed/sdn-openflow-tcam-need-to-know/2012/07/
[12]Q. Dong, S. Banerjee, J. Wang, D. Agrawal, and A. Shukla, "Packet classifiers in ternary CAMs can be smaller," in Proc. SIGMETRICS, 2006, pp. 311-322.
[13]P. Gupta and N. McKeown, "Algorithms for packet classification," in IEEE Network, vol. 15, no. 2, pp. 24-32, Mar/Apr 2001.
[14]Charles E. Leiserson Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Transactions on Computers, Vol. 34 , no. 10, Oct. 1985, pp. 892-901.
[15]E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik archive,Volume 1 Issue 1, December 1959 Pages 269-271
|