Journal of South China University of Technology (Natural Science Edition) ›› 2006, Vol. 34 ›› Issue (1): 10-13,34.

• Electronics, Communication & Automation Technology • Previous Articles     Next Articles

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

Xu Xing  Ye Wu  Fmg Sui-li  Xie Ming   

  1. College of Electronic and Information Engineering,South China Univ.of Tech.,Guangzhou 510640,Guangdong,China
  • Received:2004-11-12 Online:2006-01-25 Published:2006-01-25
  • Contact: 徐兴(1978-)，男，博士生，主要从事网络流量优化控制方面的研究． E-mail:xuzhexing@163.com
  • About author:徐兴(1978-)，男，博士生，主要从事网络流量优化控制方面的研究．
  • Supported by:

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

PDF

732

Abstract:

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 F1 (Fast Fourier Transform)and the pretreatment method is proposed,Simulation resuhs 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.

Key words: fast Fourier transform, call-blocking probability, large-scale network, fast algorithm