Utilization Based Secured Dynamic Scheduling Algorithm for Real-Time Applications on Grid (U-SDSA)

摘要

Security is the major issue in most of the real-time applications, besides there being a stringent requirementfor such applications to provide high QoS. As security algorithmsdemand large computation time, the prevalent real-time packetscheduling algorithms tend to focus on meeting the deadlinewithout having much concern for security requirements. In thispaper, we propose a utilization based secured dynamic schedulingalgorithm (u-SDSA) for real-time applications on grid whichtries to meet both (security and scheduling) the above-mentioned requirements. Using grid of nodes or computing elements asthe distributed framework for processing real-time packets, wetry to ensure maximum guarantee ratio, maximum averagesecurity level, and optimal overall performance. To ensure optimaloverall performance of the grid, our mechanism distributes theincoming packets for processing amongst different nodes basedon utilization of the nodes. If the minimum security level of anincoming packet cannot be ensured, then it is forwarded to oneof the adjacent nodes having the least utilization, provided theutilization of this node is less than the utilization threshold value(U_thresh). Using extensive simulation, we show that the proposedu-SDSA algorithm performs better than the existing algorithms.