Cost Effective, Reliable and Secure Workflow Deployment over Federated Clouds

IEEE Transactions on Services Computing

Volumn 10, Issue 6, 2017, Pages 929-941

  Wen, Zhenyu ^a   Cala, Jacek ^a   Watson, Paul ^a   Romanovsky, Alexander ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Cloud computing; cost; reliability; scheduling; security; workflow

Indexed keywords

CLOUD COMPUTING; COST EFFECTIVENESS; COSTS; CRYPTOGRAPHY; DIGITAL STORAGE; ENTROPY; NETWORK SECURITY; RELIABILITY; SCHEDULING;

APPLICATION REQUIREMENTS; DYNAMIC LEVEL SCHEDULING; ENTROPY-BASED METHODS; MULTI-LEVEL SECURITY MODELS; SECURITY; SECURITY REQUIREMENTS; WORKFLOW; WORKFLOW APPLICATIONS;

SCHEDULING ALGORITHMS;

EID: 85039424610     PISSN: 19391374     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSC.2016.2543719     Document Type: Article

References (44)

1. (2015). Cloudrfp.com. [Online]. Available: https://www. cloudrfp.com/company/browse
2. (2011). Summary of the amazon ec2 and amazon rds service disruption in the us east region. [Online]. Available: http://aws. amazon.com/message/65648
3. M. Mihailescu and Y. M. Teo, Dynamic resource pricing on federated clouds, in Proc. 10th IEEE/ACM Int. Conf. Cluster, Cloud Grid Comput., May 2010, pp. 513-517
4. P. Watson. (2012). A multi-level security model for partitioning workflows over federated clouds. J. Cloud Comput. [Online]. 1(1), pp. 1-15. Available: http://dx.doi.org/10.1186/2192-113X-1-15
5. D. E. Bell and L. J. LaPadula, Secure computer systems: Mathematical foundations, MITRE Corporation, Bedford, MA, Tech. Rep. MTR-2547, vol. 1, Mar. 1973
6. D. Hollingsworth, Workflow management coalition-The workflow reference model,WorkflowManagement Coalition, 2 Crown Walk Winchester Hampshire, UK, Tech. Rep. TC00-1003, 1995
7. A. Avizienis, J.-C. Laprie, B. Randell, and C. Landwehr, Basic concepts and taxonomy of dependable and secure computing, IEEE Trans. Dependable Secure Comput., vol. 1, no. 1, pp. 11-33, Jan. 2004
8. C. E. Shannon. (2001, Jan.). A mathematical theory of communication. SIGMOBILE Mob. Comput. Commun. Rev. [Online]. 5(1), pp. 3-55. Available: http://doi.acm.org/10.1145/584091.584093
9. M. R. Garey and D. S. Johnson, Computers Intractability: Guide Theory NP-Completeness. New York, NY, USA: Freeman, 1979
10. Y. Klein and G. Langholz, Multi-criteria scheduling optimization using fuzzy logic, in Proc. IEEE Int. Conf. Syst., Man, Cybern., Oct. 1998, vol. 1, pp. 445-450
11. W. Chen and E. Deelman. (2012). Workflowsim: A toolkit for simulating scientific workflows in distributed environments. in Proc. IEEE 8th Int. Conf. E-Sci., pp. 1-8. [Online]. Available: http://dx. doi.org/10.1109/eScience.2012.6404430
12. M. Bux and U. Leser, DynamicCloudSim: Simulating heterogeneity in computational clouds, Future Gener. Comput. Syst., vol. 46, no. 0, pp. 85-99, 2015
13. H. Hiden, S. Woodman, P. Watson, and J. Caa, Developing cloud applications using the e-Science Central platform, Roy. Soc. London. Philosoph. Trans. A. Math., Phys. Eng. Sci., vol. 371, p. 20120085, 2013
14. Z. Zheng and M. Lyu, Selecting an optimal fault tolerance strategy for reliable service-oriented systems with local and global constraints, Computers, vol. 64, no. 1, pp. 219-232, Jan 2015
15. E. L. Rhys Lewis, Introduction Reliability Engineering. Hoboken, NJ, USA: Wiley, Nov. 15, 1995
16. M. Hakem and F. Butelle, Reliability and scheduling on systems subject to failures, in Proc. Int. Conf. Parallel Process., Sep. 2007, pp. 38-38
17. A. Dogan and F. Ozguner. (2005, May). Biobjective scheduling algorithms for execution time-reliability trade-off in heterogeneous computing systems∗. Comput. J. [Online]. 48(3), pp. 300-314. Available: http://dx.doi.org/10.1093/comjnl/bxh086
18. A. Dogan and F. Ozguner, Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing, IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 3, pp. 308-323, Mar. 2002
19. D. E. Denning. (1976, May). A lattice model of secure information flow. Commun. ACM [Online]. 19(5), pp. 236-243. Available: http://doi.acm.org/10.1145/360051.360056
20. B. Hendrickson, R. Leland, and R. V. Driessche. (1997). Skewed graph partitioning. in Proc. 8th SIAM Conf. Parallel Process. Sci. Comput. [Online]. Available: http://www.sandia.gov/ leland/ documents/Skewed-Graph-Partitioning.pdf
21. Z. Wen, J. Caa, and P. Watson, A scalable method for partitioning workflows with security requirements over federated clouds, in Proc. IEEE 6th Int. Conf. Cloud Comput. Tech. Sci., Dec. 2014, pp. 122-129
22. H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. Berlin, Germany: Springer-Verlag, 2004
23. D. Jang, J. U. Kang, A. Kruckman, J. Kudo, and S. J. Miller, Chains of distributions, hierarchical Bayesian models and benfords law, ArXiv e-print, May 2008, http://adsabs.harvard.edu/ abs/2008arXiv0805.4226J
24. E. Deelman, K. Vahi, G. Juve, M. Rynge, S. Callaghan, P. J. Maechling, R. Mayani, W. Chen, R. Ferreira da Silva, M. Livny, and K. Wenger. (2014). Pegasus, a workflow management system for science automation. Future Gener. Comput. Syst. [Online]. 46, pp. 17-35. Available: http://linkinghub.elsevier.com/retrieve/ pii/S0167739X14002015
25. G. Juve, A. Chervenak, E. Deelman, S. Bharathi, G. Mehta, and K. Vahi, Characterizing and profiling scientific workflows, Future Gener. Comput. Syst., vol. 29, no. 3, pp. 682-692, 2013
26. R. Prodan and M. Wieczorek, Bi-criteria scheduling of scientific grid workflows, IEEE Trans. Autom. Sci. Eng., vol. 7, no. 2, pp. 364-376, Apr. 2010
27. B. Shirazi, M. Wang, and G. Pathak, Analysis and evaluation of heuristic methods for static task scheduling, J. Parallel Distrib. Comput., vol. 10, no. 3, pp. 222-232, 1990
28. P. Garraghan, P. Townend, and J. Xu, An empirical failure-analysis of a large-scale cloud computing environment, in Proc. IEEE 15th Int. Symp. High-Assurance Syst. Eng., Jan. 2014, pp. 113-120
29. J. Caa, Y. X. Xu, E. A. Wijaya, and P. Missier, From scripted HPC-based NGS pipelines to workflows on the cloud, in Proc. C4Bio Workshop, Co-Located 2014 CCGrid Conf., 2014, pp. 694-700
30. M. Dobber, R. van der Mei, and G. Koole, Effective prediction of job processing times in a large-scale grid environment, in Proc. 15th IEEE Int. Symp. High Perform. Distrib. Comput., 2006, pp. 359-360
31. T. Miu and P. Missier, Predicting the execution time of workflow activities based on their input features, in Proc. High Perform. Comput., Netw., Storage Anal., Nov. 2012, pp. 64-72
32. R. Duan, F. Nadeem, J. Wang, Y. Zhang, R. Prodan, and T. Fahringer, A hybrid intelligent method for performance modeling and prediction of workflow activities in grids, in Proc. 9th IEEE/ ACM Int. Symp. Cluster Comput. Grid, May 2009, pp. 339-347
33. H. Topcuouglu, S. Hariri, and M.-Y. Wu. (2002, Mar.). Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. [Online]. 13(3), pp. 260-274. Available: http://dx.doi.org/10.1109/71.993206
34. I. Ahmad and Y.-K. Kwok, A new approach to scheduling parallel programs using task duplication, in Proc. Int. Conf. Parallel Process., Aug. 1994, vol. 2, pp. 47-51
35. B. Kruatrachue and T. Lewis, Grain size determination for parallel processing, IEEE Software, vol. 5, no. 1, pp. 23-32, Jan. 1988
36. S. Song, K. Hwang, Y. kwong Kwok, and S. Member, Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling, Computers, vol. 55, no. 6, pp. 703-719, Jun. 2006
37. X. Qin and H. Jiang. (2006, Jun.). A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems. Parallel Comput. [Online]. 32(5), pp. 331-356. Available: http://dx.doi.org/10.1016/j.parco.2006.06.006
38. T. Xie and X. Qin, Scheduling security-critical real-time applications on clusters, Computers, vol. 55, no. 7, pp. 864-879, Jul. 2006
39. J. J. Dongarra, E. Jeannot, E. Saule, and Z. Shi. (2007). Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. in Proc. 19th Annu. ACM Symp. Parallel Algorithms Archit., pp. 280-288. [Online]. Available: http://doi. acm.org/10.1145/1248377.1248423
40. H. Fard, R. Prodan, and T. Fahringer, A truthful dynamic workflow scheduling mechanism for commercial multicloud environments, IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 6, pp. 1203-1212, Jun. 2013
41. X. Tang, K. Li, M. Qiu, and E. H.-M. Sha. (2012). A hierarchical reliability-driven scheduling algorithm in grid systems. J. Parallel Distrib. Comput. [Online]. 72(4), pp. 525-535. Available: http:// www.sciencedirect.com/science/article/pii/S0743731511002346
42. H. M. Fard, R. Prodan, and T. Fahringer. (2014). Multi-objective list scheduling of workflow applications in distributed computing infrastructures. J. Parallel Distrib. Comput. [Online]. 74(3), pp. 2152-2165. Available: http://www.sciencedirect.com/ science/article/pii/S0743731513002384
43. H. Zo, D. L. Nazareth, and H. K. Jain, Measuring reliability of applications composed of web services, in Proc. Annu. Hawaii Int. Conf. Syst. Sci., 2007, pp. 1-10
44. S. Ran. (2003, Mar.). A model for web services discovery with qos. SIGecom Exch. [Online]. 4(1), pp. 1-10. Available: http://doi.acm. org/10.1145/844357.844360