29 research outputs found
Academic Cloud Computing Research: Five Pitfalls and Five Opportunities
This discussion paper argues that there are five fundamental pitfalls, which
can restrict academics from conducting cloud computing research at the
infrastructure level, which is currently where the vast majority of academic
research lies. Instead academics should be conducting higher risk research, in
order to gain understanding and open up entirely new areas.
We call for a renewed mindset and argue that academic research should focus
less upon physical infrastructure and embrace the abstractions provided by
clouds through five opportunities: user driven research, new programming
models, PaaS environments, and improved tools to support elasticity and
large-scale debugging. The objective of this paper is to foster discussion, and
to define a roadmap forward, which will allow academia to make longer-term
impacts to the cloud computing community.Comment: Accepted and presented at the 6th USENIX Workshop on Hot Topics in
Cloud Computing (HotCloud'14
On the Optimality of Virtualized Security Function Placement in Multi-Tenant Data Centers
Security and service protection against cyber attacks remain among the primary challenges for virtualized, multi-tenant Data Centres (DCs), for reasons that vary from lack of resource isolation to the monolithic nature of legacy middleboxes. Although security is currently considered a property of the underlying infrastructure, diverse services require protection against different threats and at timescales which are on par with those of service deployment and elastic resource provisioning. We address the resource allocation problem of deploying customised security services over a virtualized, multi-tenant DC. We formulate the problem in Integral Linear Programming (ILP) as an instance of the NP-hard variable size variable cost bin packing problem with the objective of maximising the residual resources after allocation. We propose a modified version of the Best Fit Decreasing algorithm (BFD) to solve the problem in polynomial time and we show that BFD optimises the objective function up to 80% more than other algorithms
A Novel Approach for Elastic Query Processing in the Cloud
Cloud computing is a promising model of serviceoriented computing. One major advantage of cloud computing is its elasticity, i.e., the system's capability to supply and take away resources dynamically at runtime. For that, it's essential to design and implement a systematic and effective technique that takes complete advantage of the system's potential flexibility. This paper presents a non-invasive approach that monitors the performance of relational database management systems in cloud infrastructure, and dynamically makes choices to maximise the effectiveness of the provider's environment whereas still satisfying specified service level agreements" (SLAs)
Capacity Management for Cloud Computing: A System Dynamics Approach
As the demand for cloud computing as a preferred computing architecture grows, the need for effective capacity planning by cloud providers becomes crucial for their long term viability. Situations involving under-capacity and over-capacity represent lost opportunities and increased overhead. Economic conditions play a critical role in determining the capacity, cost, and revenue of cloud-based services. Using a system dynamics approach, this study evaluates the different conditions in cloud ecosystem from a capacity planning and management perspective, with a view to providing cloud service providers guidance for cloud capacity building strategies
DEPAS: A Decentralized Probabilistic Algorithm for Auto-Scaling
The dynamic provisioning of virtualized resources offered by cloud computing
infrastructures allows applications deployed in a cloud environment to
automatically increase and decrease the amount of used resources. This
capability is called auto-scaling and its main purpose is to automatically
adjust the scale of the system that is running the application to satisfy the
varying workload with minimum resource utilization. The need for auto-scaling
is particularly important during workload peaks, in which applications may need
to scale up to extremely large-scale systems.
Both the research community and the main cloud providers have already
developed auto-scaling solutions. However, most research solutions are
centralized and not suitable for managing large-scale systems, moreover cloud
providers' solutions are bound to the limitations of a specific provider in
terms of resource prices, availability, reliability, and connectivity.
In this paper we propose DEPAS, a decentralized probabilistic auto-scaling
algorithm integrated into a P2P architecture that is cloud provider
independent, thus allowing the auto-scaling of services over multiple cloud
infrastructures at the same time. Our simulations, which are based on real
service traces, show that our approach is capable of: (i) keeping the overall
utilization of all the instantiated cloud resources in a target range, (ii)
maintaining service response times close to the ones obtained using optimal
centralized auto-scaling approaches.Comment: Submitted to Springer Computin
Scaling social media applications into geo-distributed clouds
TS51: Cloud/Grid computing and networks 3Federation of geo-distributed cloud services is a trend in cloud computing which, by spanning multiple data centers at different geographical locations, can provide a cloud platform with much larger capacities. Such a geo-distributed cloud is ideal for supporting large-scale social media streaming applications (e.g., YouTube-like sites) with dynamic contents and demands, owing to its abundant on-demand storage/bandwidth capacities and geographical proximity to different groups of users. Although promising, its realization presents challenges on how to efficiently store and migrate contents among different cloud sites (i.e. data centers), and to distribute user requests to the appropriate sites for timely responses at modest costs. These challenges escalate when we consider the persistently increasing contents and volatile user behaviors in a social media application. By exploiting social influences among users, this paper proposes efficient proactive algorithms for dynamic, optimal scaling of a social media application in a geo-distributed cloud. Our key contribution is an online content migration and request distribution algorithm with the following features: (1) future demand prediction by novelly characterizing social influences among the users in a simple but effective epidemic model; (2) oneshot optimal content migration and request distribution based on efficient optimization algorithms to address the predicted demand, and (3) a Ξ(t)-step look-ahead mechanism to adjust the one-shot optimization results towards the offline optimum. We verify the effectiveness of our algorithm using solid theoretical analysis, as well as large-scale experiments under dynamic realistic settings on a home-built cloud platform. Β© 2012 IEEE.published_or_final_versionThe 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), Orlando, FL., 25-30 March 2012. In IEEE Infocom Proceedings, 2012, p. 684-69