Power-aware routing in networks with delay and link utilization constraints
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 FG...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE Computer Society
2012
|
| Online Access: | http://hdl.handle.net/20.500.11937/26049 |
| _version_ | 1848751875291086848 |
|---|---|
| author | Lin, GongQi Soh, Sieteng Lazarescu, Mihai Chin, K. |
| author2 | Pfeifer, T. |
| author_facet | Pfeifer, T. Lin, GongQi Soh, Sieteng Lazarescu, Mihai Chin, K. |
| author_sort | Lin, GongQi |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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%. |
| first_indexed | 2025-11-14T07:59:40Z |
| format | Conference Paper |
| id | curtin-20.500.11937-26049 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:59:40Z |
| publishDate | 2012 |
| publisher | IEEE Computer Society |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-260492023-02-02T07:57:40Z Power-aware routing in networks with delay and link utilization constraints Lin, GongQi Soh, Sieteng Lazarescu, Mihai Chin, K. Pfeifer, T. Jayasumana, A. Turgut, D. 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%. 2012 Conference Paper http://hdl.handle.net/20.500.11937/26049 10.1109/LCN.2012.6423626 IEEE Computer Society restricted |
| spellingShingle | Lin, GongQi Soh, Sieteng Lazarescu, Mihai Chin, K. Power-aware routing in networks with delay and link utilization constraints |
| title | Power-aware routing in networks with delay and link utilization constraints |
| title_full | Power-aware routing in networks with delay and link utilization constraints |
| title_fullStr | Power-aware routing in networks with delay and link utilization constraints |
| title_full_unstemmed | Power-aware routing in networks with delay and link utilization constraints |
| title_short | Power-aware routing in networks with delay and link utilization constraints |
| title_sort | power-aware routing in networks with delay and link utilization constraints |
| url | http://hdl.handle.net/20.500.11937/26049 |