KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Rules Placement with Delay Guarantee in Combined SDN Forwarding Element

  • Qi, Qinglei (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications) ;
  • Wang, Wendong (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications) ;
  • Gong, Xiangyang (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications) ;
  • Que, Xirong (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications)
  • Received : 2016.10.25
  • Accepted : 2017.04.05
  • Published : 2017.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Recent studies have shown that the flow table size of hardware SDN switch cannot match the number of concurrent flows. Combined SDN Forwarding Element (CFE), which comprises several software switches and a hardware switch, becomes an alternative approach to tackle this problem. Due to the limited capacity of software switch, the way to route concurrent flows in CFE can largely affect the maximum delay that a flow suffers at CFE. As delay-guarantee is a nontrivial task for network providers with the increasing number of delay-sensitive applications, we propose an analytical model of CFE to evaluate a rules placement solution first. Next, we formulate the problem of Rules Placement with delay guarantee in CFE (RPCFE), and present the genetic-based rules placement (GARP) algorithm to solve the RPCFE problem. Further, we validate the analytical model of CFE through simulations in NS-3 and compare the performance of GARP with three benchmark algorithms.

Keywords

References

  1. OpenFlow 1.0.0 Specification [Online].
  2. M. Kuzniar, P. Peresini, and D. Kostic, "What you need to know about sdn flow tables," in Proc. of 16th Passive and Active Measurement, pp.347-359, March 19-20, 2015.
  3. A. Lazaris, D. Tahara, X. Huang, E. Li, A. Voellmy, Y. R. Yang, and M. Yu, "Tango: Simplifying sdn control with automatic switch property inference, abstraction, and optimization," in Proc. of 10th ACM Conf. on Emerging Networking Experiments and Technologies, pp. 199-212, December 02-05, 2014.
  4. Tcams and openflow: What every sdn practitioner must know, [Online].
  5. M. Kobayashi, S. Seetharaman, G. Parulkar, G. Appenzeller, J. Little, J. Van Reijendam, P. Weissmann, and N. McKeown, "Maturing of openflow and software-defined networking through deployments," Computer Networks, vol. 61, pp. 151-175, March, 2014. https://doi.org/10.1016/j.bjp.2013.10.011
  6. S. Banerjee and K. Kannan, "Tag-in-tag: Efficient flow table management in sdn switches," in Proc. of IEEE Conf. on Network and Service Management (CNSM) and Workshop, pp.109-117, November 17-21, 2014,.
  7. X.-N. Nguyen, D. Saucez, C. Barakat, and T. Turletti, "Rules placement problem in openflow networks: a survey," IEEE Communications Surveys & Tutorials, vol. 18, no. 2, pp. 1273-1286, 2015. https://doi.org/10.1109/COMST.2015.2506984
  8. N. Katta, O. Alipourfard, J. Rexford, and D. Walker, "Cacheflow: Dependency-aware rule-caching for software-defined networks," in Proc. of ACM Symposium on SDN Research, pp.6:1-6:12. March 14-15, 2016.
  9. X. Cao, Y. Dong, and D. H. C. Du, "Synchronized multi-hop scheduling for real-time traffic on sdns," in Proc. of 24th IEEE Conf. on Computer Communication and Networks, pp.1-8, August 3-6, 2015,.
  10. X. Wang, X. Wang, L. Liu, and G. Xing, "Dutycon: a dynamic duty cycle control approach to end-to-end delay guarantees in wireless sensor networks," ACM Transactions on Sensor Networks, vol. 9, no. 4, p. 42, 2013.
  11. X. N. Nguyen, D. Saucez, C. Barakat and T. Turletti, "OFFICER: A general optimization framework for OpenFlow rule allocation and endpoint policy enforcement," in Proc. of IEEE Conference on Computer Communications, pp. 478-486, April 26-May 1, 2015.
  12. K. Kannan and S. Banerjee, "Flowmaster: Early eviction of dead flow on sdn switches," in Proc. of International Conf. on Distributed Computing and Networking, pp.484-498, January 4-7, 2014.
  13. M. Klymash, B. Strykhalyuk, M. Beshley and T. Maksymyuk, "Research and development the methods of quality of service provision in Mobile Cloud systems," in Proc. of IEEE International Black Sea Conference on Communications and Networking, pp.160-164, June 5-8, 2014.
  14. T. Maksymyuk, S. Dumych, O. Krasko and M. Jo, "Software defined optical switching for cloud computing transport systems," in Proc. of 9th ACM International Conf. on Ubiquitous Information Management and Communication, pp.1-2, January 08-10, 2015:
  15. M. Selmchenko, M. Beshley, O. Panchenko and M. Klymash, "Development of monitoring system for end-to-end packet delay measurement in software-defined networks," in Proc. of 13th IEEE International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science, pp. 667-670, February 23-26, 2016.
  16. K. Phemius and M. Bouet, "Monitoring latency with openflow," in Proc. of 9th IEEE Conf. on Network and Service Management, pp.122-125, October 122-125, 2013.
  17. N. Mehravari, Queueing Theory. John Wiley and Sons, Inc., 2001.
  18. J. L. Boudec and P. Thiran, Network calculus: a theory of deterministic queuing systems for the internet, Springer-Verlag, 2001.
  19. Y. Jiang, "Network calculus and queueing theory: Two sides of one coin: Invited paper," in Proc. of 4th International ICST Conf. on Performance Evaluation Methodologies and Tools, pp. 37:1-37:12, October 20-22, 2009.
  20. F. Ciucu and J. Schmitt, "Perspectives on network calculus: no free lunch, but still good value," in Proc. of ACM conf. on Applications, technologies, architectures, and protocols for computer communication, pp. 311-322, August 13-17, 2012.
  21. J. Y. L. Boudec, "Application of network calculus to guaranteed service networks," IEEE Transactions on Information Theory, vol. 44, no. 3, pp. 1087-1096, 1998. https://doi.org/10.1109/18.669170
  22. A. Lazaris, D. Tahara, X. Huang, E. Li, A. Voellmy, Y. R. Yang, and M. Yu, "Tango: Simplifying sdn control with automatic switch property inference, abstraction, and optimization," in Proc. of 10th ACM Conf. on Emerging Networking Experiments and Technologies, pp. 199-212, December 02-05, 2014.
  23. E. J. Rosensweig and J. Kurose, "A network calculus for cache networks," in Proc. of IEEE INFOCOM, pp. 85-89, April 14-19, 2013.
  24. J. L. Boudec and P. Thiran, Network calculus: a theory of deterministic queuing systems for the internet, Springer-Verlag, 2001.
  25. C.S. Chang, Performance guarantees in communication networks, Springer Science & Business Media, 2012.
  26. J. Y. Leung, Handbook of scheduling: algorithms, models, and performance analysis, CRC Press, 2004.
  27. L D. Whitley, "The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best," in Proc. of ICGA, pp.116-123, 1989.
  28. ACL and QoS Command Reference [Online].