Reliable Green Routing Using Two Disjoint Paths

Lin, 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.

Source Title

2014 IEEE International Conference on Communications (ICC)

Source Conference

IEEE International Conference on Communications (ICC)

DOI

10.1109/ICC.2014.6883901

ISBN

978-1-4799-2003-7

School

Department of Computing

Remarks

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.

URI

http://hdl.handle.net/20.500.11937/11161

Collection

Curtin Research Publications

Abstract

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.