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

A new control algorithm for wide-sense nonblocking multiplane photonic banyan-type switching fabrics with zero crosstalk

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2008年第3期26卷 54-64页

作者： Danilewicz, Grzegorz Kabacinski, Wojciech Michalski, Marek Zal, Mariusz Poznan Univ Tech Chair Commun & Comp Networks PL-60965 Poznan Poland

A new control algorithm for log(2)(N,0,p) switching networks composed of 2 x 2 switching elements has been proposed recently. Under this algorithm log(2) (N, 0;p) switching networks with even number of stages are wide-sense nonblocking (WSNB) if p is the same as for the rearrangeable nonblocking (RNB) one. The considerred algorithm and WSNB conditions did not take into account crosstalk constraint, which is an important factor in photonic switching. This paper enhanced this algorithm to the case when crosstalk in the switching fabric is not allowed. WSNB conditions for this enhanced algorithm are also derived. It is shown, that the number of planes required is less than those derived earlier in other papers for WSNB multiplane banyan-type switching fabrics under crosstalk constraint. Under this algorithm, log(2)(N, 0, p) switching networks with odd number of stages and with zero crosstalk are WSNB if p is the same as for RNB one.

关键词： switching networks control algorithms path searching algorithms wide-sense nonblocking crosstalk

来源：评论

学校读者我要写书评

暂无评论

The routing algorithm and wide-sense nonblocking conditions for multiplane baseline switching networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2006年第12期24卷 35-44页

作者： Kabacinski, Wojciech Michalski, Marek Poznan Univ Tech Inst Elect & Telecommun PL-60965 Poznan Poland

A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new connection blocks the lowest number of possible future connections in the plane. We have proved, that when using this algorithm connections can be routed without blocking when the number of planes in the switching network is the same as in the rearrangeable one for even number of stages. When the switching network contains the odd number of stages, required number of planes is greater than in the rearrangeable switching network but less than in the strict-sense nonblocking one. Different implementations of the proposed algorithm are also considered. It should be noted, that the algorithm can determine the plane for a new connection in O(N-0.5) time or even in O(1) time depending on the implementation. The overall time complexity of the proposed algorithm is from O(N-3.5 log(2) N) to O(N log(2) N) depending on its implementation and number of processors used.

关键词： switching networks control algorithms path searching algorithms wide-sense nonblocking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：