Energy-Aware Two Link-Disjoint Paths Routing
Network robustness and throughput can be improved by routing each source-to-terminal (s, t) demand via two link-disjoint paths (TLDP). However, the use of TLDP incurs higher energy cost. Henceforth, we address the problem of minimizing the energy usage of networks that use TLDP. Specifically, our pr...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE Press
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/17186 |
| _version_ | 1848749394373902336 |
|---|---|
| author | Lin, Gongqi Soh, Sieteng Chin, K. Lazarescu, Mihai |
| author2 | IEEE |
| author_facet | IEEE Lin, Gongqi Soh, Sieteng Chin, K. Lazarescu, Mihai |
| author_sort | Lin, Gongqi |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Network robustness and throughput can be improved by routing each source-to-terminal (s, t) demand via two link-disjoint paths (TLDP). However, the use of TLDP incurs higher energy cost. Henceforth, we address the problem of minimizing the energy usage of networks that use TLDP. Specifically, our problem is to maximally switch off redundant network links while maintaining at least 0≤T≤100% of (s, t) TLDP in the network, for a given T, and limiting the maximum link utilization (MLU) to no greater than a configured threshold. To address this problem, we present a fast heuristic, called TLDP by Shortest Path First (TLDP-SPF), and extensively evaluate its performance on both real and/or synthetic topologies and traffic demands. Our simulation results show that TLDP-SPF can reduce network energy usage, on average, by more than 20%, even for MLU below 50%. As compared to using Shortest Path routing, while reducing energy by about 20%, TLDP-SPF does not significantly affect (s, t) path length, even for MLU<;50%. |
| first_indexed | 2025-11-14T07:20:14Z |
| format | Conference Paper |
| id | curtin-20.500.11937-17186 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:20:14Z |
| publishDate | 2013 |
| publisher | IEEE Press |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-171862017-09-13T15:43:29Z Energy-Aware Two Link-Disjoint Paths Routing Lin, Gongqi Soh, Sieteng Chin, K. Lazarescu, Mihai IEEE power savings routing robustness maximum link utilization two link-disjoint paths thoughput algorithm Network robustness and throughput can be improved by routing each source-to-terminal (s, t) demand via two link-disjoint paths (TLDP). However, the use of TLDP incurs higher energy cost. Henceforth, we address the problem of minimizing the energy usage of networks that use TLDP. Specifically, our problem is to maximally switch off redundant network links while maintaining at least 0≤T≤100% of (s, t) TLDP in the network, for a given T, and limiting the maximum link utilization (MLU) to no greater than a configured threshold. To address this problem, we present a fast heuristic, called TLDP by Shortest Path First (TLDP-SPF), and extensively evaluate its performance on both real and/or synthetic topologies and traffic demands. Our simulation results show that TLDP-SPF can reduce network energy usage, on average, by more than 20%, even for MLU below 50%. As compared to using Shortest Path routing, while reducing energy by about 20%, TLDP-SPF does not significantly affect (s, t) path length, even for MLU<;50%. 2013 Conference Paper http://hdl.handle.net/20.500.11937/17186 10.1109/HPSR.2013.6602298 IEEE Press fulltext |
| spellingShingle | power savings routing robustness maximum link utilization two link-disjoint paths thoughput algorithm Lin, Gongqi Soh, Sieteng Chin, K. Lazarescu, Mihai Energy-Aware Two Link-Disjoint Paths Routing |
| title | Energy-Aware Two Link-Disjoint Paths Routing |
| title_full | Energy-Aware Two Link-Disjoint Paths Routing |
| title_fullStr | Energy-Aware Two Link-Disjoint Paths Routing |
| title_full_unstemmed | Energy-Aware Two Link-Disjoint Paths Routing |
| title_short | Energy-Aware Two Link-Disjoint Paths Routing |
| title_sort | energy-aware two link-disjoint paths routing |
| topic | power savings routing robustness maximum link utilization two link-disjoint paths thoughput algorithm |
| url | http://hdl.handle.net/20.500.11937/17186 |