ON the role of K-Bits bitonic sorting network in multicast routing
Majed Z. Al-Hajery, Kenneth E. Batcher · 2002
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/sup 2/ 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/sup 2/ N) and O(/spl radic/N) for the Hypercube and 2D-MESH respectively.>