Sökning: onr:"swepub:oai:DiVA.org:umu-80125" >
Modeling and Placem...
Modeling and Placement of Cloud Services with Internal Structure
-
- Espling, Daniel, 1983- (författare)
- Umeå universitet,Institutionen för datavetenskap
-
- Larsson, Lars, 1983- (författare)
- Umeå universitet,Institutionen för datavetenskap
-
- Li, Wubin, 1983- (författare)
- Umeå universitet,Institutionen för datavetenskap
-
visa fler...
-
- Tordsson, Johan, 1980- (författare)
- Umeå universitet,Institutionen för datavetenskap
-
- Elmroth, Erik, 1964- (författare)
- Umeå universitet,Institutionen för datavetenskap
-
visa färre...
-
(creator_code:org_t)
- IEEE Computer Society, 2016
- 2016
- Engelska.
-
Ingår i: IEEE Transactions on Cloud Computing. - : IEEE Computer Society. - 2168-7161. ; 4:4, s. 429-439
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Virtual machine placement is the process of mapping virtual machines to available physical hosts within a datacenter or on a remote datacenter in a cloud federation. Normally, service owners cannot influence the placement of service components beyond choosing datacenter provider and deployment zone at that provider. For some services, however, this lack of influence is a hindrance to cloud adoption. For example, services that require specific geographical deployment (due e.g. to legislation), or require redundancy by avoiding co-location placement of critical components. We present an approach for service owners to influence placement of their service components by explicitly specifying service structure, component relationships, and placement constraints between components. We show how the structure and constraints can be expressed and subsequently formulated as constraints that can be used in placement of virtual machines in the cloud. We use an integer linear programming scheduling approach to illustrate the approach, show the corresponding mathematical formulation of the model, and evaluate it using a large set of simulated input. Our experimental evaluation confirms the feasibility of the model and shows how varying amounts of placement constraints and data center background load affects the possibility for a solver to find a solution satisfying all constraints within a certain time-frame. Our experiments indicate that the number of constraints affects the ability of finding a solution to a higher degree than background load, and that for a high number of hosts with low capacity, component affinity is the dominating factor affecting the possibility to find a solution.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- service management
- service structure
- placement
- affinity
- collocation
- scheduling
- integer linear programming
- cloud computing
- datalogi
- Computer Science
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas
- Av författaren/redakt...
-
Espling, Daniel, ...
-
Larsson, Lars, 1 ...
-
Li, Wubin, 1983-
-
Tordsson, Johan, ...
-
Elmroth, Erik, 1 ...
- Om ämnet
-
- NATURVETENSKAP
-
NATURVETENSKAP
-
och Data och informa ...
-
och Datavetenskap
- Artiklar i publikationen
-
IEEE Transaction ...
- Av lärosätet
-
Umeå universitet