<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    jst
   </journal-id>
   <journal-title-group>
    <journal-title>
     Journal of Sensor Technology
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2161-122X
   </issn>
   <issn publication-format="print">
    2161-1238
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/jst.2025.152003
   </article-id>
   <article-id pub-id-type="publisher-id">
    jst-143409
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Computer Science 
     </subject>
     <subject>
       Communications
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Implementation of a New SDN-Expert Architecture for Reducing Energy Consumption in SDNs
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Lagasane Ouattara
      </surname>
      <given-names>
       Kra
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Ahoua Cyrille
      </surname>
      <given-names>
       Aka
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Nabongo
      </surname>
      <given-names>
       Diabaté
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Olivier
      </surname>
      <given-names>
       Asseu
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aDepartment of Mathematical Computer Science, Alassane Ouattara University, Bouaké, Côte d’Ivoire
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aÉcole Supérieur Africaine des TIC, Abidjan, Côte d’Ivoire
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     20
    </day> 
    <month>
     06
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    15
   </volume> 
   <issue>
    02
   </issue>
   <fpage>
    27
   </fpage>
   <lpage>
    35
   </lpage>
   <history>
    <date date-type="received">
     <day>
      4,
     </day>
     <month>
      March
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      17,
     </day>
     <month>
      March
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      17,
     </day>
     <month>
      June
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Reducing energy consumption in smart networks such as the Internet of Things (IoT), 5G and software-defined networks (SDN) is a major challenge. With the exponential increase in connected devices, network and energy resources are under severe strain. This paper proposes an innovative architecture, named SDN-Expert, integrating an expert system based on artificial intelligence (AI) with a hybrid inference engine combining decision trees and neural networks. This approach dynamically optimizes energy consumption by turning off unused router ports while maintaining optimal Quality of Service (QoS). Extended simulations performed on realistic large-scale network topologies using real-world traffic data (CAIDA datasets) demonstrate substantial energy savings (up to 32% improvement) and clearly illustrate the practicality and competitiveness of our solution compared to existing energy-efficient techniques in SDNs. Finally, we discuss potential applications of the proposed architecture to wireless sensor networks, highlighting its broader applicability and environmental impact.
   </abstract>
   <kwd-group> 
    <kwd>
     SDN
    </kwd> 
    <kwd>
      SDN-Expert Architecture
    </kwd> 
    <kwd>
      Reducing Energy
    </kwd> 
    <kwd>
      Energy Consumption
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>With the rise of technological paradigms such as the Internet of Things (IoT), 5G and software-defined networking (SDN), the energy consumption of network equipment has become a major concern for operators and researchers. These infrastructures, essential for meeting growing connectivity needs, lead to a significant increase in energy resource consumption. In particular, network equipment such as routers and switches consume energy not only for their main functions but also for cooling systems, accounting for up to 38% of total consumption <xref ref-type="bibr" rid="scirp.143409-1">
     [1]
    </xref> <xref ref-type="bibr" rid="scirp.143409-2">
     [2]
    </xref>.</p>
   <p>Several recent studies have focused on energy optimization in SDN, proposing various techniques ranging from dynamic network resource management to the use of adaptive and intelligent algorithms <xref ref-type="bibr" rid="scirp.143409-3">
     [3]
    </xref> <xref ref-type="bibr" rid="scirp.143409-4">
     [4]
    </xref>. However, these approaches often exhibit limitations regarding adaptability, scalability, and real-time management of variable network traffic.</p>
   <p>To overcome these limitations, we propose an innovative architecture named SDN-Expert, which is distinguished by integrating an expert system based on artificial intelligence (AI). Specifically, this architecture employs a hybrid inference engine combining decision trees and neural networks, providing optimized adaptive decision-making in real-time. The primary contribution of our work lies in the development of an original mathematical optimization model integrated with intelligent inference techniques. Furthermore, the validation now includes extended simulations performed on realistic large-scale topologies, incorporating real-world traffic traces, thereby demonstrating more rigorously the performance and practicality of our proposed architecture compared to existing solutions.</p>
   <p>Finally, we discuss potential applications of SDN-Expert in sensor networks, highlighting how this architecture can effectively interact with such environments to reduce their global energy footprint further.</p>
  </sec><sec id="s2">
   <title>2. State of Art</title>
   <p>Software-defined networks (SDN) are characterized by a clear separation between the control plane and the data plane, offering great flexibility in network management. Numerous studies have explored the potential for energy optimization in this context:</p>
   <p>Paramasivam &amp; Velusamy (2023) proposed a quality of service (QoS)-oriented approach in SDN-based video streaming, focusing mainly on latency and jitter metrics without explicitly addressing energy management considerations <xref ref-type="bibr" rid="scirp.143409-5">
     [5]
    </xref>.</p>
   <p>Qi et al. (2019) developed a differentiated routing algorithm for flying ad hoc sensor networks (FANET), partially considering energy management, though their approach was limited to specific topologies and static scenarios, lacking adaptive real-time energy optimization <xref ref-type="bibr" rid="scirp.143409-3">
     [3]
    </xref>.</p>
   <p>Fogli et al. (2022) studied SDN architectures in wireless ad hoc network scenarios, highlighting opportunities and limitations related to QoS management but not explicitly including dynamic energy optimization strategies <xref ref-type="bibr" rid="scirp.143409-6">
     [6]
    </xref>.</p>
   <p>Lui et al. (2022) proposed an energy-efficient optimization model for SDN management using machine learning techniques. However, this model lacks comprehensive real-time adaptive decision-making capabilities for rapid variations in network traffic <xref ref-type="bibr" rid="scirp.143409-7">
     [7]
    </xref>.</p>
   <p>Hussein et al. (2024) conducted an exhaustive review of SDN routing protocols for vehicular ad hoc networks (VANET), considering energy constraints and QoS aspects, but their adaptability to real-time traffic fluctuations remains limited <xref ref-type="bibr" rid="scirp.143409-8">
     [8]
    </xref>.</p>
   <p>Despite these contributions, existing approaches often demonstrate limitations regarding dynamic adaptability, scalability, and responsiveness to rapid variations in network traffic conditions. To overcome these limitations, our work proposes the innovative SDN-Expert architecture, which integrates an AI-based inference engine combining decision trees and neural networks, allowing optimized adaptive decision-making. Additionally, we have extended our validation to large-scale, realistic network topologies, incorporating real-world traffic traces to rigorously evaluate the practical efficiency and competitiveness of our proposed solution.</p>
  </sec><sec id="s3">
   <title>3. Proposed Model</title>
   <sec id="s3_1">
    <title>3.1. SDN-Expert Architecture</title>
    <p>The proposed SDN-Expert architecture (<xref ref-type="fig" rid="fig1">
      Figure 1
     </xref>) consists of three distinct and complementary layers:</p>
    <p>1. Application layer</p>
    <p>Interacts directly with users, capturing specific expectations and requirements related to network performance and energy management.</p>
    <p>2. Control layer</p>
    <p>This layer forms the core of our innovative approach, integrating an artificial intelligence-based expert system. It comprises a hybrid inference engine, explicitly combining decision trees and neural networks, along with a rule base and a fact base to ensure optimized adaptive decision-making in real time.</p>
    <p>3. Infrastructure layer</p>
    <p>Includes physical network equipment (routers, switches) executing the adaptive decisions made by the Control layer, such as dynamic activation and deactivation of router ports based on real-time network conditions.</p>
    <fig id="fig1" position="float">
     <label>Figure 1</label>
     <caption>
      <title>Figure 1. SDN-Expert architecture.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/4200303-rId17.jpeg?20250620105113" />
    </fig>
    <p>The significant improvement introduced by our model is the explicit integration of hybrid artificial intelligence techniques (decision trees and neural networks), which ensures greater adaptability and responsiveness compared to traditional, non-adaptive methods.</p>
   </sec>
   <sec id="s3_2">
    <title>3.2. Mathematical Modeling</title>
    <p>The problem is formulated as an integer linear optimization problem (ILP). Our formulation improves upon standard ILP models by explicitly incorporating adaptive decision-making mechanisms through AI-based inference, particularly using decision trees for quick decision paths and neural networks for predictive capabilities, thus enhancing responsiveness to rapid changes in traffic conditions.</p>
    <p>The objective is to minimize total energy consumption by dynamically switching off unused router ports, while strictly adhering to Quality of Service (QoS) constraints:</p>
    <p>Objective function:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         M 
       </mi> 
       <mi>
         i 
       </mi> 
       <mi>
         n 
       </mi> 
       <munder> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mi>
          i 
        </mi> 
       </munder> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         − 
       </mo> 
       <msub> 
        <mi>
          g 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> (1)</p>
    <p>Subject to the following constraints:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          L 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ≤ 
       </mo> 
       <msub> 
        <mi>
          L 
        </mi> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           x 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> (2)</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <munder> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           ϵ 
         </mi> 
         <mi>
           N 
         </mi> 
        </mrow> 
       </munder> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ≥ 
       </mo> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> (3)</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <munder> 
        <mstyle mathsize="140%" displaystyle="true"> 
         <mo>
           ∑ 
         </mo> 
        </mstyle> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mi>
           ϵ 
         </mi> 
         <mi>
           F 
         </mi> 
        </mrow> 
       </munder> 
       <msub> 
        <mi>
          B 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ≥ 
       </mo> 
       <msub> 
        <mi>
          B 
        </mi> 
        <mrow> 
         <mi>
           r 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           q 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> (4)</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           t 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         ≤ 
       </mo> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mrow> 
         <mi>
           b 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           d 
         </mi> 
         <mi>
           g 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           t 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> (5)</p>
    <p>Where:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          C 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>: total consumption of the router 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        i 
      </mi> 
     </math> at time 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        t 
      </mi> 
     </math>.</p>
    <p>
     <xref ref-type="bibr" rid="scirp.143409-"></xref> 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          g 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>: Save energy by disabling unused ports <xref ref-type="bibr" rid="scirp.143409-7">
      [7]
     </xref>.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          L 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo> 
       </mo> 
      </mrow> 
     </math>: router latency 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        i 
      </mi> 
     </math> at time 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        t 
      </mi> 
     </math>.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          L 
        </mi> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mi>
           a 
         </mi> 
         <mi>
           x 
         </mi> 
        </mrow> 
       </msub> 
       <mo> 
       </mo> 
      </mrow> 
     </math>: maximum acceptable latency threshold.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>: number of active ports on the router at the moment 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        t 
      </mi> 
     </math>.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mi>
           m 
         </mi> 
         <mi>
           i 
         </mi> 
         <mi>
           n 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>: minimum number of active ports to guarantee connectivity.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          B 
        </mi> 
        <mi>
          i 
        </mi> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>: available bandwidth for critical flows.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          B 
        </mi> 
        <mrow> 
         <mi>
           r 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           q 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>: minimum bandwidth required to guarantee quality of service for critical flows.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mi>
           o 
         </mi> 
         <mi>
           t 
         </mi> 
        </mrow> 
       </msub> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          t 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>: total energy consumption of the network at time 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        t 
      </mi> 
     </math>.</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          E 
        </mi> 
        <mrow> 
         <mi>
           b 
         </mi> 
         <mi>
           u 
         </mi> 
         <mi>
           d 
         </mi> 
         <mi>
           g 
         </mi> 
         <mi>
           e 
         </mi> 
         <mi>
           t 
         </mi> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>: maximum energy consumption limit.</p>
    <p>These constraints ensure that the solution optimizes energy consumption while maintaining network performance at acceptable levels.</p>
    <p>These constraints collectively ensure that the SDN-Expert solution effectively balances energy optimization with maintaining optimal network performance, thus clearly improving upon existing approaches.</p>
   </sec>
   <sec id="s3_3">
    <title>3.3. SDN-Expert Algorithm</title>
    <p>The following algorithm follows directly from the proposed model:</p>
    <p>Algorithm 1. SDN-Expert algorithm.</p>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td custom-top-td acenter" width="7.61%"><p style="text-align:center">1.</p></td> 
      <td class="custom-bottom-td custom-top-td acenter" width="92.39%"><p style="text-align:center">Start</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="7.61%"><p style="text-align:center">2.</p></td> 
      <td class="custom-top-td acenter" width="92.39%"><p style="text-align:center">Collect network data // Gather real-time information about the network.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">3.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Network state (latency, bandwidth, energy)</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">4.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Active routers and ports</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">5.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Identify inactive ports // Detect network ports that are currently not in use.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">6.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Calculate energy gain 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             G 
           </mi> 
           <mi>
             p 
           </mi> 
          </msub> 
         </mrow> 
        </math></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">7.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Sort candidate ports by 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             G 
           </mi> 
           <mi>
             p 
           </mi> 
          </msub> 
         </mrow> 
        </math> // Rank the ports based on their energy-saving potential.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">8.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Select ports to deactivate // Choose ports to disable while ensuring network stability.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">9.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Under QoS and energy constraints</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">10.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Check latency constraint // Verify that latency remains within the acceptable threshold.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">11.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <mo> 
          </mo> 
          <msub> 
           <mi>
             L 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ≤ 
          </mo> 
          <msub> 
           <mi>
             L 
           </mi> 
           <mrow> 
            <mi>
              m 
            </mi> 
            <mi>
              a 
            </mi> 
            <mi>
              x 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">12.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Check active ports constraint // Ensure a minimum number of active ports is maintained.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">13.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ≥ 
          </mo> 
          <msub> 
           <mi>
             P 
           </mi> 
           <mrow> 
            <mi>
              m 
            </mi> 
            <mi>
              i 
            </mi> 
            <mi>
              n 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">14.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Check bandwidth constraint // Validate that sufficient bandwidth is available.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">15.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             B 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ≥ 
          </mo> 
          <msub> 
           <mi>
             B 
           </mi> 
           <mrow> 
            <mi>
              r 
            </mi> 
            <mi>
              e 
            </mi> 
            <mi>
              q 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">16.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Check energy consumption constraint // Ensure total network energy use does not exceed the limit.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">17.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
          <msub> 
           <mi>
             E 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              o 
            </mi> 
            <mi>
              t 
            </mi> 
           </mrow> 
          </msub> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mi>
             t 
           </mi> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mo>
            ≤ 
          </mo> 
          <msub> 
           <mi>
             E 
           </mi> 
           <mrow> 
            <mi>
              b 
            </mi> 
            <mi>
              u 
            </mi> 
            <mi>
              d 
            </mi> 
            <mi>
              g 
            </mi> 
            <mi>
              e 
            </mi> 
            <mi>
              t 
            </mi> 
           </mrow> 
          </msub> 
         </mrow> 
        </math></p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">18.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Apply modifications // Implement the changes to the network.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">19.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Update SDN configuration</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">20.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">Update parameters and validate // Adjust system parameters and confirm that all constraints are met.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.61%"><p style="text-align:center">21.</p></td> 
      <td class="acenter" width="92.39%"><p style="text-align:center">End</p></td> 
     </tr> 
    </table>
   </sec>
  </sec><sec id="s4">
   <title>4. Results and Discussion</title>
   <sec id="s4_1">
    <title>4.1. Simulation Environment</title>
    <p>To comprehensively assess the performance of the proposed SDN-Expert architecture, we conducted extensive simulations on a realistic network topology consisting of 50 nodes, utilizing real-world traffic traces from the CAIDA dataset. The results obtained were compared to existing methods: Paramasivam &amp; Velusamy (2023), Qi et al. (2019), and Hussein et al. (2024). Performance was analyzed based on three critical criteria: energy savings, average latency, and packet loss rate.</p>
   </sec>
   <sec id="s4_2">
    <title>4.2. Energy Savings</title>
    <p>The simulation results clearly illustrate that the SDN-Expert approach achieves a significant energy saving of 32%, compared to 18% for Paramasivam (2023), 12% for Qi (2019), and 20% for Hussein (2024), as shown in <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>.</p>
    <fig id="fig2" position="float">
     <label>Figure 2</label>
     <caption>
      <title>Figure 2. Energy saving comparison.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/4200303-rId71.jpeg?20250620105113" />
    </fig>
    <p>This substantial improvement primarily stems from integrating a hybrid inference engine that combines decision trees and neural networks, enabling optimized real-time adaptive management of network resources.</p>
   </sec>
   <sec id="s4_3">
    <title>4.3. Average Lantency</title>
    <p>Regarding latency, our results show that SDN-Expert achieves a notably lower average latency (40 ms), clearly outperforming existing methods (55 ms for Paramasivam, 65 ms for Qi, and 50 ms for Hussein), as illustrated in <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>.</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. Average latency comparison.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/4200303-rId72.jpeg?20250620105113" />
    </fig>
    <p>This improvement is attributed to the AI-based inference engine, which dynamically optimizes network paths by proactively predicting traffic variations and avoiding congestion areas.</p>
   </sec>
   <sec id="s4_4">
    <title>4.4. Packet Loss Rates</title>
    <p>The related <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref> demonstrates that our model significantly reduces the packet loss rate to only 1%, compared to 3% for Paramasivam, 5% for Qi, and 2.5% for Hussein.</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Packet loss rate comparison.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/4200303-rId73.jpeg?20250620105113" />
    </fig>
    <p>This notable improvement results from predictive mechanisms provided by the neural network and dynamic decision-making facilitated by decision trees, allowing the network to proactively prevent congestion in real time.</p>
    <table-wrap id="table1">
     <label>
      <xref ref-type="table" rid="table1">
       Table 1
      </xref></label>
     <caption>
      <title>
       <xref ref-type="bibr" rid="scirp.143409-"></xref>Table 1. Comparative analysis of the SDN-Expert approach for energy optimization and quality of service (QoS).</title>
     </caption>
     <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
      <tr> 
       <td class="custom-bottom-td acenter" width="34.62%"><p style="text-align:center">Evaluated Criteria</p></td> 
       <td class="custom-bottom-td acenter" width="24.62%"><p style="text-align:center">SDN-Expert (Proposed)</p></td> 
       <td class="custom-bottom-td acenter" width="21.12%"><p style="text-align:center">Paramasivam (2023)</p></td> 
       <td class="custom-bottom-td acenter" width="12.78%"><p style="text-align:center">Qi (2019)</p></td> 
       <td class="custom-bottom-td acenter" width="14.53%"><p style="text-align:center">Hussein (2024)</p></td> 
      </tr> 
      <tr> 
       <td class="custom-top-td acenter" width="34.62%"><p style="text-align:center">Energy Savings (%)</p></td> 
       <td class="custom-top-td acenter" width="24.62%"><p style="text-align:center">32%</p></td> 
       <td class="custom-top-td acenter" width="21.12%"><p style="text-align:center">18%</p></td> 
       <td class="custom-top-td acenter" width="12.78%"><p style="text-align:center">12%</p></td> 
       <td class="custom-top-td acenter" width="14.53%"><p style="text-align:center">20%</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="34.62%"><p style="text-align:center">Average Latency (ms)</p></td> 
       <td class="acenter" width="24.62%"><p style="text-align:center">40 ms</p></td> 
       <td class="acenter" width="21.12%"><p style="text-align:center">55 ms</p></td> 
       <td class="acenter" width="12.78%"><p style="text-align:center">65 ms</p></td> 
       <td class="acenter" width="14.53%"><p style="text-align:center">50 ms</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="34.62%"><p style="text-align:center">Packet Loss Rate (%)</p></td> 
       <td class="acenter" width="24.62%"><p style="text-align:center">1%</p></td> 
       <td class="acenter" width="21.12%"><p style="text-align:center">3%</p></td> 
       <td class="acenter" width="12.78%"><p style="text-align:center">5%</p></td> 
       <td class="acenter" width="14.53%"><p style="text-align:center">2.5 %</p></td> 
      </tr> 
      <tr> 
       <td class="acenter" width="34.62%"><p style="text-align:center">Dynamic Adaptability</p></td> 
       <td class="acenter" width="24.62%"><p style="text-align:center">High (Hybrid AI)</p></td> 
       <td class="acenter" width="21.12%"><p style="text-align:center">Low</p></td> 
       <td class="acenter" width="12.78%"><p style="text-align:center">Limited</p></td> 
       <td class="acenter" width="14.53%"><p style="text-align:center">Moderate</p></td> 
      </tr> 
     </table>
    </table-wrap>
    <p>This comprehensive comparative analysis clearly demonstrates that the SDN-Expert approach significantly improves SDN network performance regarding energy optimization and Quality of Service (QoS), ensuring high adaptability to real-time variations in network traffic. The explicit integration of decision trees and neural networks grants our model enhanced responsiveness to rapid changes in actual network conditions. As shown in <xref ref-type="table" rid="table1">
      Table 1
     </xref>, the SDN-Expert approach significantly improves SDN network performance in terms of energy optimization and QoS.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Conclusions and Future Work</title>
   <p>This paper introduces SDN-Expert, an innovative architecture designed to dynamically optimize energy consumption in Software-Defined Networks (SDN), while ensuring optimal Quality of Service (QoS). Simulation results clearly demonstrate the efficiency of our proposed solution. In particular, extended simulations performed on large-scale, realistic network topologies incorporating real-world traffic traces confirm the substantial improvements achieved by SDN-Expert in terms of energy savings (up to 32%), average latency (40 ms), and packet loss rate (1%), thereby significantly outperforming existing techniques.</p>
   <p>The improvements result primarily from our explicit integration of a hybrid inference engine, combining decision trees and neural networks, enabling adaptive real-time decision-making to proactively manage network resources and respond efficiently to rapid variations in network traffic.</p>
   <p>Considering the promising results obtained, future work will include:</p>
   <p>1) Extending validations further to cover diverse real-life network scenarios, including large-scale deployments with complex topologies and hardware-specific constraints.</p>
   <p>2) Integrating robust security mechanisms to strengthen the proposed solution against potential vulnerabilities targeting the control and data planes.</p>
   <p>3) Developing advanced deep learning-based models to further improve adaptive decision-making, especially under highly dynamic network conditions.</p>
   <p>4) Exploring the application of SDN-Expert architecture specifically to wireless sensor networks (WSNs), with the objective of reducing energy consumption and prolonging network lifetime, while also evaluating environmental impacts and reducing the carbon footprint of connected systems.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.143409-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kreutz, D., Ramos, F.M.V., Esteves Verissimo, P., Esteve Rothenberg, C., Azodolmolky, S. and Uhlig, S. (2015) Software-Defined Networking: A Comprehensive Survey. Proceedings of the IEEE, 103, 14-76. &gt;https://doi.org/10.1109/jproc.2014.2371999
    </mixed-citation>
   </ref>
   <ref id="scirp.143409-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jin, X., et al. (2017) Joint Optimization of Bandwidth and Spectrum Allocation in SDN-Based Elastic Optical Networks with Time-Varying Traffic. Journal of Lightwave Technology, 35, 1890-1900.
    </mixed-citation>
   </ref>
   <ref id="scirp.143409-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Qi, W., et al. (2019) A Traffic-Differentiated Routing Algorithm in Flying Ad Hoc Sensor Networks with SDN. Sensors, 19, Article 2135.
    </mixed-citation>
   </ref>
   <ref id="scirp.143409-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Abdelhafidh, M., Charef, N., Mnaouer, A.B. and Fourati, L.C. (2022) Software-Defined Networking for Flying Ad-Hoc Network Security: A Survey. 2022 2nd International Conference of Smart Systems and Emerging Technologies (SMARTTECH), Riyadh, 9-11 May 2022, 232-237. &gt;https://doi.org/10.1109/smarttech54121.2022.00057
    </mixed-citation>
   </ref>
   <ref id="scirp.143409-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tahi, N., Soro, E., Brou, P. and Asseu, O. (2024) Optimising Energy Consumption in SD-DCN Networks (Software Defined-Data Center Network). Open Journal of Applied Sciences, 14, 2223-2235. &gt;https://doi.org/10.4236/ojapps.2024.148149
    </mixed-citation>
   </ref>
   <ref id="scirp.143409-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Fogli, M., Giannelli, C. and Stefanelli, C. (2022) Software-Defined Networking in Wireless Ad Hoc Scenarios: Objectives and Control Architectures. Journal of Network and Computer Applications, 203, Article 103387. &gt;https://doi.org/10.1016/j.jnca.2022.103387
    </mixed-citation>
   </ref>
   <ref id="scirp.143409-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, X., Bi, J. and Chen, H.H. (2022) Energy-Efficient Software-Defined Networking for Sustainable Network Management. Computer Networks, 206, Article 108752. 
    </mixed-citation>
   </ref>
   <ref id="scirp.143409-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hussein, N.H., Koh, S.P., Yaw, C.T., Tiong, S.K., Benedict, F., Yusaf, T., et al. (2024) SDN-Based VANET Routing: A Comprehensive Survey on Architectures, Protocols, Analysis, and Future Challenges. IEEE Access, 12, 1432-1468. &gt;https://doi.org/10.1109/access.2024.3355313
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>