A Nonblocking Optical Switching Network for Crosstalk-Free Permutation

A Nonblocking Optical Switching Network for Crosstalk-Free Permutation
复制标题

DOI:
--
复制
发表时间:
2003-12
影响因子:
0.7
通讯作者:
Xiaohong Jiang;M. Khandker;Hong Shen;S. Horiguchi
Xiaohong Jiang;M. Khandker;Hong Shen;S. Horiguchi
中科院分区:
计算机科学4区
文献类型:
--
作者:
Xiaohong Jiang;M. Khandker;Hong Shen;S. Horiguchi

文献摘要

被引文献

相似文献

垂直堆叠是一种新型的交换网络技术,将多个兼容连接打包在一起是降低网络硬件成本的有效策略。本文研究了一种基于光榕树网络垂直堆叠结构的光交换网络的无串扰置换能力。我们首先研究这种光交换网络的无阻塞条件。然后,我们研究在这个网络中的无串扰的排列,通过均匀地分解成多个无串扰的部分排列(CFPP)和实现每个CFPP在网络的堆叠平面,使一个无串扰的排列可以在一个单一的通行证。给出了置换的CFPP可分解性的严格证明,并给出了CFPP分解的完整算法。本文还探讨了在此网络中实现无串扰排列所需的通道数和平面数之间权衡的可能性。
Vertical stacking is a novel technique for building switching networks, and packing multiple compatible connections together is an effective strategy to reduce network hardware cost. In this paper, we study the crosstalk-free permutation capability of an optical switching network built on the vertical stacking of optical banyan networks to which packing strategy is applied. We first look into the nonblocking condition of this optical switching network. We then study the crosstalk-free permutation in this network by decomposing a permutation evenly into multiple crosstalk-free partial permutations (CFPPs) and realizing each CFPP in a stacked plane of the network such that a crosstalk-free permutation can be performed in a single pass. We present a rigorous proof of CFPP decomposability of a permutation and also a complete algorithm for CFPP decomposition. The possibility of a tradeoff between the number of passes and the number of planes required for realizing a crosstalk-free permutation in this network is also explored in this paper.