ON the role of K-Bits bitonic sorting network in multicast routing

Using both modified bit-level comparators and the bitonic sorting algorithm, three multicast routing networks are introduced. The first is dynamic network, which possess a time complexity of O(log² N) and cost complexity of O(N log N). The next two are Hypercube and 2D-MESH static topology networks. A new type of wormhole router is adopted to achieve a general multicast time complexity of O(log² N) and O(√N) for the Hypercube and 2D-MESH respectively