大规模网络中基于FFT的呼叫阻塞率的快速算法  

Fast Algorithm for Calculating Call-Blocking Probability Based on FFT in Large-Scale Networks

作　　者：徐兴[1] 叶梧[1] 冯穗力[1] 谢明[1] 

机构地区：[1]华南理工大学电子与信息学院,广东广州510640

出　　处：《华南理工大学学报（自然科学版）》2006年第1期10-13,34,共5页Journal of South China University of Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(69972051);广东省自然科学基金资助项目(31391)

摘　　要：在大规模网络条件下,Kaufman提出的一维递推快速呼叫阻塞率(CBP)算法由于其呼叫阻塞率的计算将导致系统计算溢出,改进的Kaufman方案虽然消除了计算溢出,但是其计算时间随网络规模的变大呈指数增长.有鉴于此,文中提出了一种基于快速傅立叶变换(FFT)方法和计算溢出避免预处理机制的呼叫阻塞率快速计算方法.仿真结果表明,该算法消除了计算溢出且降低了计算复杂度,具有计算简单、无误差、速度快的优点.In large-scale networks, the 1 D fast recursion CBP （Call-Blocking Probability） algorithm proposed by Kaufman is unavailable due to the data overflow caused by the calculation of CBP. The modified Kaufman method overcomes the trouble of data overflow, but the time consumption exponentially increases with network scale. To get out of this trouble, a fast algorithm to calculate CBP based on the FFT（ Fast Fourier Transform） and the pre-treatment method is proposed. Simulation results show that the fast algorithm not only avoids data overflow but also decreases computation complexity dramatically, and is of the advantages of simplicity, rapid computation and high accuracy.

关 键 词：快速傅立叶变换 呼叫阻塞率 大规模网络 快速算法 

分 类 号：TN915.2[电子电信—通信与信息系统]