Skip to main content

Opportunistic Resource Sharing Based Elastic Resource Allocation in a Data Center

  • Conference paper
  • First Online:
Security, Privacy and Anonymity in Computation, Communication and Storage (SpaCCS 2016)

Abstract

Resource allocation is the primary issue for multi-tenant cloud data centers. Opportunistic resource sharing is an efficient way to optimize resource utilization for data centers. However, the resource collision makes it challenging. In this paper, we introduce a Markov-chain based model (MST) to characterize the dynamical resource requirements for application, instead of the traditional static virtual network. To deal with the resource collision problem, we introduce a waiting time indicator (WTE) to describe the resource usage, and achieve a tradeoff between utilization and performance. Based on the MST model and WTE indicator, we propose a TRRA algorithm. The basic idea is to select the PM with reasonable WTE value for any extra resource requirement from applications. The experimental results show that our algorithm can realize better resource utilization while guaranteeing acceptable application performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Amazon ec2 service level agreement. http://aws.amazon.com/ec2-sla/

  2. Windows azure platform service level agreements. http://www.microsoft.com/windowsazure/pricing/

  3. Alicherry, M., Lakshman, T.V.: Network aware resource allocation in distributed clouds. In: IEEE Infocom, pp. 963–971 (2012)

    Google Scholar 

  4. Ballani, H., Costa, P., Karagiannis, T., Rowstron, A.: Towards predictable datacenter networks. ACM SIGCOMM Comput. Commun. Rev. 41(4), 242–253 (2011)

    Article  Google Scholar 

  5. Chowdhury, M., Rahman, M.R., Boutaba, R.: Vineyard: virtual network embedding algorithms with coordinated node and link mapping. IEEE/ACM Trans. Netw. 20(1), 206–219 (2012)

    Article  Google Scholar 

  6. Chowdhury, N., Boutaba, R.: A survey of network virtualization. Comput. Netw. 54(5), 862–876 (2010)

    Article  MATH  Google Scholar 

  7. Ghazar, T., Samaan, N.: Pricing utility-based virtual networks. IEEE Trans. Netw. Serv. Manag. 10(2), 119–132 (2013)

    Article  Google Scholar 

  8. Guo, C., Lu, G., Wang, H.J., Yang, S., Kong, C., Sun, P., Wu, W., Zhang, Y.: Secondnet: a data center network virtualization architecture with bandwidth guarantees. In: ACM CONEXT 2010, Philadelphia, PA, USA, 30 November-December, pp. 620–622 (2010)

    Google Scholar 

  9. Jayasinghe, D., Pu, C., Eilam, T., Steinder, M., Whally, I., Snible, E.: Improving performance and availability of services hosted on iaas clouds with structural constraint-aware virtual machine placement. In: IEEE International Conference on Services Computing, pp. 72–79 (2011)

    Google Scholar 

  10. Li, X., Qian, Z., Lu, S., Wu, J.: Energy efficient virtual machine placement algorithm with balanced and improved resource utilization in a data center. Math. Comput. Model. 58(5), 1222–1235 (2013)

    Article  MathSciNet  Google Scholar 

  11. Lischka, J., Karl, H.: A virtual network mapping algorithm based on subgraph isomorphism detection. In: ACM Workshop on Virtualized Infrastructure Systems and Architectures, pp. 81–88 (2009)

    Google Scholar 

  12. Meng, X., Pappas, V., Zhang, L.: Improving the scalability of data center networks with traffic-aware virtual machine placement. In: Proceedings-IEEE INFOCOM, vol. 54(1), pp. 1–9 (2010)

    Google Scholar 

  13. Wang, M., Meng, X., Zhang, L.: Consolidating virtual machines with dynamic bandwidth demand in data centers. In: Proceedings-IEEE INFOCOM, vol. 34(17), pp. 71–75 (2011)

    Google Scholar 

  14. Xie, D., Ding, N., Hu, Y.C., Kompella, R.: The only constant is change: incorporating time-varying network reservations in data centers. In: Proceedings of ACM SIGCOMM 2012, pp. 199–210 (2012)

    Google Scholar 

  15. Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtual network embedding: substrate support for path splitting and migration. ACM SIGCOMM Comput. Commun. Rev. 38(2), 17–29 (2008)

    Article  Google Scholar 

  16. Zhang, S., Qian, Z., Wu, J., Lu, S.: Sea: stable resource allocation in geographically distributed clouds. In: ICC 2014, IEEE International Conference on Communications, pp. 2932–2937 (2014)

    Google Scholar 

  17. Zhang, S., Qian, Z., Wu, J., Lu, S., Epstein, L.: Virtual network embedding with opportunistic resource sharing. IEEE Trans. Parallel Distrib. Syst. 25(3), 816–827 (2014)

    Article  Google Scholar 

  18. Zhu, Y., Ammar, M.: Algorithms for assigning substrate network resources to virtual network components. In: Infocom IEEE International Conference on Computer Communications, pp. 1–12 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Songyun Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Yuan, G. et al. (2016). Opportunistic Resource Sharing Based Elastic Resource Allocation in a Data Center. In: Wang, G., Ray, I., Alcaraz Calero, J., Thampi, S. (eds) Security, Privacy and Anonymity in Computation, Communication and Storage. SpaCCS 2016. Lecture Notes in Computer Science(), vol 10067. Springer, Cham. https://doi.org/10.1007/978-3-319-49145-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49145-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49144-8

  • Online ISBN: 978-3-319-49145-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics