Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of South China University of Technology(Natural Science Edition)》 2006-01
Add to Favorite Get Latest Update

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

Xu Xing Ye Wu Feng Sui-li Xie Ming(College of Electronic and Information Engineering,South China Univ.of Tech.,Guangzhou 510640,Guangdong,China)  
In large-scale networks,the 1D 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.
【Fund】: 国家自然科学基金资助项目(69972051);; 广东省自然科学基金资助项目(31391)
【CateGory Index】: TN915.07
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Citations】
Chinese Journal Full-text Database 2 Hits
1 Huang Sheng-ye 1 Li Jian-xiang 2 Ye Wu 3 Feng Sui-li 3 Song Hui 3 (1. College of Computer and Communications, Hunan Univ., Changsha 410082, Hunan, China; 2.Dept. of Mathematics, Hunan Univ. of Science and Technology, Xiangtan 411201, Hunan, China; 3.College of Electronic and Information Engineering, South China Univ. of Tech., Guangzhou 510640, Guangdong, China);Transmission Routings of Coordination Messages for the Optimal Management of Large-scale Networks[J];Journal of South China University of Technology(Natural Science);2004-04
2 HUANG Sheng-ye,YE Wu,FENG Sui-li (Department of Telecommunications, South China University of Technology, Guangzhou 510641, China);A fast algorithm based on quasi-independent approximation for calculating the call blocking probabilities in a huge shared resource system[J];Journal of China Institute of Communications;2002-11
【Co-citations】
Chinese Journal Full-text Database 5 Hits
1 Huang Sheng-ye Shi Heng (College of Computer and Communication, Hunan University, Changsha 410082, China);Performance Study on Multiplex System of Broad Band Real-Time VBR Service and Best Effort Service[J];Journal of Electronics & Information Technology;2008-12
2 HUANG Sheng-ye,XIONG Qin-ping,JIANG Hong-yan (College of Computer and Communications,Hunan Univ,Changsha,Hunan 410082,China);A Call Admission Control Strategy for Systems with Multi-rate VBR Services[J];Journal of Hunan University(Natural Sciences);2008-10
3 ZHANG Pengfei1,HUANG Shengye 1,ZHAO Hailin 2(1.College of Computer and Communication,Hunan University,Changsha 410082;2.College of Vocation and Technology,Central South University of Forestry and Technology,Changsha 410004);Study on Queueing System Performance of Best Effort Service in Broad Band Integrated Service Network[J];Computer Engineering;2007-09
4 LIU Xiaofan1, HUANG Shengye1,2, DAI Zhen1 (Department of Computer and Communication, Hunan University1, Changsha 410081; Hunan Institute of Hunanrities, Science and Technology2, Loudi 417000);An Optimal Algorithm for Virtual Path Bandwidth Allocation[J];Science Technology and Engineering;2006-12
5 JIANG Hong-yan,LIN Ya-ping,HUANG Sheng-ye (College of Computers and Communications,Hunan University,Changsha 410082,China);Analysis of loss probabilities on the call level and packet level in a multi-rate system[J];Journal on Communications;2007-09
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved