The energy consumption of the Internet has a huge impact on the world economy and it is likely to increase every year. In present backbone networks, pairs of nodes are connected by “bundles” of multiple physical cables that form one logical link and energy saving can be achieved by shutting down unused network resources. The hose model can support traffic demand variations among node pairs in different time periods because it accommodates multiple traffic matrices unlike the pipe model which supports only one traffic matrix. This paper proposes an OSPF (Open Shortest Path First) link weight optimization scheme to reduce the network resources used for the hose model considering single link failures. The proposed scheme employs a heuristic algorithm based on simulated annealing to determine a suitable set of link weights to reduce the worst-case total network resources used, and considering any single link failure preemptively. It efficiently selects the worst-case performance link-failure topology and searches for a link weight set that reduces the worst-case total network resources used. Numerical results show that the proposed scheme is more effective in the reduction of worst-case total network resources used than the conventional schemes, Start-time Optimization and minimum hop routing.
Ravindra Sandaruwan RANAWEERA
The University of Electro-Communications
Ihsen Aziz OUÉDRAOGO
The University of Electro-Communications
Eiji OKI
The University of Electro-Communications
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ravindra Sandaruwan RANAWEERA, Ihsen Aziz OUÉDRAOGO, Eiji OKI, "Network Optimization for Energy Saving Considering Link Failure with Uncertain Traffic Conditions" in IEICE TRANSACTIONS on Communications,
vol. E97-B, no. 12, pp. 2729-2738, December 2014, doi: 10.1587/transcom.E97.B.2729.
Abstract: The energy consumption of the Internet has a huge impact on the world economy and it is likely to increase every year. In present backbone networks, pairs of nodes are connected by “bundles” of multiple physical cables that form one logical link and energy saving can be achieved by shutting down unused network resources. The hose model can support traffic demand variations among node pairs in different time periods because it accommodates multiple traffic matrices unlike the pipe model which supports only one traffic matrix. This paper proposes an OSPF (Open Shortest Path First) link weight optimization scheme to reduce the network resources used for the hose model considering single link failures. The proposed scheme employs a heuristic algorithm based on simulated annealing to determine a suitable set of link weights to reduce the worst-case total network resources used, and considering any single link failure preemptively. It efficiently selects the worst-case performance link-failure topology and searches for a link weight set that reduces the worst-case total network resources used. Numerical results show that the proposed scheme is more effective in the reduction of worst-case total network resources used than the conventional schemes, Start-time Optimization and minimum hop routing.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.2729/_p
Copy
@ARTICLE{e97-b_12_2729,
author={Ravindra Sandaruwan RANAWEERA, Ihsen Aziz OUÉDRAOGO, Eiji OKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Network Optimization for Energy Saving Considering Link Failure with Uncertain Traffic Conditions},
year={2014},
volume={E97-B},
number={12},
pages={2729-2738},
abstract={The energy consumption of the Internet has a huge impact on the world economy and it is likely to increase every year. In present backbone networks, pairs of nodes are connected by “bundles” of multiple physical cables that form one logical link and energy saving can be achieved by shutting down unused network resources. The hose model can support traffic demand variations among node pairs in different time periods because it accommodates multiple traffic matrices unlike the pipe model which supports only one traffic matrix. This paper proposes an OSPF (Open Shortest Path First) link weight optimization scheme to reduce the network resources used for the hose model considering single link failures. The proposed scheme employs a heuristic algorithm based on simulated annealing to determine a suitable set of link weights to reduce the worst-case total network resources used, and considering any single link failure preemptively. It efficiently selects the worst-case performance link-failure topology and searches for a link weight set that reduces the worst-case total network resources used. Numerical results show that the proposed scheme is more effective in the reduction of worst-case total network resources used than the conventional schemes, Start-time Optimization and minimum hop routing.},
keywords={},
doi={10.1587/transcom.E97.B.2729},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Network Optimization for Energy Saving Considering Link Failure with Uncertain Traffic Conditions
T2 - IEICE TRANSACTIONS on Communications
SP - 2729
EP - 2738
AU - Ravindra Sandaruwan RANAWEERA
AU - Ihsen Aziz OUÉDRAOGO
AU - Eiji OKI
PY - 2014
DO - 10.1587/transcom.E97.B.2729
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2014
AB - The energy consumption of the Internet has a huge impact on the world economy and it is likely to increase every year. In present backbone networks, pairs of nodes are connected by “bundles” of multiple physical cables that form one logical link and energy saving can be achieved by shutting down unused network resources. The hose model can support traffic demand variations among node pairs in different time periods because it accommodates multiple traffic matrices unlike the pipe model which supports only one traffic matrix. This paper proposes an OSPF (Open Shortest Path First) link weight optimization scheme to reduce the network resources used for the hose model considering single link failures. The proposed scheme employs a heuristic algorithm based on simulated annealing to determine a suitable set of link weights to reduce the worst-case total network resources used, and considering any single link failure preemptively. It efficiently selects the worst-case performance link-failure topology and searches for a link weight set that reduces the worst-case total network resources used. Numerical results show that the proposed scheme is more effective in the reduction of worst-case total network resources used than the conventional schemes, Start-time Optimization and minimum hop routing.
ER -