Skip to main content
SpringerLink
Log in

Service-Oriented Resource Allocation in Clouds: Pursuing Flexibility and Efficiency

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The networking-oblivious resource reservation model in today’s public clouds cannot guarantee the performance of tenants’ applications. Virtual networks that capture both computing and networking resource requirements of tenants have been proposed as better interfaces between cloud providers and tenants. In this paper, we propose a novel virtual network model that could specify not only absolute and relative location requirements but also time-varying resource demands. Building on top of our model, we study how to efficiently and flexibly place multiple virtual networks in a cloud, and we propose two algorithms, MIPA and SAPA, which focus on optimizing resource utilization and providing flexible placement, respectively. The mixed integer programming based MIPA transforms the placement problem into the multi-commodity flow problem through augmenting the physical network with shadow nodes and links. The simulated annealing-based SAPA achieves resource utilization efficiency through opportunistically sharing physical resources among multiple resource demands. Besides, SAPA allows cloud providers to control the trade-offs between performance guarantee and resource utilization, and between allocation optimality and running time, and allows tenants to control the trade-off between application performance and placement cost. Extensive simulation results confirm the efficiency of MIPA in resource utilization and the flexibility of SAPA in controlling trade-offs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Armbrust M, Fox A, Griffith R et al. A view of cloud computing. Communications of the ACM, 2010, 53(4): 50–58.

    Article  Google Scholar 

  2. Greenberg A, Hamilton J R, Jain N et al. VL2: A scalable and flexible data center network. In Proc. ACM SIGCOMM 2009 Conference, Aug. 2009, pp.51-62.

  3. Ballani H, Costa P, Karagiannis T et al. Towards predictable datacenter networks. In Proc. ACM SIGCOMM 2011 Conference, Aug. 2011, pp.242-253.

  4. Xu F, Liu F, Jin H et al. Managing performance overhead of virtual machines in cloud computing: A survey, state of the art, and future directions. Proceedings of the IEEE, 2014, 102(1): 11–31.

    Article  Google Scholar 

  5. Guo C, Lu G, Wang H et al. SecondNet: A data center network virtualization architecture with bandwidth guarantees. In Proc. the 6th ACM International Conference on Emerging Networking Experiments and Technologies, Nov. 30-Dec. 3, 2010, Article No. 15.

  6. Xie D, Ding N, Hu Y C et al. The only constant is change: Incorporating time-varying network reservations in data centers. In Proc. ACM SIGCOMM 2012 Conference, Aug. 2012, pp.199-210.

  7. Yu M, Yi Y, Rexford J et al. Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 17–29.

    Article  Google Scholar 

  8. Chowdhury M, Rahman M, Boutaba R. ViNEYard: Virtual network embedding algorithms with coordinated node and link mapping. IEEE/ACM Transactions on Networking, 2012, 20(1): 206–219.

    Article  Google Scholar 

  9. Duan Q, Yan Y, Vasilakos A V. A survey on service-oriented network virtualization toward convergence of networking and cloud computing. IEEE Transactions on Network and Service Management, 2012, 9(4): 373–392.

    Article  Google Scholar 

  10. Ahuja R K, Magnanti T L, Orlin J B. Network Flows: Theory, Algorithms, and Applications. Prentice hall, Upper Saddle River, NJ, USA, 1993.

    MATH  Google Scholar 

  11. Kirkpatrick S. Optimization by simulated annealing: Quantitative studies. J. Statistical Physics, 1984, 34(5/6): 975–986.

    Article  MathSciNet  Google Scholar 

  12. Zhang S, Qian Z Z, Wu J et al. Virtual network embedding with opportunistic resource sharing. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(3): 816–827.

    Article  Google Scholar 

  13. Zhu Y, Ammar M. Algorithms for assigning substrate network resources to virtual network components. In Proc. the 25th IEEE INFOCOM, Apr. 2006.

  14. Vogels W. Beyond server consolidation. ACM Queue, 2008, 6(1): 20-26.

    Article  Google Scholar 

  15. Ghazar T, Samaan N. Pricing utility-based virtual networks. IEEE Transactions on Network and Service Management, 2013, 10(2): 119-132.

    Article  Google Scholar 

  16. Agarwal S, Kandula S, Bruno N et al. Re-optimizing data-parallel computing. In Proc. the 9th USENIX Symp. Networked Systems Design and Implementation, Apr. 2012, pp.281-294.

  17. Koslovski G, Yeow W L, Westphal C et al. Reliability support in virtual infrastructures. In Proc. the 2nd IEEE CloudCom, Nov. 30-Dec. 3, 2010, pp.49-58.

  18. Yeow W L, Westphal C, Kozat U C. Designing and embedding reliable virtual infrastructures. ACM SIGCOMM Computer Communication Review, 2011, 41(2): 57–64.

    Article  Google Scholar 

  19. Jarray A, Karmouch A. Cost-efficient mapping for fault-tolerant virtual networks. IEEE Transactions on Computers, 2014. (PrePrint)

  20. Andersen D G. Theoretical approaches to node assignment. Technical Report, Computer Science Department, Carnegie Mellon University, USA, Dec. 2002.

  21. Vijay V V. Approximation Algorithms. Springer-Verlag, Berlin, 2001.

    Google Scholar 

  22. Mitzenmacher M, Upfal E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York, NY, USA, 2005.

    Book  Google Scholar 

  23. Anagnostopoulos A, Michel L, Hentenryck P V et al. A simulated annealing approach to the traveling tournament problem. Journal of Scheduling, 2006, 9(2): 177–193.

    Article  MATH  Google Scholar 

  24. Osman I H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 1993, 41(4): 421–451.

    Article  MATH  MathSciNet  Google Scholar 

  25. Zhang S, Qian Z Z, Guo S et al. FELL: A flexible virtual network embedding algorithm with guaranteed load balancing. In Proc. IEEE Int. Conf. Communications, Jun. 2011.

  26. Wang M, Meng X, Zhang L. Consolidating virtual machines with dynamic bandwidth demand in data centers. In Proc. the 30th IEEE INFOCOM, Apr. 2011, pp.71-75.

  27. Meng X, Pappas V, Zhang L. Improving the scalability of data center networks with traffic-aware virtual machine placement. In Proc. the 29th IEEE INFOCOM, Mar. 2010, pp.1154-1162.

  28. Zhang Q, Zhani M F, Boutaba R et al. Harmony: Dynamic heterogeneity-aware resource provisioning in the cloud. In Proc. the 33rd ICDCS, Jul. 2013, pp.510-519.

  29. Wei G, Vasilakos A V, Zheng Y et al. A game-theoretic method of fair resource allocation for cloud computing services. J. Supercomputing, 2010, 54(2): 252–269.

    Article  Google Scholar 

  30. Zhang H, Li B, Jiang H et al. A framework for truthful online auctions in cloud computing with heterogeneous user demands. In Proc. the 32nd IEEE INFOCOM, Apr. 2013, pp.1510-1518.

  31. Di S, Wang C L. Minimization of cloud task execution length with workload prediction errors. In Proc. the 20th International Conference on High Performance Computing, Dec. 2013, pp.69-78.

  32. Di S, Wang C L. Dynamic optimization of multiattribute resource allocation in self-organizing clouds. IEEE Trans. Parallel and Distributed Systems, 2013, 24(3): 464–478.

    Article  Google Scholar 

  33. Rahimi M R, Ren J, Liu C H et al. Mobile cloud computing: A survey, state of art and future directions. Mobile Networks and Applications, 2014, 19(2): 133–143.

    Article  Google Scholar 

  34. Rahimi M R, Venkatasubramanian N, Mehrotra S et al. MAPCloud: Mobile applications on an elastic and scalable 2-tier cloud architecture. In Proc. the 5th IEEE/ACM Int. Conf. Utility and Cloud Computing, Nov. 2012, pp.83-90.

  35. Rahimi M R, Venkatasubramanian N, Vasilakos A V. MuSIC: Mobility-aware optimal service allocation in mobile cloud computing. In Proc. the 6th IEEE International Conference on Cloud Computing, Jun. 28-Jul. 3, 2013, pp.75-82.

  36. Gao P X, Curtis A R, Wong B et al. It’s not easy being green. In Proc. ACM SIGCOMM 2012 Conference, Aug. 2012, pp.211-222.

  37. Wang L, Zhang F, Aroca J A et al. GreenDCN: A general framework for achieving energy efficiency in data center networks. IEEE Journal on Selected Areas in Communications, 2014, 32(1): 4–15.

    Article  Google Scholar 

  38. Al-Fares M, Loukissas A, Vahdat A. A scalable, commodity data center network architecture. In Proc. ACM SIG-COMM 2008 Conference, Aug. 2008, pp.63-74.

  39. Guo C, Wu H, Tan K et al. DCell: A scalable and fault-tolerant network structure for data centers. In Proc. ACM SIGCOMM 2008 Conference, Aug. 2008, pp.75-86.

  40. Guo C, Lu G, Li D et al. BCube: A high performance, server-centric network architecture for modular data centers. In Proc. ACM SIGCOMM 2009 Conference, Aug. 2009, pp.63-74.

  41. Zhou X, Zhang Z, Zhu Y et al. Mirror mirror on the ceiling: Flexible wireless links for data centers. In Proc. ACM SIGCOMM 2012 Conference, Aug. 2012, pp.443-454.

  42. Ballani H, Costa P, Karagiannis T et al. The price is right: Towards location-independent costs in datacenters. In Proc. the 10th HotNets, Nov. 2011, Article No. 23.

  43. Ricci R, Alfeld C, Lepreau J. A solver for the network testbed mapping problem. ACM SIGCOMM Computer Communication Review, 2003, 33(2): 65–81.

    Article  Google Scholar 

  44. Lischka J, Karl H. A virtual network mapping algorithm based on subgraph isomorphism detection. In Proc. the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures, Aug. 2009, pp.81-88.

  45. Cheng X, Su S, Zhang Z et al. Virtual network embedding through topology-aware node ranking. ACM SIGCOMM Computer Communication Review, 2011, 41(2): 38–47.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210023, China

    Sheng Zhang, Zhu-Zhong Qian & Sang-Lu Lu

  2. Department of Computer Science and Technology, Nanjing University, Nanjing, 210023, China

    Sheng Zhang, Zhu-Zhong Qian & Sang-Lu Lu

  3. Department of Computer and Information Sciences, Temple University, Philadelphia, PA, 19122, U.S.A.

    Jie Wu

Authors
  1. Sheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhu-Zhong Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jie Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sang-Lu Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhu-Zhong Qian.

Additional information

This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61472181, 61202113, and 61321491, the Key Project of Jiangsu Research Program of China under Grant No. BE2013116, and the EU FP7 IRSES Mobile Cloud Project under Grant No. 612212.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, S., Qian, ZZ., Wu, J. et al. Service-Oriented Resource Allocation in Clouds: Pursuing Flexibility and Efficiency. J. Comput. Sci. Technol. 30, 421–436 (2015). https://doi.org/10.1007/s11390-015-1533-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-015-1533-2

Keywords

Search

Navigation