This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Annual IEEE Conference on Local Computer Networks
Power-aware routing in networks with delay and link utilization constraints
Clearwater Beach, FL, USA USA
October 22-October 25
ISBN: 978-1-4673-1565-4
Gongqi Lin, Department of Computing, Curtin University of Technology, Perth Australia
Sieteng Soh, Department of Computing, Curtin University of Technology, Perth Australia
Mihai Lazarescu, Department of Computing, Curtin University of Technology, Perth Australia
Kwan-Wu Chin, School of Electrical, Computer and Telecommunications Engineering, University of Wollongong, Australia
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%.
Index Terms:
Green products,Delay,Topology,Switches,Network topology,Routing,Upper bound,shortest path,power savings,routing,multiple paths,maximum link utilization,bundled links
Citation:
Gongqi Lin, Sieteng Soh, Mihai Lazarescu, Kwan-Wu Chin, "Power-aware routing in networks with delay and link utilization constraints," lcn, pp.272-275, 37th Annual IEEE Conference on Local Computer Networks, 2012
Usage of this product signifies your acceptance of the Terms of Use.