Energy-Aware Two Link-Disjoint Paths Routing
dc.contributor.author | Lin, Gongqi | |
dc.contributor.author | Soh, Sieteng | |
dc.contributor.author | Chin, K. | |
dc.contributor.author | Lazarescu, Mihai | |
dc.contributor.editor | IEEE | |
dc.date.accessioned | 2017-01-30T12:00:12Z | |
dc.date.available | 2017-01-30T12:00:12Z | |
dc.date.created | 2014-02-13T20:00:39Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Lin, Gongqi and Soh, Sieteng and Chin, Kwan-Wu and Lazarescu, Mihai. 2013. Energy-Aware Two Link-Disjoint Paths Routing, in Proceedings of the 14th International Conference on High Performance Switching and Routing (HPSR), Jul 8-11 2013, pp. 103-108. Taipei, Taiwan: IEEE. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/17186 | |
dc.identifier.doi | 10.1109/HPSR.2013.6602298 | |
dc.description.abstract |
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%. | |
dc.publisher | IEEE Press | |
dc.subject | power savings | |
dc.subject | routing | |
dc.subject | robustness | |
dc.subject | maximum link utilization | |
dc.subject | two link-disjoint paths | |
dc.subject | thoughput | |
dc.subject | algorithm | |
dc.title | Energy-Aware Two Link-Disjoint Paths Routing | |
dc.type | Conference Paper | |
dcterms.source.startPage | 103 | |
dcterms.source.endPage | 108 | |
dcterms.source.title | 2013 IEEE 14th International Conference on High Performance Switching and Routing | |
dcterms.source.series | 2013 IEEE 14th International Conference on High Performance Switching and Routing | |
dcterms.source.isbn | 978-1-4673-4619-1 | |
dcterms.source.conference | International Conference on High Performance Switching and Routing | |
dcterms.source.conference-start-date | Jul 8 2013 | |
dcterms.source.conferencelocation | Taipei, Taiwan | |
dcterms.source.place | IEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854 | |
curtin.note |
Copyright © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | |
curtin.department | ||
curtin.accessStatus | Open access |