| 基于最小化收发器数量的光网络业务量疏导 |
| |
| 引用本文： | 王强民,戎蒙恬,诸鸿文.基于最小化收发器数量的光网络业务量疏导[J].光子学报,2003,32(8):936-939. |
| |
| 作者姓名： | 王强民 戎蒙恬 诸鸿文 |
| |
| 作者单位： | 上海交通大学现代通信研究所,上海,200030 |
| |
| 摘 要： | 研究了网格型波分复用中的业务量疏导问题,首先把该问题表示为整数线性规划问题(ILP),优化的目标是使得网络中使用的收发器数量最少由于问题的计算复杂度较高,提出了一种启发式算法来解决该问题,数值结果表明:这种算法可以得到与整数线性规划(ILP)得到的最优解相近的结果,在WDM网络中采用适当的业务量疏导可以减少网络中使用的收发器数量。
|
| 关 键 词： | 光网络 波分复用 业务量疏导 整数线性规划 |
| 收稿时间： | 2002-09-09 |
Traffic Grooming in an Optical Network Based on Minimizing Number of Transceivers |
| |
| Abstract.Traffic Grooming in an Optical Network Based on Minimizing Number of Transceivers[J].Acta Photonica Sinica,2003,32(8):936-939. |
| |
| Authors: | Abstract |
| |
| Institution: | Modern Communication Institute, Shanghai Jiaotong University, Shanghai 200030 |
| |
| Abstract: | The traffic grooming problem in a WDM mesh network is investigated. It is formulated as an integer linear program (ILP); the objective function is minimizing the number of transceivers in the network. A heuristic algorithm is proposed to solve the problem. The numerical results show that the proposed heuristic approach can get results, which are close to the optimal results obtained by ILP. This means that traffic grooming can potentially reduce the number of transceivers in the network,the heuristic algorithm is efficient. |
| |
| Keywords: | Optical network Wavelength division multiplexing Traffic grooming Integer linear program |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《光子学报》浏览原始摘要信息 |
| 点击此处可从《光子学报》下载免费的PDF全文 |
|
