skip to main content
research-article

SDN Flow Entry Management Using Reinforcement Learning

Authors Info & Claims
Published:26 November 2018Publication History
Skip Abstract Section

Abstract

Modern information technology services largely depend on cloud infrastructures to provide their services. These cloud infrastructures are built on top of Datacenter Networks (DCNs) constructed with high-speed links, fast switching gear, and redundancy to offer better flexibility and resiliency. In this environment, network traffic includes long-lived (elephant) and short-lived (mice) flows with partitioned/aggregated traffic patterns. Although SDN-based approaches can efficiently allocate networking resources for such flows, the overhead due to network reconfiguration can be significant. With limited capacity of Ternary Content-Addressable Memory (TCAM) deployed in an OpenFlow enabled switch, it is crucial to determine which forwarding rules should remain in the flow table and which rules should be processed by the SDN controller in case of a table-miss on the SDN switch. This is needed in order to obtain the flow entries that satisfy the goal of reducing the long-term control plane overhead introduced between the controller and the switches. To achieve this goal, we propose a machine learning technique that utilizes two variations of Reinforcement Learning (RL) algorithms—the first of which is a traditional RL-based algorithm, while the other is deep reinforcement learning-based. Emulation results using the RL algorithm show around 60% improvement in reducing the long-term control plane overhead and around 14% improvement in the table-hit ratio compared to the Multiple Bloom Filters (MBF) method, given a fixed size flow table of 4KB.

