<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMES</journal-id>
<journal-id journal-id-type="nlm-ta">CMES</journal-id>
<journal-id journal-id-type="publisher-id">CMES</journal-id>
<journal-title-group>
<journal-title>Computer Modeling in Engineering &#x0026; Sciences</journal-title>
</journal-title-group>
<issn pub-type="epub">1526-1506</issn>
<issn pub-type="ppub">1526-1492</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">53903</article-id>
<article-id pub-id-type="doi">10.32604/cmes.2024.053903</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Examining the Quality Metrics of a Communication Network with Distributed Software-Defined Networking Architecture</article-title>
<alt-title alt-title-type="left-running-head">Examining the Quality Metrics of a Communication Network with Distributed Software-Defined Networking Architecture</alt-title>
<alt-title alt-title-type="right-running-head">Examining the Quality Metrics of a Communication Network with Distributed Software-Defined Networking Architecture</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Mehmood</surname><given-names>Khawaja Tahir</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref><email>ktahir@bzu.edu.pk</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Atiq</surname><given-names>Shahid</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Sajjad</surname><given-names>Intisar Ali</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Hussain</surname><given-names>Muhammad Majid</given-names></name><xref ref-type="aff" rid="aff-4">4</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Basit</surname><given-names>Malik M. Abdul</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Electrical Engineering, Khwaja Fareed University of Engineering and Information Technology</institution>, <addr-line>Rahim Yar Khan, 64200</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Telecommunication Systems, Bahauddin Zakariya University</institution>, <addr-line>Multan, 60000</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Electrical Engineering, University of Engineering and Technology</institution>, <addr-line>Taxila, 47050</addr-line>, <country>Pakistan</country></aff>
<aff id="aff-4"><label>4</label><institution>School of Engineering and Physical Sciences, Heriot-Watt University</institution>, <addr-line>Edinburgh, EH14 4AS</addr-line>, <country>UK</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Khawaja Tahir Mehmood. Email: <email>ktahir@bzu.edu.pk</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2024</year></pub-date>
<pub-date date-type="pub" publication-format="electronic"><day>27</day><month>9</month><year>2024</year></pub-date>
<volume>141</volume>
<issue>2</issue>
<fpage>1673</fpage>
<lpage>1708</lpage>
<history>
<date date-type="received">
<day>13</day>
<month>5</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>26</day>
<month>7</month>
<year>2024</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2024 The Authors.</copyright-statement>
<copyright-year>2024</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMES_53903.pdf"></self-uri>
<abstract>
<p>Software-Defined Networking (SDN), with segregated data and control planes, provides faster data routing, stability, and enhanced quality metrics, such as throughput (T<sub>h</sub>), maximum available bandwidth (B<sub>d(max)</sub>), data transfer (D<sub>Transfer</sub>), and reduction in end-to-end delay (D<sub>(E-E)</sub>). This paper explores the critical work of deploying SDN in large&#x00AD;scale Data Center Networks (DCNs) to enhance its Quality of Service (QoS) parameters, using logically distributed control configurations. There is a noticeable increase in Delay<sub>(E-E)</sub> when adopting SDN with a unified (single) control structure in big DCNs to handle Hypertext Transfer Protocol (HTTP) requests causing a reduction in network quality parameters (B<sub>d(max)</sub>, T<sub>h</sub>, D<sub>Transfer</sub>, D<sub>(E-E)</sub>, etc.). This article examines the network performance in terms of quality matrices (bandwidth, throughput, data transfer, etc.), by establishing a large&#x2013;scale SDN-based virtual network in the Mininet environment. The SDN network is simulated in three stages: (1) An SDN network with unitary controller-POX to manage the data traffic flow of the network without the server load management algorithm. (2) An SDN network with only one controller to manage the data traffic flow of the network with a server load management algorithm. (3) Deployment of SDN in proposed control arrangement (logically distributed controlled framework) with multiple controllers managing data traffic flow under the proposed Intelligent Sensing Server Load Management (ISSLM) algorithm. As a result of this approach, the network quality parameters in large-scale networks are enhanced.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Software defined networking</kwd>
<kwd>quality of service</kwd>
<kwd>hypertext transfer protocol</kwd>
<kwd>data transfer rate</kwd>
<kwd>latency</kwd>
<kwd>maximum available bandwidth</kwd>
<kwd>server load management</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>In today&#x2019;s advanced technological environment, internet service providers increasingly manage demands for ultra-high-speed connectivity across different remote networks. By the end of 2023, approximately 29.3 billion different remote networks should be connected via modern network resources [<xref ref-type="bibr" rid="ref-1">1</xref>]. Optimizing the performance of any network mostly involves increasing its throughput, ensuring that it can process large amounts of data concurrently, improving data transfer rates, and minimizing latency. Software-defined networking (SDN) can ease the optimization process with a unique centralized control arrangement for managing data traffic and the ability to overcome the challenges associated with traditional networks in terms of scaling, controllability, and reliability [<xref ref-type="bibr" rid="ref-2">2</xref>]. SDN architectural framework has a three-layered structure (1-application layer, 2-control layer, and 3-data layer). Using a northbound Application Program Interface (API), the programmable logic is easily transferred to the controller at the control layer from the application layer. SDN controller updates routing tables of various networking devices in the data plane and coordinates and manages the data flow over various topologies via the southbound interface. SDN is becoming a key component of modern network infrastructures because of its two programmable properties that greatly enhance network scalability: (1) The segregation of the data plane from the control plane, augmenting network controllability, as illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. (2) The instructions can easily be forwarded to the SDN controller that can effectively process data traffic management over the whole network architecture [<xref ref-type="bibr" rid="ref-3">3</xref>], providing augmented controllability. Due to centralized control arrangements, congestion in SDN-based networks can easily be managed compared to traditional networks [<xref ref-type="bibr" rid="ref-4">4</xref>]. In an SDN-based network, the segregation of control and data planes means all the flow management functionality of network devices (routers, switches, etc.) is managed by the SDN controller. The unified controller is used for small to medium-sized networks and multiple controllers (logically distributed/logically centralized). This functionality enhances the Quality of Service (QoS) parameters; the logical reasons are as follows:
<list list-type="simple">
<list-item><label>&#x27A2;</label><p>The separation of control and data planes with all flow management control is with an SDN controller, which can have dynamic flow control ability in an SDN-based network by managing network traffic flow based on real-time conditions.</p>
</list-item>
<list-item><label>&#x27A2;</label><p>The separation of planes with the controller incharge provides reconfiguration of network paths, avoidance of congestion, application of prioritization of network traffic, enhanced throughput, greater data transfer, maximum available bandwidth, and ensuring low latency. These factors result in enhanced network performance and greater QoS parameter values.</p></list-item>
<list-item><label>&#x27A2;</label><p>The segregation of control and data planes in an SDN-based network provides additional facilities to optimize resource allocation based on the current demands of users by modifying the controller operation mode.</p></list-item>
<list-item><label>&#x27A2;</label><p>The programmability of the control plane allows quick implementation of new applications and services based on the QoS demands of any network environment.</p></list-item>
<list-item><label>&#x27A2;</label><p>The segregation of data and control planes in SDN provides an agile, responsive, and dynamically manageable network, resulting in enhanced QoS parameters.</p></list-item>
</list></p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Difference between the traditional and SDN-based networks&#x2019; operational models</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-1.tif"/>
</fig>
<p>There are two configuration options for the SDN controller: (a) centralized mode and (b) distributed mode [<xref ref-type="bibr" rid="ref-5">5</xref>]. The SDN controller operates best in centralized mode for small- to medium-sized networks. However, there can be significant delays in data transmission when large, multi-component Data Center Networks (DCNs) use a single, centralized model-based SDN controller, which provides slower controller operation and causes traffic congestion and delay. This delay can exacerbate network issues by creating backlogs of data that need to be processed [<xref ref-type="bibr" rid="ref-6">6</xref>]. The study was conducted in [<xref ref-type="bibr" rid="ref-7">7</xref>] to evaluate the performance of a single NOX controller for processing a large amount of data to pass through a large DCN. To mitigate latency issues within large-scale SDN-based DCNs using a single controller, the SDN controller must be framed in either logically centralized or distributed [<xref ref-type="bibr" rid="ref-8">8</xref>,<xref ref-type="bibr" rid="ref-9">9</xref>] control mode. The research articles [<xref ref-type="bibr" rid="ref-10">10</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>] suggest the resource management issue and its mitigation in the SDN network.</p>
<sec id="s1_1">
<label>1.1</label>
<title>A Centralized Controlled System Using an SDN Controller</title>
<p>This controller design distributes Hypertext Transfer Protocol (HTTP) requests from different hosts equally by deploying numerous high-performance SDN controllers across DCNs with exact synchronization. In comparison to the single SDN controller mode, this logically centralized SDN controller configuration, as shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, improves QoS characteristics in bigger DCNs. On the other hand, maintaining strict synchronization between these controllers may cause compatibility issues. The arrangement&#x2019;s primary drawback is the difficulty of synchronization between various controllers. Under some circumstances, synchronizing these controllers with un-versioned third-party programs may cause unpredictable and unstable network behavior, ultimately leading to system failure.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Logically centralized SDN controller configuration</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-2.tif"/>
</fig>
</sec>
<sec id="s1_2">
<label>1.2</label>
<title>Distributed Controlled Arrangement with an SDN Controller</title>
<p>This SDN control architecture uses a decentralized method that eliminates the need for controller synchronization in a distributed network configuration. The vast network of Large DCNs is separated into smaller domains, in contrast to the use of separate controllers in master and slave versions, as explained in <xref ref-type="sec" rid="s1_1">Section 1.1</xref>. Every controller stores vital flow information inside its Storage Area Network (SAN) and controls flow within its assigned domain. The network administrator can use this data to receive more instruction, which improves localized flow control inside each domain. Due to this solution, the strict synchronization requirement of distributed controllers is removed, which is necessary for global control of the distributed SDN network, as outlined in <xref ref-type="sec" rid="s1_1">Section 1.1</xref>. Comparing this SDN controller configuration to a centralized SDN control framework, one can get higher efficiency, faster response rates, and more versatility. <xref ref-type="fig" rid="fig-3">Fig. 3</xref> outlines the structure for logically distributed SDN control mode.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>SDN controller set up in a control mode</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-3.tif"/>
</fig>
<p>This SDN control configuration is frequently used by software-defined wide-area networks (SD-WANs). The research articles [<xref ref-type="bibr" rid="ref-12">12</xref>,<xref ref-type="bibr" rid="ref-13">13</xref>] demonstrate how SDN is used in distributed controlled structures regarding Google and Microsoft&#x2019;s network development. These employ distributed network devices to offer their users services. Compared to typical networking systems, the quality characteristics with a hierarchical distributed control arrangement are significantly superior. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> shows the hierarchical distributed control configuration. The controller of each domain in the network is in charge of it. Under the supervision of a global controller, each route controller controls its local controller. That local domain controller manages the data flow inside a domain. When data travels outside the local controller&#x2019;s controlling area, the route controller will take control of the flow. The research papers [<xref ref-type="bibr" rid="ref-14">14</xref>&#x2013;<xref ref-type="bibr" rid="ref-16">16</xref>] raise attention to the issue with the &#x201C;east-west&#x201D; bound interface between multiple controllers.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>SDN controller arranged in hierarchical, logically distributed mode</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-4.tif"/>
</fig>
</sec>
<sec id="s1_3">
<label>1.3</label>
<title>Research Objectives</title>
<p>The main goal of this study is to implement the suggested method (ISSLM) to control network server loads effectively and improve the QoS. Many HTTP servers can handle HTTP queries within the SDN architecture. However, server overload may occur if all HTTP request flows are directed toward a single server without considering network server load management. Consequently, this results in (a) overcrowded links, (b) HTTP queues, and (c) end-to-end delays. In the end, this decrease in the QoS characteristics of the network may cause the network to collapse due to total network failure. The following are the main objectives of this research project.</p>
<sec id="s1_3_1">
<label>1.3.1</label>
<title>To Deploy SDN in Large DCNs</title>
<p>In this method, the large DCN network is divided into smaller domains, and every controller is responsible for flow control inside its domain and storing necessary flow data in its SAN for the network administrator to instruct the controller further to manage the flow inside that local domain better as compared to the logically centralized method.</p>
</sec>
<sec id="s1_3_2">
<label>1.3.2</label>
<title>To Enhance QoS (<italic>B</italic><sub><italic>dmax</italic></sub>, <italic>T</italic><sub><italic>h</italic></sub>, <italic>D</italic><sub><italic>Transfer</italic></sub>, <italic>etc</italic>.) Parameters</title>
<p>A. Self-Adapting Configuration:</p>
<p>The Request Per Second (RPS) load on each server is calculated by adaptation of the following procedure:
<list list-type="simple">
<list-item><label>&#x27A2;</label><p>Firstly, the APACHE program must be installed on every HTTP server.</p></list-item>
<list-item><label>&#x27A2;</label><p>Then, the GRAFANA program is started on every server. PROMETHEUS is a data source, making collecting HTTP server data logs possible.</p></list-item>
<list-item><label>&#x27A2;</label><p>Prom_QL queries are written to control the RPS matrices for every server, considering settings like RAM and default time.</p></list-item>
<list-item><label>&#x27A2;</label><p>Installing and integrating the POX controller with the PSUTIL Python library function.</p></list-item>
<list-item><label>&#x27A2;</label><p>Using PSUTIL, endpoints are created so that the POX controller may access all of the servers&#x2019; RPS matrix values.</p></list-item>
<list-item><label>&#x27A2;</label><p>These RPS matrices are used to determine the load on every HTTP server.</p></list-item>
</list></p>
<p>B. Adaptive Optimization:</p>
<p>To balance server loads, the ISSLM algorithm takes three factors into account: (1) Comparing each server&#x2019;s RPS values to a benchmark server load (S<sub>load</sub>) measurement. When a server&#x2019;s load exceeds the reference server load (S<sub>load</sub>) in an SDN network, it is considered overloaded and is removed from the server list. When this occurs, HTTP flows are diverted to the server with the lowest server load value among the servers accessible on the network, within the acceptable range of the reference server load (S<sub>load</sub>) value. (2) HTTP flows are routed to the server in the SDN network with the fewest active connections if the criterion mentioned above is not satisfied. (3) The server with the fastest response time.</p>
</sec>
</sec>
<sec id="s1_4">
<label>1.4</label>
<title>Work Contribution</title>
<p>The main goal of this study is to apply a suggested load balancing algorithm, called ISSLM, for network servers to improve the QoS metrics, which include maximum bandwidth (B<sub>dmax</sub>), throughput, data transfer, and delay in a chosen or parameterized SDN based DCN. The suggested working model, which uses the ISSLM algorithm to accomplish the study goals, is shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>A proposed working model for obtaining research objectives by the proposed algorithm (ISSLM)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-5.tif"/>
</fig>
<p>A large-scale SDN-based virtual network was created in the Mininet environment to study network quality factors to achieve the previously indicated goal. According to this research study, the chosen or parameterized network is simulated in three steps:
<list list-type="simple">
<list-item><label>&#x27A2;</label><p>In the first step, we configured an SDN network with only one controller&#x2014;the POX controller&#x2014;to manage the data flow over the network. The Mininet environment is used to set up this network configuration. In particular, this configuration does not include a server load management algorithm.</p></list-item>
<list-item><label>&#x27A2;</label><p>In the second step, we keep the SDN network operational using a single controller (POX) set up in the Mininet environment, which controls data traffic flow within the network. We integrate a server load management algorithm into this design to efficiently balance the load among network servers.</p></list-item>
<list-item><label>&#x27A2;</label><p>In the third case, we build a user-defined distributed network that several controllers oversee. The controllers are responsible for monitoring data flow inside their designated domains. Moreover, the suggested ISSLM algorithm influences how these controllers function. This strategic approach aims to improve the large-scale network&#x2019;s network quality metrics.</p></list-item>
</list></p>
</sec>
<sec id="s1_5">
<label>1.5</label>
<title>Paper Arrangement</title>
<p><xref ref-type="sec" rid="s2">Section 2</xref> explains the literature review and provides a comparison table of traditional server load management algorithms with the proposed technique of the ISSLM algorithm. In <xref ref-type="sec" rid="s3">Section 3</xref>, we have discussed the working model of (ISSLM) algorithm and problem statement. In <xref ref-type="sec" rid="s4">Section 4</xref>, the SDN network (in this research article) is simulated in three stages: (1) An SDN network with only one controller (POX) to manage the data traffic flow of the network (established on the Mininet environment) without the server load management algorithm. (2) An SDN network with only one controller to manage the data traffic flow of the network (established on the Mininet environment) with a server load management algorithm. (3) A user-defined network is now established in distributed network domains with multiple controllers managing data traffic flow under the proposed ISSLM algorithm. As a result of this approach, the network quality parameters in the large-scale network are augmented. In <xref ref-type="sec" rid="s5">Section 5</xref>, we conclude the simulation results along with future research directions.</p>
</sec>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Review</title>
<p>This section provides an overview of study findings about distributed SDN control configurations divided into two groups. As shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>, there are two research strategies: (1) logically centralized SDN configuration research techniques and (2) logically distributed SDN configuration research techniques.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Classification of the literature review into two portions</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-6.tif"/>
</fig>
<sec id="s2_1">
<label>2.1</label>
<title>Research Methodology for Linking Large DCNs in SDN Centralized Controlled Structure</title>
<p>The Hyperflow protocol [<xref ref-type="bibr" rid="ref-17">17</xref>], which uses the WheelFS application to synchronize controllers, is covered in an article [<xref ref-type="bibr" rid="ref-18">18</xref>]. A broker-oriented distributed file system is used in this technique, which could lead to network Denial of Service (DOS) attacks. The Online Information Exchange (ONIX) program, which controls flow characteristics in the Network Information Database (NIDB) database, is presented in a research study [<xref ref-type="bibr" rid="ref-19">19</xref>]. While this method is appropriate for medium-sized networks, NIDB exchange may cause network overload in larger Data Center Networks (DCNs), resulting in worse quality parameters. A research paper [<xref ref-type="bibr" rid="ref-20">20</xref>] shows an Open Daylight (ODL) cluster that utilizes the AKKA (derived from a Swedish mountain and the choice of name symbolizes stability, resilience, and the ability to handle heavy loads, much like a mountain) framework [<xref ref-type="bibr" rid="ref-21">21</xref>,<xref ref-type="bibr" rid="ref-22">22</xref>] to synchronize controllers. Still, many control frames are used, making big DCNs slow. The Open Network Operating System (ONOS) is presented in a research article [<xref ref-type="bibr" rid="ref-23">23</xref>], which uses the Reliable, Available, and Fault-Tolerant (RAFT) algorithm [<xref ref-type="bibr" rid="ref-24">24</xref>] to map data between controllers. An active standby controller configuration is used to provide fault tolerance. According to a research paper [<xref ref-type="bibr" rid="ref-25">25</xref>], Atomix, a Java-based program, helps with fault tolerance in SDN networks. Similarly, Smart-Light uses an active-standby controller topology for fault tolerance with centralized data storage (CDS) [<xref ref-type="bibr" rid="ref-26">26</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>]. A research article [<xref ref-type="bibr" rid="ref-28">28</xref>] discusses Ravenna, built on the Replicated State Machine (RSM) method for network device interconnections. As explained in another study [<xref ref-type="bibr" rid="ref-29">29</xref>], Manta&#x2019;s and Rama&#x2019;s methods aim to emulate Ravana&#x2019;s traits without changing the OpenFlow protocol. Compared to Ravana, the open flow-based algorithm Kandos provides better quality parameters, as shown in a study publication [<xref ref-type="bibr" rid="ref-30">30</xref>]. Furthermore, research papers [<xref ref-type="bibr" rid="ref-31">31</xref>,<xref ref-type="bibr" rid="ref-32">32</xref>] include white documents from the Google project, which show that when used in logically centralized control mode setups, practical efficiency can reach up to 90%.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Research Methodology for Linking Large DCNs in SDN Distributed Controlled Structure</title>
<p>The functioning of controllers in the SDN distributed controlled plane (DISCO) is explained in a research study [<xref ref-type="bibr" rid="ref-33">33</xref>]. For intra- and inter-domain applications, this controller uses a variety of network-based agents to enable information flow. A revised protocol for managing queue messages (AMQP), specifically for inter-domain data transfers, is suggested by the authors in a research study [<xref ref-type="bibr" rid="ref-34">34</xref>]. The outcomes are noticeably better with the application of this technique. The Distributed Control Plane Interface (DCPI) program, which functions as an east-west bound interface, is also introduced in a research study [<xref ref-type="bibr" rid="ref-35">35</xref>]. It makes sharing and synchronizing network flow status easier for several domains. Based on the OpenFlow protocol, the Route Flow Partial (RFP) application is used to manage applications related to inter-domain flow. It is covered in more detail in another article [<xref ref-type="bibr" rid="ref-36">36</xref>]. A research article [<xref ref-type="bibr" rid="ref-37">37</xref>] discusses an application created by INRIA to improve fault tolerance and security in distributed SDN (D-SDN) configurations. Novel techniques for implementing SDN across internet exchange points, or SDX, are explored in several research articles [<xref ref-type="bibr" rid="ref-38">38</xref>&#x2013;<xref ref-type="bibr" rid="ref-42">42</xref>]. Among these, research articles [<xref ref-type="bibr" rid="ref-43">43</xref>&#x2013;<xref ref-type="bibr" rid="ref-45">45</xref>] cover fault tolerance techniques and DOS attack detection techniques within SDX. Furthermore, a study [<xref ref-type="bibr" rid="ref-46">46</xref>] describes enhancements to the SDN network&#x2019;s Border Gateway Protocol (BGP). As demonstrated in a different study publication [<xref ref-type="bibr" rid="ref-47">47</xref>&#x2013;<xref ref-type="bibr" rid="ref-48">48</xref>], the Distributed Flow Architecture for Networked Enterprises (DIFANE) application, when implemented in an SDN network, yields better QoS parameters.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>A Comparison between Traditional Server Load Balancing Algorithms and the Proposed (ISSLM) Algorithm for Efficient Server Load Balancing</title>
<p>The differences between the suggested ISSLM algorithm and traditional load-balancing techniques are shown in <xref ref-type="table" rid="table-1">Table 1</xref>. This section also details how the ISSLM algorithm overcomes the drawbacks of conventional load-balancing methods.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison of the proposed (ISSLM) method with conventional server load balancing algorithms</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Authors</th>
<th>Key contribution</th>
<th>Implemented method/technique</th>
<th>Notable constraint</th>
</tr>
</thead>
<tbody>
<tr>
<td>Mehmood et al. [<xref ref-type="bibr" rid="ref-49">49</xref>]</td>
<td>Improve the network&#x2019;s QoS metrics, focusing on B<sub>d(max)</sub>, throughput, and data transfer.</td>
<td>Implementing an algorithm for dynamic load balancing.</td>
<td>Scalability problems in larger configurations; effectiveness restricted to smaller DCNs.</td>
</tr>
<tr>
<td rowspan="2">Chiang et al. [<xref ref-type="bibr" rid="ref-50">50</xref>]</td>
<td>1-Optimum servers are chosen based on lower RPS values.</td>
<td rowspan="2">1-Utilizing the Dynamic Weighted Random Selection (DWRS) method. Giving less loaded servers a more substantial weight. 2-Direct flow to servers that have greater weights.</td>
<td rowspan="2">Lack of active connection analysis and rapid responses.</td>
</tr>
<tr>
<td>2-Execution is carried out in a framework that is hardware-centric.</td>
</tr>
<tr>
<td rowspan="2">Begam et al. [<xref ref-type="bibr" rid="ref-51">51</xref>]</td>
<td>1-Best server selection based on calculation of response time.</td>
<td rowspan="2">The search technique was based on multiple regression (MRBS).</td>
<td rowspan="2">The approach does not use active server load sensing.</td>
</tr>
<tr>
<td>2-Redirecting flow to servers with the lowest possible delay.</td>
</tr>
<tr>
<td rowspan="2">Malba&#x0161;i&#x0107; et al. [<xref ref-type="bibr" rid="ref-52">52</xref>]</td>
<td>1- Determine the optimal server based on minimum server load.</td>
<td rowspan="2">Using matrices with several parameters to schedule connections.</td>
<td rowspan="2">Restricted scope of the assessments, absence of response time, and active connection assessments.</td>
</tr>
<tr>
<td>2-Implementation is performed on a Mininet arrangement.</td>
</tr>
<tr>
<td>Liang et al. [<xref ref-type="bibr" rid="ref-53">53</xref>]</td>
<td>Automated load redistribution among servers driven by IoT applications.</td>
<td>Employing a Bayesian network based on IoT inputs.</td>
<td>Oversight in active server load sensing within the framework.</td>
</tr>
<tr>
<td>Ahmad et al. [<xref ref-type="bibr" rid="ref-54">54</xref>]</td>
<td>Middlebox integration as a proxy server for load sharing with SDN controllers.</td>
<td>Developing a robust network involving a controller and middlebox for traffic control.</td>
<td>Compatibility challenges between middlebox and SDN controller infrastructure.</td>
</tr>
<tr>
<td>Saxena et al. [<xref ref-type="bibr" rid="ref-55">55</xref>]</td>
<td>Introduction of Adaptive Multi-Objective Load Balancing (AMOLB) considering various metrics.</td>
<td>Calculation of routing cost with data forwarding based on path weights.</td>
<td>The narrow focus on routing cost overlooks response time considerations.</td>
</tr>
<tr>
<td>Haidi et al. [<xref ref-type="bibr" rid="ref-56">56</xref>]</td>
<td>Improving Bandwidth utilization through Dynamic Load Balancing.</td>
<td>The Floodlight controller is used for Dynamic Load Balancing.</td>
<td>Insufficient analysis of response time dynamics.</td>
</tr>
<tr>
<td>Ejaz et al. [<xref ref-type="bibr" rid="ref-57">57</xref>]</td>
<td>Load distribution among SDN controllers.</td>
<td>Multiple controllers in Master-Slave scenario.</td>
<td>Dependency on tight synchronization within logically centralized frameworks.</td>
</tr>
<tr>
<td>Gasmelseed et al. [<xref ref-type="bibr" rid="ref-58">58</xref>]</td>
<td>SDN controller load balancing.</td>
<td>TCP/UDP flow separation using Multiple Controllers.</td>
<td>Dependency on tight synchronization within logically centralized frameworks.</td>
</tr>
<tr>
<td>Xu et al. [<xref ref-type="bibr" rid="ref-59">59</xref>]</td>
<td>Load balancing on network switches.</td>
<td>It is based on migration cost, prioritizing servers with lower migration costs.</td>
<td>Inefficiency when targeting overloaded servers considering migration cost.</td>
</tr>
<tr>
<td>Geo et al. [<xref ref-type="bibr" rid="ref-60">60</xref>]</td>
<td>Bandwidth optimization &#x0026; Latency reduction.</td>
<td>They are opting for multiple controllers with segregated master controllers.</td>
<td>Compatibility challenges, energy consumption, and overhead constraints with controllers.</td>
</tr>
<tr>
<td>Vyakarana et al. [<xref ref-type="bibr" rid="ref-61">61</xref>]</td>
<td>Elephant flow avoidance.</td>
<td>Employing a static algorithm distinguishing critical and non-critical traffic.</td>
<td>Network bandwidth wastage under varying dynamic load conditions.</td>
</tr>
<tr>
<td rowspan="2">Sathyanarayana et al. [<xref ref-type="bibr" rid="ref-62">62</xref>]</td>
<td rowspan="2">Load balancing via less-loaded server selection and shortest path algorithms.</td>
<td>1-Dynamic Flow Algorithm for servers with less traffic.</td>
<td rowspan="2">Extensive resource consumption when concurrently executing both algorithms.</td>
</tr>
<tr>
<td>2-The shortest path to the best server using the Ant Colony Algorithm.</td>
</tr>
<tr>
<td>Zhong et al. [<xref ref-type="bibr" rid="ref-63">63</xref>]</td>
<td>Reduction of processing delays.</td>
<td>Computations of server response time.</td>
<td>Trade-offs in throughput and bandwidth to mitigate processing delays.</td>
</tr>
<tr>
<td>Hamed et al. [<xref ref-type="bibr" rid="ref-64">64</xref>]</td>
<td>Server load balancing.</td>
<td>Utilizing the traditional Round-Robin method.</td>
<td>Reduced load balancing effectiveness in extensive SDN setups with intense data flows.</td>
</tr>
<tr>
<td>Hai et al. [<xref ref-type="bibr" rid="ref-65">65</xref>]</td>
<td>Elephant flow mitigation.</td>
<td>Using traffic categorization into critical and non-critical segments.</td>
<td>Significant network bandwidth utilization concerns.</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Problem Statement</title>
<p>When a single SDN controller controls the data traffic flow of a large SDN-based DCN, even how efficient the proposed method is, the network quality parameters are derailed. In the research article [<xref ref-type="bibr" rid="ref-47">47</xref>], the server load was balanced using a dynamic server load algorithm but using a single controller, which could result in a large processing delay of control instruction to the underlying switch in large DCNs. This research article uses multiple controllers in a logically distributed scenario to overcome the tight synchronization problem, as happens in the logically centralized control environment. Many research ideas to address this practical issue are mentioned in <xref ref-type="sec" rid="s2">Section 2</xref>. But there are some significant issues related to this worthwhile issue that are following:
<list list-type="simple">
<list-item><label>&#x27A2;</label><p>The SDN controller manages the data traffic flow of all networking devices inside a network. Suppose another controller is incorporated inside a network to share the load of flow control. The transfer of control information among controllers inside the network requires tight synchronization. The open flow protocol will connect them to transmit control information regarding network controllability, which could also lead to vulnerabilities in DOS attacks. The problem of synchronization arises in the logically controlled arrangement.</p></list-item>
<list-item><label>&#x27A2;</label><p>However, suppose the synchronization condition is somehow fulfilled. In that case, there is a problem when the network is a large DCN, and sharing necessary control files among controllers in case of heavy data traffic flow could make the controller loaded, enhancing the processing delays and latency and further derailing network quality parameters.</p></list-item>
<list-item><label>&#x27A2;</label><p>Normally, there are two types of data flow inside a network: (1) data traffic requests to be transferred from one host and (2) control data flow from one controller to another. Sharing every flow information among different controllers has the advantage that if one controller fails, another controller takes responsibility for flow control in addition to its commitments. This requires additional spaces and programming to sport multiple control data flow inside a network.</p></list-item>
</list></p>
<p>However, this research article proposed a more efficient method: to balance server load as compared to the research methods suggested in <xref ref-type="table" rid="table-1">Table 1</xref> that is, instead of using different controllers in the master and slave version, the large DCNS network is divided into smaller domains, and every controller is responsible for flow control inside its domain and storing necessary flow data in its SAN for the network administrator to instruct the controller further to manage the flow inside that local domain better.</p>

<p><bold><italic>Solution Proposed by Implementing the Proposed Algorithm</italic></bold></p>
<p>Logically distributed use of SDN controllers is recommended when working with big networks with hundreds of thousands of network components. This method divides the large DCNs into smaller domains and assigns each controller to control flow control inside its assigned domain. These controllers also store important flow data in their SANs, which makes it easier for network administrators to give additional instructions for better flow management in each local domain. As seen in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, this logically distributed technique has advantages over the logically centralized approach.</p>
</sec>
<sec id="s4">
<label>4</label>
<title>Methodology of the Proposed Technique (ISSLM)</title>
<p>The methodology of the proposed algorithm, the ISSLM algorithm, is divided into three procedural steps that are as follows.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Procedural Step#1</title>
<p>The SDN controller mode of operation is defined before forming an SDN-based network. If the network to be managed is small (comprising a few networking devices), then a single SDN controller is sufficient to control the flow. However, if the network is large (comparing hundreds of thousands of network components), the SDN controller should be used in a logically distributed manner. In this method, the large DCNS network is divided into smaller domains, and every controller is responsible for flow control inside its domain and storing necessary flow data in its SAN for the network administrator to instruct the controller further to manage the flow inside that local domain better as compared to the method adopted in research article [<xref ref-type="bibr" rid="ref-49">49</xref>]. The procedure of Step 1 is shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Illustration of the suggested technique&#x2019;s initial procedural step in a flow diagram</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-7.tif"/>
</fig>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Procedural Step#2</title>
<p>The SDN controller determines each server&#x2019;s HTTP request load (RPS) to prevent network server overload carried by HTTP requests. The Grafana application is launched on the HTTP server and configured to modulate the data source in Prometheus format; to accomplish this, Grafana gives the required server logs access to the SDN controller when combined with Prometheus as the data source. Each server&#x2019;s RPS and active connection details are automatically retrieved every 10 milliseconds by designing a server load module at the POX controller using core and Psutil as Python library functions to fetch data by eliminating the need for lengthy calculation and Python coding. The following is the summary algorithm shown in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Procedural steps for evaluation of RPS matrices</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Sr. no.</th>
<th>Procedural step explanation</th>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">Integrate_ HTTP servers_RPS matrices_with_POXContoller</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;PSUTIL_setup ()</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;PSUTIL_Integrate_with_POXController ()</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;Endpoint_Creation_in_POXController_for_handling_RPS matrices ()</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;APACHE_Setup ()</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;GRAFANA_Run ()</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;Data_source_addition_of_PROMETHEUS ()</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;Construct_PromQL_query_manager_for_RPS_matrices ()</td>
</tr>
<tr>
<td>2</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">Integrate_ HTTP servers_RPS matrices_with_POXContoller</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#FFF100">Print</styled-content> (<styled-content style="color:#37904B">&#x201C;Amending the POX controller module to retrieve each HTTP server&#x2019;s RPS matrices data&#x201D;</styled-content>)</td>
</tr>
<tr>
<td>3</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">PSUTIL_setup</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#FFF100">Print</styled-content> (<styled-content style="color:#37904B">&#x201C;The Python library function that is installed and integrated with the POX controller is called PSUTIL&#x201D;</styled-content>)</td>
</tr>
<tr>
<td>4</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">PSUTIL_Integrate_with_POXController</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#FFF100">Print</styled-content> (<styled-content style="color:#37904B">&#x201C;With the POX controller installed, PSUTIL is the Python library function that is integrated&#x201D;</styled-content>)</td>
</tr>
<tr>
<td>5</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">Endpoint_Creation_in_POXController_for_handling_RPS matrices</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#FFF100">Print</styled-content> (<styled-content style="color:#37904B">&#x201C;To expose all of each server&#x2019;s RPS matrix values to the POX controller, an endpoint is constructed using PSUTIL&#x201D;</styled-content>)</td>
</tr>
<tr>
<td>6</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">APACHE_Setup</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#FFF100">Print</styled-content> (<styled-content style="color:#37904B">&#x201C;Every HTTP server has the APACHE program installed&#x201D;</styled-content>)</td>
</tr>
<tr>
<td>7</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">GRAFANA_Run</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#FFF100">Print</styled-content> (<styled-content style="color:#37904B">&#x201C;On every server, the GRAFANA application is started&#x201D;</styled-content>)</td>
</tr>
<tr>
<td>8</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">Data_source_addition_of_PROMETHEUS</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#FFF100">Print</styled-content> (<styled-content style="color:#37904B">&#x201C;To select the data source for PROMETHEUS to extract the HTTP server&#x2019;s data logs, the GRAFANA application is run on each server and its browser is extracted&#x201D;</styled-content>)</td>
</tr>
<tr>
<td>9</td>
<td><styled-content style="color:#25ADE3">def</styled-content> <styled-content style="color:#FF0000">Construct_PromQL_query_manager_for_RPS_matrices</styled-content> ():</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#FFF100">Print</styled-content> (<styled-content style="color:#37904B">&#x201C;To query the RPS matrix (i.e., needed parameters, default time, memory detail, etc.) of each server, Prom_QL queries are built&#x201D;</styled-content>)</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_3">
<label>4.3</label>
<title>Procedural Step#3</title>
<p>After forming the SDN network on the Mininet tool, the controller calculates the HTTP request load (RPS) for each server in the network. If the RPS value for any request severing sever is greater than the reference load threshold value (S_<sub>Load</sub>), the following conditions are met in the proposed algorithm:</p>
<p>if (Request load of requested server &#x003E; &#x003D; Server load)</p>
<p>&#x2002;&#x2002;&#x2002;{</p>
<p>&#x2002;&#x2002;&#x2002;Remove the requested server from the available servers list;</p>
<p>&#x2002;&#x2002;&#x2002;For five times:</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;If (Server search with lesser request load value &#x003D; Successful)</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;{</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Move the load of HTTP requests to that server;</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;break the loop;</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;}</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;else if (Server search with the fewest connections active &#x003D; Successful)</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;{</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Move the load of HTTP requests to that server;</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;break the loop;</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;}</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;else if (Server search with slowest response time &#x003D; Successful)</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;{</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Move the load of HTTP requests to that server;</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;break the loop;</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;}</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;else</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;{</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;Print &#x201C;The optimal server was not found&#x201D;;</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;}</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;}</p>
<p>else</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;{</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;The requested server is given a new HTTP flow;</p>
<p>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;}</p>
<p>The procedure of Step 3 is illustrated in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>The second and third procedural steps of the suggested technique are represented in a flow diagram</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-8.tif"/>
</fig>
</sec>
<sec id="s4_4">
<label>4.4</label>
<title>A Comparison between Traditional Server Load Balancing Algorithms and the Proposed (ISSLM) Algorithm for Efficient Server Load Balancing</title>
<p>This portion includes an algorithm, as shown in <xref ref-type="table" rid="table-3">Table 3</xref>, to perform server load balancing with the research technique (ISSLM) algorithm.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Algorithm to perform server load balancing with ISSLM</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Steps</th>
<th>Explanation</th>
</tr>
</thead>
<tbody>
<tr>
<td colspan="2"><italic>Initialization:</italic></td>
</tr>
<tr>
<td></td>
<td>&#x201C;total_Unavailable_Servers&#x201D; &#x2190; Count of currently unavailable servers in the network.</td>
</tr>
<tr>
<td/>
<td>&#x201C;server_With_MinLoad&#x201D; &#x2190; Server with minimum HTTP request load in the network.</td>
</tr>
<tr>
<td/>
<td>The &#x201C;chosen_Optimal_Server&#x201D; &#x2190; server was selected via the ISSLM algorithm for new HTTP request management.</td>
</tr>
<tr>
<td/>
<td>&#x201C;incoming_HTTP_Request_Batch&#x201D; &#x2190; The SDN controller will manage A new batch of HTTP requests.</td>
</tr>
<tr>
<td colspan="2"><italic>Algorithm Workflow:</italic></td>
</tr>
<tr>
<td><bold>1</bold></td>
<td><styled-content style="color:#70AE46">Evaluate if &#x201C;incoming_HTTP_Request_Batch&#x201D; equals &#x201C;total_Unavailable_Servers.&#x201D;</styled-content></td>
</tr>
<tr>
<td/>
<td>If true, proceed to Step 2. If false, move to Step 4.</td>
</tr>
<tr>
<td><bold>2</bold></td>
<td><styled-content style="color:#70AE46">Identify the optimal server with the lowest load among available servers:</styled-content></td>
</tr>
<tr>
<td/>
<td>&#x201C;available_Servers&#x201D; &#x003D; [active_Server_List]</td>
</tr>
<tr>
<td/>
<td>def select Server_With_MinLoad(available_Servers)</td>
</tr>
<tr>
<td/>
<td>&#x2002; return min(available_Servers, key&#x003D;lambda server: available_Servers.get(server))</td>
</tr>
<tr>
<td/>
<td><styled-content style="color:#4872B7"><bold>Assign</bold></styled-content> <styled-content style="color:#0000FF">&#x201C;chosen_Optimal_Server&#x201D; &#x003D; select Server_With_MinLoad(available_Servers)</styled-content></td>
</tr>
<tr>
<td><bold>3</bold></td>
<td><styled-content style="color:#70AE46">If the condition in Step 2 is not satisfied, select the optimal server with the fewest active connections:</styled-content></td>
</tr>
<tr>
<td/>
<td>&#x201C;connection_Servers&#x201D; &#x003D; [active_Server_List]</td>
</tr>
<tr>
<td/>
<td>def select Least_Connections_Server(connection_Servers):</td>
</tr>
<tr>
<td/>
<td>&#x2002; return min(connection_Servers, key&#x003D;lambda server: connection_Servers.get(server))</td>
</tr>
<tr>
<td/>
<td><styled-content style="color:#4872B7"><bold>Assign</bold></styled-content> <styled-content style="color:#0000FF">&#x201C;chosen_Optimal_Server&#x201D; &#x003D; select LeastConnectionsServer (connectionServers)</styled-content></td>
</tr>
<tr>
<td><bold>4</bold></td>
<td><styled-content style="color:#70AE46">If neither of the previous conditions are satisfied, select the optimal server with the quickest response time:</styled-content></td>
</tr>
<tr>
<td/>
<td>&#x201C;avail_Servers&#x201D; &#x003D; [active_Server_List]</td>
</tr>
<tr>
<td/>
<td>def Server_RespTime(avail_Servers):</td>
</tr>
<tr>
<td/>
<td>&#x2002; startTime &#x003D; get_current_time()</td>
</tr>
<tr>
<td/>
<td>&#x2002; response &#x003D; send_request_to_server(availServers)</td>
</tr>
<tr>
<td/>
<td>&#x2002; endTime &#x003D; get_current_time()</td>
</tr>
<tr>
<td/>
<td>&#x2002; responseTime &#x003D; endTime &#x2013; startTime</td>
</tr>
<tr>
<td/>
<td>&#x2002; print(f&#x201D;Server response time: {responseTime} milliseconds&#x201D;)</td>
</tr>
<tr>
<td/>
<td>def Fastest Resp_Server(responseTime):</td>
</tr>
<tr>
<td/>
<td>&#x2002; return min(responseTime, key&#x003D;lambda server: responseTime.get(server))</td>
</tr>
<tr>
<td/>
<td><styled-content style="color:#4872B7"><bold>Assign</bold></styled-content> <styled-content style="color:#0000FF">&#x201C;chosen_Optimal_Server&#x201D; &#x003D; FastestRespServer(ServerRespTime (availServers))</styled-content></td>
</tr>
</tbody>
</table>
</table-wrap>
<sec id="s4_4_1">
<label>4.4.1</label>
<title>Algorithm for Segregating the Control Plane of Large SDN-Based DCN</title>
<p>This portion includes an algorithm, as shown in <xref ref-type="table" rid="table-4">Table 4</xref>, to segregate the control plane of large SDN-based DCN with the research technique (ISSLM) algorithm.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Algorithm to perform server load balancing with ISSLM</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Sr. no.</th>
<th>Explanation</th>
</tr>
</thead>
<tbody>
<tr>
<td><bold>1</bold></td>
<td>class NetworkManager:</td>
</tr>
<tr>
<td><bold>2</bold></td>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#25ADE3">def</styled-content> __<styled-content style="color:#FF0000">init</styled-content>__(self, identifier, http_RequestCount):</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;self.identifier &#x003D; identifier</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;self.http_RequestCount &#x003D; http_RequestCount</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;self.qualityMetrics &#x003D; {}</td>
</tr>
<tr>
<td><bold>3</bold></td>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#25ADE3">def</styled-content> monitor_subnetwork(self):</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;self.qualityMetrics &#x003D; {<styled-content style="color:#70AE46">&#x201C;Delay-EndToEnd&#x201D;: &#x201C;ms,&#x201D; &#x201C;Throughput&#x201D;: &#x201C;Gbps, &#x201C;DataTransfer&#x201D;: &#x201C;GB&#x201D;</styled-content>}</td>
</tr>
<tr>
<td><bold>4</bold></td>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#25ADE3">def</styled-content> balance_http_load_with_ISSLM(self):</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;print(<styled-content style="color:#70AE46">f&#x201D;Applying ISSLM to balance load for controller {self.identifier} handling {self.httpRequestCount} HTTP requests.&#x201D;</styled-content>)</td>
</tr>
<tr>
<td><bold>5</bold></td>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#25ADE3">def</styled-content> store_qos_metrics(self, storage_Area_Network):</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;storage_Area_Network[self.identifier] &#x003D; self.qualityMetrics</td>
</tr>
<tr>
<td><bold>6</bold></td>
<td>class SAN:</td>
</tr>
<tr>
<td><bold>7</bold></td>
<td>&#x2002;&#x2002;&#x2002;<styled-content style="color:#25ADE3">def</styled-content> distribute_sdn_control(http_Request_Distributions):</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;storage_Network &#x003D; {}</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;for index, http_RequestCount in enumerate(http_Request_Distributions):</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;manager &#x003D; Network_Manager(index, http_RequestCount)</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;manager.balance_http_load_with_ISSLM()</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;manager.monitor_subnetwork()</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;manager.store_qos_metrics(storage_Network)</td>
</tr>
<tr>
<td/>
<td>&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;&#x2002;<styled-content style="color:#25ADE3">return</styled-content> storage_Network</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Results and Discussion</title>
<p>For the evaluation of the quality metrics parameters (maximum available bandwidth: B<sub>d(max)</sub>, Throughput: T<sub>h</sub>, Data transfer: D<sub>Transfer</sub>, and end-to-end delay: D<sub>E-E</sub>, etc.), the SDN-based network is simulated in three different configurations: (1) A single POX controller-based SDN controller arrangement designed on Mininet without any server load management algorithm for managing network data traffic. (2) A single POX controller-based SDN controller arrangement designed on Mininet with a proposed server load management algorithm (ISSLM) for managing network traffic. (3) Deployment of SDN in logically distributed controlled framework arrangement designed on Mininet with proposed server load management algorithm (ISSLM) for managing network data traffic. <xref ref-type="fig" rid="fig-9">Fig. 9</xref> represents the virtual network configurations designed on the Mininet tool for the first two cases of simulations.</p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Network topology selected for obtaining QoS parameter results in the first portion of the simulation</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-9.tif"/>
</fig>
<sec id="s5_1">
<label>5.1</label>
<title>Case-A: Evaluation of the Quality Metrics Parameters (<italic>B</italic><sub><italic>d</italic><italic>(max)</italic></sub>, <italic>T</italic><sub><italic>h</italic></sub>, <italic>D</italic><sub><italic>Transfer</italic></sub>, <italic>D</italic> <sub><italic>E-E</italic></sub>, <italic>etc</italic>.) in a Single POX Controller-Based SDN Controller Arrangement Designed on Mininet without Any Server Load Management Algorithm for Managing Network Data Traffic</title>
<p>The user-defined network designed on Mininet, as shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, comprises thirty HTTP request-generating hosts (H<sub>st-1</sub> to H<sub>st-30</sub>), three OpenFlow switches (S<sub>w1</sub>, S<sub>w2</sub>, S<sub>w3</sub>), four servers (S<sub>er-1</sub>, S<sub>er-2</sub>, S<sub>er-3</sub>, and S<sub>er-4</sub>), and single POX controller (C<sub>Ps</sub>) that is responsible for managing the HTTP request load that is directed towards the servers. In this virtualized network environment, the servers are accordingly assigned the IP addresses 100.0.0.1, 100.0.0.2, 100.0.0.3, and 100.0.0.4. The QoS metrics (B<sub>d(max)</sub>, T<sub>h</sub>, D<sub>Transfer</sub>, D<sub>E-E</sub>, etc.) obtained under normal working conditions (200 randomly generated HTTP requests from hosts H<sub>st-1</sub>&#x2013;H<sub>st-30</sub> in our test case) include a maximum bandwidth (B<sub>d(max)</sub>) of 6.5 Gb/s, a throughput (T<sub>h</sub>) of 5.6152 Gb/s, and a data transfer (D<sub>Transfer</sub>) volume of 7.019 Gbytes. However, during the simulation time of 10 s, a high volume of HTTP requests of 20,000 are made from randomly available Hosts (H<sub>st-1</sub> to H<sub>st-30</sub>), and every request is exclusively sent to S<sub>er-2</sub> only. Because in this scenario there is no server load management technique applied on the Controller (C<sub>Ps</sub>), it makes the S<sub>er-2</sub> get overloaded and reach a bottleneck state. As a result, QoS parameters (B<sub>d(max)</sub>, T<sub>h</sub>, D<sub>Transfer</sub>, D<sub>E-E</sub>, etc.) deteriorate. <xref ref-type="fig" rid="fig-10">Fig. 10</xref> shows the QoS parameters for maximum bandwidth (B<sub>d(max)</sub>) and data transfer (D<sub>Transfer</sub>) related to the link between S<sub>er-2</sub> and the initiating hosts using the Iperf tool. Equations (<xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-4">(4)</xref>) are used to obtain the values of throughput (T<sub>h</sub>), the percentage drop in data transfer (%D<sub>Transfer</sub>), the percentage increase in server load (%I<sub>SL</sub>), and end-to-end Delay (D<sub>E-E</sub>). Where the Round-Trip Delay (RTD) is obtained from the Iperf utility by using its h<sub>ping</sub> directory.</p>
<p><disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>D</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mspace width="thinmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mi>G</mml:mi><mml:mi>b</mml:mi><mml:mi>y</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>S</mml:mi><mml:mi>L</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>100</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mn>100</mml:mn><mml:mo>&#x2217;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>B</mml:mi><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mspace width="thinmathspace" /><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>B</mml:mi><mml:mi>d</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi mathvariant="normal">&#x0025;</mml:mi><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>100</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mn>100</mml:mn><mml:mo>&#x2217;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>E</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>R</mml:mi><mml:mi>T</mml:mi><mml:mi>D</mml:mi></mml:mrow><mml:mn>2</mml:mn></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Results of quality parameters obtained through Iperf utility using a single controller (C<sub>Ps</sub>) without load management</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-10.tif"/>
</fig>
<p><xref ref-type="table" rid="table-5">Table 5</xref> represents the QoS parameters (B<sub>d(max)</sub>, T<sub>h</sub>, D<sub>Transfer</sub>, D<sub>E-E</sub>, etc.) for Case A with integration of Iperf utility with the Mininet environment over 10 s. When all 20,000 requests are sent to a S<sub>er-2</sub> without the use of load balancing, there is a noticeable increase in the server load (%I<sub>SL</sub>) as compared to the normal conditions. The percentage of data transfer (%D<sub>Transfer</sub>) is also drastically decreased compared to normal conditions (i.e., 200 randomly generated HTTP requests from hosts H<sub>st-1</sub>&#x2013;H<sub>st-30</sub>).</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>QoS parameters of Ser-2 using a single controller (C<sub>Ps</sub>) without a Load Balancing Algorithm</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Time in (S<sub>econds</sub>)</th>
<th>S<sub>requested</sub></th>
<th>B<sub>d(max)</sub> in (Gb/s)</th>
<th>D<sub>Transfer</sub> in (G-bytes)</th>
<th>T<sub>h</sub> in (Gb/s)</th>
<th>%I<sub>SL</sub></th>
<th>%D<sub>Transfer</sub></th>
</tr>
</thead>
<tbody>
<tr>
<td>10</td>
<td>S<sub>2</sub></td>
<td>1.449</td>
<td>1.652</td>
<td>1.322</td>
<td>77.70%</td>
<td>76.49%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Line graphs of QoS parameters (B<sub>d(max)</sub> and D<sub>Transfer</sub>) for S<sub>er-2</sub> using the Gnu Plot tool are represented in <xref ref-type="fig" rid="fig-11">Fig. 11a</xref>,<xref ref-type="fig" rid="fig-11">b</xref>.</p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Line graphs of (Bd<sub>(max)</sub> and D<sub>Transfer</sub>) for Server_2 without load management. (a) B<sub>d(max)</sub> using a single controller (C<sub>Ps</sub>) without load management. (b) D<sub>Transfer</sub> using a single controller (C<sub>Ps</sub>) without load management</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-11.tif"/>
</fig>
<sec id="s5_1_1">
<label>5.1.1</label>
<title>Summarizing QoS Parameters (<italic>B</italic><sub><italic>d(max)</italic></sub>, <italic>T</italic><sub><italic>h</italic></sub>, <italic>D</italic><sub><italic>Transfer</italic></sub>, <italic>D</italic><sub><italic>E-E</italic></sub>, <italic>etc</italic>.) Result of Case A</title>
<p>When a network topology shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref> is simulated to obtain the QoS parameters (B<sub>d(max)</sub>, Th, D<sub>Transfer</sub>, D<sub>E-E</sub>, etc.) results with only a single controller without a load management algorithm, the overall network QoS is drastically decreased. The B<sub>d</sub> decreased to the value (from 6.5 to 1.449 Gb/s). The T<sub>h</sub> value is declined from (5.612 to 1.322 Gb/s). The D<sub>Transfer</sub> is also reduced from (7.019 to 1.652 Gbytes), and a Delay of (262.5 ms) is induced in the selected network. The percentage load on the network servers (%I<sub>SL</sub>) is increased to (77.70%). The overall percentage reduction in data transfer (%D<sub>Transfer</sub>) is (76.49%).</p>

</sec>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Case-B: Evaluation of the Quality Metrics Parameters (<italic>B</italic><sub><italic>d</italic></sub><sub><italic>(max)</italic></sub>, <italic>T</italic><sub><italic>h</italic></sub>, <italic>D</italic><sub><italic>Transfer</italic></sub>, <italic>D</italic><sub><italic>E-E</italic></sub>, <italic>etc</italic>.) in a Single POX Controller-Based SDN Controller Arrangement Designed on Mininet with Proposed Server Load Management Algorithm (ISSLM) for Managing Network Data Traffic</title>
<p>In this section, the proposed algorithm (ISSLM) in the form of Python script is loaded on the POX controller, which performs server load management under the direction of (the ISSLM) algorithm. In this mode, all the HTTP requests generated from randomly available hosts (H<sub>st-1</sub> to H<sub>st-30</sub>) are first countered by an SDN controller that performs load balancing on network servers (S<sub>er1</sub>, S<sub>er2</sub>, S<sub>er3,</sub> and S<sub>er4</sub>) with the aid of the ISSLM algorithm. In ten second simulation period, 20,000 HTTP requests are directed only toward the POX controller. Using the Iperf utility, the QoS parameters for Case B are obtained and shown in <xref ref-type="fig" rid="fig-12">Fig. 12</xref>.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Results of quality parameters obtained through Iperf utility using a single controller (C<sub>Ps</sub>) with ISSLM algorithm</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-12.tif"/>
</fig>
<p><xref ref-type="table" rid="table-6">Table 6</xref> represents the QoS parameters (B<sub>d(max)</sub>, T<sub>h</sub>, D<sub>Transfer</sub>, D<sub>E-E</sub>, etc.) for Case B with integration of Iperf utility with Mininet environment over 10 s. As it is evident from <xref ref-type="table" rid="table-6">Table 6</xref> and <xref ref-type="fig" rid="fig-12">Fig. 12</xref>, the network quality parameters (B<sub>d(max)</sub>, T<sub>h</sub>, D<sub>Transfer</sub>, D<sub>E-E</sub>) are greatly increased as compared to Case A when all 20,000 HTTP requests are controlled by the controller equipped with a proposed algorithm (ISSLM). The (B<sub>d(max)</sub>) increases to 5.561 from 1.449 Gb/s. The T<sub>h</sub> improves to 4.854 from 1.322 GB/s. There is also significant increase in D<sub>Transfer</sub>, going from 1.652 G-bytes to 6.068 G-bytes. Regarding <xref ref-type="disp-formula" rid="eqn-2">Eqs. (2)</xref> and <xref ref-type="disp-formula" rid="eqn-3">(3)</xref>, the (%D<sub>Transfer</sub>) and (%I<sub>SL</sub>) drop from 76.49% to 13.55% and 77.70% to 14.44%, respectively.</p>
<table-wrap id="table-6">
<label>Table 6</label>
<caption>
<title>QoS parameters using a single controller (C<sub>Ps</sub>) with a Load Balancing Algorithm (ISSLM)</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Node</th>
<th>Time</th>
<th>B<sub>d(max)</sub></th>
<th>T<sub>h</sub></th>
<th>D<sub>Transfer</sub></th>
<th>%I<sub>SL</sub></th>
<th>%D<sub>Transfer</sub></th>
<th>D<sub>(E-E)</sub></th>
</tr>
</thead>
<tbody>
<tr>
<td>QoS parameter extraction with Cs under ISSLM</td>
<td>10 s</td>
<td>5.561 Gb/s</td>
<td>4.854 Gb/s</td>
<td>6.068 G-bytes</td>
<td>14.44%</td>
<td>13.55%</td>
<td>36.7 ms</td>
</tr>
<tr>
<td>QoS parameter extraction with Cs without ISSLM</td>
<td>10 s</td>
<td>1.449 Gb/s</td>
<td>1.322 Gb/s</td>
<td>1.652 G-bytes</td>
<td>77.70%</td>
<td>76.49%</td>
<td>513.5 ms</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Line graphs of QoS parameters (B<sub>d(max)</sub> and D<sub>Transfer</sub>) for Case B using the Gnu Plot tool are represented in <xref ref-type="fig" rid="fig-13">Figs. 13</xref> and <xref ref-type="fig" rid="fig-14">14</xref>.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>B<sub>d(max)</sub> using a single controller (C<sub>Ps</sub>) with load management algorithm (ISSLM)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-13.tif"/>
</fig><fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>D<sub>Transfer</sub> using a single controller (C<sub>Ps</sub>) with load management algorithm (ISSLM)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-14.tif"/>
</fig>
<sec id="s5_2_1">
<label>5.2.1</label>
<title>Summarizing QoS Parameters (<italic>B</italic><sub><italic>d(max)</italic></sub>, <italic>T</italic><sub><italic>h</italic></sub>, <italic>D</italic><sub><italic>Transfer</italic></sub>, <italic>D</italic><sub><italic>E-E</italic></sub>, <italic>etc</italic>.) Result of Case B</title>
<p>When a network topology shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref> is simulated to obtain the QoS parameters (B<sub>d(max),</sub> T<sub>h</sub>, D<sub>Transfer</sub>, D<sub>E-E</sub>, etc.) results with only a single controller with the proposed load management algorithm (ISSLM), the overall QoS of the network is increased as compared to Case A. The B<sub>d</sub> is maximized to the value (from 1.449 to 5.561 Gb/s). The T<sub>h</sub> value is increased from (1.322 to 4.854 Gb/s). The D<sub>Transfer</sub> is also incremented from (1.652 to 6.068 Gbytes), and Delay is reduced to (513.5 to 36.7 ms) in the selected network. The percentage load on the network servers (%I<sub>SL</sub>) is decreased up to (from 77.70% to 14.44%). The overall percentage reduction in data transfer (%D<sub>Transfer</sub>) is also less in Case B (76.49% to 13.55%).</p>

</sec>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>Case-C: Evaluation of the Quality Metrics Parameters (<italic>B</italic> <sub><italic>d</italic></sub><sub><italic>(max)</italic></sub>, <italic>T</italic><sub><italic>h</italic></sub>, <italic>D</italic><sub><italic>Transfer</italic></sub>, <italic>D</italic><sub><italic>E-E</italic></sub>, <italic>etc</italic>.) with Deployment of SDN in Logically Distributed Controlled Framework Arrangement Designed on Mininet with Proposed Server Load Management Algorithm (ISSLM) for Managing Network Data Traffic</title>
<p>In this case, the SDN architecture is framed in a logically distributed controlled arrangement, as shown in <xref ref-type="fig" rid="fig-15">Fig. 15</xref>. Thirty hosts (H<sub>st-1</sub> to H<sub>st-30</sub>) are divided into four logically distributed SDN-based sub-networks (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3,</sub> and L<sub>d4</sub>), each of which is overseen by a separate dedicated controller (C<sub>d1</sub>, C<sub>d2</sub>, C<sub>d3,</sub> and C<sub>d4</sub>). Now, instead of handling 20,000 HTTP requests by the single controller (C<sub>Ps</sub>), the C<sub>d1</sub> and C<sub>d3</sub>, handle 6000 HTTP requests apiece that come from network devices in sub-networks L<sub>d1</sub> and L<sub>d3</sub>, respectively, using a proposed algorithm (ISSLM). Similarly, 4000 HTTP requests apiece are managed by C<sub>d2</sub> and C<sub>d4</sub> and directed from network devices inside L<sub>d2</sub> and L<sub>d4</sub> using the ISSLM algorithm with the help of logic presented in <xref ref-type="table" rid="table-4">Table 4</xref>. Higher-level controllers C<sub>p1</sub> and C<sub>p2</sub> are responsible for overall network flow control management and fault tolerance.</p>
<fig id="fig-15">
<label>Figure 15</label>
<caption>
<title>The proposed network configuration for deploying SDN in large DCNs</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-15.tif"/>
</fig>
<p>The subnetwork controllers (C<sub>d1</sub>, C<sub>d2</sub>, C<sub>d3</sub> and C<sub>d4</sub>) have an IP address as (11.0.1.1, 12.0.1.1, 13.0.1.1, and 14.0.1.1), respectively. For subnetworks (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub> and L<sub>d4</sub>), the corresponding IP addresses are (11.0.1.2, 12.0.1.2, 13.0.1.2 and 14.0.1.2), respectively. <xref ref-type="fig" rid="fig-16">Fig. 16</xref> illustrates the values of (B<sub>d(max)</sub>, T<sub>h</sub>, and D<sub>Transfer</sub>) in all sub-divided networks (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3,</sub> and L<sub>d4</sub>) using the Iperf utility.</p>
<fig id="fig-16">
<label>Figure 16</label>
<caption>
<title>QoS parametric values of four subdivided networks (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub>, and L<sub>d4</sub>) using Iperf utility. (a): Displays the QoS parametric values for (L<sub>d1</sub>) using Iperf utility. (b): Displays the QoS parametric values for (L<sub>d2</sub>) using the Iperf utility. (c): Displays the QoS parametric values for (L<sub>d3</sub>) using Iperf utility. (d): Displays the QoS parametric values for (L<sub>d4</sub>) using the Iperf utility</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-16a.tif"/><graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-16b.tif"/>
</fig>
<p>As evidenced by <xref ref-type="table" rid="table-7">Table 7</xref> and <xref ref-type="fig" rid="fig-16">Fig. 16</xref>, the QoS parametric values in the proposed framework (logically distributed controlled arrangement) by implementing the proposed algorithm (ISSLM) are far greater than the quality requests obtained from the Case (A and B).</p>
<table-wrap id="table-7">
<label>Table 7</label>
<caption>
<title>Comparative analysis of QoS parametric values obtained in all three portions</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Terminal</th>
<th>Time in (S<sub>econds</sub>)</th>
<th>B<sub>d(max)</sub> in (Gb/s)</th>
<th>T<sub>h</sub> in (Gb/s)</th>
<th>D<sub>Transfer</sub> in (G-bytes)</th>
<th>%I<sub>SL</sub></th>
<th>%D<sub>Transfer</sub></th>
</tr>
</thead>
<tbody>
<tr>
<td>QoS parameters of Case A</td>
<td>10</td>
<td>1.449</td>
<td>1.322</td>
<td>1.652</td>
<td>77.70%</td>
<td>76.49%</td>
</tr>
<tr>
<td>QoS parameters of Case B</td>
<td>10</td>
<td>5.561</td>
<td>4.854</td>
<td>6.068</td>
<td>14.44%</td>
<td>13.55%</td>
</tr>
<tr>
<td>QoS parameters for local domain (L<sub>d1</sub>)</td>
<td>10</td>
<td>5.901</td>
<td>5.072</td>
<td>6.340</td>
<td>9.21%</td>
<td>9.67%</td>
</tr>
<tr>
<td>QoS parameters for local domain (L<sub>d2</sub>)</td>
<td>10</td>
<td>6.101</td>
<td>5.201</td>
<td>6.501</td>
<td>6.14%</td>
<td>7.38%</td>
</tr>
<tr>
<td>QoS parameters for local domain (L<sub>d3</sub>)</td>
<td>10</td>
<td>5.901</td>
<td>5.072</td>
<td>6.340</td>
<td>9.21%</td>
<td>9.67%</td>
</tr>
<tr>
<td>QoS parameters for local domain (L<sub>d4</sub>)</td>
<td>10</td>
<td>6.101</td>
<td>5.201</td>
<td>6.501</td>
<td>6.14%</td>
<td>7.38%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It is the dividend from <xref ref-type="table" rid="table-7">Table 7</xref> that (B<sub>d(max)</sub>) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3,</sub> and L<sub>d4</sub>) has increased to (5.901, 6.101, 5.901, 6.101 Gb/s), respectively, from (5.561 Gb/s), as recorded under QoS parameters in Case B. Similarly (T<sub>h</sub>) for each subnetwork has increased from 4.854 Gb/s (throughput as QoS parametric value in Case B) to (5.072, 5.201, 5.072, 5.201 Gb/s) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub> and L<sub>d4</sub>), respectively. (D<sub>Transfer</sub>) for each subnetwork has increased from 6.068 Gbytes (Data transfer as QoS parametric value in Case B) to (6.340, 6.501, 6.340, 6.501 Gbytes) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub> and L<sub>d4</sub>), respectively. Moreover, the (%I<sub>SL</sub>) has dropped throughout the corresponding sub-networks from 14.44% (QoS parametric value in Case B) to (9.21%, 6.14%, 9.21%, 6.14%), for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3,</sub> and L<sub>d4</sub>), respectively. The (%D<sub>Transfer</sub>) has dropped throughout the corresponding subnetworks from 13.55% (QoS parametric value in Case B) to (9.67%, 7.38%, 9.67%, 7.38%), for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3,</sub> and L<sub>d4</sub>), respectively. These differences in B<sub>d(max)</sub>and D<sub>Transfer</sub> across the segmented networks (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub>, and L<sub>d4</sub>) are graphically represented in line graph format using the Gnu plot in <xref ref-type="fig" rid="fig-17">Fig. 17</xref>.</p>
<fig id="fig-17">
<label>Figure 17</label>
<caption>
<title>Line Graphs of QoS parametric values of four local domains (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub>, and L<sub>d4</sub>) using Gnu-plot. (a): B<sub>d(max)</sub> for (L<sub>d1</sub> and L<sub>d3</sub>) with the proposed algorithm (ISSLM). (b): B<sub>d(max)</sub> for (L<sub>d2</sub> and L<sub>d4</sub>) with the proposed algorithm (ISSLM). (c): D<sub>Transfer</sub> for (L<sub>d1</sub> and L<sub>d3</sub>) with the proposed algorithm (ISSLM). (d): D<sub>Transfer</sub> for (L<sub>d2</sub> and L<sub>d4</sub>) with the proposed algorithm (ISSLM)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-17a.tif"/><graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-17b.tif"/>
</fig>
<sec id="s5_3_1">
<label>5.3.1</label>
<title>Summarizing QoS Parameters (<italic>B</italic><sub><italic>d(max)</italic></sub>, <italic>T</italic><sub><italic>h</italic></sub>, <italic>D</italic><sub><italic>Transfer</italic></sub>, <italic>D</italic><sub><italic>E-E</italic></sub>, <italic>etc</italic>.) Result of Case C</title>
<p>When a network is framed in a logically distributed controlled environment, as shown in <xref ref-type="fig" rid="fig-15">Fig. 15</xref>, the QoS parameters (B<sub>d(max),</sub> T<sub>h</sub>, D<sub>transfer</sub>, D<sub>E-E</sub>, etc.) results are far more superior as compared to QoS parameters of Case (A &#x0026; B). The B<sub>d</sub> is maximized from (5.561 Gb/s) in Case B to (5.901, 6.101, 5.901, 6.101 Gb/s) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub> and L<sub>d4</sub>), respectively. The T<sub>h</sub> value is increased from (4.854 Gb/s) in Case B to (5.072, 5.201, 5.072, 5.201 Gb/s) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub> and L<sub>d4</sub>), respectively. The D<sub>transfer</sub> is also incremented from (6.068 Gbytes) in Case B to (6.340, 6.501, 6.340, 6.501 Gbytes) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub> and L<sub>d4</sub>) respectively and Delay is reduced from (36.7 ms) in Case B to (3.57, 0.87, 3.57, 0.87 ms) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub> and L<sub>d4</sub>) respectively in the selected network. The percentage load on the network servers (%I<sub>SL</sub>) decreased from (14.44%) in Case B to (9.21%, 6.14%, 9.21%, 6.14%) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3</sub> and L<sub>d4</sub>), respectively. The overall percentage reduction in data transfer (%D<sub>Transfer</sub>) is also less in Case C (9.67%, 7.38%, 9.67%, 7.38%) for (L<sub>d1</sub>, L<sub>d2</sub>, L<sub>d3,</sub> and L<sub>d4</sub>), respectively.</p>

</sec>
</sec>
<sec id="s5_4">
<label>5.4</label>
<title>Case-D: Evaluating the Performance in Terms of QoS Parameters of the Proposed Framework (Logically Distributed Controlled Environment) under ISSLM in Comparison with Traditional Load Balancing Methods</title>
<p>In Case D, we tested and gathered the QoS parameter values (B<sub>d(max)</sub>, T<sub>h</sub>, D<sub>transfer</sub>, D_T<sub>ransmission</sub>_D<sub>elay</sub>) result with the application of the following latest and widely used load balancing techniques mentioned in <xref ref-type="table" rid="table-1">Table 1</xref> one by one on the user-defined network to compare it with the proposed method (ISSLM) as they also based on Mininet environment as our proposed technique.</p>

<p>&#x2022; Dynamic Weight Random Selection Method (DWRS) in [<xref ref-type="bibr" rid="ref-50">50</xref>]</p>
<p>&#x2022; Multiple Regression Based Search Algorithm (MRBS) in [<xref ref-type="bibr" rid="ref-51">51</xref>]</p>
<p>&#x2022; Adoptive Multiple Objective Load Balancing (AMLOB) in [<xref ref-type="bibr" rid="ref-55">55</xref>]</p>
<p>&#x2022; Shortest Time Calculation Method (SRT) in [<xref ref-type="bibr" rid="ref-63">63</xref>]</p>
<p>&#x2022; Conventional Round Robin Method (CRRM) in [<xref ref-type="bibr" rid="ref-64">64</xref>]</p>
<p>The results of Case D are summarized in <xref ref-type="table" rid="table-8">Table 8</xref>. The network QoS parameters are tested for all the above methods, including the proposed technique in two load conditions (normal flow: 200 HTTP requests to be managed by the SDN controller and heavy flow: 20,000 HTTP requests to be managed by the SDN controller). The D<sub>elay</sub>_T<sub>ransmission</sub> is calculated by <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref> in both modes (heavy flow mode: M<sub>2</sub> and normal flow mode: M<sub>1</sub>). The differential transmission Delay (D_T<sub>ransmission</sub>_D<sub>elay</sub>), as shown in <xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref>, is a difference in milliseconds of transmission delay in (Heavy flow mode to normal flow mode: Transmission delay in M<sub>2</sub>&#x2013;Transmission Delay in M<sub>1</sub>). The main reason for finding this parameter, in addition to the transmission delay, is to see how much delay is produced in ms when the load shifts from normal to heavy mode. The last column of <xref ref-type="table" rid="table-8">Table 8</xref> explains the difference in transmission delay in ms when the load shifts from normal mode to heavy flow mode. The QoS metrics (B<sub>d(max)</sub>, T<sub>h</sub>, D<sub>Transfer</sub>) obtained under normal loaded conditions include a maximum bandwidth (B<sub>d(max)</sub>) of 4.02 Gb/s and a data transfer (D<sub>Transfer</sub>) volume of 7.02 Gbytes for 15 s.<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>y</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mi>D</mml:mi><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>f</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>G</mml:mi><mml:mi>b</mml:mi><mml:mi>y</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mn>8</mml:mn></mml:mrow><mml:mrow><mml:mi>B</mml:mi><mml:mi>d</mml:mi><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>G</mml:mi><mml:mi>b</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>O</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>y</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>y</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>M</mml:mi><mml:mn>2</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>y</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>T</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>M</mml:mi><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<table-wrap id="table-8">
<label>Table 8</label>
<caption>
<title>Contrasting QoS variables results calculated from Iperf utility</title>
</caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th>Technique utilized</th>
<th>Time in (S<sub>econds</sub>)</th>
<th>B<sub>d(max)</sub> in (Gb/s)</th>
<th>T<sub>h</sub> in (Gb/s)</th>
<th>D<sub>Transfer</sub> in (G-bytes)</th>
<th>D_T<sub>ransmission</sub>_D<sub>elay</sub></th>
</tr>
</thead>
<tbody>
<tr>
<td>Research technique ISSLM Algorithm</td>
<td>15 </td>
<td>3.469</td>
<td>3.232</td>
<td>6.059</td>
<td>2.80</td>
</tr>
<tr>
<td>(SRT)</td>
<td>15</td>
<td>1.499</td>
<td>1.40</td>
<td>2.629</td>
<td>60.58</td>
</tr>
<tr>
<td>(CRRM) method</td>
<td>15</td>
<td>1.449</td>
<td>1.386</td>
<td>2.599</td>
<td>379.10</td>
</tr>
<tr>
<td>(DWRS) method</td>
<td>15</td>
<td>3.229</td>
<td>3.013</td>
<td>5.649</td>
<td>25.564</td>
</tr>
<tr>
<td>(MRBS) method</td>
<td>15 </td>
<td>3.025</td>
<td>2.82</td>
<td>5.299</td>
<td>43.78</td>
</tr>
<tr>
<td>(AMLOB) method</td>
<td>15</td>
<td>2.796</td>
<td>2.6133</td>
<td>4.899</td>
<td>47.06</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>where (M1 &#x003D; Normal data traffic mode) and M2 &#x003D; (Heavy data traffic mode).</p>
<p><xref ref-type="fig" rid="fig-18">Figs. 18</xref>&#x2013;<xref ref-type="fig" rid="fig-20">20</xref> show the contrast of QoS variable (B<sub>d(max)</sub>, D<sub>Transfer</sub>, D_T<sub>ransmission</sub>_D<sub>elay</sub>) results obtained from the Iperf utility under the proposed framework (logically distributed) using the Gnu plot.</p>
<fig id="fig-18">
<label>Figure 18</label>
<caption>
<title>Contrasting the QoS variable (B<sub>d(max)</sub>) results from different traditional methods with the research technique (ISSLM)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-18.tif"/>
</fig><fig id="fig-19">
<label>Figure 19</label>
<caption>
<title>Contrasting QoS variable (D<sub>Transfer</sub>) results from different traditional methods with the research technique (ISSLM)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-19.tif"/>
</fig><fig id="fig-20">
<label>Figure 20</label>
<caption>
<title>Contrasting QoS variable (D_T<sub>ransmission</sub>_D<sub>elay</sub>) results from different traditional methods with the research technique (ISSLM)</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMES_53903-fig-20.tif"/>
</fig>
<sec id="s5_4_1">
<label>5.4.1</label>
<title>Summarizing QoS Parameters (<italic>B</italic><sub><italic>d(max)</italic></sub>, <italic>T</italic><sub><italic>h</italic></sub>, <italic>D</italic><sub><italic>Transfer</italic></sub>, <italic>D_T</italic><sub><italic>ransmission</italic></sub><italic>_D</italic><sub><italic>elay</italic></sub>, <italic>etc</italic>.) Result of Comparative Analysis</title>
<p>When a network is framed in a logically distributed controlled environment, as shown in <xref ref-type="fig" rid="fig-15">Fig. 15</xref>, the QoS parameters (B<sub>d(max),</sub> T<sub>h</sub>, D<sub>Transfer</sub>, D_T<sub>ransmission</sub>_D<sub>elay</sub>, etc.) results with the proposed algorithm ISSLM are far more superior as compared to QoS parameters obtained from the traditional methods namely: SRT, CRRM, DWRS, MRBS and AMLOB. The B<sub>d</sub> value in the selected network with the proposed algorithm-based framework is (3.649 Gb/s) as compared to (1.499, 1.449, 3.229, 3.025, 2.796 Gb/s) for (SRT, CRRM, DWRS<sub>,</sub> MRBS, and AMLOB), respectively. The T<sub>h</sub> value in the selected network with the proposed algorithm-based framework is (3.232 Gb/s) as compared to (1.40, 1.386, 3.013, 2.82, 2.6133 Gb/s) for (SRT, CRRM, DWRS, MRBS, and AMLOB), respectively. The D<sub>transfer</sub> value in the selected network with the proposed algorithm-based framework is (6.059 Gbytes) as compared to (2.629, 2.599, 5.649, 5.299, 4.899 Gbytes) for (SRT, CRRM, DWRS<sub>,</sub> MRBS, and AMLOB) respectively and D_T<sub>ransmission</sub>_D<sub>elay</sub> in the selected network with proposed algorithm based framework is (2.80 ms) as compared to (60.58, 379.10, 25.564, 43.78, 47.06 ms) for (SRT, CRRM, DWRS<sub>,</sub> MRBS and AMLOB), respectively.</p>

</sec>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>In this research article, we have accomplished our goal of magnifying the network quality parameters (maximum available bandwidth, greater throughput, and higher data transfer) in large DCNs by applying the proposed algorithm, ISSLM on SDN controllers arranged in logically distributed arrangement with the utilization of two new methods (1) A large SDN based DCN is divided into sub-networks with independent controllers to overcome the bottleneck issues of the unified controller and also nullifying the compatibilities issues with use of multiple controllers in single large network. (2) Each local controller manages the load by adopting the ISSLM algorithm that performs the desired task of shifting load to the most suitable controller based on three conditions (A-server have less RPS value (OR) B-server with fewer concurrent requests (OR) C-server with less response time). For testing, the virtual network (with many network devices) is formed on Mininet, and simulation is performed in three different configurations: (1) A single POX controller-based SDN controller arrangement designed on Mininet without any server load management algorithm for managing network traffic. (2) A single POX controller-based SDN controller arrangement designed on Mininet with a proposed server load management algorithm (ISSLM) for managing network traffic. (3) Deployment of SDN in logically distributed controlled framework arrangement designed on Mininet with proposed server load management algorithm (ISSLM) for managing network data traffic. Case C&#x2019;s QoS parametrized values (Bd<sub>(max)</sub>, T<sub>h</sub>, D<sub>Transfer</sub>, D_T<sub>ransmission</sub>_D<sub>elay</sub>, etc.) showed that the proposed framework with ISSLM algorithm performed better server load management in Large DCNs. The comparative analysis results of the proposed algorithm ISSLM are far more superior as compared to QoS parameters obtained from the traditional methods, namely: SRT, CRRM, DWRS, MRBS and AMLOB. The Bd<sub>max</sub> value in the selected network with the proposed algorithm-based framework is (3.649 Gb/s) as compared to (1.499, 1.449, 3.229, 3.025, 2.796 Gb/s) for (SRT, CRRM, DWRS, MRBS and AMLOB), respectively. The T<sub>h</sub> value in the selected network with the proposed algorithm-based framework is (3.232 Gb/s) as compared to (1.40, 1.386, 3.013, 2.82, 2.6133 Gb/s) for (SRT, CRRM, DWRS, MRBS, and AMLOB), respectively. The Dtransfer value in the selected network with the proposed algorithm based framework is (6.059 Gbytes) as compared to (2.629, 2.599, 5.649, 5.299, 4.899 Gbytes) for (SRT, CRRM, DWRS, MRBS and AMLOB), respectively and D_T<sub>ransmission</sub>_D<sub>elay</sub> in the selected network with proposed algorithm based framework is (2.80 ms) as compared to (60.58, 379.10, 25.564, 43.78, 47.06 ms) for (SRT, CRRM, DWRS, MRBS and AMLOB), respectively. However, one possible limitation of this research study is that it has been conducted in a controlled or simulated environment; the obtained results can show slight variation when the proposed technique is made functional in real-world conditions and is strongly tied to the performance and reliability of the SDN controllers.</p>
</sec>
</body>
<back>
<ack><p>Special thanks to Shahid Atiq, Muhammad Majid Hussain, and Intisar Ali Sajjad for guiding and supporting the implementation of the QoS Enhancement Method ISSLM Algorithm. Also, special thanks to Malik Muhammad Abdul Basit for manuscript preparation.</p>
</ack>
<sec><title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec><title>Author Contributions</title>
<p>The author&#x2019;s contributions to this paper are as follows: study conception and design: Khawaja Tahir Mehmood, Shahid Atiq; data collection: Khawaja Tahir Mehmood, Shahid Atiq; analysis and interpretation of results: Khawaja Tahir Mehmood, Shahid Atiq; draft manuscript preparation: Khawaja Tahir Mehmood, Shahid Atiq, Intisar Ali Sajjad, Muhammad Majid Hussain, Malik M. Abdul Basit. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability"><title>Availability of Data and Materials</title>
<p>The supporting data related to the algorithm and simulation material technical details are with the corresponding author and can be provided upon appropriate request.</p>
</sec>
<sec><title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement"><title>Conflicts of Interest</title>
<p>The authors declare that have no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>1.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><collab>Cisco</collab></person-group>. <source>Annual internet report (2018&#x2013;2023) white paper</source>. <publisher-name>Cisco</publisher-name>; <year>2020</year>. <year>Available from:</year> <ext-link ext-link-type="uri" xlink:href="https://www.cisco.com/c/en/us/solutions/collateral/executive-perspectives/annual-internet-report/white-paper-c11-741490.html">https://www.cisco.com/</ext-link><ext-link ext-link-type="uri" xlink:href="https://www.cisco.com/c/en/us/solutions/collateral/executive-perspectives/annual-internet-report/white-paper-c11-741490.html">c/en/us/solutions/collateral/executive-perspectives/annual-internet-report/white-paper-c11-741490.html</ext-link>. <comment>[Accessed 2020]</comment>.</mixed-citation></ref>
<ref id="ref-2"><label>2.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Sloane</surname> <given-names>T</given-names></string-name></person-group>. <source>Software-defined networking: the new norm for networks</source>. <publisher-name>Open Networking Foundation</publisher-name>; <year>2013</year>. <year>Available from: </year><ext-link ext-link-type="uri" xlink:href="https://opennetworking.org/sdn-resources/whitepapers/software-defined-networking-the-new-norm-for-networks/">https://opennetworking.org/sdn-resources/whitepapers/software-defined-networking-the-new-norm-for-networks/</ext-link>. <comment>[Accessed 2020]</comment>.</mixed-citation></ref>
<ref id="ref-3"><label>3.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gomez-Rodriguez</surname> <given-names>JR</given-names></string-name>, <string-name><surname>Sandoval-Arechiga</surname> <given-names>R</given-names></string-name>, <string-name><surname>Ibarra-Delgado</surname> <given-names>S</given-names></string-name>, <string-name><surname>Rodriguez-Abdala</surname> <given-names>VI</given-names></string-name>, <string-name><surname>Vazquez-Avila</surname> <given-names>JL</given-names></string-name>, <string-name><surname>Parra-Michel</surname> <given-names>R</given-names></string-name></person-group>. <article-title>A survey of software-defined networks-on-chip: motivations, challenges and opportunities</article-title>. <source>Micromachines</source>. <year>2021 Feb 12</year>;<volume>12</volume>(<issue>2</issue>):<fpage>183</fpage>. doi:<pub-id pub-id-type="doi">10.3390/mi12020183</pub-id>; <pub-id pub-id-type="pmid">33673049</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>4.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jenabzadeh</surname> <given-names>MR</given-names></string-name>, <string-name><surname>Ayatollahitafti</surname> <given-names>V</given-names></string-name>, <string-name><surname>Mollakhalili</surname> <given-names>MR</given-names></string-name>, <string-name><surname>Mollahoseini Ardakani</surname> <given-names>MR</given-names></string-name></person-group>. <article-title>VNR_CCP: a new approach to congestion control using virtualization technique and switch migration in SDN</article-title>. <source>J Model Eng</source>. <year>2024 May</year>;<volume>22</volume>(<issue>76</issue>):<fpage>85</fpage>&#x2013;<lpage>98</lpage>.</mixed-citation></ref>
<ref id="ref-5"><label>5.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kaur</surname> <given-names>S</given-names></string-name>, <string-name><surname>Sandhu</surname> <given-names>AK</given-names></string-name>, <string-name><surname>Bhandari</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Investigation of application layer DDoS attacks in legacy and software-defined networks: a comprehensive review</article-title>. <source>Int J Inf Secur</source>. <year>2023 Aug 7</year>;<volume>22</volume>(<issue>6</issue>):<fpage>1949</fpage>&#x2013;<lpage>88</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10207-023-00728-5</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>6.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Salti</surname> <given-names>IA</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>N</given-names></string-name></person-group>. <article-title>An effective, efficient and scalable link discovery (EESLD) framework for hybrid multi-controller SDN networks</article-title>. <source>IEEE Access</source>. <year>2023 Jan</year>;<volume>11</volume>:<fpage>140660</fpage>&#x2013;<lpage>86</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2023.3339381</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>7.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Imran Hussain</surname> <given-names>S</given-names></string-name>, <string-name><surname>Yesvanth</surname> <given-names>R</given-names></string-name>, <string-name><surname>Yuvarajapathi</surname> <given-names>V</given-names></string-name></person-group>. <article-title>Implementing OpenFlow, exploring the present and future software-defined networks ecosystem</article-title>. In: <conf-name>International Conference on Sustainable Communication Networks and Application (ICSCNA)</conf-name>, <year>2023</year>; <publisher-loc>Theni, India</publisher-loc>; p. <fpage>280</fpage>&#x2013;<lpage>5</lpage>.</mixed-citation></ref>
<ref id="ref-8"><label>8.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sezer</surname> <given-names>S</given-names></string-name>, <string-name><surname>Scott-Hayward</surname> <given-names>S</given-names></string-name>, <string-name><surname>Chouhan</surname> <given-names>P</given-names></string-name>, <string-name><surname>Fraser</surname> <given-names>B</given-names></string-name>, <string-name><surname>Lake</surname> <given-names>D</given-names></string-name>, <string-name><surname>Finnegan</surname> <given-names>J</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Are we ready for SDN? Implementation challenges for software-defined networks</article-title>. <source>IEEE Commun Mag</source>. <year>2013</year>;<volume>51</volume>(<issue>7</issue>):<fpage>36</fpage>&#x2013;<lpage>43</lpage>. doi:<pub-id pub-id-type="doi">10.1109/MCOM.2013.6553676</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>9.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Karakus</surname> <given-names>M</given-names></string-name>, <string-name><surname>Durresi</surname> <given-names>A</given-names></string-name></person-group>. <article-title>A survey: control plane scalability issues and approaches in Software-Defined Networking (SDN)</article-title>. <source>Comput Netw</source>. <year>2017 Jan</year>;<volume>112</volume>:<fpage>279</fpage>&#x2013;<lpage>93</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comnet.2016.11.017</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>10.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Javadpour</surname> <given-names>A</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>G</given-names></string-name>, <string-name><surname>Rezaei</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Resource management in a peer-to-peer cloud network for IoT</article-title>. <source>Wirel Pers Commun</source>. <year>2020 Aug</year>;<volume>115</volume>(<issue>3</issue>):<fpage>2471</fpage>&#x2013;<lpage>88</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11277-020-07691-7</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>11.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Javadpour</surname> <given-names>A</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>G</given-names></string-name></person-group>. <article-title>cTMvSDN: improving resource management using combination of Markov-process and TDMA in software-defined networking</article-title>. <source>J Supercomput</source>. <year>2021</year>;<volume>Jul;78</volume>(<issue>3</issue>):<fpage>3477</fpage>&#x2013;<lpage>99</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11227-021-03871-9</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>12.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Manzoor</surname> <given-names>S</given-names></string-name>, <string-name><surname>Kayani</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Ali</surname> <given-names>N</given-names></string-name>, <string-name><surname>Ratyal</surname> <given-names>NI</given-names></string-name>, <string-name><surname>Mohamed</surname> <given-names>HG</given-names></string-name></person-group>. <article-title>TiWA: achieving tetra indicator Wi-Fi associations in software defined Wi-Fi networks</article-title>. <source>IEEE Access</source>. <year>2023 Jan</year>;<volume>11</volume>:<fpage>89520</fpage>&#x2013;<lpage>34</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2023.3307476</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>13.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Kalafatidis</surname> <given-names>S</given-names></string-name>, <string-name><surname>Demiroglou</surname> <given-names>V</given-names></string-name>, <string-name><surname>Mamatas</surname> <given-names>L</given-names></string-name>, <string-name><surname>Tsaoussidis</surname> <given-names>V</given-names></string-name></person-group>. <article-title>Experimenting with an SDN-Based NDN deployment over wireless mesh networks</article-title>. In: <conf-name>IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</conf-name>, <year>2022</year>; <publisher-loc>New York, NY, USA</publisher-loc>; p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>. </mixed-citation></ref>
<ref id="ref-14"><label>14.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kobo</surname> <given-names>HI</given-names></string-name>, <string-name><surname>Abu-Mahfouz</surname> <given-names>AM</given-names></string-name>, <string-name><surname>Hancke</surname> <given-names>GP</given-names></string-name></person-group>. <article-title>A survey on software-defined wireless sensor networks: challenges and design requirements</article-title>. <source>IEEE Access</source>. <year>2017</year>;<volume>5</volume>:<fpage>1872</fpage>&#x2013;<lpage>99</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2017.2666200</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>15.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kreutz</surname> <given-names>D</given-names></string-name>, <string-name><surname>Ramos</surname> <given-names>FMV</given-names></string-name>, <string-name><surname>Esteves Verissimo</surname> <given-names>P</given-names></string-name>, <string-name><surname>Esteve Rothenberg</surname> <given-names>C</given-names></string-name>, <string-name><surname>Azodolmolky</surname> <given-names>S</given-names></string-name>, <string-name><surname>Uhlig</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Software-defined networking: a comprehensive survey</article-title>. <source>Proc IEEE</source>. <year>2015 Jan</year>;<volume>103</volume>(<issue>1</issue>):<fpage>14</fpage>&#x2013;<lpage>76</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JPROC.2014.2371999</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>16.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shah</surname> <given-names>N</given-names></string-name>, <string-name><surname>Giaccone</surname> <given-names>P</given-names></string-name>, <string-name><surname>Rawat</surname> <given-names>DB</given-names></string-name>, <string-name><surname>Rayes</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Solutions for adopting software defined network in practice</article-title>. <source>Int J Commun Syst</source>. <year>2019 May 1</year>;<volume>32</volume>(<issue>17</issue>):<fpage>e3990</fpage>. doi:<pub-id pub-id-type="doi">10.1002/dac.3990</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>17.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zuo</surname> <given-names>QY</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>GS</given-names></string-name>, <string-name><surname>Xing</surname> <given-names>CY</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>GM</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>PC</given-names></string-name></person-group>. <article-title>Research on OpenFlow-based SDN technologies</article-title>. <source>J Softw</source>. <year>2013 Dec 1</year>;<volume>24</volume>(<issue>5</issue>):<fpage>1078</fpage>&#x2013;<lpage>97</lpage>. doi:<pub-id pub-id-type="doi">10.3724/SP.J.1001.2013.04390</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>18.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Stribling</surname> <given-names>J</given-names></string-name>, <string-name><surname>Sovran</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>I</given-names></string-name>, <string-name><surname>Pretzer</surname> <given-names>X</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name>, <string-name><surname>Kaashoek</surname> <given-names>MF</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Flexible, wide-area storage for distributed systems with WheelFS</article-title>. <source>Netw Syst Des Implement</source>. <year>2009 Apr</year>;<volume>4</volume>:<fpage>43</fpage>&#x2013;<lpage>58</lpage>.</mixed-citation></ref>
<ref id="ref-19"><label>19.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Koponen</surname> <given-names>T</given-names></string-name>, <string-name><surname>Casado</surname> <given-names>M</given-names></string-name>, <string-name><surname>Gude</surname> <given-names>N</given-names></string-name>, <string-name><surname>Stribling</surname> <given-names>J</given-names></string-name>, <string-name><surname>Poutievski</surname> <given-names>L</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>M</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Onix: a distributed control platform for large-scale production networks</article-title>. <source>Proc OSDI</source>. <year>2010</year>;<volume>10</volume>:<fpage>1</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-20"><label>20.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Medved</surname> <given-names>J</given-names></string-name>, <string-name><surname>Varga</surname> <given-names>R</given-names></string-name>, <string-name><surname>Tkacik</surname> <given-names>A</given-names></string-name>, <string-name><surname>Gray</surname> <given-names>K</given-names></string-name></person-group>. <article-title>OpenDaylight: towards a model-driven SDN controller architecture</article-title>. In: <conf-name>Proceeding of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks</conf-name>, <year>2014</year>; <publisher-loc>Sydney, NSW, Australia</publisher-loc>; p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>. </mixed-citation></ref>
<ref id="ref-21"><label>21.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Akka</collab></person-group>. <article-title>Build concurrent, distributed, and resilient message-driven applications for java and scala</article-title>. Available from: <ext-link ext-link-type="uri" xlink:href="https://akka.io/">https://akka.io/</ext-link>. <comment>[Accessed 2020]</comment>.</mixed-citation></ref>
<ref id="ref-22"><label>22.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Suh</surname> <given-names>D</given-names></string-name>, <string-name><surname>Jang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Han</surname> <given-names>S</given-names></string-name>, <string-name><surname>Pack</surname> <given-names>S</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>T</given-names></string-name>, <string-name><surname>Kwak</surname> <given-names>JY</given-names></string-name></person-group>. <article-title>On performance of OpenDaylight clustering</article-title>. In: <conf-name>IEEE NetSoft Conference and Workshops (NetSoft)</conf-name>, <year>2016</year>; <publisher-loc>Seoul, Republic of Korea</publisher-loc>; p. <fpage>407</fpage>&#x2013;<lpage>10</lpage>. </mixed-citation></ref>
<ref id="ref-23"><label>23.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Berde</surname> <given-names>P</given-names></string-name>, <string-name><surname>Gerola</surname> <given-names>M</given-names></string-name>, <string-name><surname>Hart</surname> <given-names>J</given-names></string-name>, <string-name><surname>Higuchi</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Kobayashi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Koide</surname> <given-names>T</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>ONOS: towards an open, distributed SDN OS</article-title>. In: <conf-name>Proceedings of the Third Workshop on Hot Topics in Software Defined Networking</conf-name>, <year>2014</year>; <publisher-loc>Chicago, IL, USA</publisher-loc>; p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>. </mixed-citation></ref>
<ref id="ref-24"><label>24.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sakic</surname> <given-names>E</given-names></string-name>, <string-name><surname>Kellerer</surname> <given-names>W</given-names></string-name></person-group>. <article-title>Response time and availability study of RAFT consensus in distributed SDN control plane</article-title>. <source>IEEE Trans Netw Serv Manag</source>. <year>2018 Mar</year>;<volume>15</volume>(<issue>1</issue>):<fpage>304</fpage>&#x2013;<lpage>18</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TNSM.2017.2775061</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>25.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Atomix</collab></person-group>. <article-title>A reactive java framework for building fault-tolerant distributed systems</article-title>. Available from: <ext-link ext-link-type="uri" xlink:href="https://atomix.io/">https://atomix.io/</ext-link> <comment>[Accessed 2020]</comment>.</mixed-citation></ref>
<ref id="ref-26"><label>26.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hunt</surname> <given-names>P</given-names></string-name>, <string-name><surname>Konar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Junqueira</surname> <given-names>FP</given-names></string-name>, <string-name><surname>Reed</surname> <given-names>B</given-names></string-name></person-group>. <article-title>ZooKeeper: wait-free coordination for internet-scale systems</article-title>. In: <conf-name>USENIX Annual Technical Conference</conf-name>, <year>2010</year>; <publisher-loc>Boston, MA, USA</publisher-loc>; p. <fpage>11</fpage>.</mixed-citation></ref>
<ref id="ref-27"><label>27.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Rehman</surname> <given-names>AU</given-names></string-name>, <string-name><surname>RuiL</surname> <given-names>A</given-names></string-name>, <string-name><surname>Barraca</surname> <given-names>JP</given-names></string-name></person-group>. <article-title>Fault-tolerance in the scope of software-defined networking (SDN)</article-title>. <source>IEEE Access</source>. <year>2019</year>;<volume>7</volume>:<fpage>124474</fpage>&#x2013;<lpage>90</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2019.2939115</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>28.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Katta</surname> <given-names>N</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Freedman</surname> <given-names>M</given-names></string-name>, <string-name><surname>Rexford</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Ravana: controller fault-tolerance in software-defined networking</article-title>. In: <conf-name>Proceedings of the 1st ACM SIGCOMM Symposium on Software Defined Networking Research</conf-name>, <year>2015</year>; <publisher-loc>Santa Clara, CA, USA</publisher-loc>; p. <fpage>1</fpage>&#x2013;<lpage>13</lpage>. </mixed-citation></ref>
<ref id="ref-29"><label>29.</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Mantas</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ramos</surname> <given-names>FMV</given-names></string-name></person-group>. <source>Consistent and fault-tolerant SDN with unmodified switches</source>. <publisher-loc>Cornell University</publisher-loc>: <publisher-name>USA</publisher-name>; <year>2016 Jan</year>.</mixed-citation></ref>
<ref id="ref-30"><label>30.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yeganeh</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ganjali</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Kandoo: a framework for efficient and scalable offloading of control applications</article-title>. In: <conf-name>Proceedings of the First Workshop on Hot Topics in Software Defined Networks, ACM SIGCOMM</conf-name>, <year>2012</year>; <publisher-loc>Helsinki, Finland</publisher-loc>; p. <fpage>19</fpage>&#x2013;<lpage>24</lpage>. </mixed-citation></ref>
<ref id="ref-31"><label>31.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jain</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zolla</surname> <given-names>J</given-names></string-name>, <string-name><surname>H&#x00F6;lzle</surname> <given-names>U</given-names></string-name>, <string-name><surname>Stuart</surname> <given-names>S</given-names></string-name>, <string-name><surname>Vahdat</surname> <given-names>A</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>B4: experience with a globally-deployed software defined WAN</article-title>. <source>ACM SIGCOMM Comput Commun Rev</source>. <year>2013 Aug</year>;<volume>43</volume>(<issue>4</issue>):<fpage>3</fpage>&#x2013;<lpage>14</lpage>. doi:<pub-id pub-id-type="doi">10.1145/2486001.2486019</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>32.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hong</surname> <given-names>CY</given-names></string-name>, <string-name><surname>Kandula</surname> <given-names>S</given-names></string-name>, <string-name><surname>Mahajan</surname> <given-names>R</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>M</given-names></string-name>, <string-name><surname>Gill</surname> <given-names>V</given-names></string-name>, <string-name><surname>Nanduri</surname> <given-names>M</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Achieving high utilization with software-driven WAN</article-title>. In: <conf-name>Proceedings of the ACM SIGCOMM, 2013 Conference on SIGCOMM</conf-name>, <year>2013</year>; <publisher-loc>Hong Kong, China</publisher-loc>; p. <fpage>15</fpage>&#x2013;<lpage>26</lpage>.</mixed-citation></ref>
<ref id="ref-33"><label>33.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Phemius</surname> <given-names>K</given-names></string-name>, <string-name><surname>Bouet</surname> <given-names>M</given-names></string-name>, <string-name><surname>Leguay</surname> <given-names>J</given-names></string-name></person-group>. <article-title>DISCO: distributed multi-domain SDN controllers</article-title>. In: <conf-name>2014 IEEE Network Operations and Management Symposium (NOMS)</conf-name>, <year>2014</year>; <publisher-loc>Krakow, Poland</publisher-loc>. </mixed-citation></ref>
<ref id="ref-34"><label>34.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Basavaraju</surname> <given-names>N</given-names></string-name>, <string-name><surname>Alexander</surname> <given-names>N</given-names></string-name>, <string-name><surname>Seitz</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Performance evaluation of advanced message queuing protocol (AMQP): an empirical analysis of AMQP online message brokers</article-title>. In: <conf-name>International Symposium on Networks, Computers and Communications (ISNCC)</conf-name>, <year>2021</year>; <publisher-loc>Dubai, United Arab Emirates</publisher-loc>; p. <fpage>1</fpage>&#x2013;<lpage>8</lpage>. </mixed-citation></ref>
<ref id="ref-35"><label>35.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Benamrane</surname> <given-names>F</given-names></string-name>, <string-name><surname>Ben Mamoun</surname> <given-names>M</given-names></string-name>, <string-name><surname>Benaini</surname> <given-names>R</given-names></string-name></person-group>. <article-title>An East-West interface for distributed SDN control plane: implementation and evaluation</article-title>. <source>Comput Electr Eng</source>. <year>2017 Jan</year>;<volume>57</volume>:<fpage>162</fpage>&#x2013;<lpage>75</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.compeleceng.2016.09.012</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>36.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Esteve Rothenberg</surname> <given-names>C</given-names></string-name>, <string-name><surname>Trindade Nascimento</surname> <given-names>M</given-names></string-name>, <string-name><surname>Teixeira Godoy</surname> <given-names>H</given-names></string-name>, <string-name><surname>Carlos</surname> <given-names>S</given-names></string-name>, <string-name><surname>Raszuk</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Revisiting routing control platforms with the eyes and muscles of software-defined networking</article-title>. In: <conf-name>Proceedings of the First Workshop on Hot Topics in Software Defined Networks, ACM SIGCOMM</conf-name>, <year>2012</year>; <publisher-loc>Helsinki, Finland</publisher-loc>; p. <fpage>13</fpage>&#x2013;<lpage>8</lpage>. </mixed-citation></ref>
<ref id="ref-37"><label>37.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Santos</surname> <given-names>MAS</given-names></string-name>, <string-name><surname>Nunes</surname> <given-names>BAA</given-names></string-name>, <string-name><surname>Obraczka</surname> <given-names>K</given-names></string-name>, <string-name><surname>Turletti</surname> <given-names>T</given-names></string-name>, <string-name><surname>de Oliveira</surname> <given-names>BT</given-names></string-name>, <string-name><surname>Margi</surname> <given-names>CB</given-names></string-name></person-group>. <article-title>Decentralizing SDN&#x2019;s control plane</article-title>. In: <conf-name>39th Annual IEEE Conference on Local Computer Networks</conf-name>, <year>2014</year>; <publisher-loc>Edmonton, AB, Canada</publisher-loc>; p. <fpage>402</fpage>&#x2013;<lpage>5</lpage>. </mixed-citation></ref>
<ref id="ref-38"><label>38.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Stringer</surname> <given-names>J</given-names></string-name>, <string-name><surname>Pemberton</surname> <given-names>D</given-names></string-name>, <string-name><surname>Fu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Lorier</surname> <given-names>C</given-names></string-name>, <string-name><surname>Nelson</surname> <given-names>RE</given-names></string-name>, <string-name><surname>Bailey</surname> <given-names>JJ</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Cardigan: SDN distributed routing fabric going live at an Internet exchange</article-title>. In: <conf-name>2014 IEEE Symposium on Computers and Communications (ISCC)</conf-name>, <year>2014</year>; <publisher-loc>Funchal, Portugal</publisher-loc>; p. <fpage>1</fpage>&#x2013;<lpage>7</lpage>. </mixed-citation></ref>
<ref id="ref-39"><label>39.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Lapeyrade</surname> <given-names>R</given-names></string-name>, <string-name><surname>Bruy&#x00E8;re</surname> <given-names>M</given-names></string-name>, <string-name><surname>Owezarski</surname> <given-names>P</given-names></string-name></person-group>. <article-title>OpenFlow-based migration and management of the TouIX IXP</article-title>. In: <conf-name>IEEE/IFIP Network Operations and Management Symposium</conf-name>, <year>2016</year>; <publisher-loc>Istanbul, Turkey</publisher-loc>; p. <fpage>1131</fpage>&#x2013;<lpage>6</lpage>. </mixed-citation></ref>
<ref id="ref-40"><label>40.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Malboubi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Chuah</surname> <given-names>CN</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Intelligent SDN based traffic (de)aggregation and measurement paradigm (iSTAMP)</article-title>. In: <conf-name>IEEE INFOCOM 2014&#x2014;IEEE Conference on Computer Communications</conf-name>, <year>2014</year>; <publisher-loc>Toronto, ON, Canada</publisher-loc>; p. <fpage>934</fpage>&#x2013;<lpage>42</lpage>. </mixed-citation></ref>
<ref id="ref-41"><label>41.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><collab>Endeavour</collab></person-group>. <article-title>Project</article-title>. Available from: <ext-link ext-link-type="uri" xlink:href="https://www.h2020-endeavour.eu/">https://www.h2020-endeavour.eu/</ext-link>. <comment>[Accessed 2024]</comment>.</mixed-citation></ref>
<ref id="ref-42"><label>42.</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Morgan</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Atlantic wave-SDX: a distributed intercontinental experimental software defined exchange for research and education networking</article-title>; <year>2015</year>. Available from: <ext-link ext-link-type="uri" xlink:href="https://itnews.fiu.edu/wp-content/uploads/sites/8/2015/04/AtlanticWaveSDX-Press-Release_FinalDraft.pdf">https://itnews.fiu.edu/wp-content/uploads/sites/</ext-link><ext-link ext-link-type="uri" xlink:href="https://itnews.fiu.edu/wp-content/uploads/sites/8/2015/04/AtlanticWaveSDX-Press-Release_FinalDraft.pdf">8/2015/04/AtlanticWaveSDX-Press-Release_FinalDraft.pdf</ext-link> <comment>[Accessed 2020]</comment>.</mixed-citation></ref>
<ref id="ref-43"><label>43.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lin</surname> <given-names>P</given-names></string-name>, <string-name><surname>Bi</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wolff</surname> <given-names>S</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>A</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>Z</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>A west-east bridge based SDN inter-domain testbed</article-title>. <source>IEEE Commun Mag</source>. <year>2015 Feb</year>;<volume>53</volume>(<issue>2</issue>):<fpage>190</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.1109/MCOM.2015.7045408</pub-id>.</mixed-citation></ref>
<ref id="ref-44"><label>44.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mehmood</surname> <given-names>KT</given-names></string-name>, <string-name><surname>Atiq</surname> <given-names>S</given-names></string-name>, <string-name><surname>Hashmi</surname> <given-names>MW</given-names></string-name></person-group>. <article-title>Predictive analysis of telecom system quality parameters with SDN (Software Define Networking) controlled environment</article-title>. <source>Elem Educ Online</source>. <year>2021 Jan</year>;<volume>20</volume>(<issue>3</issue>):<fpage>2342</fpage>&#x2013;<lpage>55</lpage>.</mixed-citation></ref>
<ref id="ref-45"><label>45.</label><mixed-citation publication-type="book"><source>Advanced Layer 2 System, Internet2</source>. <publisher-loc>Ann Arbor, MI, USA</publisher-loc>: <publisher-name>Advanced Technology Community Founded by the U.S. Research and Education Communit</publisher-name>; <year>Dec. 2014. Available from:</year> <ext-link ext-link-type="uri" xlink:href="https://www.internet2.edu/products-%20services/advanced-networking/layer-2-services/">https://www.</ext-link><ext-link ext-link-type="uri" xlink:href="https://www.internet2.edu/products-%20services/advanced-networking/layer-2-services/">internet2.edu/products-%20services/advanced-networking/layer-2-services/</ext-link>. <comment>[Accessed 2024]</comment>.</mixed-citation></ref>
<ref id="ref-46"><label>46.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kotronis</surname> <given-names>V</given-names></string-name>, <string-name><surname>G&#x00E4;mperli</surname> <given-names>A</given-names></string-name>, <string-name><surname>Dimitropoulos</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Routing centralization across domains via SDN: a model and emulation framework for BGP evolution</article-title>. <source>Comput Netw</source>. <year>2015 Dec</year>;<volume>92</volume>:<fpage>227</fpage>&#x2013;<lpage>39</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comnet.2015.07.015</pub-id>.</mixed-citation></ref>
<ref id="ref-47"><label>47.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>M</given-names></string-name>, <string-name><surname>Rexford</surname> <given-names>J</given-names></string-name>, <string-name><surname>Freedman</surname> <given-names>MJ</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Scalable flow-based networking with DIFANE</article-title>. In: <conf-name>SIGCOMM&#x2019;10: Proceedings of the ACM SIGCOMM</conf-name>, <year>2010</year>; <publisher-loc>New Delhi, India</publisher-loc>; p. <fpage>351</fpage>&#x2013;<lpage>62</lpage>.</mixed-citation></ref>
<ref id="ref-48"><label>48.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Aly</surname> <given-names>WHF</given-names></string-name></person-group>. <article-title>Generic controller adaptive load balancing (GCALB) for SDN networks</article-title>. <source>J Comput Netw Commun</source>. <year>2019 Dec</year>;<volume>2019</volume>:<fpage>1</fpage>&#x2013;<lpage>9</lpage>. doi:<pub-id pub-id-type="doi">10.1145/1851182.1851224</pub-id>.</mixed-citation></ref>
<ref id="ref-49"><label>49.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mehmood</surname> <given-names>KT</given-names></string-name>, <string-name><surname>Atiq</surname> <given-names>S</given-names></string-name>, <string-name><surname>Hussain</surname> <given-names>MM</given-names></string-name></person-group>. <article-title>Enhancing QoS of telecom networks through server load management in software-defined networking (SDN)</article-title>. <source>Sensors</source>. <year>2023 Jan</year>;<volume>23</volume>(<issue>23</issue>):<fpage>9324</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s23239324</pub-id>; <pub-id pub-id-type="pmid">38067697</pub-id></mixed-citation></ref>
<ref id="ref-50"><label>50.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chiang</surname> <given-names>ML</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>HS</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>HY</given-names></string-name>, <string-name><surname>Chiang</surname> <given-names>CY</given-names></string-name></person-group>. <article-title>SDN-based server clusters with dynamic load balancing and performance improvement</article-title>. <source>Cluster Comput</source>. <year>2020 May</year>;<volume>24</volume>(<issue>1</issue>):<fpage>537</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10586-020-03135-w</pub-id>.</mixed-citation></ref>
<ref id="ref-51"><label>51.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Begam</surname> <given-names>GS</given-names></string-name>, <string-name><surname>Sangeetha</surname> <given-names>M</given-names></string-name>, <string-name><surname>Shanker</surname> <given-names>NR</given-names></string-name></person-group>. <article-title>Load balancing in DCN servers through SDN machine learning algorithm</article-title>. <source>Arab J Sci Eng</source>. <year>2021 Jul</year>;<volume>47</volume>(<issue>2</issue>):<fpage>1423</fpage>&#x2013;<lpage>34</lpage>. doi:<pub-id pub-id-type="doi">10.21203/rs.3.rs-277161/v1</pub-id>.</mixed-citation></ref>
<ref id="ref-52"><label>52.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Malba&#x0161;i&#x0107;</surname> <given-names>T</given-names></string-name>, <string-name><surname>Bojovi&#x0107;</surname> <given-names>PD</given-names></string-name>, <string-name><surname>Bojovi&#x0107;</surname> <given-names>&#x017D;.</given-names></string-name>, <string-name><surname>&#x0160;uh</surname> <given-names>J</given-names></string-name>, <string-name><surname>Vujo&#x0161;evi&#x0107;</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Hybrid SDN networks: a multi-parameter server load balancing scheme</article-title>. <source>J Netw Syst Manag</source>. <year>2022 Jan</year>;<volume>30</volume>(<issue>2</issue>):<fpage>1</fpage>&#x2013;<lpage>29</lpage>. doi:<pub-id pub-id-type="doi">10.21203/rs.3.rs-383737/v1</pub-id>.</mixed-citation></ref>
<ref id="ref-53"><label>53.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Liang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>F</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Load balancing algorithm of controller based on SDN architecture under machine learning</article-title>. <source>J Syst Sci Inform</source>. <year>2020 Dec</year>;<volume>8</volume>(<issue>6</issue>):<fpage>578</fpage>&#x2013;<lpage>88</lpage>. doi:<pub-id pub-id-type="doi">10.21078/JSSI-2020-578-11</pub-id>.</mixed-citation></ref>
<ref id="ref-54"><label>54.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ahmad</surname> <given-names>S</given-names></string-name>, <string-name><surname>Jamil</surname> <given-names>F</given-names></string-name>, <string-name><surname>Ali</surname> <given-names>A</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>E</given-names></string-name>, <string-name><surname>Ibrahim</surname> <given-names>M</given-names></string-name>, <string-name><surname>Keun Whangbo</surname> <given-names>T</given-names></string-name></person-group>. <article-title>Effectively handling network congestion and load balancing in software-defined networking</article-title>. <source>Comput Mater Contin</source>. <year>2022</year>;<volume>70</volume>(<issue>1</issue>):<fpage>1363</fpage>&#x2013;<lpage>79</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2022.017715</pub-id>.</mixed-citation></ref>
<ref id="ref-55"><label>55.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Saxena</surname> <given-names>MC</given-names></string-name>, <string-name><surname>Sabharwal</surname> <given-names>M</given-names></string-name>, <string-name><surname>Bajaj</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Review of SDN-based load-balancing methods, issues, challenges, and roadmap</article-title>. <source>Int J Electr Comput Eng Syst</source>. <year>2023 Nov</year>;<volume>14</volume>(<issue>9</issue>):<fpage>1031</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.32985/ijeces.14.9.8</pub-id>.</mixed-citation></ref>
<ref id="ref-56"><label>56.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Haidi</surname> <given-names>AM</given-names></string-name>, <string-name><surname>Au</surname> <given-names>TW</given-names></string-name>, <string-name><surname>Shah</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Single cluster load balancing using SDN: performance comparison between floodlight and POX</article-title>. In: <conf-name>IEEE 19th International Conference on Communication Technology (ICCT)</conf-name>, <year>2019</year>; <publisher-loc>Xi&#x2019;an, China</publisher-loc>. </mixed-citation></ref>
<ref id="ref-57"><label>57.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ejaz</surname> <given-names>S</given-names></string-name>, <string-name><surname>Iqbal</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Azmat Shah</surname> <given-names>P</given-names></string-name>, <string-name><surname>Bukhari</surname> <given-names>BH</given-names></string-name>, <string-name><surname>Ali</surname> <given-names>A</given-names></string-name>, <string-name><surname>Aadil</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Traffic load balancing using software defined networking (SDN) controller as virtualized network function</article-title>. <source>IEEE Access</source>. <year>2019</year>;<volume>7</volume>:<fpage>46646</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2019.2909356</pub-id>.</mixed-citation></ref>
<ref id="ref-58"><label>58.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gasmelseed</surname> <given-names>H</given-names></string-name>, <string-name><surname>Ramar</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Traffic pattern-based load-balancing algorithm in software-defined network using distributed controllers</article-title>. <source>Int J Commun Syst</source>. <year>2018 Nov</year>;<volume>32</volume>(<issue>7</issue>):<fpage>e3841</fpage>. doi:<pub-id pub-id-type="doi">10.1002/dac.3841</pub-id>.</mixed-citation></ref>
<ref id="ref-59"><label>59.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Cello</surname> <given-names>M</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>IC</given-names></string-name>, <string-name><surname>Walid</surname> <given-names>A</given-names></string-name>, <string-name><surname>Wilfong</surname> <given-names>G</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>CHP</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Dynamic switch migration in distributed software-defined networks to achieve controller load balance</article-title>. <source>IEEE J Sel Areas Commun</source>. <year>2019 Mar</year>;<volume>37</volume>(<issue>3</issue>):<fpage>515</fpage>&#x2013;<lpage>29</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JSAC.2019.2894237</pub-id>.</mixed-citation></ref>
<ref id="ref-60"><label>60.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>D</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>T</given-names></string-name></person-group>. <article-title>A hierarchical routing scheme with load balancing in software defined vehicular ad hoc networks</article-title>. <source>IEEE Access</source>. <year>2018 Jan</year>;<volume>6</volume>:<fpage>73774</fpage>&#x2013;<lpage>85</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2018.2884708</pub-id>.</mixed-citation></ref>
<ref id="ref-61"><label>61.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Vyakaranal</surname> <given-names>SB</given-names></string-name>, <string-name><surname>Naragund</surname> <given-names>JG</given-names></string-name></person-group>. <article-title>Weighted round-robin load balancing algorithm for software-defined network</article-title>. In: <conf-name>Emerging Research in Electronics, Computer Science and Technology</conf-name>, <year>2019</year>; <publisher-loc>Singapore</publisher-loc>; p. <fpage>375</fpage>&#x2013;<lpage>87</lpage>. </mixed-citation></ref>
<ref id="ref-62"><label>62.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Sathyanarayana</surname> <given-names>S</given-names></string-name>, <string-name><surname>Moh</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Joint route-server load balancing in software defined networks using ant colony optimization</article-title>. In: <conf-name>International Conference on High Performance Computing and Simulation</conf-name>, <year>2016</year>; <publisher-loc>Innsbruck, Austria</publisher-loc>; p. <fpage>156</fpage>&#x2013;<lpage>63</lpage>. </mixed-citation></ref>
<ref id="ref-63"><label>63.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhong</surname> <given-names>H</given-names></string-name>, <string-name><surname>Fang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>J</given-names></string-name></person-group>. <article-title>LBBSRT: an efficient SDN load balancing scheme based on server response time</article-title>. <source>Future Gener Comput Syst</source>. <year>2017 Mar</year>;<volume>68</volume>:<fpage>183</fpage>&#x2013;<lpage>90</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.future.2016.10.001</pub-id>.</mixed-citation></ref>
<ref id="ref-64"><label>64.</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hamed</surname> <given-names>MI</given-names></string-name>, <string-name><surname>ElHalawany</surname> <given-names>BM</given-names></string-name>, <string-name><surname>Fouda</surname> <given-names>MM</given-names></string-name>, <string-name><surname>Eldien</surname> <given-names>AST</given-names></string-name></person-group>. <article-title>Performance analysis of applying load balancing strategies on different SDN environments</article-title>. <source>Benha J Appl Sci</source>. <year>2017 Mar</year>;<volume>2</volume>(<issue>1</issue>):<fpage>91</fpage>&#x2013;<lpage>7</lpage>. doi:<pub-id pub-id-type="doi">10.21608/bjas.2017.163983</pub-id>.</mixed-citation></ref>
<ref id="ref-65"><label>65.</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Hai</surname> <given-names>NT</given-names></string-name>, <string-name><surname>Kim</surname> <given-names>DS</given-names></string-name></person-group>. <article-title>Efficient load balancing for multi-controller in SDN-based mission-critical networks</article-title>. In: <conf-name>IEEE 14th International Conference on Industrial Informatics (INDIN)</conf-name>, <year>2016</year>; <publisher-loc>Poitiers, France</publisher-loc>; p. <fpage>420</fpage>&#x2013;<lpage>5</lpage>.</mixed-citation></ref>
</ref-list>
</back></article>