摘要
针对现有接纳控制算法在业务请求到达率动态变化时,难以同时满足资源利用率高,鲁棒性和公平性的问题,提出基于虚拟分区的接纳控制算法.该算法在资源初步划分的基础上,对过载业务的请求进行接纳决策时,需为其他业务预留资源,减少业务过载对其他业务服务质量的影响.通过实验分析了关键参数对算法性能的影响,且比较实验结果表明,提出的算法相比现有算法有更好的综合性能.
Existing admission control algorithms are difficult to achieve high resource utilization,strong robustness and fairness at the same time,at the condition of dynamic changes of service arrival rate.Aiming at this problem,the virtual partitioning based admission control algorithm was proposed.Based on the resource partitioning preliminarily,the algorithm reserves resource for other services when making decisions on admission of the overload service,in order to reducing the impact on quality of service.The effect of the key parameter on the algorithm performance was analyzed through experiment.Experiment shows that the proposed algorithm has better comprehensive performance,compared with the existing ones.
出处
《小型微型计算机系统》
CSCD
北大核心
2012年第8期1676-1680,共5页
Journal of Chinese Computer Systems
基金
国家科技支撑计划项目(2008BAH28B04)资助
国家“八六三”高技术研究发展计划项目(2009AA01A339)资助
关键词
接纳控制
虚拟分区
资源预留
资源收益
鲁棒性
公平性
admission control
virtual partitioning
resource reservation
resource revenue
robustness
fairness