View Item 

Power-aware routing in networks with delay and link utilization constraints

Access Status
Fulltext not available
Authors
Lin, GongQi
Soh, Sieteng
Lazarescu, Mihai
Chin, K.
Date
2012
Type
Conference Paper

Metadata
Show full item record
Citation
Lin, G. and Soh, S. and Lazarescu, M. and Chin, K. 2012. Power-aware routing in networks with delay and link utilization constraints, in Proceedings of the 37th IEEE Conference on Local Computer Networks (LCN), Oct 22-25 2012, pp. 272-275. Florida, USA: IEEE Computer Society.
Source Title
Proceedings of the 37th Annual IEEE Conference on Local Computer Networks (LCN 2012)
Source Conference
IEEE Conference on Local Computer Networks
DOI
ISBN
School
Department of Computing
URI
Collection
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%.