Minimization of Network Power Consumption with Redundancy Elimination, International IFIP TC 6 Networking Conference, pp.247-258, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00721855
On capacitated network design cut?set polyhedra, Mathematical Programming, vol.92, issue.3, pp.425-437, 2002. ,
DOI : 10.1007/s101070100284
The convex hull of two core capacitated network design problems, Mathematical Programming, vol.17, issue.1-3, pp.233-250, 1993. ,
DOI : 10.1007/BF01580612
On cut-based inequalities for capacitated network design polyhedra, Networks, vol.14, issue.2, pp.141-156, 2011. ,
DOI : 10.1002/net.20395
A Power Benchmarking Framework for Network Devices, Proceedings of the 8th International IFIP-TC 6 Networking Conference, pp.795-808, 2009. ,
DOI : 10.1109/TC.2007.70836
SNDlib 1.0-Survivable Network Design Library, Networks, vol.3, pp.276-286, 2010. ,
DOI : 10.1002/net.20371
A Power Benchmarking Framework for Network Devices, Proceedings of IFIP Networking, pp.795-808, 2009. ,
DOI : 10.1109/TC.2007.70836
Minimizing ISP Network Energy Cost: Formulation and Solutions, IEEE/ACM Transactions on Networking, vol.20, issue.2, pp.463-476, 2012. ,
DOI : 10.1109/TNET.2011.2161487
Packet Caches on Routers: the Implications of Universal Redundant Traffic Elimination, Proceedings of ACM SIGCOMM, pp.219-230, 2008. ,
Application Acceleration and WAN Optimization Fundamentals, 2007. ,
On the cut polytope, Mathematical Programming, vol.2, issue.2, pp.157-173, 1986. ,
DOI : 10.1007/BF02592023