Hyppää sisältöön
    • Suomeksi
    • In English
Trepo
  • Suomeksi
  • In English
  • Kirjaudu
Näytä viite 
  •   Etusivu
  • Trepo
  • TUNICRIS-julkaisut
  • Näytä viite
  •   Etusivu
  • Trepo
  • TUNICRIS-julkaisut
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

Chaotic salp swarm algorithm for SDN multi-controller networks

Ateya, Abdelhamied A.; Muthanna, Ammar; Vybornova, Anastasia; Algarni, Abeer D.; Abuarqoub, Abdelrahman; Koucheryavy, Y.; Koucheryavy, Andrey (2019-08)

 
Avaa tiedosto
Chaotic_salp_swarm_algorithm_2019.pdf (1.600Mt)
Lataukset: 



Ateya, Abdelhamied A.
Muthanna, Ammar
Vybornova, Anastasia
Algarni, Abeer D.
Abuarqoub, Abdelrahman
Koucheryavy, Y.
Koucheryavy, Andrey
08 / 2019

Engineering Science and Technology, an International Journal
doi:10.1016/j.jestch.2018.12.015
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:tuni-202003042514

Kuvaus

Peer reviewed
Tiivistelmä
Software-defined networking (SDN) is a novel network paradigm that enables flexible management for networks. However, with the increase in network capacity, a single controller of SDN has many limitations on both performance and scalability. Distributed multi-controller deployment is a promising method to satisfy fault tolerant and scalability. There are still open research issues related to controllers placement, and the optimal number of deployed controllers. In this paper, a dynamic optimization algorithm that is based on the Salp Swarm Optimization Algorithm (SSOA) is developed with the introduction of chaotic maps for enhancing the optimizer’s performance. The algorithm dynamically evaluates the optimum number of controllers and the optimal connections between switches and controllers in large scale SDN networks. In order to evaluate the proposed algorithm, several experiments were conducted and implemented in various scenarios. Moreover, the algorithm was compared to the linear and meta-heuristic algorithms. Simulation results show that the proposed algorithm outperforms meta-heuristic algorithms and a game theory based algorithm in terms of execution time and reliability.
Kokoelmat
  • TUNICRIS-julkaisut [25310]
Kalevantie 5
PL 617
33014 Tampereen yliopisto
oa[@]tuni.fi | Tietosuoja | Saavutettavuusseloste
 

 

Selaa kokoelmaa

TekijätNimekkeetTiedekunta (2019 -)Tiedekunta (- 2018)Tutkinto-ohjelmat ja opintosuunnatAvainsanatJulkaisuajatKokoelmat

Omat tiedot

Kirjaudu sisäänRekisteröidy
Kalevantie 5
PL 617
33014 Tampereen yliopisto
oa[@]tuni.fi | Tietosuoja | Saavutettavuusseloste