Kshira Sagar Sahoo, S. Ramasubbareddy, B. Balusamy, B. Deep
{"title":"Analysing control plane scalability issue of software defined wide area network using simulated annealing technique","authors":"Kshira Sagar Sahoo, S. Ramasubbareddy, B. Balusamy, B. Deep","doi":"10.1504/ijguc.2020.10032055","DOIUrl":null,"url":null,"abstract":"In Software Defined Networks (SDN), the decoupling of the control logic from the data plane provides numerous advantages. Since its inception, SDN is a subject of a wide range of criticism mainly related to the scalability issues of the control plane. To address these limitations, recent architectures have supported the implementation of multiple controllers. Usage of multiple controllers leads to Controller Placement Problems (CPP) particularly in wide area networks. In most of the placement strategies, authors focused on propagation latency, because it is a critical factor in real networks. In this paper, the placement problem has been formulated on the basis of propagation latency as an optimisation problem, and Simulated Annealing (SA) technique has been used to analyse the problem. Further, we investigate the behaviour of SA with four different neighbouring solutions technique. The effectiveness of the algorithms is carried out on TataNld topology and implemented using MATLAB simulator.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Grid Util. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijguc.2020.10032055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In Software Defined Networks (SDN), the decoupling of the control logic from the data plane provides numerous advantages. Since its inception, SDN is a subject of a wide range of criticism mainly related to the scalability issues of the control plane. To address these limitations, recent architectures have supported the implementation of multiple controllers. Usage of multiple controllers leads to Controller Placement Problems (CPP) particularly in wide area networks. In most of the placement strategies, authors focused on propagation latency, because it is a critical factor in real networks. In this paper, the placement problem has been formulated on the basis of propagation latency as an optimisation problem, and Simulated Annealing (SA) technique has been used to analyse the problem. Further, we investigate the behaviour of SA with four different neighbouring solutions technique. The effectiveness of the algorithms is carried out on TataNld topology and implemented using MATLAB simulator.