Skip to main content
SpringerLink
Log in

Security aware dynamic scheduling algorithm (SADSA) for real-time applications on grid

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Security is a major concern of modern real-time applications, besides requiring stringent latency bound. However, encryption algorithms are computation intensive task which impacts the timeliness of the real-time applications. Therefore, there exists a trade-off between the desired level of security and the service guarantee. In this paper, we propose a security-aware dynamic scheduling algorithm (SADSA) using a grid of computational elements (CEs) which performs this trade-off and tries to maximize the instantaneous average security level of the packets besides providing a guaranteed service. As packets arrive, we first assign them to the CEs based on the utilization value of a CE, which is the ratio of completion time and a deadline of the last packet in a CE. The security level of all the packets is then dynamically adjusted to meet the minimum required security level while maximizing the average security level of all the packets in that CE. We first show that the proposed assignment algorithm is NP-hard, is 2-competitive to the optimal solution, and that the proposed algorithm provides a sub-optimal solution. Further, using extensive simulation, we show that the proposed SADSA algorithm performs better in terms of guarantee ratio, average security level and overall performance compared to the existing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. High-security level requires greater computation resources like CPU cycle, memory requirement, etc. Hence, the more complex algorithm requires more time to encrypt a given message. However, the time required may also depend on other factors like a number of bits to be encrypted (block length) and key length [1].

  2. We have assumed that under optimal allocation, the system under steady-state condition will be non-blocking. That is, there is no packet drop due to insufficient buffer space.

  3. It must be noted that the security level of a packet is \(0.1\le Sl^i\le 1.0\)

References

  1. Atdelzater, T.F., Atkins, E.M., Shin, K.G.: QoS negotiation in real-time systems and its application to automated flight control. IEEE Trans. Comput. 49(11), 1170–1183 (2000)

    Article  Google Scholar 

  2. Xie, T., Qin, X.: Security-aware resource allocation for real-time parallel jobs on homogeneous and heterogeneous clusters. IEEE Trans. Parallel Distrib. Syst. 19(5), 682–697 (2008)

    Article  Google Scholar 

  3. Xie, T., Qin, X., Sung, A.: SAREC: a security-aware scheduling strategy for real-time applications on clusters. In: Proceedings of the International Conference on Parallel Processing (ICPP’05), pp. 5–12 (2005)

  4. Xie, T., Qin, X.: Scheduling security-critical real-time applications on clusters. IEEE Trans. Comput. 55(7), 864–879 (2006)

    Article  Google Scholar 

  5. Saleh, M., Dong, L.: Real-time scheduling with security awareness for packet switched networks. In: IEEE Radio and Wireless Symposium (RWS’12), pp. 391–394 (2012)

  6. Saleh, M., Dong, L.: Real-time scheduling with security enhancement for packet switched networks. IEEE Trans. Netw. Serv. Manag. 10(3), 271–285 (2013)

    Article  Google Scholar 

  7. Singh, S., Tripathi, S., Batabyal, S.: Utilization based secured dynamic scheduling algorithm for real-time applications on grid (u-SDSA). In: 31st International IEEE Conference on Advanced Information Networking and Applications (AINA’17), pp. 606-613 (2017)

  8. Xie, T., Qin, X.: Enhancing security of real-time applications on grids through dynamic scheduling (SAREG). In: 11th International Workshop Job Scheduling Strategies for Parallel Processing (JSSPP’05), vol. 3834, pp. 219–237 (2005)

  9. Xie, T., Qin, X.: A security middleware model for real-time applications on grids. IEICE Trans. Inf. Syst. Spec. Issue Parallel Distrib. Comput. Netw. E89–D(2), 631–638 (2006)

    Google Scholar 

  10. Jiang, W., Guo, W., Sang, N.: Periodic real-time message scheduling for confidentiality-aware cyber-physical System in wireless networks. In: 5th IEEE International Conference on Frontier of Computer Science and Technology, pp. 355–360 (2010)

  11. Jung, Y., Festijo, E.: Securing RTP packets using per-packet selective encryption scheme for real-time multimedia applications. In: 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, Melbourne, pp. 659–666, VIC (2013)

  12. Singh, S., Tripathi, S., Batabyal, S.: Secured Dynamic Scheduling Algorithm for Real-Time Applications on Grid. Information Systems Security, pp. 283–300. Springer, Berlin (2016)

    Google Scholar 

  13. Karnik, A., Passerini, K.: Wireless network security—a discussion from a business perspective. In: Wireless Telecommunications Symposium (WTS’05), pp. 261–267 (2005)

  14. Lu, S., Bharghavan, V., Srikant, R.: Fair scheduling in wireless packet networks. IEEE/ACM Trans. Netw. 7(4), 473–489 (1999)

    Article  Google Scholar 

  15. Qin, X., Alghamdi, M., Nijim, M., Zong, Z., Bellam, K., Ruan, X., Manzanares, A.: Improving security of real-time wireless networks through packet scheduling. IEEE Trans. Wirel. Commun. 7(9), 3273–3279 (2008)

    Article  Google Scholar 

  16. Zhu, X., Guo, H., Liang, S., Yang, X.: An improved security-aware packet scheduling algorithm in real-time wireless networks. Inf. Process. Lett. 7(112), 282–288 (2012)

    Article  MathSciNet  Google Scholar 

  17. Xie, T., Qin, X.: Security-driven scheduling for data-intensive applications on grids. Clust. Comput. 10(2), 145–153 (2007)

    Article  Google Scholar 

  18. Mohan, S., Yoon, M., Pellizzoni, R., Bobba, R.: Integrating security constraints into fixed priority real-time schedulers. Real Time Syst. 52(5), 644–674 (2016)

    Article  Google Scholar 

  19. Kashyap, R., Vidyarthi, D.P.: Security driven scheduling model for computational grid using NSGA-II. J. Grid Comput. 11(4), 721–734 (2013)

    Article  Google Scholar 

  20. Xie, T., Sung, A., Qin, X.: Dynamic task scheduling with security awareness in real-time systems. In: 19th IEEE International Parallel and Distributed Processing Symposium, p. 8 (2005)

  21. D’Amico, M., Diaz, J.C.D., Iori, M.: Bin packing problem with precedence constraints. Oper. Res. 60(6), 1491–1504 (2012)

    Article  MathSciNet  Google Scholar 

  22. Kang, J., Park, S.: Algorithms for the variable sized bin packing problem. Eur. J. Oper. Res. 147(2003), 365–372 (2003)

    Article  MathSciNet  Google Scholar 

  23. https://confluence.pegasus.isi.edu/display/pegasus/WorkflowGenerator

Download references

Acknowledgements

Support for this work has been provided by Visvesvaraya PhD scheme under the Ministry of Electronics and Information Technology (MeitY), India. The Unique Awardee Number is VISPHD-MEITY-1577.

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, IIT(ISM), Dhanbad, Dhanbad, India

    Surendra Singh & Sachin Tripathi

  2. Department of Computer Science & Information Systems, BITS Pilani, Hyderabad Campus, Pilani, India

    Suvadip Batabyal

Authors
  1. Surendra Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suvadip Batabyal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sachin Tripathi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suvadip Batabyal.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This paper is a major extension of [7].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, S., Batabyal, S. & Tripathi, S. Security aware dynamic scheduling algorithm (SADSA) for real-time applications on grid. Cluster Comput 23, 989–1005 (2020). https://doi.org/10.1007/s10586-019-02970-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-019-02970-w

Keywords

Search

Navigation