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.
survivability server cluster pseudo-random sequence scheduling algorithm
Zhang Lei Arun Sood Dai Hao Ma Mingkai
Institute of Command Automation PLA University of Science and Technology Nanjing, China Department of Computer Science and Center for Image Analysis George Mason University Fairfax, VA, US Institute of China Electronic Equipment System Engineering Company Beijing, China
国际会议
大连
英文
1-6
2008-10-12（万方平台首次上网日期，不代表论文的发表时间）