To work out a solution for answering the question when it is suitable for emergency response strategies to be executed, an emergency algorithm for enhanced survivability of a key service is presented. First, based on ...To work out a solution for answering the question when it is suitable for emergency response strategies to be executed, an emergency algorithm for enhanced survivability of a key service is presented. First, based on the central limit theorem and the hypothesis testing theory, the confidence interval of each key service＇s history average service response time in the host server and the spare server can be figured out, respectively. This can also be updated dynamically by a proposed method using the method of time slide window. Then, according to the five kinds of distributed situations of the current service response time＇ s confidence interval in the host server and the spare server, the proposed algorithm can dynamically choose the appropriate emergency policies such as resource reconfiguration, service degradation or service drifting, etc. in fight time. Thus, the key service request can be finished within its expected deadline by users as far as possible. Furthermore, the whole process of dynamic configuration is transparent to users. Finally, simulation tests are performed to prove the feasibility.展开更多
基金Specialized Research Fund for the Doctoral Program of Higher Education (No20050217007)the Weaponry Equipment Foundation of PLA Equipment Ministry (No51416060104CB0101)
文摘To work out a solution for answering the question when it is suitable for emergency response strategies to be executed, an emergency algorithm for enhanced survivability of a key service is presented. First, based on the central limit theorem and the hypothesis testing theory, the confidence interval of each key service＇s history average service response time in the host server and the spare server can be figured out, respectively. This can also be updated dynamically by a proposed method using the method of time slide window. Then, according to the five kinds of distributed situations of the current service response time＇ s confidence interval in the host server and the spare server, the proposed algorithm can dynamically choose the appropriate emergency policies such as resource reconfiguration, service degradation or service drifting, etc. in fight time. Thus, the key service request can be finished within its expected deadline by users as far as possible. Furthermore, the whole process of dynamic configuration is transparent to users. Finally, simulation tests are performed to prove the feasibility.
