Multicast and self-routing in ATM radix trees and banyan networks

Considers methods that perform all point-to-multipoint permutations in ATM radix tree and banyan networks. The authors investigate the relationship between the structure of the routing tab and the ease of performing multicasting. They first consider a simple explicit addressing scheme that requires (N-1)(log₂N+1) routing bits. They then present an addressing filtering scheme that requires N routing bits. Next they propose a new method, the vertex isolation addressing (VIA) scheme, which requires r(N-1)/(r-1) bits for radix-r tree networks. Thus for binary trees the routing tab i 2(N-1) bits long and as r approaches N the routing tab approaches N bits. The authors demonstrate that the “excess” bits in the VIA routing tab provide certain error detection capabilities. Encoding and decoding algorithms and hardware implementations for the VIA method are presented. Modified VIA schemes are then investigated for large tree networks. Finally the authors show that the VIA scheme and its modifications are applicable to banyan networks