Energy aware routing with link disjoint backup paths

Pickavet, 2008, Worldwide energy needs for ICT: the rise of power-aware networking, 1 Zhang, 2010, GreenTE: power-aware traffic engineering, 21 Bianzino, 2012, A survey of green networking research, IEEE Commun. Surv. Tutor., 14, 3, 10.1109/SURV.2011.113010.00106 Swarup, 2004, PESO: low overhead protection for ethernet over SONET transport, 165 Lin, 2014, Energy aware two disjoint paths routing, J. Netw. Comput. Appl., 43, 27, 10.1016/j.jnca.2014.04.004 Kar, 2003, Routing restorable bandwidth guaranteed connections using maximum 2-route flows, IEEE/ACM Trans. Netw., 11, 772, 10.1109/TNET.2003.818191 Bolla, 2011, Energy efficiency in the future internet: a survey of existing approaches and trends in energy-aware fixed network infrastructures, IEEE Commun. Surv. Tutor., 13, 223, 10.1109/SURV.2011.071410.00073 Gupta, 2003, Greening of the internet, 19 Chabarek, 2008, Power awareness in network design and routing, 457 Chiaraviglio, 2009, Reducing power consumption in backbone networks, 2298 Chiaraviglio, 2012, Minimizing ISP network energy cost: formulation and solutions, IEEE/ACM Trans. Netw., 20, 463, 10.1109/TNET.2011.2161487 Heller, 2010, ElasticTree: saving energy in data center networks, 249 Fisher, 2010, Greening backbone networks: reducing energy consumption by shutting off cables in bundled links, 29 CPLEX, http://www.ilog.com/products/cplex/ Izmailov, 2002, Flow splitting approach for path provisioning and path protection problems, 93 Suurballe, 1984, A quick method for finding shortest pairs of disjoint paths, Networks, 14, 325, 10.1002/net.3230140209 Xiong, 2009, Multi-constrained shortest disjoint paths for reliable QoS routing, ETRI J., 31, 534, 10.4218/etrij.09.0108.0531 Kodialam, 2000, Dynamic routing of bandwidth guaranteed tunnels with restoration, 902 Kodialam, 2002, Restorable dynamic quality of service routing, IEEE Commun. Mag., 40, 72, 10.1109/MCOM.2002.1007411 Bejerano, 2005, Algorithms for computing QoS paths with restoration, IEEE/ACM Trans. Netw., 13, 648, 10.1109/TNET.2005.850217 Guo, 2003, Link-disjoint paths for reliable QoS routing, Int. J. Commun. Syst., 16, 779, 10.1002/dac.612 Addis, 2014, On the energy cost of robustness and resiliency in IP networks, Comput. Netw., 75, 239, 10.1016/j.comnet.2014.10.004 Addis, 2014, Energy management through optimized routing and device powering for greener communication networks, IEEE/ACM Trans. Netw., 22, 313, 10.1109/TNET.2013.2249667 J. Y., 1971, Finding the K shortest loopless paths in a network, Manag. Sci., 17, 712, 10.1287/mnsc.17.11.712 Lin, 2014, Reliable green routing using two disjoint paths, 3727 Fortune, 1980, The directed subgraph homeomorphism problem, Theor. Comput. Sci., 10, 111, 10.1016/0304-3975(80)90009-2 Giroire, 2010, Minimizing routing energy consumption: from theoretical to practical results, 252 Perl, 1978, Finding two disjoint paths between two pairs of vertices in a graph, J. Assoc. Comput. Mach., 25, 1, 10.1145/322047.322048 Nunes, 2014, A survey of software-defined networking: past, present, and future of programmable networks, IEEE Commun. Surv. Tutor., 16, 1617, 10.1109/SURV.2014.012214.00180 Wang, 2014, Energy-aware routing algorithms in software-defined networks, 1 Internet2, http://www.internet2.edu/ Kandula, 2005, Walking the tightrope: responsive yet stable traffic engineering, 253 Roughan, 2002, Experience in measuring internet backbone traffic variability: Models metrics, measurements and meaning, 91 Applegate, 2003, Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs, 313