본문 바로가기
KERD
논문KCI 등재

An Efficient VM-Level Scaling Scheme in an IaaS Cloud Computing System: A Queueing Theory Approach

2

조회

0

다운로드

1

인용

0

참고문헌

키워드

주제분류컴퓨터학

초록

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

Abstract

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

참고문헌 (15)

  1. 김문경, "An Efficient Two-Phase Heuristic Policy for Acceptance Control in IaaS Cloud Service", 산업경영시스템학회지, 38(2), pp.91~100 (2015), 한국산업경영시스템학회
  2. 엄태원, "Dynamic Resource Allocation and Scheduling for Cloud-Based Virtual Content Delivery Networks", ETRI Journal, 36(2), pp.197~205 (2014), 한국전자통신연구원
  3. Z. Zhuang, "Building cloud-ready video transcoding system for content delivery networks(CDNs)", Proc. IEEE GCC, pp.2048~2053 (2012)
  4. J. He, "On the cost-QoE tradeoff for cloud-based video streaming under Amazon EC2’s pricing models", IEEE Transactions on Circuits and Systems for Video Technology, 24(4), pp.669~680 (2013)
  5. S.P.Ponnusamy, "Cache Optimization on Hot-Point Proxy Caching Using Weighted-Rank Cache Replacemnt Policy", ETRI Journal, 35(4), pp.687~696 (2013), 한국전자통신연구원[DOI]
  6. R. S. Huckman, "Amazon web service", Harvard Business School Case (609-048), ~ (2008)
  7. H. Masuyama, "Sojourn time distribution in a MAP", M, Operations Research Letters, pp.2003, 31(5)[DOI]
  8. H. C. Tijms, "Stochastic models: an algorithmic approach" (1994), John Wiley & Sons, Inc
  9. F. Guillemin, "Analysis of the M", M, Queueing Systems, pp.2001, 39(4)[DOI]
  10. P. Barham, "Xen and the art of virtualization", Proc. ACM SOSP, pp.164~177 (2003)
  11. B. Sotomayor, "Virtual infrastructure management in private and hybrid clouds", IEEE Internet Computing, 34(5), pp.14~22 (2009)
  12. O. Litvinski, "Openstack scheduler evaluation using design of experiment", Proc. IEEE ISORC, pp.1~7 (2013)
  13. J. Huang, "Resource prediction based on double exponential smoothing in cloud computing", Proc. IEEE CECNet, pp.2056~2060 (2012)

관련 논문AI추천

이 간행물의 다른 논문 (9건)