11th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness

Research Article

Flow Setup Time aware Minimum Cost Switch-Controller Association in Software-Defined Networks

Download681 downloads
  • @INPROCEEDINGS{10.4108/eai.19-8-2015.2260893,
        author={Deze Zeng and Chao Teng and Lin Gu and Hong Yao and Qingzhong Liang},
        title={Flow Setup Time aware Minimum Cost Switch-Controller Association in Software-Defined Networks},
        proceedings={11th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness},
        publisher={IEEE},
        proceedings_a={QSHINE},
        year={2015},
        month={9},
        keywords={software defined networking flow setup optimisation and analysis},
        doi={10.4108/eai.19-8-2015.2260893}
    }
    
  • Deze Zeng
    Chao Teng
    Lin Gu
    Hong Yao
    Qingzhong Liang
    Year: 2015
    Flow Setup Time aware Minimum Cost Switch-Controller Association in Software-Defined Networks
    QSHINE
    IEEE
    DOI: 10.4108/eai.19-8-2015.2260893
Deze Zeng,*, Chao Teng1, Lin Gu2, Hong Yao1, Qingzhong Liang1
  • 1: China University of Geosciences
  • 2: University of Aizu
*Contact email: dazzae@gmail.com

Abstract

Software Defined Networks (SDN) emerged as a new network paradigm to address the customization and flexibility problems in traditional computer networks. In SDNs, a logical centralized programmable controller manages the whole networks by installing rules onto switches. It is widely regarded that one controller is restricted on both performance and scalability. To address these limitations, pioneering researchers advocate deploying multiple controllers in SDNs where each controller is in charge of a set of switches. This raises the switch-controller association problem on one switch shall be managed by which controller. In this paper, we specially investigate minimum cost switch-controller association (MC-SCA) problem on how to minimize the number of controllers needed in an SDN while guaranteeing the flow setup time. A quadratic integer programming model is first proposed and then transformed into an equivalent integer linear programming model to describe the MC-SCA problem, which is then proved as NP-Hard. We further propose a heuristic algorithm and extensively prove its high efficiency via simulations.