Energy-Efficient Network Routing with Discrete Cost Functions

  • Lin Wang
  • Antonio Fernández Anta
  • Fa Zhang
  • Chenying Hou
  • Zhiyong Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7287)

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.

Keywords

network optimization network routing approximation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Bansal, N., Kimbrel, T., Pruhs, K.: Speed Scaling to Manage Energy and Temperature. Journal of the ACM 54(1), 1–39 (2007)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    Kurp, P.: Green Computing. Communication of the ACM 51(10), 11–13 (2008)CrossRefGoogle Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    Burt, S.R.: Curve fitting to step functions. Agricultural & Applied Economics Association 46(2), 662–672 (1964)Google Scholar
  17. 17.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Lin Wang
    • 1
    • 4
  • Antonio Fernández Anta
    • 2
  • Fa Zhang
    • 1
  • Chenying Hou
    • 1
    • 4
  • Zhiyong Liu
    • 3
  1. 1.Center for Advanced Computing Research and Key Lab of Intelligent Information Processing, Institute of Computing TechnologyChinese Academy of SciencesChina
  2. 2.Institute IMDEA NetworksSpain
  3. 3.China State Key Lab for Computer Architecture, Institute of Computing TechnologyChinese Academy of SciencesChina
  4. 4.Graduate University of Chinese Academy of SciencesChina

Personalised recommendations