摘要
针对基于软交换的集群媒体服务器(SCMS)中资源处理机对接纳控制的要求,提出了一种新型的接纳控制算法NDQAS(new dynamic quota-based algorithm with sub-negotiation),该算法继承了基于资源分区的接纳算法的优点,并在此基础上引入了新的思路.在随机Petri网模型上对NDQAS进行了大量仿真实验,结果表明,在追求系统的最大收益方面,算法具有优越的性能.为了实时动态确定系统获得最大收益时算法所需的最佳资源分区,提出了2种近似的分析计算方法.对计算结果的分析显示,2种方法可有效快速地找到一个近似的最佳资源分区方案,近似分析方法对算法在系统中的实现具有重要价值.
According to the demand on the admission control of softswitch-based clustered media server, a new dynamic quota-based admission control algorithm was proposed. A sub-negotiation process was presented with the algorithm. Meanwhile, not only the advantages of quota-based algorithm was inherited but new ideas was adopted in the new algorithm. Simulations have been conducted on the Petri net model. The result shows that this algorithm can be of excellent performance. In order to find the optimal size of each resource section in real time, two approximation analysis methods were proposed. It can be seen from experiments that these methods can be used to get sub-optimal quota values quickly and effectively. These two approximation analysis methods will play important roles in implementation of system algorithms.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2006年第1期82-87,共6页
Journal of Beijing University of Posts and Telecommunications
基金
教育部博士学科点专项科研基金项目(20030013006)
国家移动通信产品研究开发专项基金项目
关键词
接纳控制算法
集群媒体服务器
软交换
admission control algorithm
clustered media server
softswitch
