Non-blocking Network Architectures for High-speed Switching Networks

点击翻译按钮获取中文摘要

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