Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
He, Ligang; Chaudhary, Nadeem; Jarvis, Stephen A. (2014)
Publisher: Elsevier
Languages: English
Types: Article
Subjects: QA76
This paper investigates the resource allocation problem for a type of workflow in pervasive computing. These workflows are abstracted from the enterprise-level applications in the business or commerce area. The activities in these workflows require not only computing resources, but also human resources. Human involvement introduces additional security concerns. When we plan/allocate resource capacities, we often assume that when a task is allocated to a resource, the resource will accept the task and start the execution once the processor becomes available. However, the security policies impose further constraints on task executions, and therefore may affect both application- and system-oriented performance. Authorization is an important aspect in security. This paper investigates the issue of allocating resources for running workflows under the role-based authorization control, which is one of the most popular authorization mechanisms. By taking into account the authorization constraints, the resource allocation strategies are developed in this paper for both human resources and computing resources. In the allocation strategy for human resources, the optimization equation is constructed subject to the constraint of the budget available to hire human resources. Then the optimization equation is solved to obtain the number of human resources allocated to each authorization role. The allocation strategy for computing resources calculates not only the number of computing resources, but also the proportion of processing capacity in each resource allocated to serve the tasks assuming each role. The simulation experiments have been conducted to verify the effectiveness of the developed allocation strategies. The experimental results show that the allocation strategy developed in this paper outperforms the traditional allocation strategies, which do not consider authorization constraints, in terms of both average response time and resource utilization.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] V. Atluri and W. kuang Huang, “A petri net based safety analysis of workflow authorization models,” 1999.
    • [2] L. He, K. Duan, X. Chen, D. Zou, Z. Han, A. Fadavinia, and S. Jarvis, “Modelling workflow executions under role-based authorisation control,” in Services Computing (SCC), 2011 IEEE International Conference on, july 2011, pp. 200 -208.
    • [3] Q. Wang and N. Li, “Satisfiability and resiliency in workflow authorization systems,” ACM Trans. Inf. Syst. Secur., vol. 13, no. 4, pp. 40:1-40:35, Dec. 2010. [Online]. Available: http://doi.acm.org/10.1145/1880022.1880034
    • [4] Y. Lu, L. Zhang, and J. Sun, “Using colored petri nets to model and analyze workflow with separation of duty constraints,” The International Journal of Advanced Manufacturing Technology, vol. 40, pp. 179-192, 2009, 10.1007/s00170-007-1316-1. [Online]. Available: http://dx.doi.org/10.1007/s00170-007-1316-1
    • [5] D. Zou, L. He, H. Jin, and X. Chen, “Crbac: Imposing multigrained constraints on the rbac model in the multi-application environment,” Journal of Network and Computer Applications, vol. 32, no. 2, pp. 402 - 411, 2009. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S1084804508000520
    • [6] E. Deelman, D. Gannon, M. Shields, and I. Taylor, “Workflows and e-science: An overview of workflow system features and capabilities,” 2008.
    • [7] C.-C. Hsu, K.-C. Huang, and F.-J. Wang, “Online scheduling of workflow applications in grid environments,” Future Generation Computer Systems, vol. 27, no. 6, pp. 860 - 870, 2011. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0167739X10002086
    • [8] P. Delias, A. Doulamis, N. Doulamis, and N. Matsatsinis, “Optimizing resource conflicts in workflow management systems,” Knowledge and Data Engineering, IEEE Transactions on, vol. 23, no. 3, pp. 417 -432, march 2011.
    • [9] D. Chakraborty, V. Mankar, and A. Nanavati, “Enabling runtime adaptation ofworkflows to external events in enterprise environments,” in Web Services, 2007. ICWS 2007. IEEE International Conference on, july 2007, pp. 1112 -1119.
    • [10] L. He, D. Zou, Z. Zhang, K. Yang, H. Jin, and S. A. Jarvis, “Optimizing resource consumptions in clouds,” in Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing, ser. GRID '11. Washington, DC, USA: IEEE Computer Society, 2011, pp. 42-49. [Online]. Available: http://dx.doi.org/10.1109/Grid.2011.15
    • [11] X. Zhao, Z. Qiu, C. Cai, and H. Yang, “A formal model of human workflow,” in Proceedings of the 2008 IEEE International Conference on Web Services, ser. ICWS '08. Washington, DC, USA: IEEE Computer Society, 2008, pp. 195-202. [Online]. Available: http://dx.doi.org/10.1109/ICWS.2008.14
    • [12] M. Stuit, H. Wortmann, N. Szirbik, and J. Roodenburg, “Multiview interaction modelling of human collaboration processes: A business process study of head and neck cancer care in a dutch academic hospital,” J. of Biomedical Informatics, vol. 44, no. 6, pp. 1039-1055, Dec. 2011. [Online]. Available: http://dx.doi.org/10.1016/j.jbi.2011.08.007
    • [13] T. Hara, T. Arai, Y. Shimomura, and T. Sakao, “Service cad system to integrate product and human activity for total value,” CIRP Journal of Manufacturing Science and Technology, vol. 1, no. 4, pp. 262 - 271, 2009, ¡ce:title¿Life Cycle Engineering¡/ce:title¿. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S1755581709000078
    • [14] J. Y. Choi and S. Reveliotis, “A generalized stochastic petri net model for performance analysis and control of capacitated reentrant lines,” Robotics and Automation, IEEE Transactions on, vol. 19, no. 3, pp. 474 - 480, june 2003.
    • [15] T. Xie and X. Qin, “Scheduling security-critical real-time applications on clusters,” Computers, IEEE Transactions on, vol. 55, no. 7, pp. 864- 879, 2006.
    • [16] --, “Security-aware resource allocation for real-time parallel jobs on homogeneous and heterogeneous clusters,” Parallel and Distributed Systems, IEEE Transactions on, vol. 19, no. 5, pp. 682-697, 2008.
    • [17] M. Qiu, L. Zhang, Z. Ming, Z. Chen, X. Qin, and L. T. Yang, “Securityaware optimization for ubiquitous computing systems with seat graph approach,” Journal of Computer and System Sciences, 2012.
    • [18] L. Kleinrock, Queueing Systems. Wiley Interscience, 1976, vol. II: Computer Applications.
    • [19] E. Cuervo, A. Balasubramanian, D. ki Cho, A. Wolman, S. Saroiu, R. Ch, and P. Bahl, “Maui: Making smartphones last longer with code offload,” in In In Proceedings of ACM MobiSys, 2010.
    • [20] Z. Liu, M. S. Squillante, and J. L. Wolf, “On maximizing service-level-agreement profits,” SIGMETRICS Perform. Eval. Rev., vol. 29, no. 3, pp. 43-44, Dec. 2001. [Online]. Available: http://doi.acm.org/10.1145/507553.507571
  • No related research data.
  • Discovered through pilot similarity algorithms. Send us your feedback.

    Title Year Similarity

    A Survey on Security-Aware Measurement in SDN


Share - Bookmark

Cite this article