About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
e-Infrastructure and e-Services for Developing Countries. 13th EAI International Conference, AFRICOMM 2021, Zanzibar, Tanzania, December 1-3, 2021, Proceedings

Research Article

Determining SDN Stability by the Analysis of Variance Technique

Download(Requires a free EAI acccount)
2 downloads
Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-031-06374-9_25,
        author={Ayotuyi T. Akinola and Matthew O. Adigun and Clementine N. Masango},
        title={Determining SDN Stability by the Analysis of Variance Technique},
        proceedings={e-Infrastructure and e-Services for Developing Countries. 13th EAI International Conference, AFRICOMM 2021, Zanzibar, Tanzania, December 1-3, 2021, Proceedings},
        proceedings_a={AFRICOMM},
        year={2022},
        month={5},
        keywords={SDN ANOVA Greedy RR Stability},
        doi={10.1007/978-3-031-06374-9_25}
    }
    
  • Ayotuyi T. Akinola
    Matthew O. Adigun
    Clementine N. Masango
    Year: 2022
    Determining SDN Stability by the Analysis of Variance Technique
    AFRICOMM
    Springer
    DOI: 10.1007/978-3-031-06374-9_25
Ayotuyi T. Akinola1,*, Matthew O. Adigun1, Clementine N. Masango1
  • 1: University of Zululand
*Contact email: ruthertosin@gmail.com

Abstract

Over the past years, many algorithms have been proposed for task scheduling and congestion control in typical Networks, such as Round-Robbin, Greedy, and many others. Whilst these algorithms are very effective in their capacities to address the targeted problems yet to compare their performance concerning the level of stability they offered in respective network systems has been a gap in the research environment that needs to be addressed. Proper scheduling mechanism along with reliable algorithms does not often guarantee a stable network else, this article is proposing a very simple but popular technique known in the statistical world as Analysis of Variance (ANOVA) as a tool for relatively determining the level of stability based on the data that are generated from the network. An OMNET++ simulator was used to conduct the simulation of the network environment and the SDN toolkits called INET framework was installed on top of it to enable the deployment of both Greedy and Round-Robbin scheduling algorithms to run. The simple analysis from the ANOVA was able to determine the level of stability between the two samples of algorithms used in these experiments. The performance evaluation while determining the response time from each experimental setup discovered that assuredly ANOVA analysis is capable of determining network stability level as well as proof that the Greedy scheduling algorithm performs better in terms of stability level than Round Robin (RR).

Keywords
SDN ANOVA Greedy RR Stability
Published
2022-05-26
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-031-06374-9_25
Copyright © 2021–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL