YGYanmin Guo

Yanmin Guo

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yanmin Guo has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Otsu Multi-Threshold Image Segmentation Based on Adaptive Double-Mutation Differential Evolution

    by Yanmin Guo, Yu Wang, Kai Meng, Zongna Zhu

    A quick and effective way of segmenting images is the Otsu threshold method. However, the complexity of time grows exponentially as the number of thresolds rises. The aim of this study is to address the issues with the standard threshold image segmentation method’s low segmentation effect and high time complexity. The two mutations differential evolution based on adaptive control parameters is presented, and the twofold mutation approach and adaptive control parameter search mechanism are used. Superior double-mutation differential evolution views Otsu threshold picture segmentation as an optimization issue, uses the maximum interclass variance technique as the objective function, determines the ideal threshold, and then implements multi-threshold image segmentation. The experimental findings demonstrate the robustness of the enhanced double-mutation differential evolution with adaptive control parameters. Compared to other benchmark algorithms, our algorithm excels in both image segmentation accuracy and time complexity, offering superior performance.


  • Open Access

    Traffic Management in IoT Backbone Networks Using GNN and MAB with SDN Orchestration

    by Yanmin Guo, Yu Wang, Faheem Khan, Abdullah A. Al-Atawi, Abdulwahid Al Abdulwahid, Youngmoon Lee, Bhaskar Marapelli

    Traffic management is a critical task in software-defined IoT networks (SDN-IoTs) to efficiently manage network resources and ensure Quality of Service (QoS) for end-users. However, traditional traffic management approaches based on queuing theory or static policies may not be effective due to the dynamic and unpredictable nature of network traffic. In this paper, we propose a novel approach that leverages Graph Neural Networks (GNNs) and multi-arm bandit algorithms to dynamically optimize traffic management policies based on real-time network traffic patterns. Specifically, our approach uses a GNN model to learn and predict network traffic patterns and a multi-arm bandit algorithm to optimize traffic management policies based on these predictions. We evaluate the proposed approach on three different datasets, including a simulated corporate network (KDD Cup 1999), a collection of network traffic traces (CAIDA), and a simulated network environment with both normal and malicious traffic (NSL-KDD). The results demonstrate that our approach outperforms other state-of-the-art traffic management methods, achieving higher throughput, lower packet loss, and lower delay, while effectively detecting anomalous traffic patterns. The proposed approach offers a promising solution to traffic management in SDNs, enabling efficient resource management and QoS assurance.


  • Open Access

    Traffic Shaping in IoT Networks using GNN and MAB with SDN Orchestration

    by Yanmin Guo, Yu Wang, Faheem Khan, Abdullah Al-Atawi, Abdulwahid Abdulwahid, Youngmoon Lee, Bhaskar Marapelli

    Traffic shaping is a critical task in software-defined -IoT networks (SDN-IoTs) to efficiently manage network resources and ensure Quality of Service (QoS) for end-users. However, traditional traffic shaping approaches based on queuing theory or static policies may not be effective due to the dynamic and unpredictable nature of network traffic. In this paper, we propose a novel approach that leverages Graph Neural Networks (GNNs) and Multi-arm Bandit algorithms to dynamically optimize traffic shaping policies based on real-time network traffic patterns. Specifically, our approach uses a GNN model to learn and predict network traffic patterns and a Multi-arm Bandit algorithm to optimize traffic shaping policies based on these predictions. We evaluate the proposed approach on three different datasets, including a simulated corporate network (KDD Cup 1999), a collection of network traffic traces (CAIDA), and a simulated network environment with both normal and malicious traffic (NSL-KDD). The results demonstrate that our approach outperforms other state-of-the-art traffic shaping methods, achieving higher throughput, lower packet loss, and lower delay, while effectively detecting anomalous traffic patterns. The proposed approach offers a promising solution to traffic shaping in SDNs, enabling efficient resource management and QoS assurance