Non-blocking Multicast Traffic Omega Internet To Achieve

Multistage Interconnection Network (MIN) is the core of parallel computing and switching systems. How to create a new multicast network with better performance, best hardware cost, routing time complexity and non-blocking multicast capability is a very important research subject.Based on detailed study concerning the implementation of multicast on Omega network, we present two novel types of non-blocking multicasting network structures: multi-Omega network and 3-0mega network. These two networks can both support huge-capacity switching and non-blocking multicast transmission, besides, they havetheir advantages on hardware cost and routing time complexity respectively.The multi-Omega network in this dissertation based on Omega and Omega ×Omega^-1 is recursively constructed by Omega× Omega^-1 using the binary splitting routing concept with O(nlog²n) hardware cost, O(log²n) network depth and O(log²n) routing time. Besides, the 3-0mega multicasting network presented in this dissertation is composed of "Omega^-1+Omega+Omega^-1" and it can realize arbitrary multiple multicasts. This network has O(nlogn) hardware cost, O(logn) routing time and O(logn) propagation delay which meet Claude Shannon's lower bound in the complexity theory on switching network proposed in the 1950s.The methodologies as well as the results of Multi-Omega networks and 3-Omega networks are advantageous over previously proposed multicast networks with new characteristics. Their designs and implementations are of great significance to further research on multistage interconnection networks especially non-blocking multicasting Omega networks with good feasibility.