Layer 2 Path Evaluation System Using Machine Learning
Article Sidebar
Main Article Content
Abstract
Does it seem strange that the spanning tree protocol (STP) has so far been the only layer-2 backbone defense against looping? Do we trust it? For several decades, the campus backbone has often been an unsuspected problem in STP failure. Meanwhile, MAC address flapping is probably a feasible way of solving the issue for modern network fabrics. Due to the serious issues involved with layer-2, particularly the legacy switches in the extended STP design, this work uses the notion of a software-defined network to evaluate both traditional and modern networks. Through the MAC address lookup for all bridge devices, this work proposes a Layer-2 evaluation system (LES), which uses a novel approach known as support supervised learning to create the data preparation for machine learning. Additionally, the LES enabled network allows administrators to determine their backbones. This study aims to evaluate the potential slowdown in the network caused by MAC address problems. Furthermore, it investigates the proposed method in a real network, while also covering the evaluation and performance of our proposed method.
Article Details
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.
- Creative Commons Copyright License
The journal allows readers to download and share all published articles as long as they properly cite such articles; however, they cannot change them or use them commercially. This is classified as CC BY-NC-ND for the creative commons license.
- Retention of Copyright and Publishing Rights
The journal allows the authors of the published articles to hold copyrights and publishing rights without restrictions.
References
H. B. Acharya, J. Hamilton, and N. Shenoy, “From Spanning Trees to Meshed Trees,” in 2020 International Conference on COMmunication Systems & NETworkS (COMSNETS), Jan. 2020, pp. 391–395, doi: 10.1109/COMSNETS48256.2020.9027495.
P. Ayegba, J. Ayoola, E. Asani, and A. Okeyinka, “A Comparative Study Of Minimal Spanning Tree Algorithms,” in 2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS), Mar. 2020, doi: 10.1109/ICMCECS47690.2020.240900.
P. Willis and N. Shenoy, “A Meshed Tree Protocol for Loop Avoidance in Switched Networks,” in 2019 International Conference on Computing, Networking and Communications (ICNC), Feb. 2019, pp. 303–307, doi: 10.1109/ICCNC.2019.8685664.
B. Hamid, Q. Rouland, and J. Jaskolka, “Distributed Maintenance of a Spanning Tree of k-Connected Graphs,” in 2019 IEEE 24th Pacific Rim International Symposium on Dependable Computing (PRDC), Dec. 2019, pp. 217–226, doi: 10.1109/PRDC47002.2019.00052.
J. Liu and Q. Xu, “Machine Learning in Software Defined Network,” in 2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC), Mar. 2019, pp. 1114–1120, doi: 10.1109/ITNEC.2019.8729331.
J. Wu, Y. Peng, M. Song, M. Cui, and L. Zhang, “Link Congestion Prediction using Machine Learning for Software-Defined-Network Data Plane,” in 2019 International Conference on Computer, Information and Telecommunication Systems (CITS), Aug. 2019, doi: 10.1109/CITS.2019.8862098.
A. Khan, A. A. Aesha, and J. Sarker, “A New Algorithmic Approach to Finding Minimum Spanning Tree,” in 2018 4th International Conference on Electrical Engineering and Information & Communication Technology (iCEEiCT), Sep. 2018, pp. 590–594, doi: 10.1109/CEEICT.2018.8628095.
D. Rafique and L. Velasco, “Machine Learning for Network Automation: Overview, Architecture, and Applications [Invited Tutorial],” Journal of Optical Communications and Networking, vol. 10, no. 10, pp. D126–D143, Oct. 2018, doi: 10.1364/JOCN.10.00D126.
D. Côté, “Using Machine Learning in Communication Networks [Invited],” Journal of Optical Communications and Networking, vol. 10, no. 10, pp. D100–D109, Oct. 2018, doi: 10.1364/JOCN.10.00D100.
T. Anusas-Amornkul, “A Network Root Cause Analysis and Repair System,” in 2018 6th International Symposium on Computational and Business Intelligence (ISCBI), Aug. 2018, pp. 69–73, doi: 10.1109/ISCBI.2018.00023.
Z. Yang and K. L. Yeung, “An Efficient Algorithm for Constructing Controller Trees in SDN,” in GLOBECOM 2017 - 2017 IEEE Global Communications Conference, Dec. 2017, doi: 10.1109/GLOCOM.2017.8254747.
S. Okada, T. Matsukawa, T. Tojo, S. Arai, and S. Yasukawa, “Reliability evaluation of fabric architecture as a replacement for router in carrier network,” in 2017 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN), Jun. 2017, doi: 10.1109/LANMAN.2017.7972152.
W. Hou, L. Shi, Y. Wang, F. Wang, H. Lyu, and M. St-Hilaire, “An improved SDNbased fabric for flexible data center networks,” in 2017 International Conference on Computing, Networking and Communications (ICNC), Jan. 2017, pp. 432–436, doi: 10.1109/ICCNC.2017.7876167.
P.-W. Chi, M.-H. Wang, J.-W. Guo, and C.-L. Lei, “SDN Migration: An Efficient Approach to Integrate OpenFlow Networks with STPEnabled Networks,” in 2016 International Computer Symposium (ICS), Dec. 2016, pp. 148–153, doi: 10.1109/ICS.2016.0038.
S.-Y. Wang, C.-C. Wu, and C.-L. Chou, “Constructing an optimal spanning tree over a hybrid network with SDN and legacy switches,” in 2015 IEEE Symposium on Computers and Communication (ISCC), Jul. 2015, pp. 502–507, doi: 10.1109/ISCC.2015.7405564.
S. Rai and S. Sharma, “Determining minimum spanning tree in an undirected weighted graph,” in 2015 International Conference on Advances in Computer Engineering and Applications, Mar. 2015, pp. 637–642, doi: 10.1109/ICACEA.2015.7164769.
L. Yanjun, L. Xiaobo, and Y. Osamu, “Traffic engineering framework with machine learning based meta-layer in software-defined networks,” in 2014 4th IEEE International Conference on Network Infrastructure and Digital Content, Sep. 2014, pp. 121–125, doi: 10.1109/ICNIDC.2014.7000278.
J. Li and J. Zhu, “Network Expansion Problem on the Spanning Tree in Graphs,” in 2009 WRI World Congress on Computer Science and Information Engineering, Mar. 2009, vol. 2, pp. 691–695, doi: 10.1109/CSIE.2009.336.
X. Xiao-Hua, N. Ai-Bing, and M. Liang, “A new verification algorithm for minmum spanning tree based on reduction and merge technology,” in 2009 4th International Conference on Computer Science & Education, Jul. 2009, pp. 469–473, doi: 10.1109/ICCSE.2009.5228388.
M. A. Kashem, C. S. Hasan, and A. Bhattacharjee, “An Algorithm for Solving the Minimum Vertex-Ranking Spanning Tree Problem on Series-Parallel Graphs,” in 2006 International Conference on Electrical and Computer Engineering, Dec. 2006, pp. 328–332, doi: 10.1109/ICECE.2006.355638.