Show simple item record

dc.contributor.authorLin, GongQi
dc.contributor.authorSoh, Sie Teng
dc.contributor.authorLazarescu, M.
dc.contributor.authorChin, K.
dc.contributor.editorAbbas Jamalipour and Der-Jiunn Deng
dc.identifier.citationLin, G. and Soh, S. and Lazarescu, M. and Chin, K. 2014. Reliable Green Routing Using Two Disjoint Paths, in IEEE International Conference on Communications (ICC), Jun 10-14 2014. Sydney, Australia: IEEE.

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.

dc.subjectpower savings
dc.subjectlink utilisation
dc.subjecttwo disjoint paths
dc.titleReliable Green Routing Using Two Disjoint Paths
dc.typeConference Paper
dcterms.source.title2014 IEEE International Conference on Communications (ICC)
dcterms.source.series2014 IEEE International Conference on Communications (ICC)
dcterms.source.conferenceIEEE International Conference on Communications (ICC)
dcterms.source.conference-start-dateJun 10 2014
dcterms.source.conferencelocationSydney, Australia
dcterms.source.placeIEEE Operations Center, 445 Hoes Lane, Piscataway, NJ 08854

Copyright © 2014 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.departmentDepartment of Computing
curtin.accessStatusOpen access

Files in this item


This item appears in the following Collection(s)

Show simple item record