Design of efficient and easily routable generalized connectors

This paper presents a new generalized connector with a very simple self-routing scheme. Unlike some of the recently reported generalized connectors, this generalized connector does not rely on an explicit use of a copy network; rather it replicates packets as it routes them through its stages to their destinations. In addition to its attractive routing scheme, this generalized connector can be constructed with O(n lg/sup 2/ n) bit-level constant fanin logic gates, O(lg/sup 2/ n) bit-level depth, and can realize any multicast assignment in O(lg/sup 3/ n) bit-level time. >