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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
He, K., Rozner, E., Agarwal, K., Felter, W., Carter, J., Akella, A.: Presto: edge-based load balancing for fast datacenter networks. ACM SIGCOMM Comput. Commun. Rev. 45, 465–478 (2015)
Alizadeh, M., et al.: CONGA: distributed congestion-aware load balancing for datacenters. In: ACM conference on SIGCOMM, pp. 503–514 (2014)
Cheocherngngarn, T., Jin, H., Andrian, J., Pan, D., Liu, J.: Depth-first worst-fit search based multipath routing for data center networks. In: 2012 IEEE Global Communications Conference (GLOBECOM), pp. 2821–2826 (2012)
Akinola, A.T., Adigun, M.O., Mudali, P.: Incorporating stability estimation into quality of service routing in an SDN-based data centre network. In: Yang, X.S., Sherratt, S., Dey, N., Joshi, A. (eds.) Proceedings of Fifth International Congress on Information and Communication Technology. Advances in Intelligent Systems and Computing, vol. 1184, pp. 406–416. Springer, Singapore (2021). https://doi.org/10.1007/978-981-15-5859-7_40
Greenberg, A., et al.: VL2: a scalable and flexible data center network. Commun. ACM 3(54), 95–104 (2011)
Zhang, J., Yu, F., Wang, S., Huang, T., Liu, Z., Liu, Y.: Load balancing in data center networks: a survey. IEEE Commun. Surv. Tutor. 3(20), 2324–2352 (2018)
Dixit, A., Prakash, P., Kompella, R.: On the efficacy of fine-grained traffic splitting protocolsin data center networks. ACM SIGCOMM Comput. Commun. Rev. 4(41), 430–431 (2011)
Hopps, C.: Analysis of an equal-cost multi-path algorithm, RFC 2992, November 2000
Liu, J., Li, J., Shou, G., Hu, Y., Guo, Z., Dai, W.: SDN based load balancing mechanism for elephant flow in data center networks. In: 2014 International Symposium on Wireless Personal Multimedia Communications, pp. 486–490 (2014)
Zakia, U., Yedder, H.: Dynamic load balancing in SDN-based data center networks. In: 8th IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON), pp. 242–247 (2017)
Yu, Y., Qian, C.: A fault-tolerant server-centric data center network. In: 2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS), pp. 1–2. IEEE (2016)
Qian, Z., Fan, F., Hu, B., Yeung, K., Li, L.: Global round robin: efficient routing with cut-through switching in fat-tree data center networks. IEEE/ACM Trans. Netw. 5(26), 2230–2241 (2018)
Cao, J., et al.: Per-packet load-balanced, low-latency routing for clos-based data center networks. In: Ninth ACM Conference on Emerging Networking Experiments and Technologies, pp. 49–60 (2013)
Dong, Z., Liu, N., Rojas-Cessa, R.: Greedy scheduling of tasks with time constraints for energy-efficient cloud-computing data centers. J. Cloud Comput. 4(1), 1–14 (2015). https://doi.org/10.1186/s13677-015-0031-y
Shang, Y., Li, D., Xu, M.: A comparison study of energy proportionality of data centre network architectures. In: 32nd International Conference on Distributed Computing Systems Workshops, pp. 1–7. IEEE (2012)
Xu, M., Shang, Y., Li, D., Wang, X.: Greening data center networks with throughput-guaranteed power-aware routing. Comput. Netw. 57(15), 2880–2899 (2013)
Srikanth, A., Varalakshmi, P., Somasundaram, V., Ravichandiran, P.: Congestion control mechanism in software defined networking by traffic rerouting. In: Second International Conference on Computing Methodologies and Communication (ICCMC), pp. 55–58. IEEE (2018)
Al-Howaide, A., Khaleel, M., Salhieh, A.: Updatable queue protocol based on TCP for virtual reality environment. in arXiv preprint: http://arxiv.org/abs/1111.1628 (2011)
Acknowledgment
The authors acknowledge the funds received from the industry partners: Telkom SA Ltd, South Africa in support of this research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Akinola, A.T., Adigun, M.O., Masango, C.N. (2022). Determining SDN Stability by the Analysis of Variance Technique. In: Sheikh, Y.H., Rai, I.A., Bakar, A.D. (eds) e-Infrastructure and e-Services for Developing Countries. AFRICOMM 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 443. Springer, Cham. https://doi.org/10.1007/978-3-031-06374-9_25
Download citation
DOI: https://doi.org/10.1007/978-3-031-06374-9_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-06373-2
Online ISBN: 978-3-031-06374-9
eBook Packages: Computer ScienceComputer Science (R0)