Abstract
Energy consumption is an important issue in the design and use of networks. In this paper, we explore energy savings in networks via a rate adaptation model. This model can be represented by a cost-minimization network routing problem with discrete cost functions. We formulate this problem as an integer program, which is proved to be NP-hard. Then a constant approximation algorithm is developed. In our proposed method, we first transform the program into a continuous-cost network routing problem, and then we approximate the optimal solution by a two-step rounding process. We show by analysis that, for uniform demands, our method provides a constant approximation for the uniform network routing problem with discrete costs. A bicriteria network routing problem is also developed so that a trade-off can be made between energy consumption and network delay. Analytical results for this latter model are also presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrews, M.: Hardness of Buy-at-Bulk Network Design. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 115–124. IEEE Computer Society, Washington, DC (2004)
Andrews, M., Antonakopoulos, S., Zhang, L.: Minimum-Cost Network Design with (Dis)economies of Scale. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 585–592. IEEE Computer Society, Washington, DC (2010)
Andrews, M., Antonakopoulos, S., Zhang, L.: Energy-aware Scheduling Algorithms for Network Stability. In: Proceedings of 29th Annual IEEE International Conference on Computer Communications (INFOCOM), pp. 1359–1367. IEEE Press, Shanghai (2011)
Andrews, M., Fernández, A.A., Zhang, L., Wenbo, Z.: Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model. In: Proceedings of 29th Annual IEEE International Conference on Computer Communications (INFOCOM). IEEE Press, San Diego (2010)
Andrews, M., Fernández A.A., Zhang, L., Wenbo, Z.: Routing for Energy Minimization in the Speed Scaling Model. In: Proceedings of 29th Annual IEEE International Conference on Computer Communications (INFOCOM). IEEE Press, San Diego (2010)
Awerbuch, B., Azar, Y.: Buy-at-bulk Network Design. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 542–550. IEEE Computer Society, Washington, DC (1997)
Bansal, N., Chan, H.L., Pruhs, K.: Speed Scaling with an Arbitrary Power Function. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 693–701. Society for Industrial and Applied Mathematics, New York (2009)
Bansal, N., Kimbrel, T., Pruhs, K.: Speed Scaling to Manage Energy and Temperature. Journal of the ACM 54(1), 1–39 (2007)
Brandon, H., Srinivasan, S., Priya, M., Yiannis, Y., Puneet, S., Sujata, B., Nick, M.: ElasticTree: Saving Energy in Data Center Networks. In: Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, pp. 249–264. USENIX Association, Berkeley (2010)
Brooks, D.M., Bose, P., Schuster, S.E., Jacobson, H., Kudva, P.N., Buyuktosunoglu, A., Wellman, J., Zyuban, V., Gupta, M., Cook, P.W.: Power-aware Microarchitecture: Design and Modeling Challenges for Next-generation Microprocessors. IEEE Micro 20(6), 26–44 (2000)
Chan, H.L., Chan, W.T., Lam, T.W., Lee, L.K., Mak, K.S., Wong, P.W.H.: Energy Efficient Online Deadline Scheduling. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 795–804. Society for Industrial and Applied Mathematics, New Orleans (2007)
Gunaratne, C., Christensen, K., Nordman, B., Suen, S.: Reducing the Energy Consumption of Ethernet with Adaptive Link Rate (ALR). IEEE Transaction on Computers 57(4), 448–461 (2008)
Gupta, M., Singh, S.: Greening of the Internet. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures and Protocols for Computer Communications (SIGCOMM), pp. 19–26. ACM Press, Karlsruhe (2003)
Kurp, P.: Green Computing. Communication of the ACM 51(10), 11–13 (2008)
Nedevschi, S., Popa, L., Iannaccone, G., Ratnasamy, S., Wetherall, D.: Reducing Network Energy Consumption via Sleeping and Rate-adaptation. In: Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 323–336. USENIX Association, San Francisco (2008)
Burt, S.R.: Curve fitting to step functions. Agricultural & Applied Economics Association 46(2), 662–672 (1964)
Yao, F., Demers, A., Shenker, S.: A Scheduling Model for Reduced CPU Energy. In: 36th Annual Symposium on Foundations of Computer Sciences, pp. 374–382 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Fernández Anta, A., Zhang, F., Hou, C., Liu, Z. (2012). Energy-Efficient Network Routing with Discrete Cost Functions. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-29952-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29951-3
Online ISBN: 978-3-642-29952-0
eBook Packages: Computer ScienceComputer Science (R0)