Green Traffic Engineering Solution For
Green Traffic Engineering Solution For
Green Traffic Engineering Solution For
ABSTRACT
Thanks to its flexibility of handling and processing due to the separation of control and data planes, The
new Software Defined Network (SDN) paradigm has attracted a lot of attention from researchers. On the
other hand, energy consumption in ICTs has become an important area of research, given the high energy
dissipation due to the manufacture of high-tech equipment and the direct use of electricity. The aim of this
study is to improve the energy efficiency of networks by switching off a subset of the links, using an SDN
(Software Defined Network) approach.We dynamically adapt the number of network links that are
switched on according to the network load.Our solution is based on the Segment Routing protocol, which
we will demonstrate that is better than MPLS.The algorithms were implemented and evaluated using the
OMNET++ simulator.Experimental results show that the number of links on can be reduced by a very
interesting percentage while maintaining a high quality of service and network stability.the proposed
solution presents a promising results to address the environmental and energy challenges faced by modern
networks.
Keywords: SDN, Green,Traffic Engineering,Energy saved,Segment Routing
7266
Journal of Theoretical and Applied Information Technology
30th November 2023. Vol.101. No 22
© 2023 Little Lion Scientific
7267
Journal of Theoretical and Applied Information Technology
30th November 2023. Vol.101. No 22
© 2023 Little Lion Scientific
7268
Journal of Theoretical and Applied Information Technology
30th November 2023. Vol.101. No 22
© 2023 Little Lion Scientific
4.2 New_Route
In a traditional infrastructure, the network
may not be able to route all flows when selected
links are down. Each node doesn't always have to
recalculate the shortest paths through the network,
since congestion can still occur: congestion can
occur even when a link is active, for example if it is
one of the shortest paths for a large network.
The introduction of SDN technology into
the network is very promising, and solves the above
Figure 5 : Main algorithm flowchart
problem as long as the SDN controller has global
knowledge of network traffic, and knows the
7269
Journal of Theoretical and Applied Information Technology
30th November 2023. Vol.101. No 22
© 2023 Little Lion Scientific
To simulate the networks, we used the Figures 11 and 12 present network load
omnet++ 5.5.1 simulator refering to Pratap [23] and variation based on time over 24 hours and
Inet 3.6.6. Figure 7,8 present the simulated network percentage of activated links when applying the
topologies (Geant and Germany 50) are real algorithm and without it. Rerouting data over paths
topologies taken from topology zoo [22], for each considered not to be the shortest leads to additional
network we simulated one day of use. costs in terms of network load. The additional cost
SR simplifies the control plane used in of our solution is illustrated in Figures 9 and 10,
MPLS by removing RSVP. However, similar to the with a maximum value of around 17%. Despite this
MPLS data plane, the traffic source uses predefined overhead, the network converges. Even if the links
7270
Journal of Theoretical and Applied Information Technology
30th November 2023. Vol.101. No 22
© 2023 Little Lion Scientific
60% 60%
network load or number of packets exchanged
without algo 40% 40%
% links on 20% 20%
0% 0%
Figure 11 : Network load in Geant network 0 3 6 9 12 15 18 21 23 24
7271
Journal of Theoretical and Applied Information Technology
30th November 2023. Vol.101. No 22
© 2023 Little Lion Scientific
7272
Journal of Theoretical and Applied Information Technology
30th November 2023. Vol.101. No 22
© 2023 Little Lion Scientific
7273
Journal of Theoretical and Applied Information Technology
30th November 2023. Vol.101. No 22
© 2023 Little Lion Scientific
7274
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies: