2012 IEEE Fifth International Conference on Cloud Computing 2012
DOI: 10.1109/cloud.2012.63
|View full text |Cite
|
Sign up to set email alerts
|

Admission Control for Elastic Cloud Services

Abstract: Abstract-This paper presents an admission control test for deciding whether or not it is worth to admit a set of services into a Cloud, and in case of acceptance, obtain the optimum allocation for each of the components that comprise the services. In the proposed model, the focus is on hosting elastic services the resource requirements of which may dynamically grow and shrink, depending on the dynamically varying number of users and patterns of requests. In finding the optimum allocation, the presented admissi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0
1

Year Published

2013
2013
2022
2022

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 44 publications
(34 citation statements)
references
References 16 publications
0
33
0
1
Order By: Relevance
“…The availability of resources and admission control is also discussed in [131]. The work uses a probabilistic approach to find an optimized allocation of services on virtualized physical resources.…”
Section: Infrastructure-provider Admission Controlmentioning
confidence: 99%
“…The availability of resources and admission control is also discussed in [131]. The work uses a probabilistic approach to find an optimized allocation of services on virtualized physical resources.…”
Section: Infrastructure-provider Admission Controlmentioning
confidence: 99%
“…However, admission control within cloud environments is not trivial due to different reasons, specially the elastic nature of services and uncertainty about future needs/behaviors. Among recent approaches to this multi-faceted problem, Konstanteli et al [27] present a probabilistic method for a combined scheduling and admission control problem formulated using mixed-integer non-linear programming. They model the elastic service demand by using cumulative distribution functions.…”
Section: Admission Controlmentioning
confidence: 99%
“…Konstanteli et al take a probabilistic approach to a combined scheduling and admission control problem formulated using mixed-integer non-linear programming [17]. In their work, the elastic service demand is modeled using cumulative distribution functions.…”
Section: Related Workmentioning
confidence: 99%