| 基于容量的相对最小影响资源分配算法 |
| |
| 引用本文： | 曲桦,梁思远,赵季红. 基于容量的相对最小影响资源分配算法[J]. 北京邮电大学学报, 2009, 32(21): 20-23 |
| |
| 作者姓名： | 曲桦 梁思远 赵季红 |
| |
| 作者单位： | 西安交通大学 |
| |
| 摘 要： | 在对现有的波长资源分配算法进行了研究和分析的基础上，提出了一种基于容量的相对最小影响波长资源分配算法.该算法通过定义基于容量的影响因子，分析受当前波长分配影响之后各路径在各波长上的可用信道数，更为精确地描述了当前分配波长对于受影响路径的路径容量产生的影响.仿真结果表明，新的算法降低了网络阻塞率，提高了网络资源利用率.
|
| 关 键 词： | 资源管理 波长分配算法 光传送网 相对最小影响 |
| 收稿时间： | 2009-04-13 |
Capacity Based Relative Least Influence Resource Assignment Algorithm |
| |
| Abstract: | The capacity based relative least influence (CBR) wavelength resource assignment algorithm is presented based on the research and analysis of existing algorithms. The CBR analyzes the influence on channel numbers of each paths at each wavelength after current assigning wavelength through defining capacity based influence factor. So the influence about influenced paths capacity from current assigning wavelength more accurately can be described. Simulation shows that the new algorithm will reduce the blocking probability and improve the utilization ratio of network resource. |
| |
| Keywords: | resource management wavelength assignment algorithm optical transport network relative least influence |
|
| 点击此处可从《北京邮电大学学报》浏览原始摘要信息 |
|
点击此处可从《北京邮电大学学报》下载全文 |
