摘要
为提高对呼叫的实时处理能力和网络资源的利用率,提出了CAC算法.该算法旨在降低运算的复杂程度,将链路容量等分为若干个阶梯,通过递推运算来估计链路上的业务质量,从而决定对呼叫是接纳还是拒绝.对算法的性能按实用要求进行了分析.该算法只使用用户容易给出且易于管制的峰值速率和平均速率两个参数,算法简单,能够实时完成对呼叫的处理.
The CAC algorithm presented aims at reducing the complexity of the computation, raising its call processing capability in real time, and meanwhile raising the utilization of the network resources. By dividing equally the link capacity into a flight of stairs, through a recursive computation, we can estimate the quality of service on the link and make the decision to accept or reject the calls. The performance of the algorithm is analysed according to the circumstances of our applications. The algorithm uses only two traffic parameters easily declared and policed, the peak bit rate and the average bit rate. The CAC scheme is simple and can be realized in real time.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
1999年第3期35-39,共5页
Journal of Beijing University of Posts and Telecommunications
基金
国家"863计划"资助