<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">ENG</journal-id><journal-title-group><journal-title>Engineering</journal-title></journal-title-group><issn pub-type="epub">1947-3931</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/eng.2018.1011056</article-id><article-id pub-id-type="publisher-id">ENG-88610</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Engineering</subject></subj-group></article-categories><title-group><article-title>
 
 
  Simulation of a Mathematical Model Minimizing Energy Consumption in SDN Type Networks
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Lagasane</surname><given-names>Kra</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Bi</surname><given-names>Tra Gooré</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Manlandon</surname><given-names>Koffi</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Olivier</surname><given-names>Asseu</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Institut National Polytechnique F. Houphou&amp;amp;#235;t Boigny (INP-HB), Yamoussoukro, C&amp;amp;#244;te d’Ivoire</addr-line></aff><aff id="aff2"><addr-line>Ecole Supérieure Africaine des TIC (ESATIC), Abidjan, C&amp;amp;#244;te d’Ivoire</addr-line></aff><pub-date pub-type="epub"><day>07</day><month>11</month><year>2018</year></pub-date><volume>10</volume><issue>11</issue><fpage>805</fpage><lpage>813</lpage><history><date date-type="received"><day>28,</day>	<month>September</month>	<year>2018</year></date><date date-type="rev-recd"><day>17,</day>	<month>November</month>	<year>2018</year>	</date><date date-type="accepted"><day>20,</day>	<month>November</month>	<year>2018</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Several works by the authors have shown that energy consumption in communication networks does not only depend on the traffic load but on all connected equipment in the network. We have contributed a new mathematical model and a new energy saving strategy with Software Defined Network (SDN) technology [
  1]. Our Model solution is based on the Modified SPRING Protocol (MSP). In this paper, we simulated our work and compared it to that of the authors [
  2] and [
  3]. The OMNET++ simulator was used for our work. Thus, the results of the simulations gave a delay that tends to zero, a packet loss of the order of 10% and a constant jitter of 4% better than the previous authors.
 
