DocumentCode :
3127170
Title :
Power-aware routing in networks with delay and link utilization constraints
Author :
Gongqi Lin ; Sieteng Soh ; Lazarescu, Mihai ; Kwan-Wu Chin
Author_Institution :
Dept. of Comput., Curtin Univ. of Technol., Perth, WA, Australia
fYear :
2012
fDate :
22-25 Oct. 2012
Firstpage :
272
Lastpage :
275
Abstract :
This paper addresses the NP-hard problem of switching off bundled links whilst retaining the QoS provided to existing applications. We propose a fast heuristic, called Multiple Paths by Shortest Path First (MSPF), and evaluated its performance against two state-of-the-art techniques: GreenTE, and FGH. MSPF improves the energy saving on average by 5% as compared to GreenTE with only 1% CPU time. While yielding equivalent energy savings, MSPF requires only 0.35% of the running time of FGH. Finally, for Maximum Link Utilization (MLU) below 50% and delay no longer than the network diameter, MSPF reduces the power usage of the GÉANT topology by up to 91%.
Keywords :
computational complexity; graph theory; network topology; quality of service; telecommunication network routing; FGH; GEANT topology; GreenTE; NP-hard problem; QoS; energy saving; link utilization constraint; maximum link utilization; multiple paths by shortest path first; off bundled link switching; power aware routing; Delay; Green products; Network topology; Routing; Switches; Topology; Upper bound; bundled links; maximum link utilization; multiple paths; power savings; routing; shortest path;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Local Computer Networks (LCN), 2012 IEEE 37th Conference on
Conference_Location :
Clearwater, FL
ISSN :
0742-1303
Print_ISBN :
978-1-4673-1565-4
Type :
conf
DOI :
10.1109/LCN.2012.6423626
Filename :
6423626
Link To Document :
بازگشت