DocumentCode :
1789414
Title :
Reliable green routing using two disjoint paths
Author :
Gongqi Lin ; Sieteng Soh ; Lazarescu, Mihai ; Kwan-Wu Chin
Author_Institution :
Curtin Univ. of Technol., Perth, WA, Australia
fYear :
2014
fDate :
10-14 June 2014
Firstpage :
3727
Lastpage :
3733
Abstract :
Network robustness and throughput can be improved by routing each demand d via two disjoint paths (2DP). However, 2DP routing increases energy usage while providing lower link utilization and redundancy. In this paper, we address an NP-complete problem, called 2DP-EAR, that aims to switch off redundant nodes and links while guaranteeing two constraints: traffic demands must be afforded 2DP, and maximum link utilization. We design an efficient heuristic, called 2DP by Nodes First (2DP-NF). We have extensively evaluated the performance of 2DP-NF on both real and/or synthetic topologies and traffic demands. As compared to using Shortest Path routing, on the GÉANT network, 2DP-NF can save around 20% energy by switching off links only with negligible effects on path delays and link utilization, even for MLU below 30%. Furthermore, 2DP-NF can obtain 39.7% power savings by switching off both nodes and links on the GÉANT network.
Keywords :
telecommunication network routing; 2DP routing; 2DP-EAR; 2DP-NF; GÉANT network; NP-complete problem; maximum link utilization; network robustness; reliable green routing; shortest path routing; two disjoint paths; Erbium; Network topology; Reliability; Routing; Switches; Throughput; Topology; maximum link utilization; power savings; robustness; thoughput; two disjoint paths;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications (ICC), 2014 IEEE International Conference on
Conference_Location :
Sydney, NSW
Type :
conf
DOI :
10.1109/ICC.2014.6883901
Filename :
6883901
Link To Document :
بازگشت