Concentrators in ATM switching

This paper presents new algorithms for constructing self-route concentrators. The fast knockout algorithm is based upon a model of knockout tournaments that takes advantage of the transitive law governing the order among numbers. This algorithm and k-sorting, an algorithm in the existing literature on circular unimodal sequences, are superior to each other under different parameter values. They are unified by the k-sortout algorithm. The k-sortout algorithm is further generalized to the general k-sortout algorithm, which produces concentrators of lower complexity than all k-sortout concentrators.