Allocation of wavelength convertible nodes and routing in all-optical networks

被引:8
作者
Harai, H
Murata, M
Miyahara, H
机构
来源
ALL-OPTICAL COMMUNICATION SYSTEMS: ARCHITECTURE, CONTROL, AND NETWORK ISSUES III | 1997年 / 3230卷
关键词
wavelength conversion; blocking minimization problem; heuristic; node allocation; ADD algorithm; routing; Descent algorithm; approximation analysis;
D O I
10.1117/12.290387
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
It is true that in all-optical networks, network performance can be improved by wavelength conversion. However, the switching node with wavelength conversion capability is still costly, and the number of such nodes should be limited in the network. In this paper, a performance optimization problem is treated in all-optical networks. We propose a heuristic algorithm to minimize an overall blocking probability by properly allocating a limited number of nodes with wavelength conversion capability. The routing streategy is also considered suitable to the case where the number of wavelength convertible nodes are limited. We validate the minimization level of our heuristic algorithm through numerical examples, and show that our algorithm can properly allocate nodes with conversion for performance optimizaition.
引用
收藏
页码:277 / 287
页数:11
相关论文
empty
未找到相关数据