检索结果-内蒙古大学图书馆

Heuristic algorithm for allocation of wavelength convertible nodes and routing coordination in all-optical networks

JOURNAL OF LIGHTWAVE TECHNOLOGY 1999年第4期17卷 535-545页

作者： Harai, H Murata, M Miyahara, H Osaka Univ Grad Sch Engn Sci Dept Informat & Math Sci Toyonaka Osaka 5608531 Japan

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 strategy 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 and decide routes for performance optimization.

关键词： ADD algorithm approximation analysis blocking minimization problem descent algorithm heuristic wavelength conversion

来源：评论

学校读者我要写书评

暂无评论

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

Allocation of wavelength convertible nodes and routing in al...

引用

Conference on All-Optical Communication Systems - Architecture, Control, and Network Issues III

作者： Harai, H Murata, M Miyahara, H Osaka Univ. (Japan)

ISBN: (纸本)0819426636

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.

关键词： wavelength conversion blocking minimization problem heuristic node allocation ADD algorithm routing Descent algorithm approximation analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：