Minimum-cost network design with (Dis)economies of scale

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 585-592

  Andrews, Matthew ^a   Antonakopoulos, Spyridon ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Approximation algorithms; Diseconomies of scale; Energy efficient networks

Indexed keywords

APPROXIMATION ALGORITHMS; ECONOMICS; ENERGY EFFICIENCY; ENERGY UTILIZATION; GREEN COMPUTING;

BICRITERIA APPROXIMATION; BUY-AT BULK NETWORK DESIGN; COMMUNICATION DEVICE; DISECONOMIES OF SCALE; ENERGY EFFICIENT NETWORKS; NETWORK DESIGN PROBLEMS; POLYLOGARITHMIC APPROXIMATION; RANDOMIZED ROUNDING;

COST FUNCTIONS;

EID: 78751555863     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.61     Document Type: Conference Paper

References (33)

1. C. Chekuri, S. Khanna, and F. B. Shepherd, "Multicommodity flow, well-linked terminals, and routing problems," in Proceedings of ACM STOC, 2005, pp. 183-192.
2. R. Khandekar, S. Rao, and U. Vazirani, "Graph partitioning using single commodity flows," in Proceedings of ACM STOC, 2006, pp. 385-390.
3. S. Rao and S. Zhou, "Edge disjoint paths in moderately connected graphs," SIAM Journal on Computing, vol. 39, no. 5, pp. 1856-1887, 2010.
4. B. Awerbuch and Y. Azar, "Buy-at-bulk network design," in Proceedings of IEEE FOCS, 1997, pp. 542-547.
5. M. Charikar and A. Karagiozova, "On non-uniform multicommodity buy-at-bulk network design," in Proceedings of ACM STOC, 2005, pp. 176-182.
6. C. Chekuri, M. T. Hajiaghayi, G. Kortsarz, and M. R. Salavatipour, "Approximation algorithms for nonuniform buy-at-bulk network design," SIAM Journal on Computing, vol. 39, no. 5, pp. 1772-1798, 2010. [Online]. Available: http://link.aip.org/link/?SMJ/39/1772/1
7. M. Andrews, "Hardness of buy-at-bulk network design," in Proceedings of IEEE FOCS, 2004, pp. 115-124.
8. "SMART2020: Enabling the low carbon economy in the information age," 2008. [Online]. Available: http://www.smart2020.org
9. P. Kurp, "Green computing," Commun. ACM, vol. 51, no. 10, pp. 11-13, 2008.
10. F. F. Yao, A. Demers, and S. Shenker, "A scheduling model for reduced CPU energy," in Proceedings of IEEE FOCS, 1995, pp. 374-382.
11. M. Li, B. J. Liu, and F. F. Yao, "Min-energy voltage allocation for tree-structured tasks," in Proceedings of COCOON, 2005, pp. 283-296.
12. N. Bansal, T. Kimbrel, and K. Pruhs, "Speed scaling to manage energy and temperature," Journal of the ACM, vol. 54, no. 1, 2007.
13. H.-L. Chan, W.-T. Chan, T. W. Lam, L.-K. Lee, K.-S. Mak, and P. W. H. Wong, "Energy efficient online deadline scheduling," in Proceedings of ACM-SIAM SODA, 2007, pp. 795-804.
14. N. Bansal, H.-L. Chan, and K. Pruhs, "Speed scaling with an arbitrary power function," in Proceedings of ACM-SIAM SODA, 2009, pp. 693-701.
15. S. Irani and K. Pruhs, "Algorithmic problems in power management," SIGACT News, vol. 36, no. 2, pp. 63-76, 2005.
16. C. Gunaratne, K. J. Christensen, B. Nordman, and S. Suen, "Reducing the energy consumption of ethernet with adaptive link rate (ALR)," IEEE Trans. Computers, vol. 57, no. 4, pp. 448-461, 2008.
17. S. Nedevschi, L. Popa, G. Iannaccone, S. Ratnasamy, and D. Wetherall, "Reducing network energy consumption via sleeping and rate-adaptation, " in NSDI, J. Crowcroft and M. Dahlin, Eds. USENIX Association, 2008, pp. 323-336.
18. "Enhanced Intel SpeedStep technology for the Intel Pentium M processor," Intel White Paper 301170-001, 2004.
19. G. Ginis, "Low-power modes for ADSL2 and ADSL2+," White Paper, Broadband Communications Group, Texas Instruments, Jan. 2005. [Online]. Available: http://focus.ti.com/pdfs/bcg/adsl2-low-power-wp.pdf
20. IEEE P802.3az Energy Efficient Ethernet Task Force, "Task Force meeting materials," 2008. [Online]. Available: http://grouper.ieee.org/ groups/802/3/az/public/index.html
21. P. Patel-Predd, "Energy-efficient ethernet," IEEE Spectrum, p. 13, May 2008.
22. D. Brooks, P. Bose, S. Schuster, H. M. Jacobson, P. Kudva, A. Buyuktosunoglu, J.-D. Wellman, V. V. Zyuban, M. Gupta, and P. W. Cook, "Power-aware microarchitecture: Design and modeling challenges for next-generation microprocessors," IEEE Micro, vol. 20, no. 6, pp. 26-44, 2000.
23. A. Wierman, L. L. H. Andrew, and A. Tang, "Power-aware speed scaling in processor sharing systems," in Proceedings of IEEE INFOCOM, 2009, pp. 2007-2015.
24. M. Andrews, A. Fernandez Anta, L. Zhang, and W. Zhao, "Routing for energy minimization in the speed scaling model," in Proceedings of IEEE INFOCOM, 2010.
25. Y. Bartal, "Probabilistic approximation of metric spaces and its algorithmic applications," in Proceedings of IEEE FOCS, 1996, pp. 184-193.
26. J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," Journal of Computer and System Sciences, vol. 69, pp. 485-497, 2004.
27. G. Kortsarz and Z. Nutov, "Approximating some network design problems with node costs," in Proceedings of APPROX-RANDOM, 2009, pp. 231-243.
28. R. D. Carr, L. Fleischer, V. J. Leung, and C. A. Phillips, "Strengthening integrality gaps for capacitated network design and covering problems," in Proceedings of ACM-SIAM SODA, 2000, pp. 106-115.
29. B. Gendron, T. G. Crainic, and A. Frangioni, "Multicommodity capacitated network design," in Telecommunications Network Planning, B. Sansò and P. Soriano, Eds., 1999, pp. 1-19.
30. M. Hewitt, G. L. Nemhauser, and M. W. P. Savelsbergh, "Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem," INFORMS Journal on Computing, vol. 22, no. 2, pp. 314-325, 2010.
31. A. Gupta, A. Kumar, and T. Roughgarden, "Simpler and better approximation algorithms for network design," in Proceedings of ACM STOC, 2003, pp. 365-372.
32. D. Kocombining double acute accentnig, "Graphok és matrixok," Matematikai és Fizikai Lapok, vol. 38, pp. 116-119, 1931.
33. M. X. Goemans and D. P. Williamson, "A general approximation technique for constrained forest problems," SIAM Journal on Computing, vol. 24, no. 2, pp. 296-317, 1995.