Secured Dynamic Scheduling Algorithm for Real-Time Applications on Grid

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).