| 大规模通信网络带宽分配的快速分解优化 |
| |
| 引用本文： | 李高海,黄生叶,叶梧.大规模通信网络带宽分配的快速分解优化[J].国际商务研究,2002,42(3):80-84. |
| |
| 作者姓名： | 李高海 黄生叶 叶梧 |
| |
| 作者单位： | [1]娄底师专计算机系，湖南娄底417000 [2]华南理工大学通信工程系，广东广州510641 |
| |
| 基金项目： | 国家自然科学基金项目 (6 9972 0 15 ) |
| |
| 摘 要： | 本文对大规模通信网络带宽分配的计算过程进行了研究，发现现有分解优化计算的方法中限制计算速度的瓶颈在于主节点上的等效流量的计算，在此基础上提出一种用近似公式代替递推公式计算呼叫损失概率的方法，将它运用于带宽分配算法中，计算速度大力提高，而计算相对误差为10％左右。
|
| 关 键 词： | 大规模通信网络 带宽分配 快速分解优化 ATM网 呼叫损失概率 误差 |
| 修稿时间： | 2002/3/23 0:00:00 |
Fast Optimization of Path Bandwidth Allocation by Dividing Large-scale Telecommunication Networks |
| |
| LI Gao-hai,HUANG Sheng-ye,YE Wu.Fast Optimization of Path Bandwidth Allocation by Dividing Large-scale Telecommunication Networks[J].International Business Research,2002,42(3):80-84. |
| |
| Authors: | LI Gao-hai HUANG Sheng-ye YE Wu |
| |
| Abstract: | The process of path bandwidth allocation in a large-scale communication network is studied in this paper. It is drawn that the bottleneck restricting the speed of computation of optimization by division is the evaluation of the equivalent traffics passing by backbone nodes.On this base, a method for replacing the iteration formula of calculating call blocking probability with an approximation one is proposed. Application of the replacement to a path bandwidth allocation algorithm makes a great increase in speed with a relative error of about 10%. |
| |
| Keywords: | ATM network Path bandwidth allocation Call blocking probability Optimization |
|
| 点击此处可从《国际商务研究》浏览原始摘要信息 |
| 点击此处可从《国际商务研究》下载免费的PDF全文 |
