The Community for Technology Leaders
RSS Icon
Subscribe
Clearwater Beach, FL, USA USA
Oct. 22, 2012 to Oct. 25, 2012
ISBN: 978-1-4673-1565-4
pp: 272-275
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
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%.
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, 2012, 38th Annual IEEE Conference on Local Computer Networks, 38th Annual IEEE Conference on Local Computer Networks 2012, pp. 272-275, doi:10.1109/LCN.2012.6423626
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool