Abstract

SummaryIn a digital world changing at high speed, data centers still play a major role in new network architectures. Software‐defined network (SDN) technology is considered as a suitable solution to solve and overcome several limitations of standard data centers including flexibility, scalability, and ease of management. However, in an SDN with a distributed control plane, the assignment of switches could be a cause of generating significant latency that could degrade the Quality of Experience (QoE) of certain services and applications hosted on the data center. In this paper, we propose a matching game algorithm ensuring a dynamic assignment of switches. Its main characteristic is to achieve a fair assignment while balancing the load generated by the data plane among all controllers resulting in a balanced response time. The numerical results show that our algorithm outperforms other existing state‐of‐the‐art algorithms in terms of minimizing controllers' response time.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.