</p></abstract><kwd-group><kwd>SPRING</kwd><kwd> Protocol</kwd><kwd> Simulator</kwd><kwd> OMNET++</kwd><kwd> Graph</kwd><kwd> Mathematical Model</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>In Wael Zouaoui’s thesis, which was defended on January 15, 2016, the authors showed that, following recent advances in the technological fields, the energy bill has continued to grow. This is due to the interconnections of computer equipment. These devices are increasingly bulky with high computing power (see <xref ref-type="fig" rid="fig1">Figure 1</xref>).</p><p>In our previous work accepted for publication in [<xref ref-type="bibr" rid="scirp.88610-ref1">1</xref>] , we mentioned the authors of [<xref ref-type="bibr" rid="scirp.88610-ref5">5</xref>] and [<xref ref-type="bibr" rid="scirp.88610-ref6">6</xref>] . In this work, a study has shown that ICTs alone consume 2% to 10% of global consumption [<xref ref-type="bibr" rid="scirp.88610-ref5">5</xref>] and a consummation of 6 Twh/an to USA in hubs, Switch, Routers [<xref ref-type="bibr" rid="scirp.88610-ref6">6</xref>] . It was necessary to find a mathematical model that is able to minimize the consumption of energy.</p><p>We have proposed a mathematical model that minimizes energy and its relevance has been shown by an algebraic resolution. In this paper, we will</p><p>simulate our approach proposal. The work will consist in presenting in Section 2 the previous works. Section 3 will present our mathematical model and its constraints (delay, packet loss and jitter) in which we will explain our algorithmic approach. We present in Section 4 the results of our simulations. In Section 5, we will compare our work with that of previous authors. The conclusion will come in Section 6.</p></sec><sec id="s2"><title>2. Previous Work</title><p>In this section, we present the results of the simulations of different authors on energy consumption in SDN networks.</p><p>Several simulation works have been processed in the optimization of energy consumption in communication networks. This is the case for citing the authors [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] and [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] . In [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] , the authors used a software approach based on an automatic On/Off control system to enable and disable router links. This is a test-bed that has been done in conventional networks. The authors chose in their network topology paths supported by the Cognitive Packet Network (CPN) protocol. It has been found that non-protocol defined routes are not degraded. The results of their approach gave 10% to 20% extinction of energy-saving links with QoS degradation (see figures below). These works of the authors, we reproduced them [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] (<xref ref-type="fig" rid="fig2">Figure 2</xref>).</p><p><xref ref-type="fig" rid="fig2">Figure 2</xref> showed that disabling some routers at instants 100 s, 300 s, 500 s, 700 s caused a delay. This is due to the fact that each time the links or routers are shut down, the CPN routing protocol looks for new favorable paths. And these paths being the shortest paths (instants 200 s, 400 s, 600 s) are quickly saturated. Only long paths are borrowed. Some packages are lost. In the authors’ experience, the packets use in their header the extinction strategy based on the Cognitive Packet Network (CPN) protocol. Routers have become mere rest areas or roads for future destinations. This is where packages with experience look for favorable destinations.During shutdown, packets in the queue are destroyed (<xref ref-type="fig" rid="fig3">Figure 3</xref>).</p><p>While packages take time to find a way, some of them are lost. Because these have already reached the number of jumps to be made in the network (30 jumps</p><p>maximum) beyond, the packets are destroyed to allow others to make their way. The successive extinction of the routers or the maximum number of links increases the delay due to congestion in the network thus causing packet losses that reach 20% (<xref ref-type="fig" rid="fig4">Figure 4</xref>).</p><p>Here, the jitter does not vary. The delay follows the same rhythm. Its value is constant of 0.08 (or 8%). We present now the simulations of the work of the authors of [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] . In [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] , the authors proposed a software approach using the SPRING protocol to turn off links when they are not used. Their approach shows in the simulations that it was possible to turn off 44% of the links to save energy that we present below through captures:</p><p><xref ref-type="fig" rid="fig5">Figure 5</xref> simulations Results in Germany 50 (top) and Giant (bottom) networks [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>]</p><p>In this work [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] , we report their results on three points:</p><p>&#252; Impact on the network load: it creates an additional cost of 18.56%. The paths on which packets are routed are not the shortest. But this extra cost is quickly canceled when the links are lit (<xref ref-type="fig" rid="fig5">Figure 5</xref>(a) and <xref ref-type="fig" rid="fig5">Figure 5</xref>(c)).</p><p>&#252; Impact on end-to-end delay: the increase was 37% with Germany 50 while in most cases it is 20%.</p><p>&#252; Impact on packet loss: no loss of packets with the algorithm used by the authors based on the Spring Protocol.</p><p>We used the idea of the authors of [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] to improve the work of the authors [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] . Our approach is software. It allowed us to disable the maximum of routers ports. Ports are disabled for adjacent routers. It is better than those of the previous</p><p>ones. Because it offers us a double saving of energy saving (in ports and links). Our simulations will demonstrate them. Well before we remember our mathematical model and then follow our simulations.</p></sec><sec id="s3"><title>3. Model Presentation</title><p>In this section, we present our mathematical model under constraint of delay, packet loss and jitter. We showed the principle of the extinction of the ports of the routers by our Modified SPRING Protocol [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] on a tree covering minimum weight.</p><p>Our model was obtained using the convexity theorem. Thus, the objective function obtained is:</p><p>min ( f ( n ( t ) , t ) ) = min ( ∑ i ∈ n ( t ) ( ( C c h + C p ) − ( a l ( t ) + b ) ) + ∑ i , j ∈ n ( t ) f ( k ( i , j , t ) ) ) (1)</p><p>Under Constraint of: q ( f ( t ) , R ( F ( t ) , n ( t ) , k ( t ) , t ) ) ≤ Q ( f ( t ) ) , ⊬ f ( t ) ∈ F ( t ) and:</p><p>∑ f ( t ) ≤ C i , j ⊬ f ( t ) ∈ F ( t ) and Max l ( t ) &lt; λ max</p><p>k ∈ { 0 , 1 }</p><p>When the routers are turned on, only one port on each router is activated and the (n-1) others are turned off. The packets have at least one path on each router. This approach will influence the delay of transmission unlike that of the authors [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] and [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] . So we define our delay based on the number of disabled ports called Dℓ(t). Our delay will be obtained from the data of the work of [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] .</p><p>So, we have:</p><p>D l ( t ) = Delay n Max l ( t ) (2)</p><p>where Dℓ(t): delay when ℓ(t) ports are disabled.</p><p>Delay<sub>n</sub>: Normal delay (value obtained from those of [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] .</p><p>Maxℓ(t): Maximum number of ports off on each router.</p><p> The ratings: (<xref ref-type="table" rid="table1">Table 1</xref>)</p><p>We have found our mathematical model which minimizes, so we present our simulations on the basis of our Modified SPRING Protocol (MSP).</p></sec><sec id="s4"><title>4. Our Simulation Results</title><p>Our extinction principle approach by Modified SPRING protocol are described in our algorithms and simulation results are presented in Algorithm 1 and Algorithm 2.</p><p>Algorithm 1. Centralized SDN: .</p><p>Algorithm 2. Main loop.</p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> Summary of the ratings</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >f(n(t),t)</th><th align="center" valign="middle" >Power consumption in the subnet</th></tr></thead><tr><td align="center" valign="middle" >λ max</td><td align="center" valign="middle" >Total number of ports on a router</td></tr><tr><td align="center" valign="middle" >C i</td><td align="center" valign="middle" >Overall energy of the router</td></tr><tr><td align="center" valign="middle" >a l ( t ) + b</td><td align="center" valign="middle" >Gain of energy obtained during the deactivation of the ports</td></tr><tr><td align="center" valign="middle" >f ( k ( i , j , t ) )</td><td align="center" valign="middle" >The state of ports in sub-networks at time t</td></tr><tr><td align="center" valign="middle" >q</td><td align="center" valign="middle" >Quality of service perceived by the user</td></tr><tr><td align="center" valign="middle" >F ( t )</td><td align="center" valign="middle" >Set of all requests at the moment t</td></tr><tr><td align="center" valign="middle" >f s , p ( t ) ∈ F ( t )</td><td align="center" valign="middle" >Observed request of a user at the instant t from a point s to a p.</td></tr><tr><td align="center" valign="middle" >R ( F ( t ) )</td><td align="center" valign="middle" >Routing of all requests at time t (see the routing algorithm).</td></tr><tr><td align="center" valign="middle" >n ( t ) ⊆ N ( t )</td><td align="center" valign="middle" >The subnet included in the network at time t</td></tr><tr><td align="center" valign="middle" >Q ( f ( t ) )</td><td align="center" valign="middle" >Quality of service set to not exceeded for all requests observed.</td></tr><tr><td align="center" valign="middle" >D l ( t )</td><td align="center" valign="middle" >delay when ℓ(t) ports are disabled</td></tr><tr><td align="center" valign="middle" >Delay<sub>n</sub></td><td align="center" valign="middle" >Normal delay</td></tr><tr><td align="center" valign="middle" >Maxℓ(t)</td><td align="center" valign="middle" >Maximum number of ports off on each router</td></tr></tbody></table></table-wrap><p>We have the results of our simulations and a comparative study of these results with the previous ones based on our algorithmic approach in OMNET ++ has been done (see <xref ref-type="fig" rid="fig6">Figure 6</xref>).</p><p>In this diagram, as we disable the ports of the routers, the delay decreases or even tends to zero. This is explained by our approach. There is at least one port on, thus establishing a link between different routers avoiding the waste of time finding a path (<xref ref-type="fig" rid="fig7">Figure 7</xref>).</p><p><xref ref-type="fig" rid="fig7">Figure 7</xref> is the consequence of that (<xref ref-type="fig" rid="fig6">Figure 6</xref>). The delay decreases, resulting in a decrease in packet loss (relatively low). In our case, it is 10% (<xref ref-type="fig" rid="fig7">Figure 7</xref>).</p><p>Jitter, in our case it decreased doubly 0.04 (<xref ref-type="fig" rid="fig8">Figure 8</xref>) contrary to 0.08 of the authors of [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] .</p><p>Given these results, a comparison of our model with that of the authors cited in our work is necessary.</p></sec><sec id="s5"><title>5. Performance Evaluation</title><p>In this section, we compare our results with those of the authors cited in this paper.</p><p>We find that the results of the authors [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] are much better than that of the authors [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] . We recall that the authors of [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] worked in classical networks. The efficiency in the work of [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] lies in the importance of SDN technology. The fact that the SDN has a global view of the network facilitates the definition of effective rules. The use of the SPRING algorithm with SDN allowed the authors of [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] to obtain better results. Ours view of the different figures, is still interesting than the previous two. Our Modified SPRING Protocol (MSP) -based approach minimizes energy with good quality of service (QoS) in terms of delay, packet loss and jitter. We achieved better packet forwarding times with less congestion, thus minimizing losses. Just like the authors of [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] , we can also say that the loss of packets in our simulations are the same. We cannot minimize without degradation. It (packet loss) is 20% in [<xref ref-type="bibr" rid="scirp.88610-ref3">3</xref>] , [<xref ref-type="bibr" rid="scirp.88610-ref2">2</xref>] and 10% in ours. Our delay is much better than previous authors.</p></sec><sec id="s6"><title>6. Conclusions</title><p>We simulated our mathematical model with the OMNET++ simulator. The results show that the ports of the routers, when deactivated according to our energy saving strategy, have a good quality of service (QoS) in terms of delay that tends to zero, packet loss of the order of 10% and constant jitter of 4%.</p><p>The quality of service degradation can be related to several factors: network connectivity difficult at times, over-provisioning of the network causing configuration rules and correct routing problems. Because the size of the memory (TCAM) in which the rules used by SDN devices are stored is small. This orientation is interesting and could be developed in our future work. The advent of SDN by the programmability thus brings flexibility and good results in the management of the network.</p></sec><sec id="s7"><title>Acknowledgements</title><p>The authors would like to thank the anonymous referee for his/her comments that helped us improve this article. The authors also wish to thank the Higher School of ICT (ESATIC) and the Doctoral School Polytechnic Institute F. H. Boigny of Yakro (INP-HB).</p></sec><sec id="s8"><title>Conflicts of Interest</title><p>The authors declare no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s9"><title>Cite this paper</title><p>Kra, L., Goor&#233;, B.T., Koffi, M. and Asseu, O. (2018) Simulation of a Mathematical Model Minimizing Energy Consumption in SDN Type Networks. Engineering, 10, 805-813. https://doi.org/10.4236/eng.2018.1011056</p></sec></body><back><ref-list><title>References</title><ref id="scirp.88610-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Kra, L., Gondo, Y., Gooré, B.T. and Asseu, O. (2018) Contribution to the Optimization of the Energy Consumption in SDN Networks. Journal of Sensor Technology, 8, 1-9. https://doi.org/10.4236/jst.2018.83005</mixed-citation></ref><ref id="scirp.88610-ref2"><label>2</label><mixed-citation publication-type="book" xlink:type="simple">Gelenbe, E. and Silvestri, S. (2009) Optimisation of Power Consumption in Wired Packet Networks. In: Bartolini, N., Nikoletseas, S., Sinha, P., Cardellini, V. and Mahanti, A., Eds., Telecommunications Engineering, Springer Berlin Heidelberg, 717-729.</mixed-citation></ref><ref id="scirp.88610-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Carpa, R., Glück, O., Lefèvre, L. and Mignot, J.-C. (2015) STREETE: Traffic Engineering for Energy-Efficient Core Networks. Conference Compas’2015, Lille.</mixed-citation></ref><ref id="scirp.88610-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Project, R.T.S. (2014) Internetlivestats.  
http://www.internetlivestats.com/internet-users-by-country/2014/</mixed-citation></ref><ref id="scirp.88610-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Chiaraviglio, E.L. and Mellia, M. (2009) How Much Can Internet Be Greened? Green Comon.</mixed-citation></ref><ref id="scirp.88610-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Bruce, N. and Christensen, K. (2005) Reducing the Energy Consumption of Networked Devices.</mixed-citation></ref></ref-list></back></article>