Abstract
AbstractIn this paper, the space‐efficient Information Dispersal Algorithm (IDA) is applied to fault‐tolerant parallel communication in the de Bruijn and d‐way digit‐exchange networks, which is a generalized butterfly (Omega) network. Let N = dn denote the size of the de Bruijn network. Our routing scheme runs in 2n + 1 time using constant size buffers (if the routing information is not counted). For d = [n In n], it probability of successful routing is at least 1 − N−In N/2. The scheme also tolerates O(N) random link failures with probability at least 1 − N(7−InInn)/6. We also propose a routing scheme for the d‐way digit‐exchange network such that similar bounds hold. Both schemes run within the said time bounds without queuing delay. © 1993 by John Wiley & Sons, Inc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
