摘要
基于中心极限定理和假设检验理论,通过比较当前关键服务请求的服务响应时间与该关键服务历史平均服务响应时间置信区间的关系,提出了一种增强网络可生存性的自主配置算法(NSAC).该算法对关键服务执行过程中的不同时段分两种情况采取适时的资源剥夺、服务迁移或者服务降级等策略,最大限度地保证关键服务请求在用户期望的截止时间内完成,整个配置过程对用户透明.仿真试验表明,本文提出的算法在网络重负载和轻负载情况下都可以更好地改善系统关键服务的可生存性.
Through comparing the relationship between current response time of key service request and confidence interval of its history average response time, this paper presented an autonomous configuration algorithm for improving network survivability （abbreviated as NSAC） based on central limit theorem and hypothesis testing theory. According to different durations in the process of key services execution, the algorithm dynamically dealt with two instances for taking the timely policies such as resource reconfig uration, service degradation or service roaming, etc. As a result, key services could be accomplished far thest within its deadline expected by users. Moreover, the whole configuration process is transparent for users. Simulation experiments show that the proposed method can improve the survivability of key service effectively under the circumstance of the network light load and overload.
出处
《武汉大学学报（理学版）》
CAS
CSCD
北大核心
2006年第5期582-586,共5页
Journal of Wuhan University:Natural Science Edition
基金
高等学校博士学科点专项科研基金(20050217007)
武备预研基金(51416060104CB0101)资助项目
关键词
网络可生存性
关键服务
自主配置
置信区间
network survivability
key service
autonomous configuration
confidence interval
