A fast O(k) multicast message routing algorithm
Thomas J. Sager, Bruce McMillin · 2002
An O(k) algorithm for multicast routing that appears to be faster and to create in the mean less traffic than previously presented O(k) multicast routing algorithms is given. The algorithm, called bestfit, is simple enough to be easily implemented in hardware, and, unlike the case for other O(k) multicast algorithms, destinations can be processed as soon as they are received, since the processing of a destination depends only on statistical properties of the destinations already processed. The algorithm basically tries to place each destination on the channel to which it 'fits best'.>