An Efficient Optimization Scheme for Energy
Consumption in ISP Backbone Networks
T. Narmatha1, M. Prabakaran2
1
R.V.S College of Engineering and Technology, Dindigul,
2
R.V.S College of Engineering and Technology, Dindigul.
Abstract-- The power consumption of the internet accounts has
been increased in the bandwidth hungry applications. Several
initiatives are being put into place to reduce the power
consumption of the Information and Communication
Technologies (ICT) sector. Network resource optimization has
become one of the most important research areas in the field of
ISP networks. In this particular report, a competent heuristic
technique primarily based Time-driven Link Sleeping (TLS)
will be planned with regard to sensible vitality supervision that
creates a optimized mix off the reduced circle topology and one
off-peak setting duration within day-to-day procedures. The
principle heuristic ways active in the procedure are generally
(1) calculating the manufactured visitors matrix and also the
beginning point with regard to off-peak window size growth,
(2) greedy link removing for the provisional reduced topology,
along with (3) the mutual growth on the off-peak window size
and also the finalization on the reduced topology to become
utilized throughout the off-peak interval. Sleeping
reconfiguration and rate adaptation has been used for reducing
energy consumption when the traffic demands are at their low
levels. In this work, an efficient heuristic based Time-driven
Link Sleeping (TLS) is proposed for reducing the energy
consumption. A robust TLS scheme with Single Link Failure
Protection (TLS-SLFP) aims to achieve an optimized trade-off
between network robustness and energy efficiency
performance. In this particular technique, rather than greedy
link removing criteria, genetic based criteria can be employed
for the link removing for the provisional reduced topology.
Innate primarily based technique might considerably decreases
the intricacy and provides much better vitality saving.
Key words- Energy saving, trade-off, genetic algorithm, link sleeping, network robustness.
I. INTRODUCTION
We can find growing calls for intended for
employing wifi systems for you to assist applications that
want hold off assures. Like applications consist of VoIP,
video loading, real time surveillance, networked control, and
so onward. Just one widespread quality these applications is
they've the rigid timeline linked to every single bundle.
Every bundle needs to be supplied previous to its timeline,
or the idea expires and is also will no longer great for its
request. In contrast, though like applications may perhaps
put up with a little area of their particular packets lacking
their particular deadlines, that they even now need a
particular regular throughput, that is described as the
throughputs associated with packets which can be supplied
previous to their particular deadlines, as a way to maintain
their particular overall performance. Serving applications
are specially demanding with wifi systems [1][2]. Cellular
transmissions are usually susceptible to shadowing,
diminishing, in addition to disturbance coming from some
other transmissions. Thus, wifi transmissions tend to be
unreliable. These kinds of approaches may be classified
because either disruptive, where completely new functions
must be supported by system hardware including powerful
Dynamic voltage scaling (DVS), or otherwise evolutionary,
where incremental strategies including URL slumbering
reconfigurations may be leveraged based on legacy of music
circle systems[3]. Even though disruptive strategies goal
with long-term options intended for greening one's destiny
World Wide Web, quick or mid-term evolutionary systems
are usually associated with equivalent value, for the reason
that ecological matter and also the shortage of energy
resources are actually regarded as upcoming provocations.
A distinct example associated with evolutionary
strategies is energy-aware circle administration based on
legacy of music circle infrastructures. Being a more
particular paradigm, the technique of energy-aware traffic
works that will depend on site visitors optimization
processes to achieve power efficiency with in business
systems. Generally speaking, ETE optimizes the syndication
associated with site visitors between various walkways
within the circle so that the all round power use may be
diminished though even now retaining the specific services
promise to get rid of customers.
Power conception could be the biggest difficulty
with marketing. To cut back the action conception with
network topology all of us utilize the moment driven url
slumbering. TLS establishes a reduced circle topology
having appointed slumbering url reconfiguration and also
the genuine off-peak interval during which this particular
circle topology is employed. The actual program goals to
name an optimized trade-off in between the amount of
slumbering hyperlinks and also the setting timeframe for the
diminished topology to experience at most power cost
savings though retaining all round circle overall
performance.
On this paper first all of us generate the circle
topology. Power conception will probably take place with
System topology. To cut back the action conception with
circle topology TLS is employed. Find the diminished circle
topology in the course of away optimum occasion all of us
employ TLS. To overcome the solitary URL failure by
employing TLS & SLFP. The main objective of this project
is always to slow up the power conception using genetic
algorithm. To identify the connection failure using TLS &
SLFP in addition to take away the URL fails in order to save
power.
II. RELATED WORK
Frederic Francois et al [4] proposed TLS scheme
with Single Link Failure Protection (TLS-SLFP) to achieve
an optimized trade-off between network robustness and
energy efficiency performance. TLS-SLFP aims to optimize
the reduced network topology so that it always remains fully
connected, and is able to support the worst-case off-peak
traffic demands after the failure of any single link during
off-peak time.
In [5] suggested two types of electrical power
supervision strategies in which slow up the energy
utilization of networks. Initial will be based upon adding
network parts to be able to slumber throughout bored
situations, decreasing energy consumed within the absence
of packets. The second is depending on aligning the actual
pace connected with network operation on the supplied
workload, decreasing the power consumed whenever
actively digesting packets. The electronics support by
network products will be available as efficiency as well as
the slumber claims. Efficiency claims help conserve
electrical power whenever routers are usually energetic,
while slumber claims help conserve electrical power
whenever routers are usually bored. The efficiency claims
dynamically change the actual pace connected with back
links as well as the connected interfaces. The slumber
claims most of us assume swiftly electrical power off of
network interfaces after they are usually bored. Two type of
methods to conserve energy basic primitives.
The primary places network interfaces to be able to
slumber throughout short bored durations. Possible issues
are usually in which buffering put too much delay across the
network knowing that break open will aggravate reduce.
Algorithms arrange for routers as well as changes to be able
to sleep in a manner that makes certain the actual buffering
push back punishment will be paid one time (not each link)
knowing that routers obvious bursts so as to certainly not
amplify reduction visibly. The second approach adapts the
actual speed connected with individual back links as well as
queuing delay from the web page link.
Open Shortest Path First (OSPF) [3] [21] is the
mostly utilized intra-domain World Wide Web routing
project. Visitors move is usually sent together smallest
paths, busting move at nodes where several outgoing back
links are generally in smallest paths on the getaway. The
actual weight loads with the back links, in addition to and
thus the actual smallest way channels may be altered
through the community agent. The actual weight loads could
be fixed proportional with their physical distances, yet often
Overloading connected with back links, and also the regular
heuristic encouraged through Cisco would be to make the
actual fat of a hyperlink inversely proportional to the
volume. The actual wish has been to enhance the actual fat
environment good expected requirements. Most of us
confirmed in which optimizing the actual fat configurations
for just a provided list of requirements is usually NP-hard,
consequently many of us resorted to a local seek heuristic.
Amazingly it ended up in which to the recommended AT&T
WorldNet spinal, many of us located fat configurations in
which done just a number of % through in which with the
optimum basic routing the location where the move for
every single desire is usually optimally allocated over all
paths among resource in addition to getaway. That contrasts
the regular opinion in which OSPF [13] routing results in
traffic jam and it demonstrates to the community in addition
to desire matrix analyzed many of us are unable to have a
substantially better load managing through switching on the
recommended much more flexible Multi-protocol Label
Transferring (MPLS) systems.
At first, the ISP circle resources are normally
over-provisioned in order to securely support peak-time site
visitor calls for because worst type of circumstance scenario.
Such a method provides opportunities regarding cutting
down the actual doing work circle topology during the
off-peak occasion as well as protecting energy even though
nevertheless preserving the actual comparable amount of
over-provisioning that comes about throughout peak-time
function.
A distinct attribute in our recommended TLS
paradigm is actually that the (pre-determined) occasion
windowpane between the initial with the decreased topology
reconfiguration and its termination is actually one every day.
This kind of time-driven reconfiguration method
substantially assists in easing the actual corresponding
businesses regarding energy protecting with the actual circle
agent facet. The enforcement with the typical peak-time
topology as well as the decreased topology could
specifically possibly be accomplished depending on existing
multi-topology redirecting standards including MT-OSPF
[4] as well as MT-ISIS [5] [14] regarding avoiding
redirecting disruptions during the transient topology
changing period of time.
The majority of ETE solutions from the novels use
the off-line optimization approach [6], [7] to its less
complicated rendering when compared with on the net
vitality saving procedures [11], [12].
III. SOLUTION APPROACH BASED ON GENETIC
ALGORITHM
A GA is developed as a solution methodology for
network topological optimization with a reliability
constraint. GA were pioneered by Holland (1975) and
Goldberg (1989) for continuous non-linear optimization, and
later extended (Cohoon et al, 1991; Biegel et al, 1990;
Muhlenbein et al, 1988) for combinatorial problems.
A) Time-driven link sleep
Throughout TLS two different system topologies
tend to be designed for everyday procedures. Over the usual
peak-time function hours, the initial entire topology is
usually applied for coping with consumer targeted visitors,
because it comes about in keeping practice. Through
off-peak period, the particular lowered system topology in
which especially excludes the particular slated sleep
inbound links is utilized for strength preserving functions.
Exclusively, a couple direction-finding topologies tend to be
designed, one while using entire real topology even though
the other not including the particular inbound links slated in
order to sleeping. After the function has joined the particular
slated off-peak period, particular person routers
simultaneously switch on the particular lowered
direction-finding topology simply by remarking the particular
multi-topology identifier (MT-ID) regarding packets on the default
entire topology MT-ID to the lowered topology MT-ID.
This specific element is utilized for strength supervision.
The idea lowers the particular optimized mix of the
particular lowered system topology along with specific
B) Stages in the TLS
TLS has three phase,
Phase 1: Calculating the particular man made targeted
visitors matrix and also the beginning for off-peak window
measurement development,
Phase 2: Genetic based utilizing link elimination
Phase 3: This articulation development of the off-peak
window measurement and also the finalization of the
lowered topology being put on during the off-peak interval.
C) TLS with Single Link Failure Protection
Time-driven Link Sleeping with Single Link
Failure Protection (TLS-SLFP). TLS-SLFP is designed in
order to boost the particular lowered system topology.
TLS-SLFP had been presented being an file format in order to
TLS take into consideration single link inability safety
which often may take place often inside in business systems.
TLS-SLFP has become demonstrated every single child
accomplish realistic strength cost savings even though there
has been additional difficulties for the protocol for instance
more exacting system on the web connectivity along with
ability difficulties to be able to assist single link inability
functions.
D) Stages in the TLS single link failure protection
TLS-SLFP has 4 Phase
Phase 1: Calculating the particular man made TM and also
the beginning for off-peak window measurement
development
Phase 2: Genetic based link elimination together with entire
system on the web connectivity check out single link
inability
Phase 3: The development of the regarding combined
off-peak period window measurement and also the final lowered
topology
Phase 4: Optimizing sleep link selection in order to avoid
targeted visitors over-crowding in the course of single link
inability
TLS-SLFP is designed in order to boost the
particular lowered system topology so that it always is
always completely linked, along with has the ability to assist
the particular worst-case off-peak targeted visitors
requirements following the inability regarding almost any
single link in the course of off-peak period. On the basic of
the web connectivity perspective, the particular more
lowered (post-failure) system topology need to still keep on
being completely linked. Consequently, additional
limitations have to be included in look after this brand-new
requirement. Also, the still fully-connected post-failure
topology doesn't automatically make certain that the many
targeted visitors requirement is going to be completely
accommodated through the more lowered topology. That's
why many of us think about the subsequent requirement on
the perspective regarding bandwidth assist, in which
particular case the initial link elimination function wants to
make sure that satisfactory bandwidth assets are provided
through the lowered topology in the presence regarding
almost any single link failure.
Process of Genetic Algorithms
Evolutionary computational techniques such as
genetic algorithms have many advantages over traditional
optimization algorithms. Current optimization algorithms
require many assumptions to be made about the problem, for
example with gradient-based searches, the requirement is
that the function be smooth and differentiable.
In GA, the search space is composed of possible
solutions to the problem; the final network design will meet
the system reliability constraint and contain at least two
different paths between all pairs of nodes. Under the
following assumptions:
(2) Each
c
ij and the p are fixed and known, wherec
ij isthe cost of link in the network between nodes i and j, and p,q
are link reliability and unreliability (p + q = 1),
(3) Each link is bi-directional,
(4) There are no redundant links in the network, and
(5) The probability of failure of a link is independent of the
states of the other links; the main problem can be stated
mathematically as follows:
Minimize Z=
∑
C
ijX
ijSubject to: f(x) ≥ p0
ij
X
∈{0,1} are the decision variables and f(x) is thenetwork reliability. The all terminal system reliability of a
network is defined to be the probability that every pair of
nodes can communicate with each other. At any instant of
time, only some arcs of G may be operational. A state of G
is a sub-graph (N, L′) with L′∈L, where L′ is the set of
operational arcs. An operational state is generally called a
path set, and a minimal operational state is a min-path. A
failed state L′ is called L \ L′ (a cutset) and when L′ is a
maximal failed state, L \ L′ is a min-cut (Colbourn et al,
1991). The reliability of G, RelK(G), is the k-terminal
reliability: If K=N, this is the all terminal reliability, Rel(G).
It is easy to formulate a network in state L′ ⊆ L, with
reliability as follows: ∏ pe ∏ qe where L′ is the set of
operational arcs. e ∈ L’ e ∈( L \ L’ ) Summing this state
occurrence probability over all operational states gives the
network system reliability.
IV. PERFORMANCE EVALUATION
The TLS-SLFP scheme was evaluated based on the
same G´EANT network topology and traffic matrices that
were used for TLS, since this allows for the change in
performance to be directly compared.
0 2 4 6 8 10 12 14 16 18 20
Energy savings(%)
1 2 3 4 5
Traffic Scalling factors
Proposed (GA) Existing (TLS-SLFP)
Fig: 1 Energy-saving gains with reduced topology of α = 0.9 under different traffic scaling factors.
0 2 4 6 8 10 12 14 16 18 20
Energy savings(%)
1 2 3 4 5
Traffic scalling factor
Proposed (GA) Existing (TLS-SLFP)
Fig: 2 Energy-saving gains with reduced topology of α = 0.7 under different traffic scaling factors.
0 2 4 6 8 10 12 14 16 18 20
Energy savings(
%)
1 2 3 4 5
Traffic scalling factors Proposed (GA) Existing (TLS-SLFP)
TLS and TLS-SLFP based on diverse beliefs regarding MLU limit α. The many stats indicate that the total energy protecting benefits tend to be diminished while brand new
restrictions tend to be added in to be able to TLS in order
take into consideration solitary link inability defense within
TLS-SLFP. Fig.1 Exhibits the actual efficiency assessment
concerning TLS-SLFP and GA in the event the MLU limit
is defined to be able to 90%. It is usually witnessed of which
in all of the situations concerning diverse visitors climbing
aspects, you will find there's loss of energy savings as soon
as the additional limit is usually applied for solitary link
inability define. The bandwidth of the proposed system is
also produces the best result for energy saving as compared
to the existing work. The congestion of the proposed one is
also produce the better result as compared to the existing
system. Figs. 2 and 3 the location where the MLU limit is
defined to be able to 70% and 60% respectively.
V CONCLUSION
The traffic pattern of many equipped ISP networks
are generally regular and conventional on a daily basis, such
a characteristic can be exploited by applying simple
time-driven energy-aware network reconfigurations with low
operational complexity. In this work, an algorithm called
Time-driven Link Sleeping (TLS) was proposed which
jointly optimizes the reduced network topology and the
period of off-peak operation during which this reduced
topology can be used. The novelty of TLS is that it performs
optimization with respect to a period of traffic behavioral
dynamics (represented by multiple traffic matrices)
compared to only one instance of traffic matrix, as is the
case in the vast majority of existing works. The proposed
scheme enables a simple and practical energy management
paradigm that eases the complexity of ISP operations for
energy conservation. TLS has been evaluated based on the
G´EANT network and its real historical traffic traces, and
the results show that the proposed scheme is able to achieve
up to 28.3% energy saving effects during daily operations.
We have also taken into account the network robustness
requirement against single link failures while formative
sleeping links for off-peak time operation. The rationale
behind is to avoid potential broken topology or traffic
congestion due to unexpected single link failures that might
occur to the reduced topology during the off-peak time.
Towards this end, TLS has been further extended to cater for
any single link failure scenario, which is known as
Time-driven Link Sleeping with Single Link Failure Protection
(TLS-SLFP).
REFERENCES
1. Rajeswari Malladi and Dharma P. Agrawal “Current and Future Applications of Mobile and Wireless Networks” october 2002/vol. 45, no. 10 communications of the ACM.
2. M. A. Panduro, C. A. Brizuela “A comparison of genetic algorithms, particle swarm optimization and the differential evolution method for the design of scannable circular antenna arrays ” Progress In Electromagnetic Research B, Vol. 13, 171{186, 2009.
3. Bernard Fortz, Mikkel Thorup” Internet Traffic Engineering by Optimizing OSPF Weights”
4. Frederic Francois, Ning Wang, Klaus Moessner, and Stylianos Georgoulas “Optimizing Link Sleeping Reconfigurations in ISP Networks with Off-Peak Time Failure Protection” IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 10, NO. 2, JUNE 2013
5. S. Nedevschi, L. Popa, G. Iannaccone, S. Ratnasamy, and D. Wetherall, “Reducing network energy consumption via sleeping and rate-adaptation,” in Proc. 2008 USENIX Symposium on Networked Systems Design and Implementation, pp. 323–336.
6. G. Da Costa, J. P. Gelas, Y. Georgiou, L. Lefevre, A. C. Orgerie, J. M. Pierson, O. Richard, and K. Sharma, “The GREEN-NET framework: energy efficiency in large scale distributed systems,” in Proc. 2009 IEEE International Symposium on Parallel Distributed Processing, pp. 1–8.
7. F. Francois, N. Wang, K. Moessner, and S. Georgoulas, “Optimization for time-driven link sleeping reconfigurations in ISP backbone networks,” in Proc. IEEE Network Operations and Management Symposium, pp. 221–228.
9. A. S. Antonio Nucci and N. Taft, “The problem of synthetically generating IP traffic matrices: initial recommendations,” Narus, Sprint and Intel, Tech. Rep., 2005.
10. M. Roughan, A. Greenberg, C. Kalmanek, M. Rumsewicz, J. Yates, and Y. Zhang, “Experience in measuring backbone traffic variability: models, metrics, measurements and meaning,” in Proc. 2002 ACM SIGCOMM Workshop on Internet measurment, pp. 91–92.
11. S. Uhlig, B. Quoitin, J. Lepropre, and S. Balon, “Providing public intradomain traffic matrices to the research community,” SIGCOMM Comput. Commun. Rev., vol. 36, pp. 83–86, Jan. 2006.
12. R. Bolla, R. Bruschi, A. Cianfrani, and M. Listanti, “Enabling backbone networks to sleep,” IEEE Network, vol. 25, no. 2, pp. 26–31, Mar.-Apr. 2011.
13. P. Psenak, S. Mirtorabi, A. Roy, L. Nguyen, and P. Pillay-Esnault, “Multi-Topology (MT) Routing in OSPF,” RFC 4915 (Proposed Standard), Internet Engineering Task Force, June 2007.
14. T. Przygienda, N. Shen, and N. Sheth, “M-ISIS: Multi Topology (MT) Routing in Intermediate System to Intermediate Systems (IS-ISs),” RFC 5120 (Proposed Standard), Internet Engineering Task Force, Feb. 2008.
15. K. W. Kwong, R. Gue andrin, A. Shaikh, and S. Tao, “Balancing performance, robustness and flexibility in routing systems,” IEEE Trans. Network and Service Management, vol. 7, no. 3, pp. 186–199, Sep. 2010. 16. L. G. Roberts, “A radical new router,” IEEE
Spectrum, vol. 46, no. 7, pp. 34–39, July 2009.
17. M. Yamada, T. Yazaki, N. Matsuyama, and T. Hayashi, “Power efficient approach and performance control for routers,” in Proc. 2009 IEEE International Conference on Communications Workshops, pp. 1–5. 18. R. Bolla, R. Bruschi, and A. Ranieri, “Energy-aware
equipment for next-generation networks,” in Proc. 2009 International Conference on Future Internet Technologies, pp. 8–11.
19. M. Mandviwalla and N.-F. Tzeng, “Energy-efficient scheme for multiprocessor-based router linecards,” in Proc. 2006 International Symposium on Applications on Internet, pp. 156–163.
20. J. C. C. Restrepo, C. G. Gruber, and C. M. Machuca, “Energy profile aware routing,” in Proc. 2009 IEEE International Conference on Communications Workshops, pp. 1–5.
21. A. Cianfrani, V. Eramo, M. Listanti, M. Polverini, and A. Vasilakos, “An OSPF-integrated routing strategy for QoS-aware energy saving in IP backbone networks,” IEEE Trans. Network and Service Management, no. 99, pp. 1–14, 2012.
22. L. Irish and K. J. Christensen, “A ‘Green TCP/IP’ to reduce electricity consumed by computers,” in Proc. 1998 IEEE Southeastcon, pp. 302–305.
23. N. Vasi´c and D. Kosti´c, “Energy-aware traffic engineering,” in Proc. 2010 International Conference on Energy-Efficient Computing and Networking, pp. 169–178.
