Non-blocking Network Architectures for High-speed Switching Networks

无阻塞交换网络可用于光交叉连接的设计，以降低信元丢失率。对于需要高数据传输率、低误码率和低延迟的应用，光网络中的交换元件的状态的重新安排是不希望的，这使得无阻塞交换对于光网络来说变得越来越重要。在本研究中，我们提出了一种比RN(Nm)网络更通用的无阻塞光交换网络的递归结构。在该体系结构中，任何M×N无阻塞交换网络都可以由给定大小为m×n的积木块构成，其中M、N、m、n都是整数的幂。我们证明了该网络对所有N个排列都是自路由的，传播时延为O(Log2N)。我们还证明了RN(N，m)网络和SPANKE网络都是该网络的特例。对于构建低信号损耗和低交叉连接的无阻塞光交换网络，该方法是一种很好的选择。我们是一个…更多的LSO讨论了Banyan网络的新体系结构，这些体系结构由于其具有小深度和绝对信号损失均匀的良好特性而非常适合作为光交换结构。将光榕树网络的水平扩展和垂直堆叠相结合是构建榕树光交换网络的一般方案。由此产生的水平扩展和垂直堆叠的光榕树(HVOB)网络通常需要较高的硬件成本或较大的网络深度来保证无阻塞特性。阻塞行为分析是研究网络性能并在硬件成本、网络深度和阻塞概率之间找到一种巧妙折衷的有效方法，但很少有人对一般的HVOB网络的阻塞行为进行分析。本文研究了一般HVOB网络的整体阻塞行为，得到了关于平面数(堆叠副本数)和级数的阻塞概率的上界。通过大量的仿真研究验证，该上界准确地刻画了HVOB网络的整体阻塞行为，并且符合网络的严格无阻塞条件。推导出的上界具有重要意义，因为它揭示了阻塞率、网络深度和网络硬件成本之间的内在关系，从而可以在它们之间进行理想的权衡。较少

Non-blocking switch networks are useful in designing optical cross-connect to reduce the cell loss probability. For applications that require a high data transmission rate, low error rate and low delay, rearrangement of the states of switching elements in the optical network is not desirable, making non-blocking switching increasingly important for optical networks. In this research, we propose a recursive architecture for non-blocking optical switch networks which is more general than the RN(Nm) network. In this architecture, any M×N non-blocking switch network can be built with building blocks of given size m×n, where M, N, m, n are all powers of integers. We show that the proposed network is self-routing for all N permutations and the propagation delay is O(log_2N). We also show that both RN(N,m) and Spanke's networks are special cases of this network. The proposed approach is a good choice for constructing non-blocking optical switch networks with low signal loss and crosstalk.We a … More lso discuss about new architecture of Banyan networks that are very attractive for serving as the optical switch architectures due to their nice properties of small depth and absolutely signal loss uniformity. Combining the horizontal expansion and vertical stacking of optical banyan networks is a general scheme for constructing banyan-based optical switching networks. The resulting horizontally expanded and vertically stacked optical banyan (HVOB) networks usually take either a high hardware cost or a large network depth to guarantee the non-blocking property. Blocking behavior analysis is an effective approach to studying network performance and finding a graceful compromise among hardware cost, network depth, and blocking probability ; however, little has been done to analyze the blocking behavior of general HVOB networks. In this paper, we study the overall blocking behavior of general HVOB networks, where an upper bound on the blocking probability of a HVOB network is developed with respect to the number of planes (stacked copies) and the number of stages. The upper bound accurately depicts the overall blocking behavior of a HVOB network as verified by an extensive simulation study, and it agrees with the strictly non-blocking condition of the network. The derived upper bound is significant because it reveals the inherent relationship among blocking probability, network depth, and network hardware cost, so that a desirable tradeoff can be made among them. Less