Timid算法、Aggressive算法以及FCA的性能分析  

Performance analysis of Timid algorithm,Aggressive algorithm and FCA

作　　者：何先军 张新福 颜晓莉 祁媛文 

机构地区：[1]重庆重邮信科股份有限公司,重庆400065

出　　处：《重庆邮电学院学报（自然科学版）》2005年第1期33-36,共4页Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)

基　　金：国家科技型中小企业技术创新基金资助项目(01C26215110971)

摘　　要：首先引入了动态信道分配Timid算法和Aggressive算法,然后通过一定的仿真条件假设,对系统采用Timid算法和采用固定信道分配(FCA)算法的性能作了分析,同时又对采用Aggressive算法和采用FCA算法的性能也作了分析,并且对采用Timid算法和Aggressive算法的性能进行了比较,可以看到只有选择一种有效的动态信道分配机制才能使系统性能得到极大的改善。This paper expounds two kinds of DCA strategies:Timid and Aggressive,then describes the simulation condition hypothesis and makes the anlysis of the performance of Timid, Aggressive and FCA. Finally the paper compares the performance of Timid with the performance of FCA, the performance of Aggressive with the performance of FCA and the performance of Timid with the performance of Aggressive, and comes to the conclusion at the end of the article that an effective and dynamic channel alocation mechanism can improve the performance of the system.

关 键 词：Timid算法 Aggressive算法 固定信道分配 阻塞概率 爱尔兰容量 

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