Abstract: Method for complex coloring based parallel scheduling for the switching network that is directed at traffic scheduling in the large scale high speed switching network. The parallel scheduling algorithm is on a frame basis. By introducing the concept of complex coloring which is optimal and can be implemented in a distributed and parallel manner, the algorithm can obtain an optimal scheduling scheme without knowledge of the global information of the switching system, so as to maximize bandwidth utilization of the switching system to achieve a nearly 100% throughput. The algorithm complexity is O(log2 N).

Abstract: A method for constructing an AWG based non-blocking optical multicast switching network, comprising constructing a non-blocking optical copy network via a wavelength replication module and an arrayed waveguide grating recursively and constructing a non-blocking optical multicast switching network via cascading a data copy network with a point-to-point switching network. The number of active optical devices required for constructing an N×N optical switching network with r input/output ports and with each port carrying m wavelengths is just O(N logm N), realizing system scalability and saving hardware cost and power consumption. By splitting the routing path of the multicast network into a routing path with O(1) complexity in the copy network and a routing path in a point-to-point unicast switching network, the routing complexity of the multicast switching network is equivalent to that of a unicast switching network.

Abstract: Method for complex coloring based parallel scheduling for the switching network that is directed at traffic scheduling in the large scale high speed switching network. The parallel scheduling algorithm is on a frame basis. By introducing the concept of complex coloring which is optimal and can be implemented in a distributed and parallel manner, the algorithm can obtain an optimal scheduling scheme without knowledge of the global information of the switching system, so as to maximize bandwidth utilization of the switching system to achieve a nearly 100% throughput. The algorithm complexity is O(log2 N).

Abstract: An arrayed waveguide grating (AWG) based interconnection network and modular construction method, comprising N1 left nodes, with each left node having N2 ports, N2 right nodes, with each right node having N1 ports, where N1?N2, N1 and N2 having a greatest common divisor r, and each port having an optical transceiver associated with a fixed wavelength; N1n2 r×1 wavelength multiplexers having their input ports respectively connected with the ports of N1 left nodes, where n2=N2/r; N2n1 1×r wavelength demultiplexers having their output ports respectively connected with the ports of N2 right nodes, where n1=N1/r; n1n2 r×r AWGs connecting the r×1 wavelength multiplexers and the 1×r wavelength demultiplexers r×rn1n2, and each of the r×r AWGs being associated with a wavelength subset {?k|k=0, 1, . . . , r?1}.

Abstract: An arrayed waveguide grating (AWG) based interconnection network and modular construction method, comprising N1 left nodes, with each left node having N2 ports, N2 right nodes, with each right node having N1 ports, where N1?N2, N1 and N2 having a greatest common divisor r, and each port having an optical transceiver associated with a fixed wavelength; N1n2 r×1 wavelength multiplexers having their input ports respectively connected with the ports of N1 left nodes, where n2=N2/r; N2n1 1×r wavelength demultiplexers having their output ports respectively connected with the ports of N2 right nodes, where n1=N1/r; n1n2 r×r AWGs connecting the r×1 wavelength multiplexers and the 1×r wavelength demultiplexers r×rn1n2, and each of the r×r AWGs being associated with a wavelength subset {?k|k=0, 1, . . . , r?1}.

Abstract: A merging network which receives three or more simultaneous input lists of sorted numbers and merges the input lists to form a single sorted list at its outputs. The merging network comprises three stages of interconnected comparator modules, the merging network inputs being connected to the inputs of the comparator modules of the first stage with a mod shuffle interconnection pattern. The outputs of the third stage form the network outputs of the merging network. The first, second, and third stages include one or more comparator modules which are larger than two-by-two. The inventive merging network may be utilized recursively to form a sorting network.

Abstract: A modular architecture for a very large packet switch is disclosed. Each module comprises a Batcher subnetwork and an expansion routing network, which expansion routing network includes a set of binary tree subnetwork interconnected with a set of banyan subnetworks. A packet may be routed from an input of the switch to any output by means of only one switch module. This means that the switch modules may be synchronized independently of each other and if one module fails the remainder of the modules may continue to route packets.

Abstract: An optical switch for use in a fiber optic telecommunications network is disclosed. An important feature of the inventive switch is its multicast capability. The inventive switch utilizes two internal networks, an optical network for transmission and an electronic network for control. Illustratively, the transmission network is an optical star network which links the input ports and output ports of the invention switch. The electronic control network is in the form of a track of ring which surrounds the optical star and sequentially connects the input and output ports.

Abstract: An optical switch for use in a fiber optic telecommunications network is disclosed. An important feature of the inventive switch is its multicast capability. The inventive switch utilizes two internal networks, an optical network for transmission and an electronic network for control. Illustratively, the transmission network is an optical star network which links the input ports and output ports of the inventive switch. The electronic control network is in the form of a track or ring which surrounds the optical star and sequentially connects the input and output ports.

Abstract: A copy network capable of packet replication is disclosed. An encoding process transforms the set of copy numbers, specified in the headers of incoming packets, into a set of monotone address intervals which form new packet headers. This process is carried out by a running adder network and a set of dummy address encoders. A broadcast banyan network performs the packet replication according to a Boolean Interval Splitting Algorithm. Finally, trunk number translators determine the destinations of individual copies. The copy network is self-routing, non-blocking and has a constant packet latency.