Abstract
The Secured Dynamic Scheduling Algorithm (SDSA) for Real-Time Applications on Grid can enhance the QoS as well as the security aspect of the packets for real-time applications or cyber-physical systems. The existing scheduling algorithms for hard real-time applications are based on timing constraints and security requirements. Some of them provide only authentication security service for the hard real-time application and perform best only when the arrival rate of packets is low. Performance, however, degrades when packet arrival rate increases since they tend to focus only on security aspects and not on scheduling. This paper tries to solve the above problems by using the secured dynamic scheduling algorithm for real-time applications on the grid. Since maintaining the desired security level may hamper the timely delivery of packets, SDSA tries to ensure guaranteed delivery with optimum security using grid or computing elements (CEs). As new packets arrive at the node, the packets are checked for feasibility criteria. A packet not satisfying feasibility criteria is forwarded to the adjacent node having least accepted queue length and again checked for feasibility criteria. Comparing with some of the existing algorithms in this area, SDSA performs well with respect to guaranteeing ratio (GR) and average security level (ASL).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 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.
- 2.
It must be noted that the security level of a packet is \(0.1\le Sl_i\le 1.0\).
References
Xie, T., Qin, X.: Scheduling security-critical real-time applications on clusters. IEEE Trans. Comput. 55(7), 864–879 (2006)
Saleh, M., Dong, L.: Real-time scheduling with security awareness for packet switched networks. In: 2012 IEEE on Radio and Wireless Symposium (RWS), pp. 391–394. IEEE (2012)
Saleh, M., Dong, L.: Real-time scheduling with security enhancement for packet switched networks. IEEE Trans. Netw. Serv. Manage. 10(3), 271–285 (2013)
Tao, X., Xiao, Q.: A security middleware model for real-time applications on grids. IEICE Trans. Inf. Syst. 89(2), 631–638 (2006)
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)
Atdelzater, T., 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)
Xie, T., Qin, X.: Enhancing security of real-time applications on grids through dynamic scheduling. In: Feitelson, D., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 219–237. Springer, Heidelberg (2005). doi:10.1007/11605300_11
Jung, Y., Festijo, E.: Securing rtp packets using per-packet selective encryption scheme for real-time multimedia applications. In: 2013 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, pp. 659–666. IEEE (2013)
Qin, X., Alghamdi, M., Nijim, M., Zong, Z., Bellam, K., Ruan, X., Manzanares, A.: Improving security of real-time wireless networks through packet scheduling [transactions letters]. IEEE Trans. Wirel. Commun. 7(9), 3273–3279 (2008)
Zhu, X., Guo, H., Liang, S., Yang, X.: An improved security-aware packet scheduling algorithm in real-time wireless networks. Inf. Process. Lett. 112(7), 282–288 (2012)
Singh, S., et al.: Improve real-time packet scheduling algorithm with security constraint. In: 2014 Annual IEEE India Conference (INDICON), pp. 1–6. IEEE (2014)
Karnik, A., Passerini, K.: Wireless network security-a discussion from a business perspective. In: Symposium, 2005 Wireless Telecommunications, pp. 261–267. IEEE (2005)
Lu, S., Bharghavan, V., Srikant, R.: Fair scheduling in wireless packet networks. IEEE/ACM Trans. Networking (TON) 7(4), 473–489 (1999)
Xie, T., Qin, X., Sung, A.: Sarec: a security-aware scheduling strategy for real-time applications on clusters. In: 2005 International Conference on Parallel Processing (ICPP 2005), pp. 5–12. IEEE (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Singh, S., Tripathi, S., Batabyal, S. (2016). Secured Dynamic Scheduling Algorithm for Real-Time Applications on Grid. In: Ray, I., Gaur, M., Conti, M., Sanghi, D., Kamakoti, V. (eds) Information Systems Security. ICISS 2016. Lecture Notes in Computer Science(), vol 10063. Springer, Cham. https://doi.org/10.1007/978-3-319-49806-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-49806-5_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49805-8
Online ISBN: 978-3-319-49806-5
eBook Packages: Computer ScienceComputer Science (R0)