A Study on Random Autonomous Algorithm for Service Survivability Scheduling

We present in this paper a scheduling algorithm towards the service migration uncertainty that aims to enhance the service survivability in the server cluster system. Survivable scheduling algorithm is one of the important aspects of survivability study. This paper introduced the stochastic mechanism in the server cluster systems, which made it uncertain of the services migration among the servers, so as to increase the difficulty for the intruders penetrating the systems, and enhanced the system survivability. In this work, we introduced the layers of survivability study, illustrated the function of the survivable scheduling algorithm; then, analyzed the advantages and disadvantages of the exist scheduling algorithms; promoted a pseudo-random autonomous algorithm for service survivability scheduling, including generating the scheduling sequence and the Markov-based autonomous competition mechanism, the performance of the algorithm is investigated at last.