Reliable Green Routing Using Two Disjoint Paths
Network robustness and throughput can be improved by routing each demand d via two disjoint paths (2DP). However, 2DP routing increases energy usage while providing lower linkutilization and redundancy. In this paper, we address an NP-complete problem, called 2DP-EAR, that aims to switch off redunda...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/11161 |
| _version_ | 1848747731431981056 |
|---|---|
| author | Lin, GongQi Soh, Sie Teng Lazarescu, M. Chin, K. |
| author2 | Abbas Jamalipour |
| author_facet | Abbas Jamalipour Lin, GongQi Soh, Sie Teng Lazarescu, M. Chin, K. |
| author_sort | Lin, GongQi |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Network robustness and throughput can be improved by routing each demand d via two disjoint paths (2DP). However, 2DP routing increases energy usage while providing lower linkutilization and redundancy. In this paper, we address an NP-complete problem, called 2DP-EAR, that aims to switch off redundant nodes and links while guaranteeing two constraints:traffic demands must be afforded 2DP, and maximum link utilization. We design an efficient heuristic, called 2DP by Nodes First (2DP-NF). We have extensively evaluated the performance of 2DP-NF on both real and/or synthetic topologies and traffic demands. As compared to using Shortest Path routing, on the GÉANT network, 2DP-NF can save around 20% energy by switching off links only with negligible effects on path delays and link utilization, even for MLU below 30%. Furthermore, 2DP-NF can obtain 39.7% power savings by switching off both nodes and links on the GÉANT network. |
| first_indexed | 2025-11-14T06:53:48Z |
| format | Conference Paper |
| id | curtin-20.500.11937-11161 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T06:53:48Z |
| publishDate | 2014 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-111612023-02-13T08:01:37Z Reliable Green Routing Using Two Disjoint Paths Lin, GongQi Soh, Sie Teng Lazarescu, M. Chin, K. Abbas Jamalipour Der-Jiunn Deng power savings link utilisation maximum two disjoint paths robustness throughput Network robustness and throughput can be improved by routing each demand d via two disjoint paths (2DP). However, 2DP routing increases energy usage while providing lower linkutilization and redundancy. In this paper, we address an NP-complete problem, called 2DP-EAR, that aims to switch off redundant nodes and links while guaranteeing two constraints:traffic demands must be afforded 2DP, and maximum link utilization. We design an efficient heuristic, called 2DP by Nodes First (2DP-NF). We have extensively evaluated the performance of 2DP-NF on both real and/or synthetic topologies and traffic demands. As compared to using Shortest Path routing, on the GÉANT network, 2DP-NF can save around 20% energy by switching off links only with negligible effects on path delays and link utilization, even for MLU below 30%. Furthermore, 2DP-NF can obtain 39.7% power savings by switching off both nodes and links on the GÉANT network. 2014 Conference Paper http://hdl.handle.net/20.500.11937/11161 10.1109/ICC.2014.6883901 IEEE fulltext |
| spellingShingle | power savings link utilisation maximum two disjoint paths robustness throughput Lin, GongQi Soh, Sie Teng Lazarescu, M. Chin, K. Reliable Green Routing Using Two Disjoint Paths |
| title | Reliable Green Routing Using Two Disjoint Paths |
| title_full | Reliable Green Routing Using Two Disjoint Paths |
| title_fullStr | Reliable Green Routing Using Two Disjoint Paths |
| title_full_unstemmed | Reliable Green Routing Using Two Disjoint Paths |
| title_short | Reliable Green Routing Using Two Disjoint Paths |
| title_sort | reliable green routing using two disjoint paths |
| topic | power savings link utilisation maximum two disjoint paths robustness throughput |
| url | http://hdl.handle.net/20.500.11937/11161 |