Toggle Main Menu Toggle Search

Open Access padlockePrints

A Scalable Method for Partitioning Workflows with Security Requirements over Federated Clouds

Lookup NU author(s): Dr Zhenyu Wen, Dr Jacek Cala, Professor Paul Watson

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

© 2014 IEEE.The significant increase in the use of cloud computing, has led to an interest in partitioning applications over a set of public and private clouds in order to meet a range of non-functional requirements including performance (for example where private cloud resources alone are insufficient), dependability (e.g. To allow the application to continue to operate even if one cloud fails) and security (for example to ensure that sensitive data is restricted to sufficiently secure clouds and networks). This paper describes a novel deployment planning algorithm to partition complex workflow-based applications over federated clouds, while meeting security requirements. The security issues are based on our previous work which extends the Bell-La Padula model to encompass cloud computing. Selecting the cheapest option for partitioning a workflow over a set of resources has been shown to be an NP-hard problem, which can take impractically long for partitioning large workflows over multiple clouds. We therefore introduce a novel adaptive partitioning algorithm to handle these large workflow applications, which significantly reduces the time required to choose a sufficiently good partitioning option. This is based on generating an initial partitioning, and then adapting it to see if a better solution can be found by bringing together on the same node services with significant communication costs. The algorithm has been implemented and evaluated by using both randomly generated and real world scientific workflows. The experiment results show that our algorithm is thousand times quicker than the exhaustive algorithm presented in our previous work. Yet, on average it generates only 25% more costly solutions. We also compared this algorithm with two other methods commonly used to partition workflows over a set of clouds.


Publication metadata

Author(s): Wen Z, Cala J, Watson P

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Proceedings of the International Conference on Cloud Computing Technology and Science, CloudCom

Year of Conference: 2015

Pages: 122-129

Online publication date: 12/02/2015

Acceptance date: 01/01/1900

Publisher: IEEE Computer Society

URL: http://doi.org/10.1109/CloudCom.2014.89

DOI: 10.1109/CloudCom.2014.89


Actions

Find at Newcastle University icon    Link to this publication


Share