By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. L. E. Law ; Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada ; A. Leon-Garcia

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)(log2N+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

Published in:

INFOCOM '95. Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Bringing Information to People. Proceedings. IEEE

Date of Conference:

2-6 Apr 1995