References

  1. M. Casado, M. J. Freedman, J. Pettit, J. Lou, N. McKeown, and S. Shenker. 2007. Ethane: Taking control of the enterprise. ACM SIGCOMM Computer Communication Review 37, 4 1--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. 2008. OpenFlow: Enabling innovation in campus networks. ACM SIGCOMM Computer Communications Review 38, 2 73--78. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Open Networking Foundation. {Online}. Available: https://www.opennetworking.org, February 2017.Google ScholarGoogle Scholar
  4. S. Kandula, S. Sengupta, A. Greenberg, P. Patel, and R. Chaiken. 2009. The nature of data center traffic: Measurement 8 analysis. In Proceedings of the 9th ACM SIGCOMM Conference on International Measurement (IMC’09). ACM, New York, 202--208. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Benson, A. Akella, and D. A. Maltz. 2010. Network traffic characteristics of data centers in the wild. In Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement. ACM, Melbourne, 267--280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. B. S. Lee, R. Kanagavelu, and K. M. M. Aung. 2013. An efficient flow cache algorithm with improved fairness in software-defined data center networks. In Proceedings of the 2013 IEEE 2nd International Conference on Cloud Networking (CloudNet). IEEE, San Francisco, 18--24.Google ScholarGoogle ScholarCross RefCross Ref
  7. B. Lantz, B. Heller, and N. McKeown. 2010. A network in a laptop: Rapid prototyping for software-defined networks. In Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks. ACM, Monterey, 19:1--19:6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Mininet -- an instant virtual network on your laptop (or other PC). {Online}. Available: http://www.mininet.org/, February 2017.Google ScholarGoogle Scholar
  9. R. Challa, Y. Lee, and H. Choo. 2016. Intelligent eviction strategy for efficient flow table management in openflow switches. In Proceedings of the 2016 IEEE NetSoft Conference and Workshops (NetSoft). IEEE, Seoul, 312--318.Google ScholarGoogle Scholar
  10. TCAMs and Openflow: What every practitioner must know. {Online}. Available: https://www.sdxcentral.com/articles/contributed/sdn-openflow-tcam-need-to-know/2012/07/, 2012.Google ScholarGoogle Scholar
  11. N. Katta, O. Alipourfard, J. Rexford, and D. Walker. 2014. Infinite cacheflow in software-defined networks. In Proceedings of the 3rd Workshop on Hot Topics in Software Defined Networking. ACM, Chicago, 175--180. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. Banerjee and K. Kannan. 2014. Tag-in-tag: Efficient flow table management in SDN switches. In Proceedings of the 10th International Conference on Network and Service Management (CNSM) and Workshop. IEEE, Rio de Janeiro. 109--117.Google ScholarGoogle Scholar
  13. S. Veeramani, M. Kumar, and S. N. Mahammad. 2013. Minimization of flow table for TCAM based openflow switches by virtual compression approach. In Proceedings of the 2013 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). IEEE, Kattankulathur, 1--4.Google ScholarGoogle Scholar
  14. H. Zhu, M. Xu, Q. Li, J. Li, Y. Yang, and S. Li. 2015. MDTC: An efficient approach to TCAM-based multidimensional table compression. In Proceedings of the 2015 IFIP Networking Conference (IFIP Networking). IEEE, Toulouse, 1--9.Google ScholarGoogle Scholar
  15. S. Luo, H. Yu, and L. M. Li. 2014. Fast incremental flow table aggregation in SDN. In Proceedings of the 2014 23rd International Conference on Computer Communication and Networks (ICCCN). IEEE, Shanghai, 1--8.Google ScholarGoogle Scholar
  16. M. Anan, A. Al-Fuqaha, N. Nasser, T. Mu, and H. Bustam. 2016. Empowering networking research and experimentation through software-defined networking. Journal of Network and Computer Applications 70, July 140--155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Lu, W. Deng, and Y. Shi. 2016. TF-idletimeout: Improving efficiency of TCAM in SDN by dynamically adjusting flow entry lifecycle. In Proceedings of the 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, Budapest, 2681--2686.Google ScholarGoogle Scholar
  18. X. N. Nguyen, D. Saucez, C. Barakat, and T. Turletti. 2016. Rules placement problem in openflow networks: A survey. In IEEE Communications Surveys 8 Tutorials 18, 2 1273--1286.Google ScholarGoogle Scholar
  19. R. S. Sutton and A. G. Barto. 1998. Reinforcement Learning: An Introduction. MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. S. Marsland. 2014. Machine Learning, 2nd edition. CRC Press.Google ScholarGoogle Scholar
  21. V. Mnih, K. Kavukcuoglu, D. Silver, A. Graves, I. Antonoglou, D. Wierstra, and M. Riedmiller. 2013. Playing Atari with deep reinforcement learning. ArXiv Preprint, ArXiv: 1312.5602.Google ScholarGoogle Scholar
  22. V. Mnih, K. Kavukcuoglu, D. Silver, A. A. Rusu, J. Veness, M. G. Bellemare, A. Graves, M. Riedmiller, A. K. Fidjeland, G. Ostrovski, and S. Petersen. 2015. Human-level control through deep reinforcement learning. Nature 518, 7540 529--533.Google ScholarGoogle Scholar
  23. Google DeepMind. {Online}. Available: https://deepmind.com/. February 2017.Google ScholarGoogle Scholar
  24. J. Schmidhuber. January 2015. Deep learning in neural networks: An overview. Neural Networks 61, 85--117. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Y. Jia, E. Shelhamer, J. Donahue, S. Karayev, J. Long, R. Girshick, S. Guadarrama, and T. Darrell. 2014. Caffe: Convolutional architecture for fast feature embedding. In Proceedings of the 22nd ACM International Conference on Multimedia. ACM, Orlando, 675--678. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. C. Lee, Y. Nakagawa, K. Hyoudou, S. Kobayashi, O. Shiraki, and T. Shimizu. 2015. Flow-aware congestion control to improve throughput under tcp incast in datacenter networks. In Proceedings of the IEEE 39th Annual Computer Software and Applications Conference. IEEE, Taichung, 155--162. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. POX Controller, {Online}. Available: https://github.com/noxrepo/pox.Google ScholarGoogle Scholar
  28. H. A. A. Al-Rawi, M. A. Ng, and K.-L. A. Yau. 2015. Application of reinforcement learning to routing in distributed wireless networks: A review. Artificial Intelligence Review 43, 3 381--416. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. R. Desai and B. P. Patil. 2015. Cooperative reinforcement learning approach for routing in ad hoc networks. In Proceedings of the 2015 International Conference on Pervasive Computing (IEEE ICPC 2015). IEEE, Pune, 1--5.Google ScholarGoogle Scholar
  30. J. Solanki and A. Chauhan. 2015. A reinforcement learning network based novel adaptive routing algorithm for wireless ad-hoc network. International Journal of Science Technology 8 Engineering 1, 12 135--142.Google ScholarGoogle Scholar
  31. S. C. Lin, I. F. Akyildiz, P. Wang, and M. Luo. 2016. QoS-aware adaptive routing in multi-layer hierarchical software defined networks: A reinforcement learning approach. In Proceedings of the 2016 IEEE International Conference on Services Computing (SCC). IEEE, San Francisco, CA, 25--33.Google ScholarGoogle Scholar
  32. S. Wang, H. Liu, P. H. Gomes, and B. Krishnamachari. 2017. Deep reinforcement learning for dynamic multichannel access. In Proceedings of the International Conference on Computing, Networking and Communications (ICNC). IEEE, Silicon Valley, 257--265.Google ScholarGoogle Scholar

Index Terms

  1. SDN Flow Entry Management Using Reinforcement Learning

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Autonomous and Adaptive Systems
            ACM Transactions on Autonomous and Adaptive Systems  Volume 13, Issue 2
            June 2018
            113 pages
            ISSN:1556-4665
            EISSN:1556-4703
            DOI:10.1145/3243657
            Issue’s Table of Contents

            Copyright © 2018 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 26 November 2018
            • Revised: 1 September 2018
            • Accepted: 1 September 2018
            • Received: 1 September 2017
            Published in taas Volume 13, Issue 2

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article
            • Research
            • Refereed

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader